---
_id: '3116'
abstract:
- lang: eng
text: Multithreaded programs coordinate their interaction through synchronization
primitives like mutexes and semaphores, which are managed by an OS-provided resource
manager. We propose algorithms for the automatic construction of code-aware resource
managers for multithreaded embedded applications. Such managers use knowledge
about the structure and resource usage (mutex and semaphore usage) of the threads
to guarantee deadlock freedom and progress while managing resources in an efficient
way. Our algorithms compute managers as winning strategies in certain infinite
games, and produce a compact code description of these strategies. We have implemented
the algorithms in the tool Cynthesis. Given a multithreaded program in C, the
tool produces C code implementing a code-aware resource manager. We show in experiments
that Cynthesis produces compact resource managers within a few minutes on a set
of embedded benchmarks with up to 6 threads. © 2012 Springer Science+Business
Media, LLC.
acknowledgement: This research was supported in part by the National Science Foundation
CAREER award CCR-0132780, by the ONR grant N00014-02-1-0671, by the National Science
Foundation grants CCR-0427202 and CCR-0234690, and by the ARP award TO.030.MM.D.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. Code aware resource
management. Formal Methods in System Design. 2013;42(2):142-174. doi:10.1007/s10703-012-0170-4
apa: Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., & Raman, V. (2013).
Code aware resource management. Formal Methods in System Design. Springer.
https://doi.org/10.1007/s10703-012-0170-4
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar,
and Vishwanath Raman. “Code Aware Resource Management.” Formal Methods in System
Design. Springer, 2013. https://doi.org/10.1007/s10703-012-0170-4.
ieee: K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware
resource management,” Formal Methods in System Design, vol. 42, no. 2.
Springer, pp. 142–174, 2013.
ista: Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware
resource management. Formal Methods in System Design. 42(2), 142–174.
mla: Chatterjee, Krishnendu, et al. “Code Aware Resource Management.” Formal
Methods in System Design, vol. 42, no. 2, Springer, 2013, pp. 142–74, doi:10.1007/s10703-012-0170-4.
short: K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods
in System Design 42 (2013) 142–174.
date_created: 2018-12-11T12:01:29Z
date_published: 2013-04-01T00:00:00Z
date_updated: 2021-01-12T07:41:10Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s10703-012-0170-4
intvolume: ' 42'
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 142 - 174
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '3583'
quality_controlled: '1'
scopus_import: 1
status: public
title: Code aware resource management
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2013'
...
---
_id: '3261'
abstract:
- lang: eng
text: Cells in a developing embryo have no direct way of "measuring" their
physical position. Through a variety of processes, however, the expression levels
of multiple genes come to be correlated with position, and these expression levels
thus form a code for "positional information." We show how to measure
this information, in bits, using the gap genes in the Drosophila embryo as an
example. Individual genes carry nearly two bits of information, twice as much
as expected if the expression patterns consisted only of on/off domains separated
by sharp boundaries. Taken together, four gap genes carry enough information to
define a cell's location with an error bar of ~1% along the anterior-posterior
axis of the embryo. This precision is nearly enough for each cell to have a unique
identity, which is the maximum information the system can use, and is nearly constant
along the length of the embryo. We argue that this constancy is a signature of
optimality in the transmission of information from primary morphogen inputs to
the output of the gap gene network.
author:
- first_name: Julien
full_name: Dubuis, Julien
last_name: Dubuis
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Eric
full_name: Wieschaus, Eric
last_name: Wieschaus
- first_name: Thomas
full_name: Gregor, Thomas
last_name: Gregor
- first_name: William
full_name: Bialek, William
last_name: Bialek
citation:
ama: Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. Positional information,
in bits. PNAS. 2013;110(41):16301-16308. doi:10.1073/pnas.1315642110
apa: Dubuis, J., Tkačik, G., Wieschaus, E., Gregor, T., & Bialek, W. (2013).
Positional information, in bits. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1315642110
chicago: Dubuis, Julien, Gašper Tkačik, Eric Wieschaus, Thomas Gregor, and William
Bialek. “Positional Information, in Bits.” PNAS. National Academy of Sciences,
2013. https://doi.org/10.1073/pnas.1315642110.
ieee: J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, and W. Bialek, “Positional
information, in bits,” PNAS, vol. 110, no. 41. National Academy of Sciences,
pp. 16301–16308, 2013.
ista: Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. 2013. Positional information,
in bits. PNAS. 110(41), 16301–16308.
mla: Dubuis, Julien, et al. “Positional Information, in Bits.” PNAS, vol.
110, no. 41, National Academy of Sciences, 2013, pp. 16301–08, doi:10.1073/pnas.1315642110.
short: J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, W. Bialek, PNAS 110 (2013)
16301–16308.
date_created: 2018-12-11T12:02:19Z
date_published: 2013-10-08T00:00:00Z
date_updated: 2021-01-12T07:42:13Z
day: '08'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1073/pnas.1315642110
external_id:
pmid:
- '24089448'
file:
- access_level: open_access
checksum: ecd859fe52a562193027d428b5524a8d
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T13:53:23Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5873'
file_name: 2013_PNAS_Dubuis.pdf
file_size: 1670548
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 110'
issue: '41'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 16301 - 16308
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '3387'
quality_controlled: '1'
scopus_import: 1
status: public
title: Positional information, in bits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 110
year: '2013'
...
---
_id: '3321'
author:
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Quadrianto N, Lampert C. Kernel based learning. In: Dubitzky W, Wolkenhauer
O, Cho K, Yokota H, eds. Encyclopedia of Systems Biology. Vol 3. Springer;
2013:1069-1069. doi:10.1007/978-1-4419-9863-7_604'
apa: Quadrianto, N., & Lampert, C. (2013). Kernel based learning. In W. Dubitzky,
O. Wolkenhauer, K. Cho, & H. Yokota (Eds.), Encyclopedia of Systems Biology
(Vol. 3, pp. 1069–1069). Springer. https://doi.org/10.1007/978-1-4419-9863-7_604
chicago: Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” In Encyclopedia
of Systems Biology, edited by Werner Dubitzky, Olaf Wolkenhauer, Kwang Cho,
and Hiroki Yokota, 3:1069–1069. Springer, 2013. https://doi.org/10.1007/978-1-4419-9863-7_604.
ieee: N. Quadrianto and C. Lampert, “Kernel based learning,” in Encyclopedia
of Systems Biology, vol. 3, W. Dubitzky, O. Wolkenhauer, K. Cho, and H. Yokota,
Eds. Springer, 2013, pp. 1069–1069.
ista: 'Quadrianto N, Lampert C. 2013.Kernel based learning. In: Encyclopedia of
Systems Biology. vol. 3, 1069–1069.'
mla: Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” Encyclopedia
of Systems Biology, edited by Werner Dubitzky et al., vol. 3, Springer, 2013,
pp. 1069–1069, doi:10.1007/978-1-4419-9863-7_604.
short: N. Quadrianto, C. Lampert, in:, W. Dubitzky, O. Wolkenhauer, K. Cho, H. Yokota
(Eds.), Encyclopedia of Systems Biology, Springer, 2013, pp. 1069–1069.
date_created: 2018-12-11T12:02:39Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:38Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-1-4419-9863-7_604
editor:
- first_name: Werner
full_name: Dubitzky, Werner
last_name: Dubitzky
- first_name: Olaf
full_name: Wolkenhauer, Olaf
last_name: Wolkenhauer
- first_name: Kwang
full_name: Cho, Kwang
last_name: Cho
- first_name: Hiroki
full_name: Yokota, Hiroki
last_name: Yokota
intvolume: ' 3'
language:
- iso: eng
month: '01'
oa_version: None
page: 1069 - 1069
publication: Encyclopedia of Systems Biology
publication_status: published
publisher: Springer
publist_id: '3314'
quality_controlled: '1'
status: public
title: Kernel based learning
type: encyclopedia_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2013'
...
---
_id: '10895'
abstract:
- lang: eng
text: 'Due to their sessile lifestyles, plants need to deal with the limitations
and stresses imposed by the changing environment. Plants cope with these by a
remarkable developmental flexibility, which is embedded in their strategy to survive.
Plants can adjust their size, shape and number of organs, bend according to gravity
and light, and regenerate tissues that were damaged, utilizing a coordinating,
intercellular signal, the plant hormone, auxin. Another versatile signal is the
cation, Ca2+, which is a crucial second messenger for many rapid cellular processes
during responses to a wide range of endogenous and environmental signals, such
as hormones, light, drought stress and others. Auxin is a good candidate for one
of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling
is poorly understood. Here, we will provide an overview of possible developmental
and physiological roles, as well as mechanisms underlying the interconnection
of Ca2+ and auxin signaling. '
article_processing_charge: No
article_type: original
author:
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Vanneste S, Friml J. Calcium: The missing link in auxin action. Plants.
2013;2(4):650-675. doi:10.3390/plants2040650'
apa: 'Vanneste, S., & Friml, J. (2013). Calcium: The missing link in auxin action.
Plants. MDPI. https://doi.org/10.3390/plants2040650'
chicago: 'Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin
Action.” Plants. MDPI, 2013. https://doi.org/10.3390/plants2040650.'
ieee: 'S. Vanneste and J. Friml, “Calcium: The missing link in auxin action,” Plants,
vol. 2, no. 4. MDPI, pp. 650–675, 2013.'
ista: 'Vanneste S, Friml J. 2013. Calcium: The missing link in auxin action. Plants.
2(4), 650–675.'
mla: 'Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.”
Plants, vol. 2, no. 4, MDPI, 2013, pp. 650–75, doi:10.3390/plants2040650.'
short: S. Vanneste, J. Friml, Plants 2 (2013) 650–675.
date_created: 2022-03-21T07:13:49Z
date_published: 2013-10-21T00:00:00Z
date_updated: 2022-03-21T12:15:29Z
day: '21'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/plants2040650
external_id:
pmid:
- '27137397'
file:
- access_level: open_access
checksum: fb4ff2e820e344e253c9197544610be6
content_type: application/pdf
creator: dernst
date_created: 2022-03-21T12:12:56Z
date_updated: 2022-03-21T12:12:56Z
file_id: '10916'
file_name: 2013_Plants_Vanneste.pdf
file_size: 670188
relation: main_file
success: 1
file_date_updated: 2022-03-21T12:12:56Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '4'
keyword:
- Plant Science
- Ecology
- Ecology
- Evolution
- Behavior and Systematics
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '10'
oa: 1
oa_version: Published Version
page: 650-675
pmid: 1
publication: Plants
publication_identifier:
issn:
- 2223-7747
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Calcium: The missing link in auxin action'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2013'
...
---
_id: '10897'
abstract:
- lang: eng
text: Taking images is an efficient way to collect data about the physical world.
It can be done fast and in exquisite detail. By definition, image processing is
the field that concerns itself with the computation aimed at harnessing the information
contained in images [10]. This talk is concerned with topological information.
Our main thesis is that persistent homology [5] is a useful method to quantify
and summarize topological information, building a bridge that connects algebraic
topology with applications. We provide supporting evidence for this thesis by
touching upon four technical developments in the overlap between persistent homology
and image processing.
acknowledgement: This research is partially supported by the European Science Foundation
(ESF) under the Research Network Programme, the European Union under the Toposys
Project FP7-ICT-318493-STREP, the Russian Government under the Mega Project 11.G34.31.0053.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Persistent homology in image processing. In: Graph-Based
Representations in Pattern Recognition. Vol 7877. LNCS. Berlin, Heidelberg:
Springer Nature; 2013:182-183. doi:10.1007/978-3-642-38221-5_19'
apa: 'Edelsbrunner, H. (2013). Persistent homology in image processing. In Graph-Based
Representations in Pattern Recognition (Vol. 7877, pp. 182–183). Berlin, Heidelberg:
Springer Nature. https://doi.org/10.1007/978-3-642-38221-5_19'
chicago: 'Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In Graph-Based
Representations in Pattern Recognition, 7877:182–83. LNCS. Berlin, Heidelberg:
Springer Nature, 2013. https://doi.org/10.1007/978-3-642-38221-5_19.'
ieee: H. Edelsbrunner, “Persistent homology in image processing,” in Graph-Based
Representations in Pattern Recognition, Vienna, Austria, 2013, vol. 7877,
pp. 182–183.
ista: 'Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based
Representations in Pattern Recognition. GbRPR: Graph-based Representations in
Pattern RecognitionLNCS vol. 7877, 182–183.'
mla: Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” Graph-Based
Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013,
pp. 182–83, doi:10.1007/978-3-642-38221-5_19.
short: H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition,
Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.
conference:
end_date: 2013-05-17
location: Vienna, Austria
name: 'GbRPR: Graph-based Representations in Pattern Recognition'
start_date: 2013-05-15
date_created: 2022-03-21T07:30:33Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2023-09-05T15:10:20Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-38221-5_19
ec_funded: 1
intvolume: ' 7877'
language:
- iso: eng
month: '06'
oa_version: None
page: 182-183
place: Berlin, Heidelberg
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Graph-Based Representations in Pattern Recognition
publication_identifier:
eisbn:
- '9783642382215'
eissn:
- 1611-3349
isbn:
- '9783642382208'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Persistent homology in image processing
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7877
year: '2013'
...
---
_id: '10898'
abstract:
- lang: eng
text: A prominent remedy to multicore scalability issues in concurrent data structure
implementations is to relax the sequential specification of the data structure.
We present distributed queues (DQ), a new family of relaxed concurrent queue implementations.
DQs implement relaxed queues with linearizable emptiness check and either configurable
or bounded out-of-order behavior or pool behavior. Our experiments show that DQs
outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue
as well as pool implementations that we considered.
article_number: '17'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Haas, Andreas
last_name: Haas
- first_name: Michael
full_name: Lippautz, Michael
last_name: Lippautz
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
- first_name: Christoph M.
full_name: Kirsch, Christoph M.
last_name: Kirsch
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: 'Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory:
Multicore performance and scalability through quantitative relaxation. In: Proceedings
of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press;
2013. doi:10.1145/2482767.2482789'
apa: 'Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch,
C. M., & Sezgin, A. (2013). Distributed queues in shared memory: Multicore
performance and scalability through quantitative relaxation. In Proceedings
of the ACM International Conference on Computing Frontiers - CF ’13. Ischia,
Italy: ACM Press. https://doi.org/10.1145/2482767.2482789'
chicago: 'Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana
Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory:
Multicore Performance and Scalability through Quantitative Relaxation.” In Proceedings
of the ACM International Conference on Computing Frontiers - CF ’13. ACM Press,
2013. https://doi.org/10.1145/2482767.2482789.'
ieee: 'A. Haas et al., “Distributed queues in shared memory: Multicore performance
and scalability through quantitative relaxation,” in Proceedings of the ACM
International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013,
no. 5.'
ista: 'Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin
A. 2013. Distributed queues in shared memory: Multicore performance and scalability
through quantitative relaxation. Proceedings of the ACM International Conference
on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.'
mla: 'Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance
and Scalability through Quantitative Relaxation.” Proceedings of the ACM International
Conference on Computing Frontiers - CF ’13, no. 5, 17, ACM Press, 2013, doi:10.1145/2482767.2482789.'
short: A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch,
A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers
- CF ’13, ACM Press, 2013.
conference:
end_date: 2013-05-16
location: Ischia, Italy
name: 'CF: Conference on Computing Frontiers'
start_date: 2013-05-14
date_created: 2022-03-21T07:33:22Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2022-06-21T08:01:19Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2482767.2482789
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
publication: Proceedings of the ACM International Conference on Computing Frontiers
- CF '13
publication_identifier:
isbn:
- 978-145032053-5
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Distributed queues in shared memory: Multicore performance and scalability
through quantitative relaxation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '10899'
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Barton NH. Differentiation. In: Encyclopedia of Biodiversity. 2nd ed.
Elsevier; 2013:508-515. doi:10.1016/b978-0-12-384719-5.00031-9'
apa: Barton, N. H. (2013). Differentiation. In Encyclopedia of Biodiversity
(2nd ed., pp. 508–515). Elsevier. https://doi.org/10.1016/b978-0-12-384719-5.00031-9
chicago: Barton, Nicholas H. “Differentiation.” In Encyclopedia of Biodiversity,
2nd ed., 508–15. Elsevier, 2013. https://doi.org/10.1016/b978-0-12-384719-5.00031-9.
ieee: N. H. Barton, “Differentiation,” in Encyclopedia of Biodiversity, 2nd
ed., Elsevier, 2013, pp. 508–515.
ista: 'Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.'
mla: Barton, Nicholas H. “Differentiation.” Encyclopedia of Biodiversity,
2nd ed., Elsevier, 2013, pp. 508–15, doi:10.1016/b978-0-12-384719-5.00031-9.
short: N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013,
pp. 508–515.
date_created: 2022-03-21T07:46:22Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2022-06-20T09:18:06Z
day: '01'
department:
- _id: NiBa
doi: 10.1016/b978-0-12-384719-5.00031-9
edition: '2'
keyword:
- Adaptive landscape
- Cline
- Coalescent process
- Gene flow
- Hybrid zone
- Local adaptation
- Natural selection
- Neutral theory
- Population structure
- Speciation
language:
- iso: eng
month: '01'
oa_version: None
page: 508-515
publication: Encyclopedia of Biodiversity
publication_identifier:
isbn:
- 978-0-12-384720-1
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differentiation
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '10900'
abstract:
- lang: eng
text: Leukocyte migration through the interstitial space is crucial for the maintenance
of tolerance and immunity. The main cues for leukocyte trafficking are chemokines
thought to directionally guide these cells towards their targets. However, model
systems that facilitate quantification of chemokine-guided leukocyte migration
in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted
mouse ears that allows the visualization of chemokine-dependent dendritic cell
(DC) motility in the dermal interstitium in real time. We present methods for
the preparation of mouse ear sheets and their use in multidimensional confocal
imaging experiments to monitor and analyze the directional migration of fluorescently
labelled DCs through the dermis and into afferent lymphatic vessels. The assay
provides a more physiological approach to study leukocyte migration than in vitro
three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen
gels and transwell assays.
acknowledgement: We would like to thank Alexander Eichner and Ingrid de Vries for
discussion and critical reading of the manuscript, and Mary Frank for assistance
with the recording of videos and images in Fig. 1. M.S. is supported through funding
from the German Research Foundation (DFG). M.W. acknowledges the Alexander von Humboldt
Foundation for funding.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Michele
full_name: Weber, Michele
id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
last_name: Weber
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: 'Weber M, Sixt MK. Live Cell Imaging of Chemotactic Dendritic Cell Migration
in Explanted Mouse Ear Preparations. In: Cardona A, Ubogu E, eds. Chemokines.
Vol 1013. MIMB. Totowa, NJ: Humana Press; 2013:215-226. doi:10.1007/978-1-62703-426-5_14'
apa: 'Weber, M., & Sixt, M. K. (2013). Live Cell Imaging of Chemotactic Dendritic
Cell Migration in Explanted Mouse Ear Preparations. In A. Cardona & E. Ubogu
(Eds.), Chemokines (Vol. 1013, pp. 215–226). Totowa, NJ: Humana Press.
https://doi.org/10.1007/978-1-62703-426-5_14'
chicago: 'Weber, Michele, and Michael K Sixt. “Live Cell Imaging of Chemotactic
Dendritic Cell Migration in Explanted Mouse Ear Preparations.” In Chemokines,
edited by Astrid Cardona and Eroboghene Ubogu, 1013:215–26. MIMB. Totowa, NJ:
Humana Press, 2013. https://doi.org/10.1007/978-1-62703-426-5_14.'
ieee: 'M. Weber and M. K. Sixt, “Live Cell Imaging of Chemotactic Dendritic Cell
Migration in Explanted Mouse Ear Preparations,” in Chemokines, vol. 1013,
A. Cardona and E. Ubogu, Eds. Totowa, NJ: Humana Press, 2013, pp. 215–226.'
ista: 'Weber M, Sixt MK. 2013.Live Cell Imaging of Chemotactic Dendritic Cell Migration
in Explanted Mouse Ear Preparations. In: Chemokines. Methods in Molecular Biology,
vol. 1013, 215–226.'
mla: Weber, Michele, and Michael K. Sixt. “Live Cell Imaging of Chemotactic Dendritic
Cell Migration in Explanted Mouse Ear Preparations.” Chemokines, edited
by Astrid Cardona and Eroboghene Ubogu, vol. 1013, Humana Press, 2013, pp. 215–26,
doi:10.1007/978-1-62703-426-5_14.
short: M. Weber, M.K. Sixt, in:, A. Cardona, E. Ubogu (Eds.), Chemokines, Humana
Press, Totowa, NJ, 2013, pp. 215–226.
date_created: 2022-03-21T07:47:41Z
date_published: 2013-04-03T00:00:00Z
date_updated: 2023-09-05T13:15:33Z
day: '03'
department:
- _id: MiSi
doi: 10.1007/978-1-62703-426-5_14
editor:
- first_name: Astrid
full_name: Cardona, Astrid
last_name: Cardona
- first_name: Eroboghene
full_name: Ubogu, Eroboghene
last_name: Ubogu
external_id:
pmid:
- '23625502'
intvolume: ' 1013'
language:
- iso: eng
month: '04'
oa_version: None
page: 215-226
place: Totowa, NJ
pmid: 1
publication: Chemokines
publication_identifier:
eisbn:
- '9781627034265'
eissn:
- 1940-6029
isbn:
- '9781627034258'
issn:
- 1064-3745
publication_status: published
publisher: Humana Press
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse
Ear Preparations
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 1013
year: '2013'
...
---
_id: '10902'
abstract:
- lang: eng
text: We consider how to edit strings from a source language so that the edited
strings belong to a target language, where the languages are given as deterministic
finite automata. Non-streaming (or offline) transducers perform edits given the
whole source string. We show that the class of deterministic one-pass transducers
with registers along with increment and min operation suffices for computing optimal
edit distance, whereas the same class of transducers without the min operation
is not sufficient. Streaming (or online) transducers perform edits as the letters
of the source string are received. We present a polynomial time algorithm for
the partial-repair problem that given a bound α asks for the construction of a
deterministic streaming transducer (if one exists) that ensures that the ‘maximum
fraction’ η of the strings of the source language are edited, within cost α, to
the target language.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting
the problem of identifying a deterministic transducer to compute the optimal cost,
and to Martin Chmelik for his comments on the introduction.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th
International Conference on Language and Automata Theory and Applications.
Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20'
apa: 'Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between
languages. In 7th International Conference on Language and Automata Theory
and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.
https://doi.org/10.1007/978-3-642-37064-9_20'
chicago: 'Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel
between Languages.” In 7th International Conference on Language and Automata
Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature,
2013. https://doi.org/10.1007/978-3-642-37064-9_20.'
ieee: K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,”
in 7th International Conference on Language and Automata Theory and Applications,
Bilbao, Spain, 2013, vol. 7810, pp. 214–225.
ista: 'Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages.
7th International Conference on Language and Automata Theory and Applications.
LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol.
7810, 214–225.'
mla: Chatterjee, Krishnendu, et al. “How to Travel between Languages.” 7th International
Conference on Language and Automata Theory and Applications, vol. 7810, Springer
Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.
short: K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on
Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg,
2013, pp. 214–225.
conference:
end_date: 2013-04-05
location: Bilbao, Spain
name: 'LATA: Conference on Language and Automata Theory and Applications'
start_date: 2013-04-02
date_created: 2022-03-21T07:56:21Z
date_published: 2013-04-15T00:00:00Z
date_updated: 2023-09-05T15:10:38Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-37064-9_20
ec_funded: 1
intvolume: ' 7810'
language:
- iso: eng
month: '04'
oa_version: None
page: 214-225
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 7th International Conference on Language and Automata Theory and Applications
publication_identifier:
eisbn:
- '9783642370649'
eissn:
- 1611-3349
isbn:
- '9783642370632'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: How to travel between languages
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7810
year: '2013'
...
---
_id: '827'
abstract:
- lang: eng
text: As sessile organisms, plants have to be able to adapt to a continuously changing
environment. Plants that perceive some of these changes as stress signals activate
signaling pathways to modulate their development and to enable them to survive.
The complex responses to environmental cues are to a large extent mediated by
plant hormones that together orchestrate the final plant response. The phytohormone
cytokinin is involved in many plant developmental processes. Recently, it has
been established that cytokinin plays an important role in stress responses, but
does not act alone. Indeed, the hormonal control of plant development and stress
adaptation is the outcome of a complex network of multiple synergistic and antagonistic
interactions between various hormones. Here, we review the recent findings on
the cytokinin function as part of this hormonal network. We focus on the importance
of the crosstalk between cytokinin and other hormones, such as abscisic acid,
jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development
and stress adaptation. Finally, the impact of the current research in the biotechnological
industry will be discussed.
article_number: '451'
author:
- first_name: José
full_name: O'Brien, José
last_name: O'Brien
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: O’Brien J, Benková E. Cytokinin cross talking during biotic and abiotic stress
responses. Frontiers in Plant Science. 2013;4. doi:10.3389/fpls.2013.00451
apa: O’Brien, J., & Benková, E. (2013). Cytokinin cross talking during biotic
and abiotic stress responses. Frontiers in Plant Science. Frontiers Research
Foundation. https://doi.org/10.3389/fpls.2013.00451
chicago: O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic
and Abiotic Stress Responses.” Frontiers in Plant Science. Frontiers Research
Foundation, 2013. https://doi.org/10.3389/fpls.2013.00451.
ieee: J. O’Brien and E. Benková, “Cytokinin cross talking during biotic and abiotic
stress responses,” Frontiers in Plant Science, vol. 4. Frontiers Research
Foundation, 2013.
ista: O’Brien J, Benková E. 2013. Cytokinin cross talking during biotic and abiotic
stress responses. Frontiers in Plant Science. 4, 451.
mla: O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and
Abiotic Stress Responses.” Frontiers in Plant Science, vol. 4, 451, Frontiers
Research Foundation, 2013, doi:10.3389/fpls.2013.00451.
short: J. O’Brien, E. Benková, Frontiers in Plant Science 4 (2013).
date_created: 2018-12-11T11:48:43Z
date_published: 2013-11-19T00:00:00Z
date_updated: 2021-01-12T08:17:50Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.3389/fpls.2013.00451
ec_funded: 1
file:
- access_level: open_access
checksum: fdc25ddd1bf9a99b99f662cdbafeddd4
content_type: application/pdf
creator: dernst
date_created: 2019-01-31T10:40:38Z
date_updated: 2020-07-14T12:48:11Z
file_id: '5903'
file_name: 2013_FrontiersPlant_OBrien.pdf
file_size: 953299
relation: main_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
intvolume: ' 4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '6821'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cytokinin cross talking during biotic and abiotic stress responses
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2013'
...
---
_id: '828'
abstract:
- lang: eng
text: The plant root system is essential for providing anchorage to the soil, supplying
minerals and water, and synthesizing metabolites. It is a dynamic organ modulated
by external cues such as environmental signals, water and nutrients availability,
salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically,
after which they progress through discrete developmental stages which can be independently
controlled, providing a high level of plasticity during root system formation.
Within this review, main contributions are presented, from the classical forward
genetic screens to the more recent high-throughput approaches, combined with computer
model predictions, dissecting how LRs and thereby root system architecture is
established and developed.
article_number: '537'
author:
- first_name: Candela
full_name: Cuesta, Candela
id: 33A3C818-F248-11E8-B48F-1D18A9856A87
last_name: Cuesta
orcid: 0000-0003-1923-2410
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Cuesta C, Wabnik KT, Benková E. Systems approaches to study root architecture
dynamics. Frontiers in Plant Science. 2013;4. doi:10.3389/fpls.2013.00537
apa: Cuesta, C., Wabnik, K. T., & Benková, E. (2013). Systems approaches to
study root architecture dynamics. Frontiers in Plant Science. Frontiers
Research Foundation. https://doi.org/10.3389/fpls.2013.00537
chicago: Cuesta, Candela, Krzysztof T Wabnik, and Eva Benková. “Systems Approaches
to Study Root Architecture Dynamics.” Frontiers in Plant Science. Frontiers
Research Foundation, 2013. https://doi.org/10.3389/fpls.2013.00537.
ieee: C. Cuesta, K. T. Wabnik, and E. Benková, “Systems approaches to study root
architecture dynamics,” Frontiers in Plant Science, vol. 4. Frontiers Research
Foundation, 2013.
ista: Cuesta C, Wabnik KT, Benková E. 2013. Systems approaches to study root architecture
dynamics. Frontiers in Plant Science. 4, 537.
mla: Cuesta, Candela, et al. “Systems Approaches to Study Root Architecture Dynamics.”
Frontiers in Plant Science, vol. 4, 537, Frontiers Research Foundation,
2013, doi:10.3389/fpls.2013.00537.
short: C. Cuesta, K.T. Wabnik, E. Benková, Frontiers in Plant Science 4 (2013).
date_created: 2018-12-11T11:48:43Z
date_published: 2013-12-26T00:00:00Z
date_updated: 2021-01-12T08:17:52Z
day: '26'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.3389/fpls.2013.00537
ec_funded: 1
file:
- access_level: open_access
checksum: 0185b3c4d7df9a94bd3ce5a66d213506
content_type: application/pdf
creator: dernst
date_created: 2019-01-31T10:36:43Z
date_updated: 2020-07-14T12:48:11Z
file_id: '5902'
file_name: 2013_FrontiersPlant_Cuesta.pdf
file_size: 710835
relation: main_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
intvolume: ' 4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '6820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Systems approaches to study root architecture dynamics
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2013'
...
---
_id: '2000'
abstract:
- lang: eng
text: In this work we present a flexible tool for tumor progression, which simulates
the evolutionary dynamics of cancer. Tumor progression implements a multi-type
branching process where the key parameters are the fitness landscape, the mutation
rate, and the average time of cell division. The fitness of a cancer cell depends
on the mutations it has accumulated. The input to our tool could be any fitness
landscape, mutation rate, and cell division time, and the tool produces the growth
dynamics and all relevant statistics.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression.
In: Proceedings of 25th Int. Conf. on Computer Aided Verification. Vol
8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:10.1007/978-3-642-39799-8_6'
apa: 'Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for
tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification
(Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6'
chicago: 'Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak.
“TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer
Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-39799-8_6.'
ieee: 'J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,”
in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg,
Russia, 2013, vol. 8044, pp. 101–106.'
ista: 'Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression.
Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided
VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.'
mla: 'Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” Proceedings
of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013,
pp. 101–06, doi:10.1007/978-3-642-39799-8_6.'
short: J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int.
Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
conference:
end_date: 2013-07-19
location: St. Petersburg, Russia
name: 'CAV: Computer Aided Verification'
start_date: 2013-07-13
date_created: 2018-12-11T11:55:08Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-39799-8_6
ec_funded: 1
external_id:
arxiv:
- '1303.5251'
intvolume: ' 8044'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1303.5251
month: '01'
oa: 1
oa_version: Preprint
page: 101 - 106
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of 25th Int. Conf. on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '5077'
quality_controlled: '1'
related_material:
record:
- id: '5399'
relation: earlier_version
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'TTP: Tool for tumor progression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '2009'
abstract:
- lang: eng
text: Traditional statistical methods for confidentiality protection of statistical
databases do not scale well to deal with GWAS databases especially in terms of
guarantees regarding protection from linkage to external information. The more
recent concept of differential privacy, introduced by the cryptographic community,
is an approach which provides a rigorous definition of privacy with meaningful
privacy guarantees in the presence of arbitrary external information, although
the guarantees may come at a serious price in terms of data utility. Building
on such notions, we propose new methods to release aggregate GWAS data without
compromising an individual’s privacy. We present methods for releasing differentially
private minor allele frequencies, chi-square statistics and p-values. We compare
these approaches on simulated data and on a GWAS study of canine hair length involving
685 dogs. We also propose a privacy-preserving method for finding genome-wide
associations based on a differentially-private approach to penalized logistic
regression.
article_processing_charge: No
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Aleksandra
full_name: Slavkovic, Aleksandra
last_name: Slavkovic
- first_name: Stephen
full_name: Fienberg, Stephen
last_name: Fienberg
citation:
ama: Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide
association studies. Journal of Privacy and Confidentiality . 2013;5(1):137-166.
doi:10.29012/jpc.v5i1.629
apa: Uhler, C., Slavkovic, A., & Fienberg, S. (2013). Privacy-preserving data
sharing for genome-wide association studies. Journal of Privacy and Confidentiality
. Carnegie Mellon University. https://doi.org/10.29012/jpc.v5i1.629
chicago: Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving
Data Sharing for Genome-Wide Association Studies.” Journal of Privacy and Confidentiality
. Carnegie Mellon University, 2013. https://doi.org/10.29012/jpc.v5i1.629.
ieee: C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing
for genome-wide association studies,” Journal of Privacy and Confidentiality
, vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013.
ista: Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for
genome-wide association studies. Journal of Privacy and Confidentiality . 5(1),
137–166.
mla: Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association
Studies.” Journal of Privacy and Confidentiality , vol. 5, no. 1, Carnegie
Mellon University, 2013, pp. 137–66, doi:10.29012/jpc.v5i1.629.
short: C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality 5
(2013) 137–166.
date_created: 2018-12-11T11:55:11Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2021-01-12T06:54:41Z
day: '01'
department:
- _id: CaUh
doi: 10.29012/jpc.v5i1.629
intvolume: ' 5'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://repository.cmu.edu/jpc/vol5/iss1/6
month: '08'
oa: 1
oa_version: Published Version
page: 137 - 166
publication: 'Journal of Privacy and Confidentiality '
publication_status: published
publisher: Carnegie Mellon University
publist_id: '5067'
quality_controlled: '1'
status: public
title: Privacy-preserving data sharing for genome-wide association studies
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2013'
...
---
_id: '2010'
abstract:
- lang: eng
text: Many algorithms for inferring causality rely heavily on the faithfulness assumption.
The main justification for imposing this assumption is that the set of unfaithful
distributions has Lebesgue measure zero, since it can be seen as a collection
of hypersurfaces in a hypercube. However, due to sampling error the faithfulness
condition alone is not sufficient for statistical estimation, and strong-faithfulness
has been proposed and assumed to achieve uniform or high-dimensional consistency.
In contrast to the plain faithfulness assumption, the set of distributions that
is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly
large as we show in this paper. We study the strong-faithfulness condition from
a geometric and combinatorial point of view and give upper and lower bounds on
the Lebesgue measure of strong-faithful distributions for various classes of directed
acyclic graphs. Our results imply fundamental limitations for the PC-algorithm
and potentially also for other algorithms based on partial correlation testing
in the Gaussian case.
arxiv: 1
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Garvesh
full_name: Raskutti, Garvesh
last_name: Raskutti
- first_name: Peter
full_name: Bühlmann, Peter
last_name: Bühlmann
- first_name: Bin
full_name: Yu, Bin
last_name: Yu
citation:
ama: Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption
in causal inference. The Annals of Statistics. 2013;41(2):436-463. doi:10.1214/12-AOS1080
apa: Uhler, C., Raskutti, G., Bühlmann, P., & Yu, B. (2013). Geometry of the
faithfulness assumption in causal inference. The Annals of Statistics.
Institute of Mathematical Statistics. https://doi.org/10.1214/12-AOS1080
chicago: Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry
of the Faithfulness Assumption in Causal Inference.” The Annals of Statistics.
Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/12-AOS1080.
ieee: C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness
assumption in causal inference,” The Annals of Statistics, vol. 41, no.
2. Institute of Mathematical Statistics, pp. 436–463, 2013.
ista: Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness
assumption in causal inference. The Annals of Statistics. 41(2), 436–463.
mla: Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal
Inference.” The Annals of Statistics, vol. 41, no. 2, Institute of Mathematical
Statistics, 2013, pp. 436–63, doi:10.1214/12-AOS1080.
short: C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013)
436–463.
date_created: 2018-12-11T11:55:11Z
date_published: 2013-04-01T00:00:00Z
date_updated: 2021-01-12T06:54:42Z
day: '01'
department:
- _id: CaUh
doi: 10.1214/12-AOS1080
external_id:
arxiv:
- '1207.0547'
intvolume: ' 41'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.doi.org/10.1214/12-AOS1080
month: '04'
oa: 1
oa_version: Published Version
page: 436 - 463
publication: The Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5066'
quality_controlled: '1'
scopus_import: 1
status: public
title: Geometry of the faithfulness assumption in causal inference
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2013'
...
---
_id: '2181'
abstract:
- lang: eng
text: 'There is a trade-off between performance and correctness in implementing
concurrent data structures. Better performance may be achieved at the expense
of relaxing correctness, by redefining the semantics of data structures. We address
such a redefinition of data structure semantics and present a systematic and formal
framework for obtaining new data structures by quantitatively relaxing existing
ones. We view a data structure as a sequential specification S containing all
"legal" sequences over an alphabet of method calls. Relaxing the data
structure corresponds to defining a distance from any sequence over the alphabet
to the sequential specification: the k-relaxed sequential specification contains
all sequences over the alphabet within distance k from the original specification.
In contrast to other existing work, our relaxations are semantic (distance in
terms of data structure states). As an instantiation of our framework, we present
two simple yet generic relaxation schemes, called out-of-order and stuttering
relaxation, along with several ways of computing distances. We show that the out-of-order
relaxation, when further instantiated to stacks, queues, and priority queues,
amounts to tolerating bounded out-of-order behavior, which cannot be captured
by a purely syntactic relaxation (distance in terms of sequence manipulation,
e.g. edit distance). We give concurrent implementations of relaxed data structures
and demonstrate that bounded relaxations provide the means for trading correctness
for performance in a controlled way. The relaxations are monotonic which further
highlights the trade-off: increasing k increases the number of permitted sequences,
which as we demonstrate can lead to better performance. Finally, since a relaxed
stack or queue also implements a pool, we actually have new concurrent pool implementations
that outperform the state-of-the-art ones.'
acknowledgement: ' and an Elise Richter Fellowship (Austrian Science Fund V00125). '
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
citation:
ama: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation
of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109'
apa: 'Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013).
Quantitative relaxation of concurrent data structures. In Proceedings of the
40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language
(pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109'
chicago: Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana
Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.
ieee: T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative
relaxation of concurrent data structures,” in Proceedings of the 40th annual
ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome,
Italy, 2013, pp. 317–328.
ista: 'Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative
relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT
symposium on Principles of programming language. POPL: Principles of Programming
Languages, 317–328.'
mla: Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.”
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.
short: T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
ACM, 2013, pp. 317–328.
conference:
end_date: 2013-01-25
location: Rome, Italy
name: 'POPL: Principles of Programming Languages'
start_date: 2013-01-23
date_created: 2018-12-11T11:56:11Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-02-21T16:06:49Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1145/2429069.2429109
ec_funded: 1
file:
- access_level: open_access
checksum: adf465e70948f4e80e48057524516456
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:33Z
date_updated: 2020-07-14T12:45:31Z
file_id: '5086'
file_name: IST-2014-198-v1+1_popl128-henzinger-clean.pdf
file_size: 294689
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 317 - 328
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles
of programming language
publication_identifier:
isbn:
- 978-1-4503-1832-7
publication_status: published
publisher: ACM
publist_id: '4801'
pubrep_id: '198'
quality_controlled: '1'
related_material:
record:
- id: '10901'
relation: later_version
status: deleted
scopus_import: 1
status: public
title: Quantitative relaxation of concurrent data structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2182'
abstract:
- lang: eng
text: We propose a general framework for abstraction with respect to quantitative
properties, such as worst-case execution time, or power consumption. Our framework
provides a systematic way for counter-example guided abstraction refinement for
quantitative properties. The salient aspect of the framework is that it allows
anytime verification, that is, verification algorithms that can be stopped at
any time (for example, due to exhaustion of memory), and report approximations
that improve monotonically when the algorithms are given more time. We instantiate
the framework with a number of quantitative abstractions and refinement schemes,
which differ in terms of how much quantitative information they keep from the
original system. We introduce both state-based and trace-based quantitative abstractions,
and we describe conditions that define classes of quantitative properties for
which the abstractions provide over-approximations. We give algorithms for evaluating
the quantitative properties on the abstract systems. We present algorithms for
counter-example based refinements for quantitative properties for both state-based
and segment-based abstractions. We perform a case study on worst-case execution
time of executables to evaluate the anytime verification aspect and the quantitative
abstractions we proposed.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement.
In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085'
apa: 'Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction
refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium
on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085'
chicago: Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative
Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.
ieee: P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction
refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium
on Principles of programming language, Rome, Italy, 2013, pp. 115–128.
ista: 'Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement.
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming
language. POPL: Principles of Programming Languages, 115–128.'
mla: Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings
of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language,
ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.
short: P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013,
pp. 115–128.
conference:
end_date: 2013-01-25
location: Rome, Italy
name: 'POPL: Principles of Programming Languages'
start_date: 2013-07-23
date_created: 2018-12-11T11:56:11Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:50Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2429069.2429085
ec_funded: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 128
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles
of programming language
publication_status: published
publisher: ACM
publist_id: '4800'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative abstraction refinement
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2209'
abstract:
- lang: eng
text: "A straight skeleton is a well-known geometric structure, and several algorithms
exist to construct the straight skeleton for a given polygon or planar straight-line
graph. In this paper, we ask the reverse question: Given the straight skeleton
(in form of a planar straight-line graph, with some rays to infinity), can we
reconstruct a planar straight-line graph for which this was the straight skeleton?
We show how to reduce this problem to the problem of finding a line that intersects
a set of convex polygons. We can find these convex polygons and all such lines
in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number
of edges of the input graph. We also explain how our approach can be used for
recognizing Voronoi diagrams of points, thereby completing a partial solution
provided by Ash and Bolker in 1985.\r\n"
alternative_title:
- '2013 10th International Symposium on Voronoi Diagrams in Science and Engineering
(ISVD 2013) '
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
citation:
ama: 'Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams
and reconstructing their input. In: IEEE; 2013:37-46. doi:10.1109/ISVD.2013.11'
apa: 'Biedl, T., Held, M., & Huber, S. (2013). Recognizing straight skeletons
and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at
the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia:
IEEE. https://doi.org/10.1109/ISVD.2013.11'
chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons
and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11.
ieee: 'T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi
diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams
in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.'
ista: 'Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi
diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and
Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science
and Engineering (ISVD 2013) , , 37–46.'
mla: Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams
and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11.
short: T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.
conference:
end_date: 2013-07-10
location: St. Petersburg, Russia
name: 'ISVD: Voronoi Diagrams in Science and Engineering'
start_date: 2013-07-08
date_created: 2018-12-11T11:56:20Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:00Z
day: '01'
department:
- _id: HeEd
doi: 10.1109/ISVD.2013.11
language:
- iso: eng
month: '12'
oa_version: None
page: 37 - 46
publication_identifier:
eisbn:
- '978-0-7695-5037-4 '
publication_status: published
publisher: IEEE
publist_id: '4763'
quality_controlled: '1'
scopus_import: 1
status: public
title: Recognizing straight skeletons and Voronoi diagrams and reconstructing their
input
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2210'
abstract:
- lang: eng
text: 'A straight skeleton is a well-known geometric structure, and several algorithms
exist to construct the straight skeleton for a given polygon. In this paper, we
ask the reverse question: Given the straight skeleton (in form of a tree with
a drawing in the plane, but with the exact position of the leaves unspecified),
can we reconstruct the polygon? We show that in most cases there exists at most
one polygon; in the remaining case there is an infinite number of polygons determined
by one angle that can range in an interval. We can find this (set of) polygon(s)
in linear time in the Real RAM computer model.'
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
citation:
ama: 'Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons.
In: 29th European Workshop on Computational Geometry. TU Braunschweig;
2013:95-98.'
apa: 'Biedl, T., Held, M., & Huber, S. (2013). Reconstructing polygons from
embedded straight skeletons. In 29th European Workshop on Computational Geometry
(pp. 95–98). Braunschweig, Germany: TU Braunschweig.'
chicago: Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons
from Embedded Straight Skeletons.” In 29th European Workshop on Computational
Geometry, 95–98. TU Braunschweig, 2013.
ieee: T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight
skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig,
Germany, 2013, pp. 95–98.
ista: 'Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight
skeletons. 29th European Workshop on Computational Geometry. EuroCG: European
Workshop on Computational Geometry, 95–98.'
mla: Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.”
29th European Workshop on Computational Geometry, TU Braunschweig, 2013,
pp. 95–98.
short: T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational
Geometry, TU Braunschweig, 2013, pp. 95–98.
conference:
end_date: 2013-03-20
location: Braunschweig, Germany
name: 'EuroCG: European Workshop on Computational Geometry'
start_date: 2013-03-17
date_created: 2018-12-11T11:56:21Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2021-01-12T06:56:00Z
day: '01'
department:
- _id: HeEd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 95 - 98
publication: 29th European Workshop on Computational Geometry
publication_status: published
publisher: TU Braunschweig
publist_id: '4762'
status: public
title: Reconstructing polygons from embedded straight skeletons
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2237'
abstract:
- lang: eng
text: We describe new extensions of the Vampire theorem prover for computing tree
interpolants. These extensions generalize Craig interpolation in Vampire, and
can also be used to derive sequence interpolants. We evaluated our implementation
on a large number of examples over the theory of linear integer arithmetic and
integer-indexed arrays, with and without quantifiers. When compared to other methods,
our experiments show that some examples could only be solved by our implementation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Régis
full_name: Blanc, Régis
last_name: Blanc
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
citation:
ama: Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181.
doi:10.1007/978-3-642-45221-5_13
apa: 'Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation
in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13'
chicago: Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation
in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13.
ieee: R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,”
vol. 8312. Springer, pp. 173–181, 2013.
ista: Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire.
8312, 173–181.
mla: Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer,
2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.
short: R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.
conference:
end_date: 2013-12-19
location: Stellenbosch, South Africa
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2013-12-14
date_created: 2018-12-11T11:56:29Z
date_published: 2013-01-14T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-45221-5_13
file:
- access_level: open_access
checksum: 9cebaafca032e6769d273f393305c705
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:10:40Z
date_updated: 2020-07-14T12:45:34Z
file_id: '7858'
file_name: 2013_LPAR_Blanc.pdf
file_size: 279206
relation: main_file
file_date_updated: 2020-07-14T12:45:34Z
has_accepted_license: '1'
intvolume: ' 8312'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 173 - 181
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '4724'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Tree interpolation in Vampire
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8312
year: '2013'
...
---
_id: '2238'
abstract:
- lang: eng
text: "We study the problem of achieving a given value in Markov decision processes
(MDPs) with several independent discounted reward objectives. We consider a generalised
version of discounted reward objectives, in which the amount of discounting depends
on the states visited and on the objective. This definition extends the usual
definition of discounted reward, and allows to capture the systems in which the
value of different commodities diminish at different and variable rates.\r\n\r\nWe
establish results for two prominent subclasses of the problem, namely state-discount
models where the discount factors are only dependent on the state of the MDP (and
independent of the objective), and reward-discount models where they are only
dependent on the objective (but not on the state of the MDP). For the state-discount
models we use a straightforward reduction to expected total reward and show that
the problem whether a value is achievable can be solved in polynomial time. For
the reward-discount model we show that memory and randomisation of the strategies
are required, but nevertheless that the problem is decidable and it is sufficient
to consider strategies which after a certain number of steps behave in a memoryless
way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e.
MDPs with no randomisation), pure strategies and discount factors of the form
1/n where n is an integer, the problem is in PSPACE and finite memory suffices
for achieving a given value. We also show that when the discount factors are not
of the form 1/n, the memory required by a strategy can be infinite.\r\n"
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Dominik
full_name: Wojtczak, Dominik
last_name: Wojtczak
citation:
ama: Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification
in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17
apa: 'Chatterjee, K., Forejt, V., & Wojtczak, D. (2013). Multi-objective discounted
reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming,
Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer.
https://doi.org/10.1007/978-3-642-45221-5_17'
chicago: Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective
Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer
Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_17.
ieee: K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward
verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
ista: Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward
verification in graphs and MDPs. 8312, 228–242.
mla: Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification
in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.
short: K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.
conference:
end_date: 2013-12-19
location: Stellenbosch, South Africa
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2013-12-14
date_created: 2018-12-11T11:56:30Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2020-08-11T10:09:42Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-45221-5_17
ec_funded: 1
intvolume: ' 8312'
language:
- iso: eng
month: '12'
oa_version: None
page: 228 - 242
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '4723'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Multi-objective discounted reward verification in graphs and MDPs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8312
year: '2013'
...