---
_id: '807'
abstract:
- lang: eng
text: 'On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries
and the publisher Springer took its effect: this deal covers accessing the licensed
content on the one hand, and publishing open access on the other hand. More than
1000 papers by Austrian authors were published open access at Springer in the
first year alone. The working group "Springer Compact Evaluierung" made
the data for these articles available via the platform OpenAPC and would like
to use this opportunity to give a short account of what this publishing agreement
actually entails and the working group intends to do.'
author:
- first_name: Magdalena
full_name: Andrae, Magdalena
last_name: Andrae
- first_name: Márton
full_name: Villányi, Márton
id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
last_name: Villányi
orcid: 0000-0001-8126-0426
citation:
ama: Andrae M, Villányi M. Der Springer Compact-Deal – Ein erster Einblick in die
Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare. 2017;70(2):274-280. doi:10.31263/voebm.v70i2.1898
apa: Andrae, M., & Villányi, M. (2017). Der Springer Compact-Deal – Ein erster
Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen Der
Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. VÖB. https://doi.org/10.31263/voebm.v70i2.1898
chicago: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein
Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. VÖB,
2017. https://doi.org/10.31263/voebm.v70i2.1898.
ieee: M. Andrae and M. Villányi, “Der Springer Compact-Deal – Ein erster Einblick
in die Evaluierung einer Offsetting-Vereinbarung,” Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, vol. 70, no. 2. VÖB,
pp. 274–280, 2017.
ista: Andrae M, Villányi M. 2017. Der Springer Compact-Deal – Ein erster Einblick
in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare. 70(2), 274–280.
mla: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster
Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” Mitteilungen Der
Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare, vol. 70,
no. 2, VÖB, 2017, pp. 274–80, doi:10.31263/voebm.v70i2.1898.
short: M. Andrae, M. Villányi, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen
Und Bibliothekare 70 (2017) 274–280.
date_created: 2018-12-11T11:48:36Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:16:45Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v70i2.1898
file:
- access_level: open_access
checksum: 558c18bcf5580d87dd371ec626d52075
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T13:39:26Z
date_updated: 2020-07-14T12:48:09Z
file_id: '5851'
file_name: 2017_VOEB_Andrae.pdf
file_size: 125065
relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
intvolume: ' 70'
issue: '2'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 274 - 280
popular_science: '1'
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publication_identifier:
issn:
- '10222588'
publication_status: published
publisher: VÖB
publist_id: '6843'
scopus_import: 1
status: public
title: Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2017'
...
---
_id: '825'
abstract:
- lang: eng
text: What data is needed about data? Describing the process to answer this question
for the institutional data repository IST DataRep.
author:
- first_name: Barbara
full_name: Petritsch, Barbara
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
citation:
ama: Petritsch B. Metadata for research data in practice. Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen & Bibliothekare. 2017;70(2):200-207.
doi:10.31263/voebm.v70i2.1678
apa: Petritsch, B. (2017). Metadata for research data in practice. Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB.
https://doi.org/10.31263/voebm.v70i2.1678
chicago: Petritsch, Barbara. “Metadata for Research Data in Practice.” Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB,
2017. https://doi.org/10.31263/voebm.v70i2.1678.
ieee: B. Petritsch, “Metadata for research data in practice,” Mitteilungen der
Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 70,
no. 2. VÖB, pp. 200–207, 2017.
ista: Petritsch B. 2017. Metadata for research data in practice. Mitteilungen der
Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 70(2), 200–207.
mla: Petritsch, Barbara. “Metadata for Research Data in Practice.” Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol.
70, no. 2, VÖB, 2017, pp. 200–07, doi:10.31263/voebm.v70i2.1678.
short: B. Petritsch, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen
& Bibliothekare 70 (2017) 200–207.
date_created: 2018-12-11T11:48:42Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:17:44Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v70i2.1678
file:
- access_level: open_access
checksum: 7c4544d07efa2c2add8612b489abb4e2
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T13:32:17Z
date_updated: 2020-07-14T12:48:11Z
file_id: '5850'
file_name: 2017_VOEB_Petritsch.pdf
file_size: 7843975
relation: main_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
intvolume: ' 70'
issue: '2'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 200 - 207
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare
publication_identifier:
issn:
- '10222588'
publication_status: published
publisher: VÖB
publist_id: '6823'
scopus_import: 1
status: public
title: Metadata for research data in practice
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: 70
year: '2017'
...
---
_id: '9445'
abstract:
- lang: eng
text: Cytosine methylation regulates essential genome functions across eukaryotes,
but the fundamental question of whether nucleosomal or naked DNA is the preferred
substrate of plant and animal methyltransferases remains unresolved. Here, we
show that genetic inactivation of a single DDM1/Lsh family nucleosome remodeler
biases methylation toward inter-nucleosomal linker DNA in Arabidopsis thaliana
and mouse. We find that DDM1 enables methylation of DNA bound to the nucleosome,
suggesting that nucleosome-free DNA is the preferred substrate of eukaryotic methyltransferases
in vivo. Furthermore, we show that simultaneous mutation of DDM1 and linker histone
H1 in Arabidopsis reproduces the strong linker-specific methylation patterns of
species that diverged from flowering plants and animals over a billion years ago.
Our results indicate that in the absence of remodeling, nucleosomes are strong
barriers to DNA methyltransferases. Linker-specific methylation can evolve simply
by breaking the connection between nucleosome remodeling and DNA methylation.
article_number: e30674
article_processing_charge: No
article_type: original
author:
- first_name: David B
full_name: Lyons, David B
last_name: Lyons
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Lyons DB, Zilberman D. DDM1 and Lsh remodelers allow methylation of DNA wrapped
in nucleosomes. eLife. 2017;6. doi:10.7554/elife.30674
apa: Lyons, D. B., & Zilberman, D. (2017). DDM1 and Lsh remodelers allow methylation
of DNA wrapped in nucleosomes. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.30674
chicago: Lyons, David B, and Daniel Zilberman. “DDM1 and Lsh Remodelers Allow Methylation
of DNA Wrapped in Nucleosomes.” ELife. eLife Sciences Publications, 2017.
https://doi.org/10.7554/elife.30674.
ieee: D. B. Lyons and D. Zilberman, “DDM1 and Lsh remodelers allow methylation of
DNA wrapped in nucleosomes,” eLife, vol. 6. eLife Sciences Publications,
2017.
ista: Lyons DB, Zilberman D. 2017. DDM1 and Lsh remodelers allow methylation of
DNA wrapped in nucleosomes. eLife. 6, e30674.
mla: Lyons, David B., and Daniel Zilberman. “DDM1 and Lsh Remodelers Allow Methylation
of DNA Wrapped in Nucleosomes.” ELife, vol. 6, e30674, eLife Sciences Publications,
2017, doi:10.7554/elife.30674.
short: D.B. Lyons, D. Zilberman, ELife 6 (2017).
date_created: 2021-06-02T14:28:58Z
date_published: 2017-11-15T00:00:00Z
date_updated: 2021-12-14T07:54:36Z
day: '15'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.7554/elife.30674
extern: '1'
external_id:
pmid:
- '29140247'
file:
- access_level: open_access
checksum: 4cfcdd67511ae4aed3d993550e46e146
content_type: application/pdf
creator: cziletti
date_created: 2021-06-02T14:33:36Z
date_updated: 2021-06-02T14:33:36Z
file_id: '9446'
file_name: 2017_eLife_Lyons.pdf
file_size: 1603102
relation: main_file
success: 1
file_date_updated: 2021-06-02T14:33:36Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: DDM1 and Lsh remodelers allow methylation of DNA wrapped in nucleosomes
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 6
year: '2017'
...
---
_id: '957'
abstract:
- lang: eng
text: Small molecule biosensors based on Forster resonance energy transfer (FRET)
enable small molecule signaling to be monitored with high spatial and temporal
resolution in complex cellular environments. FRET sensors can be constructed by
fusing a pair of fluorescent proteins to a suitable recognition domain, such as
a member of the solute-binding protein (SBP) superfamily. However, naturally occurring
SBPs may be unsuitable for incorporation into FRET sensors due to their low thermostability,
which may preclude imaging under physiological conditions, or because the positions
of their N- and C-termini may be suboptimal for fusion of fluorescent proteins,
which may limit the dynamic range of the resulting sensors. Here, we show how
these problems can be overcome using ancestral protein reconstruction and circular
permutation. Ancestral protein reconstruction, used as a protein engineering strategy,
leverages phylogenetic information to improve the thermostability of proteins,
while circular permutation enables the termini of an SBP to be repositioned to
maximize the dynamic range of the resulting FRET sensor. We also provide a protocol
for cloning the engineered SBPs into FRET sensor constructs using Golden Gate
assembly and discuss considerations for in situ characterization of the FRET sensors.
alternative_title:
- Methods in Molecular Biology
author:
- first_name: Ben
full_name: Clifton, Ben
last_name: Clifton
- first_name: Jason
full_name: Whitfield, Jason
last_name: Whitfield
- first_name: Inmaculada
full_name: Sanchez Romero, Inmaculada
id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
last_name: Sanchez Romero
- first_name: Michel
full_name: Herde, Michel
last_name: Herde
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Colin
full_name: Jackson, Colin
last_name: Jackson
citation:
ama: 'Clifton B, Whitfield J, Sanchez-Romero I, et al. Ancestral protein reconstruction
and circular permutation for improving the stability and dynamic range of FRET
sensors. In: Stein V, ed. Synthetic Protein Switches. Vol 1596. Synthetic
Protein Switches. Springer; 2017:71-87. doi:10.1007/978-1-4939-6940-1_5'
apa: Clifton, B., Whitfield, J., Sanchez-Romero, I., Herde, M., Henneberger, C.,
Janovjak, H. L., & Jackson, C. (2017). Ancestral protein reconstruction and
circular permutation for improving the stability and dynamic range of FRET sensors.
In V. Stein (Ed.), Synthetic Protein Switches (Vol. 1596, pp. 71–87). Springer.
https://doi.org/10.1007/978-1-4939-6940-1_5
chicago: Clifton, Ben, Jason Whitfield, Inmaculada Sanchez-Romero, Michel Herde,
Christian Henneberger, Harald L Janovjak, and Colin Jackson. “Ancestral Protein
Reconstruction and Circular Permutation for Improving the Stability and Dynamic
Range of FRET Sensors.” In Synthetic Protein Switches, edited by Viktor
Stein, 1596:71–87. Synthetic Protein Switches. Springer, 2017. https://doi.org/10.1007/978-1-4939-6940-1_5.
ieee: B. Clifton et al., “Ancestral protein reconstruction and circular permutation
for improving the stability and dynamic range of FRET sensors,” in Synthetic
Protein Switches, vol. 1596, V. Stein, Ed. Springer, 2017, pp. 71–87.
ista: 'Clifton B, Whitfield J, Sanchez-Romero I, Herde M, Henneberger C, Janovjak
HL, Jackson C. 2017.Ancestral protein reconstruction and circular permutation
for improving the stability and dynamic range of FRET sensors. In: Synthetic Protein
Switches. Methods in Molecular Biology, vol. 1596, 71–87.'
mla: Clifton, Ben, et al. “Ancestral Protein Reconstruction and Circular Permutation
for Improving the Stability and Dynamic Range of FRET Sensors.” Synthetic Protein
Switches, edited by Viktor Stein, vol. 1596, Springer, 2017, pp. 71–87, doi:10.1007/978-1-4939-6940-1_5.
short: B. Clifton, J. Whitfield, I. Sanchez-Romero, M. Herde, C. Henneberger, H.L.
Janovjak, C. Jackson, in:, V. Stein (Ed.), Synthetic Protein Switches, Springer,
2017, pp. 71–87.
date_created: 2018-12-11T11:49:24Z
date_published: 2017-03-15T00:00:00Z
date_updated: 2021-01-12T08:22:13Z
day: '15'
department:
- _id: HaJa
doi: 10.1007/978-1-4939-6940-1_5
editor:
- first_name: Viktor
full_name: Stein, Viktor
last_name: Stein
intvolume: ' 1596'
language:
- iso: eng
month: '03'
oa_version: None
page: 71 - 87
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors (HFSP Young Investigator)
publication: Synthetic Protein Switches
publication_identifier:
issn:
- '10643745'
publication_status: published
publisher: Springer
publist_id: '6451'
quality_controlled: '1'
scopus_import: 1
series_title: Synthetic Protein Switches
status: public
title: Ancestral protein reconstruction and circular permutation for improving the
stability and dynamic range of FRET sensors
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 1596
year: '2017'
...
---
_id: '963'
abstract:
- lang: eng
text: 'Network games are widely used as a model for selfish resource-allocation
problems. In the classical model, each player selects a path connecting her source
and target vertex. The cost of traversing an edge depends on the number of players
that traverse it. Thus, it abstracts the fact that different users may use a resource
at different times and for different durations, which plays an important role
in defining the costs of the users in reality. For example, when transmitting
packets in a communication network, routing traffic in a road network, or processing
a task in a production system, the traversal of the network involves an inherent
delay, and so sharing and congestion of resources crucially depends on time. We
study timed network games , which add a time component to network games. Each
vertex v in the network is associated with a cost function, mapping the load on
v to the price that a player pays for staying in v for one time unit with this
load. In addition, each edge has a guard, describing time intervals in which the
edge can be traversed, forcing the players to spend time on vertices. Unlike earlier
work that add a time component to network games, the time in our model is continuous
and cannot be discretized. In particular, players have uncountably many strategies,
and a game may have uncountably many pure Nash equilibria. We study properties
of timed network games with cost-sharing or congestion cost functions: their stability,
equilibrium inefficiency, and complexity. In particular, we show that the answer
to the question whether we can restrict attention to boundary strategies, namely
ones in which edges are traversed only at the boundaries of guards, is mixed. '
alternative_title:
- LIPIcs
article_number: '37'
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2017). Timed network games with clocks
(Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science
(SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.37.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark,
2017, vol. 83.'
ista: 'Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 37.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2017-08-21
date_created: 2018-12-11T11:49:26Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-02-23T12:35:50Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2017.37
file:
- access_level: open_access
checksum: f55eaf7f3c36ea07801112acfedd17d5
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:10Z
date_updated: 2020-07-14T12:48:18Z
file_id: '5059'
file_name: IST-2017-829-v1+1_mfcs-cr.pdf
file_size: 369730
relation: main_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6438'
pubrep_id: '829'
quality_controlled: '1'
related_material:
record:
- id: '6005'
relation: later_version
status: public
scopus_import: 1
status: public
title: Timed network games with clocks
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '9709'
abstract:
- lang: eng
text: Across the nervous system, certain population spiking patterns are observed
far more frequently than others. A hypothesis about this structure is that these
collective activity patterns function as population codewords–collective modes–carrying
information distinct from that of any single cell. We investigate this phenomenon
in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop
a novel statistical model that decomposes the population response into modes;
it predicts the distribution of spiking activity in the ganglion cell population
with high accuracy. We found that the modes represent localized features of the
visual stimulus that are distinct from the features represented by single neurons.
Modes form clusters of activity states that are readily discriminated from one
another. When we repeated the same visual stimulus, we found that the same mode
was robustly elicited. These results suggest that retinal ganglion cells’ collective
signaling is endowed with a form of error-correcting code–a principle that may
hold in brain areas beyond retina.
article_processing_charge: No
author:
- first_name: Jason
full_name: Prentice, Jason
last_name: Prentice
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Mark
full_name: Ioffe, Mark
last_name: Ioffe
- first_name: Adrianna
full_name: Loback, Adrianna
last_name: Loback
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: 'Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Data from: Error-robust
modes of the retinal population code. 2017. doi:10.5061/dryad.1f1rc'
apa: 'Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., & Berry, M.
(2017). Data from: Error-robust modes of the retinal population code. Dryad. https://doi.org/10.5061/dryad.1f1rc'
chicago: 'Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik,
and Michael Berry. “Data from: Error-Robust Modes of the Retinal Population Code.”
Dryad, 2017. https://doi.org/10.5061/dryad.1f1rc.'
ieee: 'J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Data
from: Error-robust modes of the retinal population code.” Dryad, 2017.'
ista: 'Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2017. Data from:
Error-robust modes of the retinal population code, Dryad, 10.5061/dryad.1f1rc.'
mla: 'Prentice, Jason, et al. Data from: Error-Robust Modes of the Retinal Population
Code. Dryad, 2017, doi:10.5061/dryad.1f1rc.'
short: J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, (2017).
date_created: 2021-07-23T11:34:34Z
date_published: 2017-10-18T00:00:00Z
date_updated: 2023-02-21T16:34:41Z
day: '18'
department:
- _id: GaTk
doi: 10.5061/dryad.1f1rc
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.1f1rc
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1197'
relation: used_in_publication
status: public
status: public
title: 'Data from: Error-robust modes of the retinal population code'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '541'
abstract:
- lang: eng
text: 'While we have good understanding of bacterial metabolism at the population
level, we know little about the metabolic behavior of individual cells: do single
cells in clonal populations sometimes specialize on different metabolic pathways?
Such metabolic specialization could be driven by stochastic gene expression and
could provide individual cells with growth benefits of specialization. We measured
the degree of phenotypic specialization in two parallel metabolic pathways, the
assimilation of glucose and arabinose. We grew Escherichia coli in chemostats,
and used isotope-labeled sugars in combination with nanometer-scale secondary
ion mass spectrometry and mathematical modeling to quantify sugar assimilation
at the single-cell level. We found large variation in metabolic activities between
single cells, both in absolute assimilation and in the degree to which individual
cells specialize in the assimilation of different sugars. Analysis of transcriptional
reporters indicated that this variation was at least partially based on cell-to-cell
variation in gene expression. Metabolic differences between cells in clonal populations
could potentially reduce metabolic incompatibilities between different pathways,
and increase the rate at which parallel reactions can be performed.'
article_number: e1007122
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Frank
full_name: Schreiber, Frank
last_name: Schreiber
- first_name: Alma
full_name: Dal Co, Alma
last_name: Dal Co
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Sten
full_name: Littmann, Sten
last_name: Littmann
- first_name: Marcel
full_name: Kuypers, Marcel
last_name: Kuypers
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
citation:
ama: Nikolic N, Schreiber F, Dal Co A, et al. Cell-to-cell variation and specialization
in sugar metabolism in clonal bacterial populations. PLoS Genetics. 2017;13(12).
doi:10.1371/journal.pgen.1007122
apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann,
S., … Ackermann, M. (2017). Cell-to-cell variation and specialization in sugar
metabolism in clonal bacterial populations. PLoS Genetics. Public Library
of Science. https://doi.org/10.1371/journal.pgen.1007122
chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller,
Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Cell-to-Cell Variation and
Specialization in Sugar Metabolism in Clonal Bacterial Populations.” PLoS Genetics.
Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.
ieee: N. Nikolic et al., “Cell-to-cell variation and specialization in sugar
metabolism in clonal bacterial populations,” PLoS Genetics, vol. 13, no.
12. Public Library of Science, 2017.
ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers
M, Ackermann M. 2017. Cell-to-cell variation and specialization in sugar metabolism
in clonal bacterial populations. PLoS Genetics. 13(12), e1007122.
mla: Nikolic, Nela, et al. “Cell-to-Cell Variation and Specialization in Sugar Metabolism
in Clonal Bacterial Populations.” PLoS Genetics, vol. 13, no. 12, e1007122,
Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122.
short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann,
M. Kuypers, M. Ackermann, PLoS Genetics 13 (2017).
date_created: 2018-12-11T11:47:04Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2023-02-23T14:10:34Z
day: '18'
ddc:
- '576'
- '579'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1007122
ec_funded: 1
file:
- access_level: open_access
checksum: 22426d9382f21554bad5fa5967afcfd0
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:35Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5088'
file_name: IST-2018-959-v1+1_2017_Nikolic_Cell-to-cell.pdf
file_size: 1308475
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: PLoS Genetics
publication_identifier:
issn:
- '15537390'
publication_status: published
publisher: Public Library of Science
publist_id: '7275'
pubrep_id: '959'
quality_controlled: '1'
related_material:
record:
- id: '9844'
relation: research_data
status: public
- id: '9845'
relation: research_data
status: public
- id: '9846'
relation: research_data
status: public
scopus_import: 1
status: public
title: Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial
populations
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: 13
year: '2017'
...
---
_id: '9847'
abstract:
- lang: eng
text: information on culture conditions, phage mutagenesis, verification and lysate
preparation; Raw data
article_processing_charge: No
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Pleska M, Guet CC. Supplementary materials and methods; Full data set from
effects of mutations in phage restriction sites during escape from restriction–modification.
2017. doi:10.6084/m9.figshare.5633917.v1
apa: Pleska, M., & Guet, C. C. (2017). Supplementary materials and methods;
Full data set from effects of mutations in phage restriction sites during escape
from restriction–modification. The Royal Society. https://doi.org/10.6084/m9.figshare.5633917.v1
chicago: Pleska, Maros, and Calin C Guet. “Supplementary Materials and Methods;
Full Data Set from Effects of Mutations in Phage Restriction Sites during Escape
from Restriction–Modification.” The Royal Society, 2017. https://doi.org/10.6084/m9.figshare.5633917.v1.
ieee: M. Pleska and C. C. Guet, “Supplementary materials and methods; Full data
set from effects of mutations in phage restriction sites during escape from restriction–modification.”
The Royal Society, 2017.
ista: Pleska M, Guet CC. 2017. Supplementary materials and methods; Full data set
from effects of mutations in phage restriction sites during escape from restriction–modification,
The Royal Society, 10.6084/m9.figshare.5633917.v1.
mla: Pleska, Maros, and Calin C. Guet. Supplementary Materials and Methods; Full
Data Set from Effects of Mutations in Phage Restriction Sites during Escape from
Restriction–Modification. The Royal Society, 2017, doi:10.6084/m9.figshare.5633917.v1.
short: M. Pleska, C.C. Guet, (2017).
date_created: 2021-08-09T13:54:38Z
date_published: 2017-11-27T00:00:00Z
date_updated: 2023-02-23T12:29:44Z
day: '27'
department:
- _id: CaGu
doi: 10.6084/m9.figshare.5633917.v1
main_file_link:
- open_access: '1'
url: https://doi.org/10.6084/m9.figshare.5633917.v1
month: '11'
oa: 1
oa_version: Published Version
publisher: The Royal Society
related_material:
record:
- id: '561'
relation: used_in_publication
status: public
status: public
title: Supplementary materials and methods; Full data set from effects of mutations
in phage restriction sites during escape from restriction–modification
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9845'
abstract:
- lang: eng
text: "Estimates of 13 C-arabinose and 2 H-glucose uptake from the fractions of
heavy isotopes measured\tin single cells"
article_processing_charge: No
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Frank
full_name: Schreiber, Frank
last_name: Schreiber
- first_name: Alma
full_name: Dal Co, Alma
last_name: Dal Co
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Sten
full_name: Littmann, Sten
last_name: Littmann
- first_name: Marcel
full_name: Kuypers, Marcel
last_name: Kuypers
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
citation:
ama: Nikolic N, Schreiber F, Dal Co A, et al. Mathematical model. 2017. doi:10.1371/journal.pgen.1007122.s017
apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann,
S., … Ackermann, M. (2017). Mathematical model. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007122.s017
chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller,
Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Mathematical Model.” Public
Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s017.
ieee: N. Nikolic et al., “Mathematical model.” Public Library of Science,
2017.
ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers
M, Ackermann M. 2017. Mathematical model, Public Library of Science, 10.1371/journal.pgen.1007122.s017.
mla: Nikolic, Nela, et al. Mathematical Model. Public Library of Science,
2017, doi:10.1371/journal.pgen.1007122.s017.
short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann,
M. Kuypers, M. Ackermann, (2017).
date_created: 2021-08-09T13:31:51Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2023-02-23T12:25:04Z
day: '18'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1007122.s017
month: '12'
oa_version: None
publisher: Public Library of Science
related_material:
record:
- id: '541'
relation: used_in_publication
status: public
status: public
title: Mathematical model
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9849'
abstract:
- lang: eng
text: This text provides additional information about the model, a derivation of
the analytic results in Eq (4), and details about simulations of an additional
parameter set.
article_processing_charge: No
author:
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Lukacisinova M, Novak S, Paixao T. Modelling and simulation details. 2017.
doi:10.1371/journal.pcbi.1005609.s001
apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Modelling and simulation
details. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s001
chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Modelling and
Simulation Details.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s001.
ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Modelling and simulation details.”
Public Library of Science, 2017.
ista: Lukacisinova M, Novak S, Paixao T. 2017. Modelling and simulation details,
Public Library of Science, 10.1371/journal.pcbi.1005609.s001.
mla: Lukacisinova, Marta, et al. Modelling and Simulation Details. Public
Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s001.
short: M. Lukacisinova, S. Novak, T. Paixao, (2017).
date_created: 2021-08-09T14:02:34Z
date_published: 2017-07-18T00:00:00Z
date_updated: 2023-02-23T12:55:39Z
day: '18'
department:
- _id: ToBo
- _id: NiBa
- _id: CaGu
doi: 10.1371/journal.pcbi.1005609.s001
month: '07'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '696'
relation: used_in_publication
status: public
status: public
title: Modelling and simulation details
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9850'
abstract:
- lang: eng
text: In this text, we discuss how a cost of resistance and the possibility of lethal
mutations impact our model.
article_processing_charge: No
author:
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Lukacisinova M, Novak S, Paixao T. Extensions of the model. 2017. doi:10.1371/journal.pcbi.1005609.s002
apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Extensions of the model.
Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s002
chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Extensions of
the Model.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s002.
ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Extensions of the model.” Public
Library of Science, 2017.
ista: Lukacisinova M, Novak S, Paixao T. 2017. Extensions of the model, Public Library
of Science, 10.1371/journal.pcbi.1005609.s002.
mla: Lukacisinova, Marta, et al. Extensions of the Model. Public Library
of Science, 2017, doi:10.1371/journal.pcbi.1005609.s002.
short: M. Lukacisinova, S. Novak, T. Paixao, (2017).
date_created: 2021-08-09T14:05:24Z
date_published: 2017-07-18T00:00:00Z
date_updated: 2023-02-23T12:55:39Z
day: '18'
department:
- _id: ToBo
- _id: CaGu
- _id: NiBa
doi: 10.1371/journal.pcbi.1005609.s002
month: '07'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '696'
relation: used_in_publication
status: public
status: public
title: Extensions of the model
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9846'
article_processing_charge: No
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Frank
full_name: Schreiber, Frank
last_name: Schreiber
- first_name: Alma
full_name: Dal Co, Alma
last_name: Dal Co
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Sten
full_name: Littmann, Sten
last_name: Littmann
- first_name: Marcel
full_name: Kuypers, Marcel
last_name: Kuypers
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
citation:
ama: Nikolic N, Schreiber F, Dal Co A, et al. Supplementary methods. 2017. doi:10.1371/journal.pgen.1007122.s016
apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann,
S., … Ackermann, M. (2017). Supplementary methods. Public Library of Science.
https://doi.org/10.1371/journal.pgen.1007122.s016
chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller,
Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Supplementary Methods.”
Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s016.
ieee: N. Nikolic et al., “Supplementary methods.” Public Library of Science,
2017.
ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers
M, Ackermann M. 2017. Supplementary methods, Public Library of Science, 10.1371/journal.pgen.1007122.s016.
mla: Nikolic, Nela, et al. Supplementary Methods. Public Library of Science,
2017, doi:10.1371/journal.pgen.1007122.s016.
short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann,
M. Kuypers, M. Ackermann, (2017).
date_created: 2021-08-09T13:35:17Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2023-02-23T12:25:04Z
day: '18'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1007122.s016
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '541'
relation: used_in_publication
status: public
status: public
title: Supplementary methods
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '680'
abstract:
- lang: eng
text: In order to respond reliably to specific features of their environment, sensory
neurons need to integrate multiple incoming noisy signals. Crucially, they also
need to compete for the interpretation of those signals with other neurons representing
similar features. The form that this competition should take depends critically
on the noise corrupting these signals. In this study we show that for the type
of noise commonly observed in sensory systems, whose variance scales with the
mean signal, sensory neurons should selectively divide their input signals by
their predictions, suppressing ambiguous cues while amplifying others. Any change
in the stimulus context alters which inputs are suppressed, leading to a deep
dynamic reshaping of neural receptive fields going far beyond simple surround
suppression. Paradoxically, these highly variable receptive fields go alongside
and are in fact required for an invariant representation of external sensory features.
In addition to offering a normative account of context-dependent changes in sensory
responses, perceptual inference in the presence of signal-dependent noise accounts
for ubiquitous features of sensory neurons such as divisive normalization, gain
control and contrast dependent temporal dynamics.
article_number: e1005582
author:
- first_name: Matthew J
full_name: Chalk, Matthew J
id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
last_name: Chalk
orcid: 0000-0001-7782-4436
- first_name: Paul
full_name: Masset, Paul
last_name: Masset
- first_name: Boris
full_name: Gutkin, Boris
last_name: Gutkin
- first_name: Sophie
full_name: Denève, Sophie
last_name: Denève
citation:
ama: Chalk MJ, Masset P, Gutkin B, Denève S. Sensory noise predicts divisive reshaping
of receptive fields. PLoS Computational Biology. 2017;13(6). doi:10.1371/journal.pcbi.1005582
apa: Chalk, M. J., Masset, P., Gutkin, B., & Denève, S. (2017). Sensory noise
predicts divisive reshaping of receptive fields. PLoS Computational Biology.
Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005582
chicago: Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Sensory
Noise Predicts Divisive Reshaping of Receptive Fields.” PLoS Computational
Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005582.
ieee: M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Sensory noise predicts
divisive reshaping of receptive fields,” PLoS Computational Biology, vol.
13, no. 6. Public Library of Science, 2017.
ista: Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Sensory noise predicts divisive
reshaping of receptive fields. PLoS Computational Biology. 13(6), e1005582.
mla: Chalk, Matthew J., et al. “Sensory Noise Predicts Divisive Reshaping of Receptive
Fields.” PLoS Computational Biology, vol. 13, no. 6, e1005582, Public Library
of Science, 2017, doi:10.1371/journal.pcbi.1005582.
short: M.J. Chalk, P. Masset, B. Gutkin, S. Denève, PLoS Computational Biology 13
(2017).
date_created: 2018-12-11T11:47:53Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-02-23T14:10:54Z
day: '01'
ddc:
- '571'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1005582
file:
- access_level: open_access
checksum: 796a1026076af6f4405a47d985bc7b68
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '4645'
file_name: IST-2017-898-v1+1_journal.pcbi.1005582.pdf
file_size: 14555676
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_identifier:
issn:
- 1553734X
publication_status: published
publisher: Public Library of Science
publist_id: '7035'
pubrep_id: '898'
quality_controlled: '1'
related_material:
record:
- id: '9855'
relation: research_data
status: public
scopus_import: 1
status: public
title: Sensory noise predicts divisive reshaping of receptive fields
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: 13
year: '2017'
...
---
_id: '9851'
abstract:
- lang: eng
text: Based on the intuitive derivation of the dynamics of SIM allele frequency
pM in the main text, we present a heuristic prediction for the long-term SIM allele
frequencies with χ > 1 stresses and compare it to numerical simulations.
article_processing_charge: No
author:
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Lukacisinova M, Novak S, Paixao T. Heuristic prediction for multiple stresses.
2017. doi:10.1371/journal.pcbi.1005609.s003
apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Heuristic prediction
for multiple stresses. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s003
chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Heuristic Prediction
for Multiple Stresses.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s003.
ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Heuristic prediction for multiple
stresses.” Public Library of Science, 2017.
ista: Lukacisinova M, Novak S, Paixao T. 2017. Heuristic prediction for multiple
stresses, Public Library of Science, 10.1371/journal.pcbi.1005609.s003.
mla: Lukacisinova, Marta, et al. Heuristic Prediction for Multiple Stresses.
Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s003.
short: M. Lukacisinova, S. Novak, T. Paixao, (2017).
date_created: 2021-08-09T14:08:14Z
date_published: 2017-07-18T00:00:00Z
date_updated: 2023-02-23T12:55:39Z
day: '18'
department:
- _id: ToBo
- _id: CaGu
- _id: NiBa
doi: 10.1371/journal.pcbi.1005609.s003
month: '07'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '696'
relation: used_in_publication
status: public
status: public
title: Heuristic prediction for multiple stresses
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9852'
abstract:
- lang: eng
text: We show how different combination strategies affect the fraction of individuals
that are multi-resistant.
article_processing_charge: No
author:
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Lukacisinova M, Novak S, Paixao T. Resistance frequencies for different combination
strategies. 2017. doi:10.1371/journal.pcbi.1005609.s004
apa: Lukacisinova, M., Novak, S., & Paixao, T. (2017). Resistance frequencies
for different combination strategies. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609.s004
chicago: Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Resistance Frequencies
for Different Combination Strategies.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.s004.
ieee: M. Lukacisinova, S. Novak, and T. Paixao, “Resistance frequencies for different
combination strategies.” Public Library of Science, 2017.
ista: Lukacisinova M, Novak S, Paixao T. 2017. Resistance frequencies for different
combination strategies, Public Library of Science, 10.1371/journal.pcbi.1005609.s004.
mla: Lukacisinova, Marta, et al. Resistance Frequencies for Different Combination
Strategies. Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.s004.
short: M. Lukacisinova, S. Novak, T. Paixao, (2017).
date_created: 2021-08-09T14:11:40Z
date_published: 2017-07-18T00:00:00Z
date_updated: 2023-02-23T12:55:39Z
day: '18'
department:
- _id: ToBo
- _id: CaGu
- _id: NiBa
doi: 10.1371/journal.pcbi.1005609.s004
month: '07'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '696'
relation: used_in_publication
status: public
status: public
title: Resistance frequencies for different combination strategies
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9855'
abstract:
- lang: eng
text: Includes derivation of optimal estimation algorithm, generalisation to non-poisson
noise statistics, correlated input noise, and implementation of in a multi-layer
neural network.
article_processing_charge: No
author:
- first_name: Matthew J
full_name: Chalk, Matthew J
id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
last_name: Chalk
orcid: 0000-0001-7782-4436
- first_name: Paul
full_name: Masset, Paul
last_name: Masset
- first_name: Boris
full_name: Gutkin, Boris
last_name: Gutkin
- first_name: Sophie
full_name: Denève, Sophie
last_name: Denève
citation:
ama: Chalk MJ, Masset P, Gutkin B, Denève S. Supplementary appendix. 2017. doi:10.1371/journal.pcbi.1005582.s001
apa: Chalk, M. J., Masset, P., Gutkin, B., & Denève, S. (2017). Supplementary
appendix. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005582.s001
chicago: Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Supplementary
Appendix.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005582.s001.
ieee: M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Supplementary appendix.”
Public Library of Science, 2017.
ista: Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Supplementary appendix, Public
Library of Science, 10.1371/journal.pcbi.1005582.s001.
mla: Chalk, Matthew J., et al. Supplementary Appendix. Public Library of
Science, 2017, doi:10.1371/journal.pcbi.1005582.s001.
short: M.J. Chalk, P. Masset, B. Gutkin, S. Denève, (2017).
date_created: 2021-08-10T07:05:10Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-02-23T12:52:17Z
day: '01'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1005582.s001
month: '06'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '680'
relation: used_in_publication
status: public
status: public
title: Supplementary appendix
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '941'
abstract:
- lang: eng
text: 'Recently there has been a proliferation of automated program repair (APR)
techniques, targeting various programming languages. Such techniques can be generally
classified into two families: syntactic- and semantics-based. Semantics-based
APR, on which we focus, typically uses symbolic execution to infer semantic constraints
and then program synthesis to construct repairs conforming to them. While syntactic-based
APR techniques have been shown successful on bugs in real-world programs written
in both C and Java, semantics-based APR techniques mostly target C programs. This
leaves empirical comparisons of the APR families not fully explored, and developers
without a Java-based semantics APR technique. We present JFix, a semantics-based
APR framework that targets Java, and an associated Eclipse plugin. JFix is implemented
atop Symbolic PathFinder, a well-known symbolic execution engine for Java programs.
It extends one particular APR technique (Angelix), and is designed to be sufficiently
generic to support a variety of such techniques. We demonstrate that semantics-based
APR can indeed efficiently and effectively repair a variety of classes of bugs
in large real-world Java programs. This supports our claim that the framework
can both support developers seeking semantics-based repair of bugs in Java programs,
as well as enable larger scale empirical studies comparing syntactic- and semantics-based
APR targeting Java. The demonstration of our tool is available via the project
website at: https://xuanbachle.github.io/semanticsrepair/ '
author:
- first_name: Xuan
full_name: Le, Xuan
last_name: Le
- first_name: Duc Hiep
full_name: Chu, Duc Hiep
id: 3598E630-F248-11E8-B48F-1D18A9856A87
last_name: Chu
- first_name: David
full_name: Lo, David
last_name: Lo
- first_name: Claire
full_name: Le Goues, Claire
last_name: Le Goues
- first_name: Willem
full_name: Visser, Willem
last_name: Visser
citation:
ama: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. JFIX: Semantics-based repair of
Java programs via symbolic PathFinder. In: Proceedings of the 26th ACM SIGSOFT
International Symposium on Software Testing and Analysis. ACM; 2017:376-379.
doi:10.1145/3092703.3098225'
apa: 'Le, X., Chu, D. H., Lo, D., Le Goues, C., & Visser, W. (2017). JFIX: Semantics-based
repair of Java programs via symbolic PathFinder. In Proceedings of the 26th
ACM SIGSOFT International Symposium on Software Testing and Analysis (pp.
376–379). Santa Barbara, CA, United States: ACM. https://doi.org/10.1145/3092703.3098225'
chicago: 'Le, Xuan, Duc Hiep Chu, David Lo, Claire Le Goues, and Willem Visser.
“JFIX: Semantics-Based Repair of Java Programs via Symbolic PathFinder.” In Proceedings
of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis,
376–79. ACM, 2017. https://doi.org/10.1145/3092703.3098225.'
ieee: 'X. Le, D. H. Chu, D. Lo, C. Le Goues, and W. Visser, “JFIX: Semantics-based
repair of Java programs via symbolic PathFinder,” in Proceedings of the 26th
ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa
Barbara, CA, United States, 2017, pp. 376–379.'
ista: 'Le X, Chu DH, Lo D, Le Goues C, Visser W. 2017. JFIX: Semantics-based repair
of Java programs via symbolic PathFinder. Proceedings of the 26th ACM SIGSOFT
International Symposium on Software Testing and Analysis. ISSTA: International
Symposium on Software Testing and Analysis, 376–379.'
mla: 'Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic
PathFinder.” Proceedings of the 26th ACM SIGSOFT International Symposium on
Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.'
short: X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, Proceedings of the 26th
ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017,
pp. 376–379.
conference:
end_date: 2017-07-14
location: Santa Barbara, CA, United States
name: 'ISSTA: International Symposium on Software Testing and Analysis'
start_date: 2017-07-10
date_created: 2018-12-11T11:49:19Z
date_published: 2017-07-10T00:00:00Z
date_updated: 2021-01-12T08:22:05Z
day: '10'
department:
- _id: ToHe
doi: 10.1145/3092703.3098225
language:
- iso: eng
month: '07'
oa_version: None
page: '376 - 379 '
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 26th ACM SIGSOFT International Symposium on Software
Testing and Analysis
publication_status: published
publisher: ACM
publist_id: '6478'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'JFIX: Semantics-based repair of Java programs via symbolic PathFinder'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '9506'
abstract:
- lang: eng
text: Methylation in the bodies of active genes is common in animals and vascular
plants. Evolutionary patterns indicate homeostatic functions for this type of
methylation.
article_number: '87'
article_processing_charge: No
author:
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zilberman D. An evolutionary case for functional gene body methylation in plants
and animals. Genome Biology. 2017;18(1). doi:10.1186/s13059-017-1230-2
apa: Zilberman, D. (2017). An evolutionary case for functional gene body methylation
in plants and animals. Genome Biology. Springer Nature. https://doi.org/10.1186/s13059-017-1230-2
chicago: Zilberman, Daniel. “An Evolutionary Case for Functional Gene Body Methylation
in Plants and Animals.” Genome Biology. Springer Nature, 2017. https://doi.org/10.1186/s13059-017-1230-2.
ieee: D. Zilberman, “An evolutionary case for functional gene body methylation in
plants and animals,” Genome Biology, vol. 18, no. 1. Springer Nature, 2017.
ista: Zilberman D. 2017. An evolutionary case for functional gene body methylation
in plants and animals. Genome Biology. 18(1), 87.
mla: Zilberman, Daniel. “An Evolutionary Case for Functional Gene Body Methylation
in Plants and Animals.” Genome Biology, vol. 18, no. 1, 87, Springer Nature,
2017, doi:10.1186/s13059-017-1230-2.
short: D. Zilberman, Genome Biology 18 (2017).
date_created: 2021-06-07T12:27:39Z
date_published: 2017-05-09T00:00:00Z
date_updated: 2021-12-14T07:55:02Z
day: '09'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.1186/s13059-017-1230-2
extern: '1'
external_id:
pmid:
- '28486944'
file:
- access_level: open_access
checksum: 5a455ad914e7d225b1baa4ab07fd925e
content_type: application/pdf
creator: asandaue
date_created: 2021-06-07T12:31:36Z
date_updated: 2021-06-07T12:31:36Z
file_id: '9507'
file_name: 2017_GenomeBiology_Zilberman.pdf
file_size: 278183
relation: main_file
success: 1
file_date_updated: 2021-06-07T12:31:36Z
has_accepted_license: '1'
intvolume: ' 18'
issue: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Genome Biology
publication_identifier:
eissn:
- 1465-6906
issn:
- 1474-760X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An evolutionary case for functional gene body methylation in plants and animals
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 18
year: '2017'
...
---
_id: '958'
abstract:
- lang: eng
text: Biosensors that exploit Forster resonance energy transfer (FRET) can be used
to visualize biological and physiological processes and are capable of providing
detailed information in both spatial and temporal dimensions. In a FRET-based
biosensor, substrate binding is associated with a change in the relative positions
of two fluorophores, leading to a change in FRET efficiency that may be observed
in the fluorescence spectrum. As a result, their design requires a ligand-binding
protein that exhibits a conformational change upon binding. However, not all ligand-binding
proteins produce responsive sensors upon conjugation to fluorescent proteins or
dyes, and identifying the optimum locations for the fluorophores often involves
labor-intensive iterative design or high-throughput screening. Combining the genetic
fusion of a fluorescent protein to the ligand-binding protein with site-specific
covalent attachment of a fluorescent dye can allow fine control over the positions
of the two fluorophores, allowing the construction of very sensitive sensors.
This relies upon the accurate prediction of the locations of the two fluorophores
in bound and unbound states. In this chapter, we describe a method for computational
identification of dye-attachment sites that allows the use of cysteine modification
to attach synthetic dyes that can be paired with a fluorescent protein for the
purposes of creating FRET sensors.
alternative_title:
- Methods in Molecular Biology
author:
- first_name: Joshua
full_name: Mitchell, Joshua
last_name: Mitchell
- first_name: William
full_name: Zhang, William
last_name: Zhang
- first_name: Michel
full_name: Herde, Michel
last_name: Herde
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Megan
full_name: O'Mara, Megan
last_name: O'Mara
- first_name: Colin
full_name: Jackson, Colin
last_name: Jackson
citation:
ama: 'Mitchell J, Zhang W, Herde M, et al. Method for developing optical sensors
using a synthetic dye fluorescent protein FRET pair and computational modeling
and assessment. In: Stein V, ed. Synthetic Protein Switches. Vol 1596.
Synthetic Protein Switches. Springer; 2017:89-99. doi:10.1007/978-1-4939-6940-1_6'
apa: Mitchell, J., Zhang, W., Herde, M., Henneberger, C., Janovjak, H. L., O’Mara,
M., & Jackson, C. (2017). Method for developing optical sensors using a synthetic
dye fluorescent protein FRET pair and computational modeling and assessment. In
V. Stein (Ed.), Synthetic Protein Switches (Vol. 1596, pp. 89–99). Springer.
https://doi.org/10.1007/978-1-4939-6940-1_6
chicago: Mitchell, Joshua, William Zhang, Michel Herde, Christian Henneberger, Harald
L Janovjak, Megan O’Mara, and Colin Jackson. “Method for Developing Optical Sensors
Using a Synthetic Dye Fluorescent Protein FRET Pair and Computational Modeling
and Assessment.” In Synthetic Protein Switches, edited by Viktor Stein,
1596:89–99. Synthetic Protein Switches. Springer, 2017. https://doi.org/10.1007/978-1-4939-6940-1_6.
ieee: J. Mitchell et al., “Method for developing optical sensors using a
synthetic dye fluorescent protein FRET pair and computational modeling and assessment,”
in Synthetic Protein Switches, vol. 1596, V. Stein, Ed. Springer, 2017,
pp. 89–99.
ista: 'Mitchell J, Zhang W, Herde M, Henneberger C, Janovjak HL, O’Mara M, Jackson
C. 2017.Method for developing optical sensors using a synthetic dye fluorescent
protein FRET pair and computational modeling and assessment. In: Synthetic Protein
Switches. Methods in Molecular Biology, vol. 1596, 89–99.'
mla: Mitchell, Joshua, et al. “Method for Developing Optical Sensors Using a Synthetic
Dye Fluorescent Protein FRET Pair and Computational Modeling and Assessment.”
Synthetic Protein Switches, edited by Viktor Stein, vol. 1596, Springer,
2017, pp. 89–99, doi:10.1007/978-1-4939-6940-1_6.
short: J. Mitchell, W. Zhang, M. Herde, C. Henneberger, H.L. Janovjak, M. O’Mara,
C. Jackson, in:, V. Stein (Ed.), Synthetic Protein Switches, Springer, 2017, pp.
89–99.
date_created: 2018-12-11T11:49:24Z
date_published: 2017-05-15T00:00:00Z
date_updated: 2021-01-12T08:22:13Z
day: '15'
department:
- _id: HaJa
doi: 10.1007/978-1-4939-6940-1_6
editor:
- first_name: Viktor
full_name: Stein, Viktor
last_name: Stein
intvolume: ' 1596'
language:
- iso: eng
month: '05'
oa_version: None
page: 89 - 99
publication: Synthetic Protein Switches
publication_identifier:
issn:
- '10643745'
publication_status: published
publisher: Springer
publist_id: '6450'
quality_controlled: '1'
scopus_import: 1
series_title: Synthetic Protein Switches
status: public
title: Method for developing optical sensors using a synthetic dye fluorescent protein
FRET pair and computational modeling and assessment
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 1596
year: '2017'
...
---
_id: '9707'
abstract:
- lang: eng
text: Branching morphogenesis of the epithelial ureteric bud forms the renal collecting
duct system and is critical for normal nephron number, while low nephron number
is implicated in hypertension and renal disease. Ureteric bud growth and branching
requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric
bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling
up-regulates transcription factors Etv4 and Etv5, which are also critical for
branching. Despite extensive knowledge of the genetic control of these events,
it is not understood, at the cellular level, how renal branching morphogenesis
is achieved or how Ret signaling influences epithelial cell behaviors to promote
this process. Analysis of chimeric embryos previously suggested a role for Ret
signaling in promoting cell rearrangements in the nephric duct, but this method
was unsuited to study individual cell behaviors during ureteric bud branching.
Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture
and time-lapse imaging, to trace the movements and divisions of individual ureteric
bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type
clones in which the mutant and wild-type sister cells are differentially and heritably
marked by green and red fluorescent proteins. We find that, in normal kidneys,
most individual tip cells behave as self-renewing progenitors, some of whose progeny
remain at the tips while others populate the growing UB trunks. In Ret or Etv4
MADM clones, the wild-type cells generated at a UB tip are much more likely to
remain at, or move to, the new tips during branching and elongation, while their
Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks.
By tracking successive mitoses in a cell lineage, we find that Ret signaling has
little effect on proliferation, in contrast to its effects on cell movement. Our
results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric
bud tips, and suggest a model in which these cell movements mediate branching
morphogenesis.
article_processing_charge: No
author:
- first_name: Paul
full_name: Riccio, Paul
last_name: Riccio
- first_name: Christina
full_name: Cebrián, Christina
last_name: Cebrián
- first_name: Hui
full_name: Zong, Hui
last_name: Zong
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Frank
full_name: Costantini, Frank
last_name: Costantini
citation:
ama: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and
Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.
2017. doi:10.5061/dryad.pk16b'
apa: 'Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., & Costantini, F. (2017).
Data from: Ret and Etv4 promote directed movements of progenitor cells during
renal branching morphogenesis. Dryad. https://doi.org/10.5061/dryad.pk16b'
chicago: 'Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank
Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor
Cells during Renal Branching Morphogenesis.” Dryad, 2017. https://doi.org/10.5061/dryad.pk16b.'
ieee: 'P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data
from: Ret and Etv4 promote directed movements of progenitor cells during renal
branching morphogenesis.” Dryad, 2017.'
ista: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from:
Ret and Etv4 promote directed movements of progenitor cells during renal branching
morphogenesis, Dryad, 10.5061/dryad.pk16b.'
mla: 'Riccio, Paul, et al. Data from: Ret and Etv4 Promote Directed Movements
of Progenitor Cells during Renal Branching Morphogenesis. Dryad, 2017, doi:10.5061/dryad.pk16b.'
short: P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017).
date_created: 2021-07-23T09:39:34Z
date_published: 2017-01-14T00:00:00Z
date_updated: 2022-08-25T13:34:55Z
day: '14'
department:
- _id: SiHi
doi: 10.5061/dryad.pk16b
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.pk16b
month: '01'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9702'
relation: used_in_publication
status: deleted
status: public
title: 'Data from: Ret and Etv4 promote directed movements of progenitor cells during
renal branching morphogenesis'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9844'
article_processing_charge: No
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Frank
full_name: Schreiber, Frank
last_name: Schreiber
- first_name: Alma
full_name: Dal Co, Alma
last_name: Dal Co
- first_name: Daniel
full_name: Kiviet, Daniel
last_name: Kiviet
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Sten
full_name: Littmann, Sten
last_name: Littmann
- first_name: Marcel
full_name: Kuypers, Marcel
last_name: Kuypers
- first_name: Martin
full_name: Ackermann, Martin
last_name: Ackermann
citation:
ama: Nikolic N, Schreiber F, Dal Co A, et al. Source data for figures and tables.
2017. doi:10.1371/journal.pgen.1007122.s018
apa: Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann,
S., … Ackermann, M. (2017). Source data for figures and tables. Public Library
of Science. https://doi.org/10.1371/journal.pgen.1007122.s018
chicago: Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller,
Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Source Data for Figures
and Tables.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s018.
ieee: N. Nikolic et al., “Source data for figures and tables.” Public Library
of Science, 2017.
ista: Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers
M, Ackermann M. 2017. Source data for figures and tables, Public Library of Science,
10.1371/journal.pgen.1007122.s018.
mla: Nikolic, Nela, et al. Source Data for Figures and Tables. Public Library
of Science, 2017, doi:10.1371/journal.pgen.1007122.s018.
short: N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann,
M. Kuypers, M. Ackermann, (2017).
date_created: 2021-08-09T13:27:16Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2023-02-23T12:25:04Z
day: '18'
department:
- _id: CaGu
doi: 10.1371/journal.pgen.1007122.s018
month: '12'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '541'
relation: used_in_publication
status: public
status: public
title: Source data for figures and tables
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '12905'
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Janos
full_name: Kiss, Janos
id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87
last_name: Kiss
citation:
ama: 'Schlögl A, Kiss J. Scientific Computing at IST Austria. In: AHPC17 – Austrian
HPC Meeting 2017. FSP Scientific Computing; 2017:28.'
apa: 'Schlögl, A., & Kiss, J. (2017). Scientific Computing at IST Austria. In
AHPC17 – Austrian HPC Meeting 2017 (p. 28). Grundlsee, Austria: FSP Scientific
Computing.'
chicago: Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.”
In AHPC17 – Austrian HPC Meeting 2017, 28. FSP Scientific Computing, 2017.
ieee: A. Schlögl and J. Kiss, “Scientific Computing at IST Austria,” in AHPC17
– Austrian HPC Meeting 2017, Grundlsee, Austria, 2017, p. 28.
ista: 'Schlögl A, Kiss J. 2017. Scientific Computing at IST Austria. AHPC17 – Austrian
HPC Meeting 2017. AHPC: Austrian HPC Meeting, 28.'
mla: Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” AHPC17
– Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28.
short: A. Schlögl, J. Kiss, in:, AHPC17 – Austrian HPC Meeting 2017, FSP Scientific
Computing, 2017, p. 28.
conference:
end_date: 2017-03-03
location: Grundlsee, Austria
name: 'AHPC: Austrian HPC Meeting'
start_date: 2017-03-01
date_created: 2023-05-05T12:58:53Z
date_published: 2017-03-03T00:00:00Z
date_updated: 2023-05-16T07:22:23Z
day: '03'
ddc:
- '000'
department:
- _id: ScienComp
file:
- access_level: open_access
checksum: 7bcc499479d4f4c5ce6c0071c24ca6c6
content_type: application/pdf
creator: dernst
date_created: 2023-05-16T07:20:50Z
date_updated: 2023-05-16T07:20:50Z
file_id: '12969'
file_name: 2017_AHPC_Schloegl.pdf
file_size: 1005486
relation: main_file
success: 1
file_date_updated: 2023-05-16T07:20:50Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc17/BOOKLET_AHPC17.pdf
month: '03'
oa: 1
oa_version: Published Version
page: '28'
publication: AHPC17 – Austrian HPC Meeting 2017
publication_status: published
publisher: FSP Scientific Computing
status: public
title: Scientific Computing at IST Austria
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '13160'
abstract:
- lang: eng
text: "Transforming deterministic ω\r\n-automata into deterministic parity automata
is traditionally done using variants of appearance records. We present a more
efficient variant of this approach, tailored to Rabin automata, and several optimizations
applicable to all appearance records. We compare the methods experimentally and
find out that our method produces smaller automata than previous approaches. Moreover,
the experiments demonstrate the potential of our method for LTL synthesis, using
LTL-to-Rabin translators. It leads to significantly smaller parity automata when
compared to state-of-the-art approaches on complex formulae."
acknowledgement: This work is partially funded by the DFG project “Verified Model
Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Clara
full_name: Waldmann, Clara
last_name: Waldmann
- first_name: Maximilian
full_name: Weininger, Maximilian
last_name: Weininger
citation:
ama: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record
for transforming Rabin automata into parity automata. In: Tools and Algorithms
for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460.
doi:10.1007/978-3-662-54577-5_26'
apa: 'Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017).
Index appearance record for transforming Rabin automata into parity automata.
In Tools and Algorithms for the Construction and Analysis of Systems (Vol.
10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26'
chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger.
“Index Appearance Record for Transforming Rabin Automata into Parity Automata.”
In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60.
Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26.
ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance
record for transforming Rabin automata into parity automata,” in Tools and
Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden,
2017, vol. 10205, pp. 443–460.
ista: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance
record for transforming Rabin automata into parity automata. Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.'
mla: Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata
into Parity Automata.” Tools and Algorithms for the Construction and Analysis
of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.
short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and
Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
date_created: 2023-06-21T13:21:14Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2023-06-21T13:29:46Z
day: '31'
department:
- _id: KrCh
doi: 10.1007/978-3-662-54577-5_26
external_id:
arxiv:
- '1701.05738'
intvolume: ' 10205'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1701.05738
month: '03'
oa: 1
oa_version: Preprint
page: 443-460
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783662545775'
eissn:
- 1611-3349
isbn:
- '9783662545768'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Index appearance record for transforming Rabin automata into parity automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10205
year: '2017'
...
---
_id: '950'
abstract:
- lang: eng
text: "Two-player games on graphs are widely studied in formal methods as they model
the interaction between a system and its environment. The game is played by moving
a token throughout a graph to produce an infinite path. There are several common
modes to determine how the players move the token through the graph; e.g., in
turn-based games the players alternate turns in moving the token. We study the
bidding mode of moving the token, which, to the best of our knowledge, has never
been studied in infinite-duration games. Both players have separate budgets, which
sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously,
and a bid is legal if it does not exceed the available budget. The winner of the
bidding pays his bid to the other player and moves the token. For reachability
objectives, repeated bidding games have been studied and are called Richman games.
There, a central question is the existence and computation of threshold budgets;
namely, a value t\\in [0,1] such that if\\PO's budget exceeds $t$, he can win
the game, and if\\PT's budget exceeds 1-t, he can win the game. We focus on parity
games and mean-payoff games. We show the existence of threshold budgets in these
games, and reduce the problem of finding them to Richman games. We also determine
the strategy-complexity of an optimal strategy. Our most interesting result shows
that memoryless strategies suffice for mean-payoff bidding games. \r\n"
alternative_title:
- LIPIcs
article_number: '17'
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- 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: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
citation:
ama: 'Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol
85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21'
apa: 'Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration
bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21'
chicago: Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration
Bidding Games,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
https://doi.org/10.4230/LIPIcs.CONCUR.2017.21.
ieee: 'G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,”
presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.'
ista: 'Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR:
Concurrency Theory, LIPIcs, vol. 85, 17.'
mla: Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.
short: G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'CONCUR: Concurrency Theory'
start_date: 2017-09-05
date_created: 2018-12-11T11:49:22Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-08-29T07:02:13Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2017.21
external_id:
arxiv:
- '1705.01433'
file:
- access_level: open_access
checksum: 6d5cccf755207b91ccbef95d8275b013
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:00Z
date_updated: 2020-07-14T12:48:16Z
file_id: '5318'
file_name: IST-2017-844-v1+1_concur-cr.pdf
file_size: 335170
relation: main_file
file_date_updated: 2020-07-14T12:48:16Z
has_accepted_license: '1'
intvolume: ' 85'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6466'
pubrep_id: '844'
quality_controlled: '1'
related_material:
record:
- id: '6752'
relation: later_version
status: public
scopus_import: 1
status: public
title: Infinite-duration bidding games
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2017'
...
---
_id: '683'
abstract:
- lang: eng
text: 'Given a triangulation of a point set in the plane, a flip deletes an edge
e whose removal leaves a convex quadrilateral, and replaces e by the opposite
diagonal of the quadrilateral. It is well known that any triangulation of a point
set can be reconfigured to any other triangulation by some sequence of flips.
We explore this question in the setting where each edge of a triangulation has
a label, and a flip transfers the label of the removed edge to the new edge. It
is not true that every labelled triangulation of a point set can be reconfigured
to every other labelled triangulation via a sequence of flips, but we characterize
when this is possible. There is an obvious necessary condition: for each label
l, if edge e has label l in the first triangulation and edge f has label l in
the second triangulation, then there must be some sequence of flips that moves
label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot
formulated the Orbit Conjecture, which states that this necessary condition is
also sufficient, i.e. that all labels can be simultaneously mapped to their destination
if and only if each label individually can be mapped to its destination. We prove
this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence
of flips to reconfigure one labelled triangulation to another, if such a sequence
exists, and we prove an upper bound of O(n7) on the length of the flip sequence.
Our proof uses the topological result that the sets of pairwise non-crossing edges
on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional
ball (this follows from a result of Orden and Santos; we give a different proof
based on a shelling argument). The dual cell complex of this simplicial ball,
called the flip complex, has the usual flip graph as its 1-skeleton. We use properties
of the 2-skeleton of the flip complex to prove the Orbit Conjecture.'
alternative_title:
- LIPIcs
article_number: '49'
author:
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping
edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2017. doi:10.4230/LIPIcs.SoCG.2017.49'
apa: 'Lubiw, A., Masárová, Z., & Wagner, U. (2017). A proof of the orbit conjecture
for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium
on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49'
chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture
for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.49.
ieee: 'A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for
flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational
Geometry, Brisbane, Australia, 2017, vol. 77.'
ista: 'Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for
flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry,
LIPIcs, vol. 77, 49.'
mla: Lubiw, Anna, et al. A Proof of the Orbit Conjecture for Flipping Edge Labelled
Triangulations. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, doi:10.4230/LIPIcs.SoCG.2017.49.
short: A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017.
conference:
end_date: 2017-07-07
location: Brisbane, Australia
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2017-07-04
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-05T15:01:43Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.49
file:
- access_level: open_access
checksum: 24fdde981cc513352a78dcf9b0660ae9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:12Z
date_updated: 2020-07-14T12:47:41Z
file_id: '5265'
file_name: IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf
file_size: 710007
relation: main_file
file_date_updated: 2020-07-14T12:47:41Z
has_accepted_license: '1'
intvolume: ' 77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7033'
pubrep_id: '896'
quality_controlled: '1'
related_material:
record:
- id: '5986'
relation: later_version
status: public
scopus_import: 1
status: public
title: A proof of the orbit conjecture for flipping edge labelled triangulations
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '1155'
abstract:
- lang: eng
text: This dissertation concerns the automatic verification of probabilistic systems
and programs with arrays by statistical and logical methods. Although statistical
and logical methods are different in nature, we show that they can be successfully
combined for system analysis. In the first part of the dissertation we present
a new statistical algorithm for the verification of probabilistic systems with
respect to unbounded properties, including linear temporal logic. Our algorithm
often performs faster than the previous approaches, and at the same time requires
less information about the system. In addition, our method can be generalized
to unbounded quantitative properties such as mean-payoff bounds. In the second
part, we introduce two techniques for comparing probabilistic systems. Probabilistic
systems are typically compared using the notion of equivalence, which requires
the systems to have the equal probability of all behaviors. However, this notion
is often too strict, since probabilities are typically only empirically estimated,
and any imprecision may break the relation between processes. On the one hand,
we propose to replace the Boolean notion of equivalence by a quantitative distance
of similarity. For this purpose, we introduce a statistical framework for estimating
distances between Markov chains based on their simulation runs, and we investigate
which distances can be approximated in our framework. On the other hand, we propose
to compare systems with respect to a new qualitative logic, which expresses that
behaviors occur with probability one or a positive probability. This qualitative
analysis is robust with respect to modeling errors and applicable to many domains.
In the last part, we present a new quantifier-free logic for integer arrays, which
allows us to express counting. Counting properties are prevalent in array-manipulating
programs, however they cannot be expressed in the quantified fragments of the
theory of arrays. We present a decision procedure for our logic, and provide several
complexity results.
acknowledgement: ' First of all, I want to thank my advisor, prof. Thomas A. Henzinger,
for his guidance during my PhD program. I am grateful for the freedom I was given
to pursue my research interests, and his continuous support. Working with prof.
Henzinger was a truly inspiring experience and taught me what it means to be a scientist.
I want to express my gratitude to my collaborators: Nikola Beneš, Krishnendu Chatterjee,
Martin Chmelík, Ashutosh Gupta, Willibald Krenn, Jan Kˇretínský, Dejan Nickovic,
Andrey Kupriyanov, and Tatjana Petrov. I have learned a great deal from my collaborators,
and without their help this thesis would not be possible. In addition, I want to
thank the members of my thesis committee: Dirk Beyer, Dejan Nickovic, and Georg
Weissenbacher for their advice and reviewing this dissertation. I would especially
like to acknowledge the late Helmut Veith, who was a member of my committee. I will
remember Helmut for his kindness, enthusiasm, and wit, as well as for being an inspiring
scientist. Finally, I would like to thank my colleagues for making my stay at IST
such a pleasant experience: Guy Avni, Sergiy Bogomolov, Ventsislav Chonev, Rasmus
Ibsen-Jensen, Mirco Giacobbe, Bernhard Kragl, Hui Kong, Petr Novotný, Jan Otop,
Andreas Pavlogiannis, Tantjana Petrov, Arjun Radhakrishna, Jakob Ruess, Thorsten
Tarrach, as well as other members of groups Henzinger and Chatterjee. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
citation:
ama: Daca P. Statistical and logical methods for property checking. 2017. doi:10.15479/AT:ISTA:TH_730
apa: Daca, P. (2017). Statistical and logical methods for property checking.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_730
chicago: Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:TH_730.
ieee: P. Daca, “Statistical and logical methods for property checking,” Institute
of Science and Technology Austria, 2017.
ista: Daca P. 2017. Statistical and logical methods for property checking. Institute
of Science and Technology Austria.
mla: Daca, Przemyslaw. Statistical and Logical Methods for Property Checking.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730.
short: P. Daca, Statistical and Logical Methods for Property Checking, Institute
of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:50:27Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2023-09-07T11:58:34Z
day: '02'
ddc:
- '004'
- '005'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:TH_730
ec_funded: 1
file:
- access_level: open_access
checksum: 1406a681cb737508234fde34766be2c2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:26Z
date_updated: 2020-07-14T12:44:34Z
file_id: '4880'
file_name: IST-2017-730-v1+1_Statistical_and_Logical_Methods_for_Property_Checking.pdf
file_size: 1028586
relation: main_file
file_date_updated: 2020-07-14T12:44:34Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '163'
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6203'
pubrep_id: '730'
related_material:
record:
- id: '1093'
relation: part_of_dissertation
status: public
- id: '1230'
relation: part_of_dissertation
status: public
- id: '1234'
relation: part_of_dissertation
status: public
- id: '1391'
relation: part_of_dissertation
status: public
- id: '1501'
relation: part_of_dissertation
status: public
- id: '1502'
relation: part_of_dissertation
status: public
- id: '2063'
relation: part_of_dissertation
status: public
- id: '2167'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Statistical and logical methods for property checking
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '6291'
abstract:
- lang: eng
text: Bacteria and their pathogens – phages – are the most abundant living entities
on Earth. Throughout their coevolution, bacteria have evolved multiple immune
systems to overcome the ubiquitous threat from the phages. Although the molecu-
lar details of these immune systems’ functions are relatively well understood,
their epidemiological consequences for the phage-bacterial communities have been
largely neglected. In this thesis we employed both experimental and theoretical
methods to explore whether herd and social immunity may arise in bacterial popu-
lations. Using our experimental system consisting of Escherichia coli strains
with a CRISPR based immunity to the T7 phage we show that herd immunity arises
in phage-bacterial communities and that it is accentuated when the populations
are spatially structured. By fitting a mathematical model, we inferred expressions
for the herd immunity threshold and the velocity of spread of a phage epidemic
in partially resistant bacterial populations, which both depend on the bacterial
growth rate, phage burst size and phage latent period. We also investigated the
poten- tial for social immunity in Streptococcus thermophilus and its phage 2972
using a bioinformatic analysis of potentially coding short open reading frames
with a signalling signature, encoded within the CRISPR associated genes. Subsequently,
we tested one identified potentially signalling peptide and found that its addition
to a phage-challenged culture increases probability of survival of bacteria two
fold, although the results were only marginally significant. Together, these results
demonstrate that the ubiquitous arms races between bacteria and phages have further
consequences at the level of the population.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Pavel
full_name: Payne, Pavel
id: 35F78294-F248-11E8-B48F-1D18A9856A87
last_name: Payne
orcid: 0000-0002-2711-9453
citation:
ama: Payne P. Bacterial herd and social immunity to phages. 2017.
apa: Payne, P. (2017). Bacterial herd and social immunity to phages. Institute
of Science and Technology Austria.
chicago: Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute
of Science and Technology Austria, 2017.
ieee: P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science
and Technology Austria, 2017.
ista: Payne P. 2017. Bacterial herd and social immunity to phages. Institute of
Science and Technology Austria.
mla: Payne, Pavel. Bacterial Herd and Social Immunity to Phages. Institute
of Science and Technology Austria, 2017.
short: P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science
and Technology Austria, 2017.
date_created: 2019-04-09T15:16:45Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-07T12:00:00Z
day: '01'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: NiBa
- _id: JoBo
file:
- access_level: closed
checksum: a0fc5c26a89c0ea759947ffba87d0d8f
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T15:15:32Z
date_updated: 2020-07-14T12:47:27Z
file_id: '6292'
file_name: thesis_pavel_payne_final_w_signature_page.pdf
file_size: 3025175
relation: main_file
- access_level: open_access
checksum: af531e921a7f64a9e0af4cd8783b2226
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T13:45:59Z
date_updated: 2021-02-22T13:45:59Z
file_id: '9187'
file_name: 2017_Payne_Thesis.pdf
file_size: 3111536
relation: main_file
success: 1
file_date_updated: 2021-02-22T13:45:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '83'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Bacterial herd and social immunity to phages
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '561'
abstract:
- lang: eng
text: Restriction–modification systems are widespread genetic elements that protect
bacteria from bacteriophage infections by recognizing and cleaving heterologous
DNA at short, well-defined sequences called restriction sites. Bioinformatic evidence
shows that restriction sites are significantly underrepresented in bacteriophage
genomes, presumably because bacteriophages with fewer restriction sites are more
likely to escape cleavage by restriction–modification systems. However, how mutations
in restriction sites affect the likelihood of bacteriophage escape is unknown.
Using the bacteriophage l and the restriction–modification system EcoRI, we show
that while mutation effects at different restriction sites are unequal, they are
independent. As a result, the probability of bacteriophage escape increases with
each mutated restriction site. Our results experimentally support the role of
restriction site avoidance as a response to selection imposed by restriction–modification
systems and offer an insight into the events underlying the process of bacteriophage
escape.
acknowledgement: This work was funded by an HFSP Young Investigators' grant RGY0079/2011
(C.C.G.). M.P. is a recipient of a DOC Fellowship of the Austrian Academy of Science
at the Institute of Science and Technology Austria.
article_number: '20170646'
article_processing_charge: No
article_type: original
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Pleska M, Guet CC. Effects of mutations in phage restriction sites during escape
from restriction–modification. Biology Letters. 2017;13(12). doi:10.1098/rsbl.2017.0646
apa: Pleska, M., & Guet, C. C. (2017). Effects of mutations in phage restriction
sites during escape from restriction–modification. Biology Letters. The
Royal Society. https://doi.org/10.1098/rsbl.2017.0646
chicago: Pleska, Maros, and Calin C Guet. “Effects of Mutations in Phage Restriction
Sites during Escape from Restriction–Modification.” Biology Letters. The
Royal Society, 2017. https://doi.org/10.1098/rsbl.2017.0646.
ieee: M. Pleska and C. C. Guet, “Effects of mutations in phage restriction sites
during escape from restriction–modification,” Biology Letters, vol. 13,
no. 12. The Royal Society, 2017.
ista: Pleska M, Guet CC. 2017. Effects of mutations in phage restriction sites during
escape from restriction–modification. Biology Letters. 13(12), 20170646.
mla: Pleska, Maros, and Calin C. Guet. “Effects of Mutations in Phage Restriction
Sites during Escape from Restriction–Modification.” Biology Letters, vol.
13, no. 12, 20170646, The Royal Society, 2017, doi:10.1098/rsbl.2017.0646.
short: M. Pleska, C.C. Guet, Biology Letters 13 (2017).
date_created: 2018-12-11T11:47:11Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-09-07T11:59:32Z
day: '01'
department:
- _id: CaGu
doi: 10.1098/rsbl.2017.0646
external_id:
pmid:
- '29237814'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1098/rsbl.2017.0646
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 251BCBEC-B435-11E9-9278-68D0E5697425
grant_number: RGY0079/2011
name: Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification
Systems (HFSP Young investigators' grant)
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
grant_number: '24210'
name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
at the Single-Cell Level (DOC Fellowship)
publication: Biology Letters
publication_identifier:
issn:
- 1744-9561
publication_status: published
publisher: The Royal Society
publist_id: '7253'
quality_controlled: '1'
related_material:
record:
- id: '9847'
relation: research_data
status: public
- id: '202'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Effects of mutations in phage restriction sites during escape from restriction–modification
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '818'
abstract:
- lang: eng
text: 'Antibiotics have diverse effects on bacteria, including massive changes in
bacterial gene expression. Whereas the gene expression changes under many antibiotics
have been measured, the temporal organization of these responses and their dependence
on the bacterial growth rate are unclear. As described in Chapter 1, we quantified
the temporal gene expression changes in the bacterium Escherichia coli in response
to the sudden exposure to antibiotics using a fluorescent reporter library and
a robotic system. Our data show temporally structured gene expression responses,
with response times for individual genes ranging from tens of minutes to several
hours. We observed that many stress response genes were activated in response
to antibiotics. As certain stress responses cross-protect bacteria from other
stressors, we then asked whether cellular responses to antibiotics have a similar
protective role in Chapter 2. Indeed, we found that the trimethoprim-induced acid
stress response protects bacteria from subsequent acid stress. We combined microfluidics
with time-lapse imaging to monitor survival, intracellular pH, and acid stress
response in single cells. This approach revealed that the variable expression
of the acid resistance operon gadBC strongly correlates with single-cell survival
time. Cells with higher gadBC expression following trimethoprim maintain higher
intracellular pH and survive the acid stress longer. Overall, we provide a way
to identify single-cell cross-protection between antibiotics and environmental
stressors from temporal gene expression data, and show how antibiotics can increase
bacterial fitness in changing environments. While gene expression changes to antibiotics
show a clear temporal structure at the population-level, it is unclear whether
this clear temporal order is followed by every single cell. Using dual-reporter
strains described in Chapter 3, we measured gene expression dynamics of promoter
pairs in the same cells using microfluidics and microscopy. Chapter 4 shows that
the oxidative stress response and the DNA stress response showed little timing
variability and a clear temporal order under the antibiotic nitrofurantoin. In
contrast, the acid stress response under trimethoprim ran independently from all
other activated response programs including the DNA stress response, which showed
particularly high timing variability in this stress condition. In summary, this
approach provides insight into the temporal organization of gene expression programs
at the single-cell level and suggests dependencies between response programs and
the underlying variability-introducing mechanisms. Altogether, this work advances
our understanding of the diverse effects that antibiotics have on bacteria. These
results were obtained by taking into account gene expression dynamics, which allowed
us to identify general principles, molecular mechanisms, and dependencies between
genes. Our findings may have implications for infectious disease treatments, and
microbial communities in the human body and in nature. '
acknowledgement: 'First of all, I would like to express great gratitude to my PhD
supervisor Tobias Bollenbach. Through his open and trusting attitude I had the freedom
to explore different scientific directions during this project, and follow the research
lines of my interest. I am thankful for constructive and often extensive discussions
and his support and commitment during the different stages of my PhD. I want to
thank my committee members, Călin Guet, Terry Hwa and Nassos Typas for their interest
and their valuable input to this project. Special thanks to Nassos for career guidance,
and for accepting me in his lab. A big thank you goes to the past, present and affiliated
members of the Bollenbach group: Guillaume Chevereau, Marjon de Vos, Marta Lukačišinová,
Veronika Bierbaum, Qi Qin, Marcin Zagórski, Martin Lukačišin, Andreas Angermayr,
Bor Kavčič, Julia Tischler, Dilay Ayhan, Jaroslav Ferenc, and Georg Rieckh. I enjoyed
working and discussing with you very much and I will miss our lengthy group meetings,
our inspiring journal clubs, and our common lunches. Special thanks to Bor for great
mental and professional support during the hard months of thesis writing, and to
Marta for very creative times during the beginning of our PhDs. May the ‘Bacterial
Survival Guide’ decorate the walls of IST forever! A great thanks to my friend and
collaborator Georg Rieckh for his enthusiasm and for getting so involved in these
projects, for his endurance and for his company throughout the years. Thanks to
the FriSBi crowd at IST Austria for interesting meetings and discussions. In particular
I want to thank Magdalena Steinrück, and Anna Andersson for inspiring exchange,
and enjoyable time together. Thanks to everybody who contributed to the cover for
Cell Systems: The constructive input from Tobias Bollenbach, Bor Kavčič, Georg Rieckh,
Marta Lukačišinová, and Sebastian Nozzi, and the professional implementation by
the graphic designer Martina Markus from the University of Cologne. Thanks to all
my office mates in the first floor Bertalanffy building throughout the years: for
ensuring a pleasant working atmosphere, and for your company! In general, I want
to thank all the people that make IST such a great environment, with the many possibilities
to shape our own social and research environment. I want to thank my family for
all kind of practical support during the years, and my second family in Argentina
for their enthusiasm. Thanks to my brother Bernhard and my sister Martina for being
great siblings, and to Helena and Valentin for the joy you brought to my life. My
deep gratitude goes to Sebastian Nozzi, for constant support, patience, love and
for believing in me. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karin
full_name: Mitosch, Karin
id: 39B66846-F248-11E8-B48F-1D18A9856A87
last_name: Mitosch
citation:
ama: Mitosch K. Timing, variability and cross-protection in bacteria – insights
from dynamic gene expression responses to antibiotics. 2017. doi:10.15479/AT:ISTA:th_862
apa: Mitosch, K. (2017). Timing, variability and cross-protection in bacteria
– insights from dynamic gene expression responses to antibiotics. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_862
chicago: Mitosch, Karin. “Timing, Variability and Cross-Protection in Bacteria –
Insights from Dynamic Gene Expression Responses to Antibiotics.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_862.
ieee: K. Mitosch, “Timing, variability and cross-protection in bacteria – insights
from dynamic gene expression responses to antibiotics,” Institute of Science and
Technology Austria, 2017.
ista: Mitosch K. 2017. Timing, variability and cross-protection in bacteria – insights
from dynamic gene expression responses to antibiotics. Institute of Science and
Technology Austria.
mla: Mitosch, Karin. Timing, Variability and Cross-Protection in Bacteria – Insights
from Dynamic Gene Expression Responses to Antibiotics. Institute of Science
and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_862.
short: K. Mitosch, Timing, Variability and Cross-Protection in Bacteria – Insights
from Dynamic Gene Expression Responses to Antibiotics, Institute of Science and
Technology Austria, 2017.
date_created: 2018-12-11T11:48:40Z
date_published: 2017-09-27T00:00:00Z
date_updated: 2023-09-07T12:00:26Z
day: '27'
ddc:
- '571'
- '579'
degree_awarded: PhD
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:th_862
file:
- access_level: closed
checksum: da3993c5f90f59a8e8623cc31ad501dd
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:48:51Z
date_updated: 2020-07-14T12:48:09Z
file_id: '6210'
file_name: Thesis_KarinMitosch.docx
file_size: 6331071
relation: source_file
- access_level: open_access
checksum: 24c3d9e51992f1b721f3df55aa13fcb8
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T08:48:51Z
date_updated: 2020-07-14T12:48:09Z
file_id: '6211'
file_name: Thesis_KarinMitosch.pdf
file_size: 9289852
relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '113'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6831'
pubrep_id: '862'
related_material:
record:
- id: '2001'
relation: part_of_dissertation
status: public
- id: '666'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
title: Timing, variability and cross-protection in bacteria – insights from dynamic
gene expression responses to antibiotics
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '666'
abstract:
- lang: eng
text: Antibiotics elicit drastic changes in microbial gene expression, including
the induction of stress response genes. While certain stress responses are known
to “cross-protect” bacteria from other stressors, it is unclear whether cellular
responses to antibiotics have a similar protective role. By measuring the genome-wide
transcriptional response dynamics of Escherichia coli to four antibiotics, we
found that trimethoprim induces a rapid acid stress response that protects bacteria
from subsequent exposure to acid. Combining microfluidics with time-lapse imaging
to monitor survival and acid stress response in single cells revealed that the
noisy expression of the acid resistance operon gadBC correlates with single-cell
survival. Cells with higher gadBC expression following trimethoprim maintain higher
intracellular pH and survive the acid stress longer. The seemingly random single-cell
survival under acid stress can therefore be predicted from gadBC expression and
rationalized in terms of GadB/C molecular function. Overall, we provide a roadmap
for identifying the molecular mechanisms of single-cell cross-protection between
antibiotics and other stressors.
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Karin
full_name: Mitosch, Karin
id: 39B66846-F248-11E8-B48F-1D18A9856A87
last_name: Mitosch
- first_name: Georg
full_name: Rieckh, Georg
id: 34DA8BD6-F248-11E8-B48F-1D18A9856A87
last_name: Rieckh
- first_name: Tobias
full_name: Bollenbach, Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Mitosch K, Rieckh G, Bollenbach MT. Noisy response to antibiotic stress predicts
subsequent single cell survival in an acidic environment. Cell Systems.
2017;4(4):393-403. doi:10.1016/j.cels.2017.03.001
apa: Mitosch, K., Rieckh, G., & Bollenbach, M. T. (2017). Noisy response to
antibiotic stress predicts subsequent single cell survival in an acidic environment.
Cell Systems. Cell Press. https://doi.org/10.1016/j.cels.2017.03.001
chicago: Mitosch, Karin, Georg Rieckh, and Mark Tobias Bollenbach. “Noisy Response
to Antibiotic Stress Predicts Subsequent Single Cell Survival in an Acidic Environment.”
Cell Systems. Cell Press, 2017. https://doi.org/10.1016/j.cels.2017.03.001.
ieee: K. Mitosch, G. Rieckh, and M. T. Bollenbach, “Noisy response to antibiotic
stress predicts subsequent single cell survival in an acidic environment,” Cell
Systems, vol. 4, no. 4. Cell Press, pp. 393–403, 2017.
ista: Mitosch K, Rieckh G, Bollenbach MT. 2017. Noisy response to antibiotic stress
predicts subsequent single cell survival in an acidic environment. Cell Systems.
4(4), 393–403.
mla: Mitosch, Karin, et al. “Noisy Response to Antibiotic Stress Predicts Subsequent
Single Cell Survival in an Acidic Environment.” Cell Systems, vol. 4, no.
4, Cell Press, 2017, pp. 393–403, doi:10.1016/j.cels.2017.03.001.
short: K. Mitosch, G. Rieckh, M.T. Bollenbach, Cell Systems 4 (2017) 393–403.
date_created: 2018-12-11T11:47:48Z
date_published: 2017-04-26T00:00:00Z
date_updated: 2023-09-07T12:00:25Z
day: '26'
ddc:
- '576'
- '610'
department:
- _id: ToBo
- _id: GaTk
doi: 10.1016/j.cels.2017.03.001
ec_funded: 1
file:
- access_level: open_access
checksum: 04ff20011c3d9a601c514aa999a5fe1a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:54Z
date_updated: 2020-07-14T12:47:35Z
file_id: '5041'
file_name: IST-2017-901-v1+1_1-s2.0-S2405471217300868-main.pdf
file_size: 2438660
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 393 - 403
project:
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303507'
name: Optimality principles in responses to antibiotics
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27201-B22
name: Revealing the mechanisms underlying drug interactions
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
grant_number: RGP0042/2013
name: Revealing the fundamental limits of cell growth
publication: Cell Systems
publication_identifier:
issn:
- '24054712'
publication_status: published
publisher: Cell Press
publist_id: '7061'
pubrep_id: '901'
quality_controlled: '1'
related_material:
record:
- id: '818'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Noisy response to antibiotic stress predicts subsequent single cell survival
in an acidic environment
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2017'
...
---
_id: '821'
abstract:
- lang: eng
text: "This dissertation focuses on algorithmic aspects of program verification,
and presents modeling and complexity advances on several problems related to the\r\nstatic
analysis of programs, the stateless model checking of concurrent programs, and
the competitive analysis of real-time scheduling algorithms.\r\nOur contributions
can be broadly grouped into five categories.\r\n\r\nOur first contribution is
a set of new algorithms and data structures for the quantitative and data-flow
analysis of programs, based on the graph-theoretic notion of treewidth.\r\nIt
has been observed that the control-flow graphs of typical programs have special
structure, and are characterized as graphs of small treewidth.\r\nWe utilize this
structural property to provide faster algorithms for the quantitative and data-flow
analysis of recursive and concurrent programs.\r\nIn most cases we make an algebraic
treatment of the considered problem,\r\nwhere several interesting analyses, such
as the reachability, shortest path, and certain kind of data-flow analysis problems
follow as special cases. \r\nWe exploit the constant-treewidth property to obtain
algorithmic improvements for on-demand versions of the problems, \r\nand provide
data structures with various tradeoffs between the resources spent in the preprocessing
and querying phase.\r\nWe also improve on the algorithmic complexity of quantitative
problems outside the algebraic path framework,\r\nnamely of the minimum mean-payoff,
minimum ratio, and minimum initial credit for energy problems.\r\n\r\n\r\nOur
second contribution is a set of algorithms for Dyck reachability with applications
to data-dependence analysis and alias analysis.\r\nIn particular, we develop an
optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous
in context-insensitive, field-sensitive points-to analysis.\r\nAdditionally, we
develop an efficient algorithm for context-sensitive data-dependence analysis
via Dyck reachability,\r\nwhere the task is to obtain analysis summaries of library
code in the presence of callbacks.\r\nOur algorithm preprocesses libraries in
almost linear time, after which the contribution of the library in the complexity
of the client analysis is (i)~linear in the number of call sites and (ii)~only
logarithmic in the size of the whole library, as opposed to linear in the size
of the whole library.\r\nFinally, we prove that Dyck reachability is Boolean Matrix
Multiplication-hard in general, and the hardness also holds for graphs of constant
treewidth.\r\nThis hardness result strongly indicates that there exist no combinatorial
algorithms for Dyck reachability with truly subcubic complexity.\r\n\r\n\r\nOur
third contribution is the formalization and algorithmic treatment of the Quantitative
Interprocedural Analysis framework.\r\nIn this framework, the transitions of a
recursive program are annotated as good, bad or neutral, and receive a weight
which measures\r\nthe magnitude of their respective effect.\r\nThe Quantitative
Interprocedural Analysis problem asks to determine whether there exists an infinite
run of the program where the long-run ratio of the bad weights over the good weights
is above a given threshold.\r\nWe illustrate how several quantitative problems
related to static analysis of recursive programs can be instantiated in this framework,\r\nand
present some case studies to this direction.\r\n\r\n\r\nOur fourth contribution
is a new dynamic partial-order reduction for the stateless model checking of concurrent
programs. Traditional approaches rely on the standard Mazurkiewicz equivalence
between traces, by means of partitioning the trace space into equivalence classes,
and attempting to explore a few representatives from each class.\r\nWe present
a new dynamic partial-order reduction method called the Data-centric Partial
Order Reduction (DC-DPOR).\r\nOur algorithm is based on a new equivalence between
traces, called the observation equivalence.\r\nDC-DPOR explores a coarser partitioning
of the trace space than any exploration method based on the standard Mazurkiewicz
equivalence.\r\nDepending on the program, the new partitioning can be even exponentially
coarser.\r\nAdditionally, DC-DPOR spends only polynomial time in each explored
class.\r\n\r\n\r\nOur fifth contribution is the use of automata and game-theoretic
verification techniques in the competitive analysis and synthesis of real-time
scheduling algorithms for firm-deadline tasks.\r\nOn the analysis side, we leverage
automata on infinite words to compute the competitive ratio of real-time schedulers
subject to various environmental constraints.\r\nOn the synthesis side, we introduce
a new instance of two-player mean-payoff partial-information games, and show\r\nhow
the synthesis of an optimal real-time scheduler can be reduced to computing winning
strategies in this new type of games."
acknowledgement: "First, I am thankful to my advisor, Krishnendu Chatterjee, for offering
me the opportunity to\r\nmaterialize my scientific curiosity in a remarkably wide
range of interesting topics, as well as for his constant availability and continuous
support throughout my doctoral studies. I have had the privilege of collaborating
with, discussing and getting inspired by all members of my committee: Thomas A.
Henzinger, Ulrich Schmid and Martin A. Nowak. The role of the above four people
has been very instrumental both to the research carried out for this dissertation,
and to the researcher I evolved to in the process.\r\nI have greatly enjoyed my
numerous brainstorming sessions with Rasmus Ibsen-Jensen, many\r\nof which led to
results on low-treewidth graphs presented here. I thank Alex Kößler for our\r\ndiscussions
on modeling and analyzing real-time scheduling algorithms, Yaron Velner for our\r\ncollaboration
on the Quantitative Interprocedural Analysis framework, and Nishant Sinha for our
initial discussions on partial order reduction techniques in stateless model checking.
I also thank Jan Otop, Ben Adlam, Bernhard Kragl and Josef Tkadlec for our fruitful
collaborations on\r\ntopics outside the scope of this dissertation, as well as the
interns Prateesh Goyal, Amir Kafshdar Goharshady, Samarth Mishra, Bhavya Choudhary
and Marek Chalupa, with whom I have shared my excitement on various research topics.
Together with my collaborators, I thank officemates and members of the Chatterjee
and Henzinger groups throughout the years, Thorsten Tarrach, Ventsi Chonev, Roopsha
Samanta, Przemek Daca, Mirco Giacobbe, Tanja Petrov, Ashutosh\r\nGupta, Arjun Radhakrishna,
\ Petr Novontý, Christian Hilbe, Jakob Ruess, Martin Chmelik,\r\nCezara Dragoi,
Johannes Reiter, Andrey Kupriyanov, Guy Avni, Sasha Rubin, Jessica Davies, Hongfei
Fu, Thomas Ferrère, Pavol Cerný, Ali Sezgin, Jan Kretínský, Sergiy Bogomolov, Hui\r\nKong,
Benjamin Aminof, Duc-Hiep Chu, and Damien Zufferey. Besides collaborations and
office spaces, with many of the above people I have been fortunate to share numerous
whiteboard\r\ndiscussions, as well as memorable long walks and amicable meals accompanied
by stimulating\r\nconversations. I am highly indebted to Elisabeth Hacker for her
continuous assistance in matters\r\nthat often exceeded her official duties, and
who made my integration in Austria a smooth process."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Pavlogiannis A. Algorithmic advances in program analysis and their applications.
2017. doi:10.15479/AT:ISTA:th_854
apa: Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their
applications. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_854
chicago: Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their
Applications.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_854.
ieee: A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,”
Institute of Science and Technology Austria, 2017.
ista: Pavlogiannis A. 2017. Algorithmic advances in program analysis and their applications.
Institute of Science and Technology Austria.
mla: Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their
Applications. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_854.
short: A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications,
Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2023-09-07T12:01:59Z
day: '09'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrCh
doi: 10.15479/AT:ISTA:th_854
ec_funded: 1
file:
- access_level: open_access
checksum: 3a3ec003f6ee73f41f82a544d63dfc77
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:44Z
date_updated: 2020-07-14T12:48:10Z
file_id: '4900'
file_name: IST-2017-854-v1+1_Pavlogiannis_Thesis_PubRep.pdf
file_size: 4103115
relation: main_file
- access_level: closed
checksum: bd2facc45ff8a2e20c5ed313c2ccaa83
content_type: application/zip
creator: dernst
date_created: 2019-04-05T07:59:31Z
date_updated: 2020-07-14T12:48:10Z
file_id: '6201'
file_name: 2017_thesis_Pavlogiannis.zip
file_size: 14744374
relation: source_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '418'
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6828'
pubrep_id: '854'
related_material:
record:
- id: '1071'
relation: part_of_dissertation
status: public
- id: '1437'
relation: part_of_dissertation
status: public
- id: '1602'
relation: part_of_dissertation
status: public
- id: '1604'
relation: part_of_dissertation
status: public
- id: '1607'
relation: part_of_dissertation
status: public
- id: '1714'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Algorithmic advances in program analysis and their applications
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '820'
abstract:
- lang: eng
text: "The lac operon is a classic model system for bacterial gene regulation, and
has been studied extensively in E. coli, a classic model organism. However, not
much is known about E. coli’s ecology and life outside the laboratory, in particular
in soil and water environments. The natural diversity of the lac operon outside
the laboratory, its role in the ecology of E. coli and the selection pressures
it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore
the genetic diversity, phylogenetic history and signatures of selection of the
lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia.
I found that complete lac operons were present in all isolates examined, which
in all but one case were functional. The lac operon phylogeny conformed to the
whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal
gene transfer as an explanation for the presence of functional lac operons in
these clades. All lac operon genes showed a signature of purifying selection;
this signature was strongest for the lacY gene. Lac operon genes of human and
environmental isolates showed similar signatures of selection, except the lacZ
gene, which showed a stronger signature of selection in environmental isolates.\r\nIn
Chapter Three, I try to identify the natural genetic variation relevant for phenotype
and fitness in the lac operon, comparing growth rate on lactose and LacZ activity
of the lac operons of these wild isolates in a common genetic background. Sequence
variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase
binding motif, predicted variation in LacZ activity at full induction, using a
thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation
in LacZ activity, nor RNA polymerase binding predicted by the model correlated
with variation in growth rate. Lac operons of human and environmental isolates
did not differ systematically in either growth rate on lactose or LacZ protein
activity, suggesting that these lac operons have been exposed to similar selection
pressures. We thus have no evidence that the phenotypic variation we measured
is relevant for fitness.\r\nTo start assessing the effect of genomic background
on the growth phenotype conferred by the lac operon, I compared growth on minimal
medium with lactose between lac operon constructs and the corresponding original
isolates, I found that maximal growth rate was determined by genomic background,
with almost all backgrounds conferring higher growth rates than lab strain K12
MG1655. However, I found no evidence that the lactose concentration at which growth
was half maximal depended on genomic background."
acknowledgement: "ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon
Bollback for giving me the chance to do this work, for sharing the ideas that lay
at the basis of this work, for his honesty and openness, showing himself to me as
a person and not just as a boss. Thanks to Nick Barton for his guidance at the last
stage, reading and commenting extensively on several versions of this manuscript,
and for his encouragement; thanks to both Jon and Nick for their kindness and patience.
Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be
in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter
my thesis committee at the last moment, and for his very sharp, helpful and relevant
comments during and after the defense. Thanks to my collaborators and discussion
partners: Anne Kupczok, for her guidance, ideas and discussions during the construction
of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh
for making me aware of the issue of parameter identifiability, suggesting how to
solve it, and for his unfortunate idea to start the plasmid enterprise in the first
place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments
on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting,
fast forwarding the analysis to turbo speed and making beautiful figures, and making
the discussion fun on top of it all; Vanessa Barone for her last minute comments,
especially on Chapter Three, providing a sharp and very helpful experimentalist
perspective at the last moment; Maros Pleska and Marjon de Vos for their comments
on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation
between growth rate and lactose concentration; Bor Kavcic for his input on growth
rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton,
Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific
environment to work in, as well as a lot of warmth and colour to everyday life.
And thanks to the friends I found here, to the people who were there for me and
to the people who changed my life, making it stranger and more beautiful than I
could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof,
Karin, Irene, Misha, Mato, Guillaume and Zanin. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Fabienne
full_name: Jesse, Fabienne
id: 4C8C26A4-F248-11E8-B48F-1D18A9856A87
last_name: Jesse
citation:
ama: Jesse F. The lac operon in the wild. 2017. doi:10.15479/AT:ISTA:th_857
apa: Jesse, F. (2017). The lac operon in the wild. Institute of Science and
Technology Austria. https://doi.org/10.15479/AT:ISTA:th_857
chicago: Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and
Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_857.
ieee: F. Jesse, “The lac operon in the wild,” Institute of Science and Technology
Austria, 2017.
ista: Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology
Austria.
mla: Jesse, Fabienne. The Lac Operon in the Wild. Institute of Science and
Technology Austria, 2017, doi:10.15479/AT:ISTA:th_857.
short: F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology
Austria, 2017.
date_created: 2018-12-11T11:48:41Z
date_published: 2017-08-25T00:00:00Z
date_updated: 2023-09-07T12:01:21Z
day: '25'
ddc:
- '576'
- '577'
- '579'
degree_awarded: PhD
department:
- _id: JoBo
doi: 10.15479/AT:ISTA:th_857
ec_funded: 1
file:
- access_level: open_access
checksum: c62257a7bff0c5f39e1abffc6bfcca5c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:00Z
date_updated: 2020-07-14T12:48:10Z
file_id: '5252'
file_name: IST-2017-857-v1+1_thesis_fabienne.pdf
file_size: 3417773
relation: main_file
- access_level: closed
checksum: fc87d7d72fce52824a3ae7dcad0413a8
content_type: application/x-tex
creator: dernst
date_created: 2019-04-05T08:51:59Z
date_updated: 2020-07-14T12:48:10Z
file_id: '6212'
file_name: 2017_thesis_Jesse_source.tex
file_size: 215899
relation: source_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '87'
project:
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6829'
pubrep_id: '857'
status: public
supervisor:
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
title: The lac operon in the wild
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '838'
abstract:
- lang: eng
text: 'In this thesis we discuss the exact security of message authentications codes
HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length
keyed hash function f into a variable input-length function. A practical single-key
variant of NMAC called HMAC is a very popular and widely deployed message authentication
code (MAC). PMAC is a block-cipher based mode of operation, which also happens
to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti
and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF),
and thus also a MAC, under two assumptions. Unfortunately, for many instantiations
of HMAC one of them has been found to be wrong. To restore the provable guarantees
for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC
was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a
pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure
variable input-length PRF. For adversaries making q queries, each of length at
most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves
an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently
best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by
giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one
initially XORs a mask to every message block, where the mask for the i th block
is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is
the i -th codeword of the Gray code. Our attack applies more generally to any
sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As
for NMAC , our first contribution is a simpler and uniform proof: If f is an ε
-secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q
queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length
at most ` blocks each. We also show that this ε + `qδ bound is basically tight
by constructing an f for which an attack with advantage `qδ exists. Moreover,
we analyze the PRF-security of a modification of NMAC called NI by An and Bellare
that avoids the constant rekeying on multi-block messages in NMAC and allows for
an information-theoretic analysis. We carry out such an analysis, obtaining a
tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2
q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved
by using τ i ’s that are k -wise independent, for k > 1 (the original has k
= 1). We observe that the security of PMAC will not increase in general if k =
2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4.
Due to simple extension attacks, this is the best bound one can hope for, using
any distribution on the masks. Whether k = 3 is already sufficient to get this
level of security is left as an open problem. Keywords: Message authentication
codes, Pseudorandom functions, HMAC, PMAC. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: Rybar M. (The exact security of) Message authentication codes. 2017. doi:10.15479/AT:ISTA:th_828
apa: Rybar, M. (2017). (The exact security of) Message authentication codes.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_828
chicago: Rybar, Michal. “(The Exact Security of) Message Authentication Codes.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828.
ieee: M. Rybar, “(The exact security of) Message authentication codes,” Institute
of Science and Technology Austria, 2017.
ista: Rybar M. 2017. (The exact security of) Message authentication codes. Institute
of Science and Technology Austria.
mla: Rybar, Michal. (The Exact Security of) Message Authentication Codes.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.
short: M. Rybar, (The Exact Security of) Message Authentication Codes, Institute
of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-06-26T00:00:00Z
date_updated: 2023-09-07T12:02:28Z
day: '26'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:th_828
file:
- access_level: open_access
checksum: ff8639ec4bded6186f44c7bd3ee26804
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:13Z
date_updated: 2020-07-14T12:48:12Z
file_id: '4799'
file_name: IST-2017-828-v1+3_2017_Rybar_thesis.pdf
file_size: 847400
relation: main_file
- access_level: closed
checksum: 3462101745ce8ad199c2d0f75dae4a7e
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:24:11Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6202'
file_name: 2017_Thesis_Rybar_source.zip
file_size: 26054879
relation: source_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6810'
pubrep_id: '828'
related_material:
record:
- id: '2082'
relation: part_of_dissertation
status: public
- id: '6196'
relation: part_of_dissertation
status: public
status: public
title: (The exact security of) Message authentication codes
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '6196'
abstract:
- lang: eng
text: PMAC is a simple and parallel block-cipher mode of operation, which was introduced
by Black and Rogaway at Eurocrypt 2002. If instantiated with a (pseudo)random
permutation over n-bit strings, PMAC constitutes a provably secure variable input-length
(pseudo)random function. For adversaries making q queries, each of length at most
l (in n-bit blocks), and of total length σ ≤ ql, the original paper proves an
upper bound on the distinguishing advantage of Ο(σ2/2n), while the currently
best bound is Ο (qσ/2n).In this work we show that this bound is tight by giving
an attack with advantage Ω (q2l/2n). In the PMAC construction one initially XORs
a mask to every message block, where the mask for the ith block is computed as
τi := γi·L, where L is a (secret) random value, and γi is the i-th codeword of
the Gray code. Our attack applies more generally to any sequence of γi’s which
contains a large coset of a subgroup of GF(2n). We then investigate if the security
of PMAC can be further improved by using τi’s that are k-wise independent, for
k > 1 (the original distribution is only 1-wise independent). We observe that
the security of PMAC will not increase in general, even if the masks are chosen
from a 2-wise independent distribution, and then prove that the security increases
to O(q<2/2n), if the τi are 4-wise independent. Due to simple extension attacks,
this is the best bound one can hope for, using any distribution on the masks.
Whether 3-wise independence is already sufficient to get this level of security
is left as an open problem.
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: Gazi P, Pietrzak KZ, Rybar M. The exact security of PMAC. IACR Transactions
on Symmetric Cryptology. 2017;2016(2):145-161. doi:10.13154/TOSC.V2016.I2.145-161
apa: Gazi, P., Pietrzak, K. Z., & Rybar, M. (2017). The exact security of PMAC.
IACR Transactions on Symmetric Cryptology. Ruhr University Bochum. https://doi.org/10.13154/TOSC.V2016.I2.145-161
chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security
of PMAC.” IACR Transactions on Symmetric Cryptology. Ruhr University Bochum,
2017. https://doi.org/10.13154/TOSC.V2016.I2.145-161.
ieee: P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR
Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum,
pp. 145–161, 2017.
ista: Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions
on Symmetric Cryptology. 2016(2), 145–161.
mla: Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric
Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.
short: P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology
2016 (2017) 145–161.
date_created: 2019-04-04T13:48:23Z
date_published: 2017-02-03T00:00:00Z
date_updated: 2023-09-07T12:02:27Z
day: '03'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.13154/TOSC.V2016.I2.145-161
ec_funded: 1
file:
- access_level: open_access
checksum: f23161d685dd957ae8d7274132999684
content_type: application/pdf
creator: dernst
date_created: 2019-04-04T13:53:58Z
date_updated: 2020-07-14T12:47:24Z
file_id: '6197'
file_name: 2017_IACR_Gazi.pdf
file_size: 597335
relation: main_file
file_date_updated: 2020-07-14T12:47:24Z
has_accepted_license: '1'
intvolume: ' 2016'
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 145-161
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: IACR Transactions on Symmetric Cryptology
publication_identifier:
eissn:
- 2519-173X
publication_status: published
publisher: Ruhr University Bochum
quality_controlled: '1'
related_material:
record:
- id: '838'
relation: dissertation_contains
status: public
status: public
title: The exact security of PMAC
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2016
year: '2017'
...
---
_id: '837'
abstract:
- lang: eng
text: 'The hippocampus is a key brain region for memory and notably for spatial
memory, and is needed for both spatial working and reference memories. Hippocampal
place cells selectively discharge in specific locations of the environment to
form mnemonic represen tations of space. Several behavioral protocols have been
designed to test spatial memory which requires the experimental subject to utilize
working memory and reference memory. However, less is known about how these memory
traces are presented in the hippo campus, especially considering tasks that require
both spatial working and long -term reference memory demand. The aim of my thesis
was to elucidate how spatial working memory, reference memory, and the combination
of both are represented in the hippocampus. In this thesis, using a radial eight
-arm maze, I examined how the combined demand on these memories influenced place
cell assemblies while reference memories were partially updated by changing some
of the reward- arms. This was contrasted with task varian ts requiring working
or reference memories only. Reference memory update led to gradual place field
shifts towards the rewards on the switched arms. Cells developed enhanced firing
in passes between newly -rewarded arms as compared to those containing an unchanged
reward. The working memory task did not show such gradual changes. Place assemblies
on occasions replayed trajectories of the maze; at decision points the next arm
choice was preferentially replayed in tasks needing reference memory while in
the pure working memory task the previously visited arm was replayed. Hence trajectory
replay only reflected the decision of the animal in tasks needing reference memory
update. At the reward locations, in all three tasks outbound trajectories of the
current arm were preferentially replayed, showing the animals’ next path to the
center. At reward locations trajectories were replayed preferentially in reverse
temporal order. Moreover, in the center reverse replay was seen in the working
memory task but in the other tasks forward replay was seen. Hence, the direction
of reactivation was determined by the goal locations so that part of the trajectory
which was closer to the goal was reactivated later in an HSE while places further
away from the goal were reactivated earlier. Altogether my work demonstrated that
reference memory update triggers several levels of reorganization of the hippocampal
cognitive map which are not seen in simpler working memory demand s. Moreover,
hippocampus is likely to be involved in spatial decisions through reactivating
planned trajectories when reference memory recall is required for such a decision. '
acknowledgement: 'I am very grateful for the opportunity I have had as a graduate
student to explore and incredibly interesting branch of neuroscience, and for the
people who made it possible. Firstly, I would like to offer my thanks to my supervisor
Professor Jozsef Csicsvari for his great support, guidance and patience offered
over the years. The door to his office was always open whenever I had questions.
I have learned a lot from him about carefully designing experiments, asking interesting
questions and how to integrate results into a broader picture. I also express my
gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific
role model who is always willing to teach , and advice and talk through problems
with his full attention. Many thanks to my wonderful “office mates” over the years
and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree
Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián
Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in
the lab for the many useful discussions about science and for making the laboratory
such a nice and friendly place to work in. A special thank goes to Michael LoBianco
and Jago Wallenschus for wonderful technical support. I would also like to thank
Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam
and thesi s committee members despite their busy schedule. I am also very thankful
to IST Austria for their support all throughout my PhD. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Haibing
full_name: Xu, Haibing
id: 310349D0-F248-11E8-B48F-1D18A9856A87
last_name: Xu
citation:
ama: Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial
tasks. 2017. doi:10.15479/AT:ISTA:th_858
apa: Xu, H. (2017). Reactivation of the hippocampal cognitive map in goal-directed
spatial tasks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_858
chicago: Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed
Spatial Tasks.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_858.
ieee: H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial
tasks,” Institute of Science and Technology Austria, 2017.
ista: Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed
spatial tasks. Institute of Science and Technology Austria.
mla: Xu, Haibing. Reactivation of the Hippocampal Cognitive Map in Goal-Directed
Spatial Tasks. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_858.
short: H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial
Tasks, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-08-23T00:00:00Z
date_updated: 2023-09-07T12:06:38Z
day: '23'
ddc:
- '571'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:th_858
file:
- access_level: closed
checksum: f11925fbbce31e495124b6bc4f10573c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:59:51Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6213'
file_name: 2017_Xu_Haibing_Thesis_Source.docx
file_size: 3589490
relation: source_file
- access_level: open_access
checksum: ffb10749a537d615fab1ef0937ccb157
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T08:59:51Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6214'
file_name: 2017_Xu_Thesis_IST.pdf
file_size: 11668613
relation: main_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '93'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6811'
pubrep_id: '858'
related_material:
record:
- id: '5828'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: Reactivation of the hippocampal cognitive map in goal-directed spatial tasks
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '938'
abstract:
- lang: eng
text: The thesis encompasses several topics of plant cell biology which were studied
in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone
auxin and its polar transport through cells and tissues. The highly controlled,
directional transport of auxin is facilitated by plasma membrane-localized transporters.
Transporters from the PIN family direct auxin transport due to their polarized
localizations at cell membranes. Substantial effort has been put into research
on cellular trafficking of PIN proteins, which is thought to underlie their polar
distribution. I participated in a forward genetic screen aimed at identifying
novel regulators of PIN polarity. The screen yielded several genes which may be
involved in PIN polarity regulation or participate in polar auxin transport by
other means. Chapter 2 focuses on the endomembrane system, with particular attention
to clathrin-mediated endocytosis. The project started with identification of several
proteins that interact with clathrin light chains. Among them, I focused on two
putative homologues of auxilin, which in non-plant systems is an endocytotic factor
known for uncoating clathrin-coated vesicles in the final step of endocytosis.
The body of my work consisted of an in-depth characterization of transgenic A.
thaliana lines overexpressing these putative auxilins in an inducible manner.
Overexpression of these proteins leads to an inhibition of endocytosis, as documented
by imaging of cargoes and clathrin-related endocytic machinery. An extension of
this work is an investigation into a concept of homeostatic regulation acting
between distinct transport processes in the endomembrane system. With auxilin
overexpressing lines, where endocytosis is blocked specifically, I made observations
on the mutual relationship between two opposite trafficking processes of secretion
and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their
relationship to auxin signaling and polarized growth in elongating cells. In plants,
microtubules are organized into arrays just below the plasma membrane, and it
is thought that their function is to guide membrane-docked cellulose synthase
complexes. These, in turn, influence cell wall structure and cell shape by directed
deposition of cellulose fibres. In elongating cells, cortical microtubule arrays
are able to reorient in relation to long cell axis, and these reorientations have
been linked to cell growth and to signaling of growth-regulating factors such
as auxin or light. In this chapter, I am addressing the causal relationship between
microtubule array reorientation, growth, and auxin signaling. I arrive at a model
where array reorientation is not guided by auxin directly, but instead is only
controlled by growth, which, in turn, is regulated by auxin.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
citation:
ama: Adamowski M. Investigations into cell polarity and trafficking in the plant
model Arabidopsis thaliana . 2017. doi:10.15479/AT:ISTA:th_842
apa: Adamowski, M. (2017). Investigations into cell polarity and trafficking
in the plant model Arabidopsis thaliana . Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:th_842
chicago: Adamowski, Maciek. “Investigations into Cell Polarity and Trafficking in
the Plant Model Arabidopsis Thaliana .” Institute of Science and Technology Austria,
2017. https://doi.org/10.15479/AT:ISTA:th_842.
ieee: M. Adamowski, “Investigations into cell polarity and trafficking in the plant
model Arabidopsis thaliana ,” Institute of Science and Technology Austria, 2017.
ista: Adamowski M. 2017. Investigations into cell polarity and trafficking in the
plant model Arabidopsis thaliana . Institute of Science and Technology Austria.
mla: Adamowski, Maciek. Investigations into Cell Polarity and Trafficking in
the Plant Model Arabidopsis Thaliana . Institute of Science and Technology
Austria, 2017, doi:10.15479/AT:ISTA:th_842.
short: M. Adamowski, Investigations into Cell Polarity and Trafficking in the Plant
Model Arabidopsis Thaliana , Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:49:18Z
date_published: 2017-06-02T00:00:00Z
date_updated: 2023-09-07T12:06:09Z
day: '02'
ddc:
- '581'
- '583'
- '580'
degree_awarded: PhD
department:
- _id: JiFr
doi: 10.15479/AT:ISTA:th_842
file:
- access_level: closed
checksum: 193425764d9aaaed3ac57062a867b315
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:03:20Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6215'
file_name: 2017_Adamowski-Thesis_Source.docx
file_size: 46903863
relation: source_file
- access_level: open_access
checksum: df5ab01be81f821e1b958596a1ec8d21
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:03:19Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6216'
file_name: 2017_Adamowski-Thesis.pdf
file_size: 8698888
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '117'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6483'
pubrep_id: '842'
related_material:
record:
- id: '1591'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: 'Investigations into cell polarity and trafficking in the plant model Arabidopsis
thaliana '
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '992'
abstract:
- lang: eng
text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
set of\r\nvariables, a finite domain of labels, and a set of constraints, each
constraint acting on\r\na subset of the variables. The goal is to find an assignment
of labels to its variables\r\nthat satisfies all constraints (or decide whether
one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
infinite) costs of particular assignments,\r\nwe obtain instances from a richer
class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
(assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
complexity classification modulo (missing pieces of) complexity classification
for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
(again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
apa: Rolinek, M. (2017). Complexity of constraint satisfaction. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
and Technology Austria, 2017.
ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
and Technology Austria.
mla: Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.
short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
Technology Austria, 2017.
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2023-09-07T12:05:41Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
checksum: 81761fb939acb7585c36629f765b4373
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:55Z
date_updated: 2020-07-14T12:48:18Z
file_id: '4654'
file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
file_size: 786145
relation: main_file
- access_level: closed
checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:43:24Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6208'
file_name: 2017_Thesis_Rolinek_source.zip
file_size: 5936337
relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '718'
abstract:
- lang: eng
text: Mapping every simplex in the Delaunay mosaic of a discrete point set to the
radius of the smallest empty circumsphere gives a generalized discrete Morse function.
Choosing the points from a Poisson point process in ℝ n , we study the expected
number of simplices in the Delaunay mosaic as well as the expected number of critical
simplices and nonsingular intervals in the corresponding generalized discrete
gradient. Observing connections with other probabilistic models, we obtain precise
expressions for the expected numbers in low dimensions. In particular, we obtain
the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions
n ≤ 4.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
- first_name: Matthias
full_name: Reitzner, Matthias
last_name: Reitzner
citation:
ama: Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay
mosaics and their discrete Morse functions. Advances in Applied Probability.
2017;49(3):745-767. doi:10.1017/apr.2017.20
apa: Edelsbrunner, H., Nikitenko, A., & Reitzner, M. (2017). Expected sizes
of poisson Delaunay mosaics and their discrete Morse functions. Advances in
Applied Probability. Cambridge University Press. https://doi.org/10.1017/apr.2017.20
chicago: Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected
Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances
in Applied Probability. Cambridge University Press, 2017. https://doi.org/10.1017/apr.2017.20.
ieee: H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson
Delaunay mosaics and their discrete Morse functions,” Advances in Applied Probability,
vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017.
ista: Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay
mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3),
745–767.
mla: Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and
Their Discrete Morse Functions.” Advances in Applied Probability, vol.
49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:10.1017/apr.2017.20.
short: H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability
49 (2017) 745–767.
date_created: 2018-12-11T11:48:07Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-07T12:07:12Z
day: '01'
department:
- _id: HeEd
doi: 10.1017/apr.2017.20
ec_funded: 1
external_id:
arxiv:
- '1607.05915'
intvolume: ' 49'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1607.05915
month: '09'
oa: 1
oa_version: Preprint
page: 745 - 767
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Advances in Applied Probability
publication_identifier:
issn:
- '00018678'
publication_status: published
publisher: Cambridge University Press
publist_id: '6962'
quality_controlled: '1'
related_material:
record:
- id: '6287'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Expected sizes of poisson Delaunay mosaics and their discrete Morse functions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2017'
...
---
_id: '559'
abstract:
- lang: eng
text: 'Proofs of space (PoS) were suggested as more ecological and economical alternative
to proofs of work, which are currently used in blockchain designs like Bitcoin.
The existing PoS are based on rather sophisticated graph pebbling lower bounds.
Much simpler and in several aspects more efficient schemes based on inverting
random functions have been suggested, but they don’t give meaningful security
guarantees due to existing time-memory trade-offs. In particular, Hellman showed
that any permutation over a domain of size N can be inverted in time T by an algorithm
that is given S bits of auxiliary information whenever (Formula presented). For
functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To
prove lower bounds, one considers an adversary who has access to an oracle f:
[ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈
Ω(N) and holds for random functions and permutations. We construct functions that
provably require more time and/or space to invert. Specifically, for any constant
k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk)
(in particular, S= T≈ (Formula presented). Our construction does not contradict
Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in
forward direction. However, its entire function table can be computed in time
quasilinear in N, which is sufficient for the PoS application. Our simplest construction
is built from a random function oracle g: [N] × [N] → [ N] and a random permutation
oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with
π being any involution without a fixed point, e.g. flipping all the bits. For
this function we prove that any adversary who gets S bits of auxiliary information,
makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must
satisfy S2· T∈ Ω(ϵ2N2).'
alternative_title:
- LNCS
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Bram
full_name: Cohen, Bram
last_name: Cohen
- first_name: Danylo
full_name: Khilko, Danylo
last_name: Khilko
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Leonid
full_name: Reyzin, Leonid
last_name: Reyzin
citation:
ama: 'Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s
time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer;
2017:357-379. doi:10.1007/978-3-319-70697-9_13'
apa: 'Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &
Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to
proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory
and Applications of Cryptology and Information Security, Hong Kong, China: Springer.
https://doi.org/10.1007/978-3-319-70697-9_13'
chicago: Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z
Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications
to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.
ieee: 'H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L.
Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of
space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and
Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.'
ista: 'Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond
Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT:
Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625,
357–379.'
mla: Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with
Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.
short: H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin,
in:, Springer, 2017, pp. 357–379.
conference:
end_date: 2017-12-07
location: Hong Kong, China
name: 'ASIACRYPT: Theory and Applications of Cryptology and Information Security'
start_date: 2017-12-03
date_created: 2018-12-11T11:47:10Z
date_published: 2017-11-18T00:00:00Z
date_updated: 2023-09-07T12:30:22Z
day: '18'
department:
- _id: KrPi
doi: 10.1007/978-3-319-70697-9_13
ec_funded: 1
intvolume: ' 10625'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/893.pdf
month: '11'
oa: 1
oa_version: Submitted Version
page: 357 - 379
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331970696-2
publication_status: published
publisher: Springer
publist_id: '7257'
quality_controlled: '1'
related_material:
record:
- id: '83'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Beyond Hellman’s time-memory trade-offs with applications to proofs of space
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10625
year: '2017'
...
---
_id: '550'
abstract:
- lang: eng
text: For large random matrices X with independent, centered entries but not necessarily
identical variances, the eigenvalue density of XX* is well-approximated by a deterministic
measure on ℝ. We show that the density of this measure has only square and cubic-root
singularities away from zero. We also extend the bulk local law in [5] to the
vicinity of these singularities.
article_number: '63'
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
citation:
ama: Alt J. Singularities of the density of states of random Gram matrices. Electronic
Communications in Probability. 2017;22. doi:10.1214/17-ECP97
apa: Alt, J. (2017). Singularities of the density of states of random Gram matrices.
Electronic Communications in Probability. Institute of Mathematical Statistics.
https://doi.org/10.1214/17-ECP97
chicago: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.”
Electronic Communications in Probability. Institute of Mathematical Statistics,
2017. https://doi.org/10.1214/17-ECP97.
ieee: J. Alt, “Singularities of the density of states of random Gram matrices,”
Electronic Communications in Probability, vol. 22. Institute of Mathematical
Statistics, 2017.
ista: Alt J. 2017. Singularities of the density of states of random Gram matrices.
Electronic Communications in Probability. 22, 63.
mla: Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.”
Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical
Statistics, 2017, doi:10.1214/17-ECP97.
short: J. Alt, Electronic Communications in Probability 22 (2017).
date_created: 2018-12-11T11:47:07Z
date_published: 2017-11-21T00:00:00Z
date_updated: 2023-09-07T12:38:08Z
day: '21'
ddc:
- '539'
department:
- _id: LaEr
doi: 10.1214/17-ECP97
ec_funded: 1
file:
- access_level: open_access
checksum: 0ec05303a0de190de145654237984c79
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:04Z
date_updated: 2020-07-14T12:47:00Z
file_id: '4663'
file_name: IST-2018-926-v1+1_euclid.ecp.1511233247.pdf
file_size: 470876
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
intvolume: ' 22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Communications in Probability
publication_identifier:
issn:
- 1083589X
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '7265'
pubrep_id: '926'
quality_controlled: '1'
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Singularities of the density of states of random Gram matrices
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: 22
year: '2017'
...
---
_id: '647'
abstract:
- lang: eng
text: Despite researchers’ efforts in the last couple of decades, reachability analysis
is still a challenging problem even for linear hybrid systems. Among the existing
approaches, the most practical ones are mainly based on bounded-time reachable
set over-approximations. For the purpose of unbounded-time analysis, one important
strategy is to abstract the original system and find an invariant for the abstraction.
In this paper, we propose an approach to constructing a new kind of abstraction
called conic abstraction for affine hybrid systems, and to computing reachable
sets based on this abstraction. The essential feature of a conic abstraction is
that it partitions the state space of a system into a set of convex polyhedral
cones which is derived from a uniform conic partition of the derivative space.
Such a set of polyhedral cones is able to cut all trajectories of the system into
almost straight segments so that every segment of a reach pipe in a polyhedral
cone tends to be straight as well, and hence can be over-approximated tightly
by polyhedra using similar techniques as HyTech or PHAVer. In particular, for
diagonalizable affine systems, our approach can guarantee to find an invariant
for unbounded reachable sets, which is beyond the capability of bounded-time reachability
analysis tools. We implemented the approach in a tool and experiments on benchmarks
show that our approach is more powerful than SpaceEx and PHAVer in dealing with
diagonalizable systems.
alternative_title:
- LNCS
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- 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: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
citation:
ama: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid
systems. In: Vol 10419. Springer; 2017:116-132. doi:10.1007/978-3-319-65765-3_7'
apa: 'Bogomolov, S., Giacobbe, M., Henzinger, T. A., & Kong, H. (2017). Conic
abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS:
Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_7'
chicago: Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic
Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_7.
ieee: 'S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions
for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of
Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.'
ista: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for
hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS,
vol. 10419, 116–132.'
mla: Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol.
10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.
short: S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017,
pp. 116–132.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
start_date: 2017-09-05
date_created: 2018-12-11T11:47:41Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-07T12:53:00Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_7
file:
- access_level: open_access
checksum: faf546914ba29bcf9974ee36b6b16750
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:38Z
date_updated: 2020-07-14T12:47:31Z
file_id: '4956'
file_name: IST-2017-831-v1+1_main.pdf
file_size: 3806864
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 116 - 132
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7129'
pubrep_id: '831'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Conic abstractions for hybrid systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: '10419 '
year: '2017'
...
---
_id: '631'
abstract:
- lang: eng
text: Template polyhedra generalize intervals and octagons to polyhedra whose facets
are orthogonal to a given set of arbitrary directions. They have been employed
in the abstract interpretation of programs and, with particular success, in the
reachability analysis of hybrid automata. While previously, the choice of directions
has been left to the user or a heuristic, we present a method for the automatic
discovery of directions that generalize and eliminate spurious counterexamples.
We show that for the class of convex hybrid automata, i.e., hybrid automata with
(possibly nonlinear) convex constraints on derivatives, such directions always
exist and can be found using convex optimization. We embed our method inside a
CEGAR loop, thus enabling the time-unbounded reachability analysis of an important
and richer class of hybrid automata than was previously possible. We evaluate
our method on several benchmarks, demonstrating also its superior efficiency for
the special case of linear hybrid automata.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by
the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project
DP140104219 (Robust AI Planning for Hybrid Systems).
alternative_title:
- LNCS
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement
of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:10.1007/978-3-662-54577-5_34'
apa: 'Bogomolov, S., Frehse, G., Giacobbe, M., & Henzinger, T. A. (2017). Counterexample
guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at
the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_34'
chicago: Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger.
“Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer,
2017. https://doi.org/10.1007/978-3-662-54577-5_34.
ieee: 'S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample
guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205,
pp. 589–606.'
ista: 'Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided
refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, LNCS, vol. 10205, 589–606.'
mla: Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra.
Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34.
short: S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017,
pp. 589–606.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
date_created: 2018-12-11T11:47:36Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2023-09-07T12:53:00Z
day: '31'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-662-54577-5_34
file:
- access_level: open_access
checksum: f395d0d20102b89aeaad8b4ef4f18f4f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:41Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4897'
file_name: IST-2017-741-v1+1_main.pdf
file_size: 569863
relation: main_file
- access_level: open_access
checksum: f416ee1ae4497b23ecdf28b1f18bb8df
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:42Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4898'
file_name: IST-2018-741-v2+2_main.pdf
file_size: 563276
relation: main_file
file_date_updated: 2020-07-14T12:47:27Z
has_accepted_license: '1'
intvolume: ' 10205'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 589 - 606
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- 978-366254576-8
publication_status: published
publisher: Springer
publist_id: '7162'
pubrep_id: '966'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Counterexample guided refinement of template polyhedra
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10205
year: '2017'
...
---
_id: '1144'
abstract:
- lang: eng
text: We show that matrix elements of functions of N × N Wigner matrices fluctuate
on a scale of order N−1/2 and we identify the limiting fluctuation. Our result
holds for any function f of the matrix that has bounded variation thus considerably
relaxing the regularity requirement imposed in [7, 11].
acknowledgement: Partially supported by the IST Austria Excellence Scholarship.
article_number: '86'
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. Electronic
Communications in Probability. 2017;21. doi:10.1214/16-ECP38
apa: Erdös, L., & Schröder, D. J. (2017). Fluctuations of functions of Wigner
matrices. Electronic Communications in Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/16-ECP38
chicago: Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner
Matrices.” Electronic Communications in Probability. Institute of Mathematical
Statistics, 2017. https://doi.org/10.1214/16-ECP38.
ieee: L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,”
Electronic Communications in Probability, vol. 21. Institute of Mathematical
Statistics, 2017.
ista: Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices.
Electronic Communications in Probability. 21, 86.
mla: Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner
Matrices.” Electronic Communications in Probability, vol. 21, 86, Institute
of Mathematical Statistics, 2017, doi:10.1214/16-ECP38.
short: L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017).
date_created: 2018-12-11T11:50:23Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2023-09-07T12:54:12Z
day: '02'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/16-ECP38
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:10Z
date_updated: 2018-12-12T10:18:10Z
file_id: '5329'
file_name: IST-2017-747-v1+1_euclid.ecp.1483347665.pdf
file_size: 440770
relation: main_file
file_date_updated: 2018-12-12T10:18:10Z
has_accepted_license: '1'
intvolume: ' 21'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '6214'
pubrep_id: '747'
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Fluctuations of functions of Wigner matrices
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: 21
year: '2017'
...
---
_id: '486'
abstract:
- lang: eng
text: Color texture reproduction in 3D printing commonly ignores volumetric light
transport (cross-talk) between surface points on a 3D print. Such light diffusion
leads to significant blur of details and color bleeding, and is particularly severe
for highly translucent resin-based print materials. Given their widely varying
scattering properties, this cross-talk between surface points strongly depends
on the internal structure of the volume surrounding each surface point. Existing
scattering-aware methods use simplified models for light diffusion, and often
accept the visual blur as an immutable property of the print medium. In contrast,
our work counteracts heterogeneous scattering to obtain the impression of a crisp
albedo texture on top of the 3D print, by optimizing for a fully volumetric material
distribution that preserves the target appearance. Our method employs an efficient
numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous
scattering, supported by a practical calibration procedure to obtain scattering
parameters from a given set of printer materials. Despite the inherent translucency
of the medium, we reproduce detailed surface textures on 3D prints. We evaluate
our system using a commercial, five-tone 3D print process and compare against
the printer’s native color texturing mode, demonstrating that our method preserves
high-frequency features well without having to compromise on color gamut.
article_number: '241'
article_processing_charge: No
article_type: original
author:
- first_name: Oskar
full_name: Elek, Oskar
last_name: Elek
- first_name: Denis
full_name: Sumin, Denis
last_name: Sumin
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
- first_name: Tim
full_name: Weyrich, Tim
last_name: Weyrich
- first_name: Karol
full_name: Myszkowski, Karol
last_name: Myszkowski
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Alexander
full_name: Wilkie, Alexander
last_name: Wilkie
- first_name: Jaroslav
full_name: Krivanek, Jaroslav
last_name: Krivanek
citation:
ama: Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for
3D printing. ACM Transactions on Graphics. 2017;36(6). doi:10.1145/3130800.3130890
apa: Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., …
Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. ACM
Transactions on Graphics. ACM. https://doi.org/10.1145/3130800.3130890
chicago: Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd
Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction
for 3D Printing.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3130800.3130890.
ieee: O. Elek et al., “Scattering-aware texture reproduction for 3D printing,”
ACM Transactions on Graphics, vol. 36, no. 6. ACM, 2017.
ista: Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek
J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions
on Graphics. 36(6), 241.
mla: Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.”
ACM Transactions on Graphics, vol. 36, no. 6, 241, ACM, 2017, doi:10.1145/3130800.3130890.
short: O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie,
J. Krivanek, ACM Transactions on Graphics 36 (2017).
date_created: 2018-12-11T11:46:44Z
date_published: 2017-11-20T00:00:00Z
date_updated: 2023-09-07T13:11:15Z
day: '20'
ddc:
- '003'
- '000'
- '005'
department:
- _id: BeBi
doi: 10.1145/3130800.3130890
ec_funded: 1
file:
- access_level: open_access
checksum: 48386fa6956c3645fc89594dc898b147
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:46Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4836'
file_name: IST-2018-1052-v1+1_ElekSumin2017SGA.pdf
file_size: 107349827
relation: main_file
- access_level: open_access
checksum: 21c89c28fb8d70f6602f752bf997aa0f
content_type: application/pdf
creator: bbickel
date_created: 2019-12-16T14:48:57Z
date_updated: 2020-07-14T12:46:35Z
file_id: '7189'
file_name: ElekSumin2017SGA_reduced_file_size.pdf
file_size: 4683145
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- '07300301'
publication_status: published
publisher: ACM
publist_id: '7334'
pubrep_id: '1052'
quality_controlled: '1'
related_material:
record:
- id: '8386'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Scattering-aware texture reproduction for 3D printing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2017'
...
---
_id: '637'
abstract:
- lang: eng
text: For many cryptographic primitives, it is relatively easy to achieve selective
security (where the adversary commits a-priori to some of the choices to be made
later in the attack) but appears difficult to achieve the more natural notion
of adaptive security (where the adversary can make all choices on the go as the
attack progresses). A series of several recent works shows how to cleverly achieve
adaptive security in several such scenarios including generalized selective decryption
(Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer
et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b).
Although the above works expressed vague intuition that they share a common technique,
the connection was never made precise. In this work we present a new framework
that connects all of these works and allows us to present them in a unified and
simplified fashion. Moreover, we use the framework to derive a new result for
adaptively secure secret sharing over access structures defined via monotone circuits.
We envision that further applications will follow in the future. Underlying our
framework is the following simple idea. It is well known that selective security,
where the adversary commits to n-bits of information about his future choices,
automatically implies adaptive security at the cost of amplifying the adversary’s
advantage by a factor of up to 2n. However, in some cases the proof of selective
security proceeds via a sequence of hybrids, where each pair of adjacent hybrids
locally only requires some smaller partial information consisting of m ≪ n bits.
The partial information needed might be completely different between different
pairs of hybrids, and if we look across all the hybrids we might rely on the entire
n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security,
at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n.
In all of our examples using the above framework, the different hybrids are captured
by some sort of a graph pebbling game and the amount of information that the adversary
needs to commit to in each pair of hybrids is bounded by the maximum number of
pebbles in play at any point in time. Therefore, coming up with better strategies
for proving adaptive security translates to various pebbling strategies for different
types of graphs.
alternative_title:
- LNCS
author:
- first_name: Zahra
full_name: Jafargholi, Zahra
last_name: Jafargholi
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Ilan
full_name: Komargodski, Ilan
last_name: Komargodski
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs
D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer;
2017:133-163. doi:10.1007/978-3-319-63688-7_5'
apa: 'Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak,
K. Z., & Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &
H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology,
Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-319-63688-7_5'
chicago: Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski,
Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited
by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.
ieee: 'Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak,
and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology,
Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.'
ista: 'Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs
D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401,
133–163.'
mla: Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by
Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
short: Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak,
D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
conference:
end_date: 2017-07-24
location: Santa Barbara, CA, United States
name: 'CRYPTO: Cryptology'
start_date: 2017-07-20
date_created: 2018-12-11T11:47:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-63688-7_5
ec_funded: 1
editor:
- first_name: Jonathan
full_name: Katz, Jonathan
last_name: Katz
- first_name: Hovav
full_name: Shacham, Hovav
last_name: Shacham
intvolume: ' 10401'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/515
month: '01'
oa: 1
oa_version: Submitted Version
page: 133 - 163
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331963687-0
publication_status: published
publisher: Springer
publist_id: '7151'
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Be adaptive avoid overcommitting
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10401
year: '2017'
...
---
_id: '9842'
abstract:
- lang: eng
text: Mathematica notebooks used to generate figures.
article_processing_charge: No
author:
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- 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: 'Etheridge A, Barton NH. Data for: Establishment in a new habitat by polygenic
adaptation. 2017. doi:10.17632/nw68fxzjpm.1'
apa: 'Etheridge, A., & Barton, N. H. (2017). Data for: Establishment in a new
habitat by polygenic adaptation. Mendeley Data. https://doi.org/10.17632/nw68fxzjpm.1'
chicago: 'Etheridge, Alison, and Nicholas H Barton. “Data for: Establishment in
a New Habitat by Polygenic Adaptation.” Mendeley Data, 2017. https://doi.org/10.17632/nw68fxzjpm.1.'
ieee: 'A. Etheridge and N. H. Barton, “Data for: Establishment in a new habitat
by polygenic adaptation.” Mendeley Data, 2017.'
ista: 'Etheridge A, Barton NH. 2017. Data for: Establishment in a new habitat by
polygenic adaptation, Mendeley Data, 10.17632/nw68fxzjpm.1.'
mla: 'Etheridge, Alison, and Nicholas H. Barton. Data for: Establishment in a
New Habitat by Polygenic Adaptation. Mendeley Data, 2017, doi:10.17632/nw68fxzjpm.1.'
short: A. Etheridge, N.H. Barton, (2017).
date_created: 2021-08-09T13:18:55Z
date_published: 2017-12-29T00:00:00Z
date_updated: 2023-09-11T13:41:21Z
day: '29'
department:
- _id: NiBa
doi: 10.17632/nw68fxzjpm.1
main_file_link:
- open_access: '1'
url: https://doi.org/10.17632/nw68fxzjpm.1
month: '12'
oa: 1
oa_version: Published Version
publisher: Mendeley Data
related_material:
record:
- id: '564'
relation: used_in_publication
status: public
status: public
title: 'Data for: Establishment in a new habitat by polygenic adaptation'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '14206'
abstract:
- lang: eng
text: Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe
(FW) algorithms regained popularity in recent years due to their simplicity, effectiveness
and theoretical guarantees. MP and FW address optimization over the linear span
and the convex hull of a set of atoms, respectively. In this paper, we consider
the intermediate case of optimization over the convex cone, parametrized as the
conic hull of a generic atom set, leading to the first principled definitions
of non-negative MP algorithms for which we give explicit convergence rates and
demonstrate excellent empirical performance. In particular, we derive sublinear
(O(1/t)) convergence on general smooth and convex objectives, and linear convergence
(O(e−t)) on strongly convex objectives, in both cases for general sets of atoms.
Furthermore, we establish a clear correspondence of our algorithms to known algorithms
from the MP and FW literature. Our novel algorithms and analyses target general
atom sets and general objective functions, and hence are directly applicable to
a large variety of learning settings.
article_processing_charge: No
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Michael
full_name: Tschannen, Michael
last_name: Tschannen
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
citation:
ama: 'Locatello F, Tschannen M, Rätsch G, Jaggi M. Greedy algorithms for cone constrained
optimization with convergence guarantees. In: Advances in Neural Information
Processing Systems. ; 2017.'
apa: Locatello, F., Tschannen, M., Rätsch, G., & Jaggi, M. (2017). Greedy algorithms
for cone constrained optimization with convergence guarantees. In Advances
in Neural Information Processing Systems. Long Beach, CA, United States.
chicago: Locatello, Francesco, Michael Tschannen, Gunnar Rätsch, and Martin Jaggi.
“Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees.”
In Advances in Neural Information Processing Systems, 2017.
ieee: F. Locatello, M. Tschannen, G. Rätsch, and M. Jaggi, “Greedy algorithms for
cone constrained optimization with convergence guarantees,” in Advances in
Neural Information Processing Systems, Long Beach, CA, United States, 2017.
ista: 'Locatello F, Tschannen M, Rätsch G, Jaggi M. 2017. Greedy algorithms for
cone constrained optimization with convergence guarantees. Advances in Neural
Information Processing Systems. NeurIPS: Neural Information Processing Systems.'
mla: Locatello, Francesco, et al. “Greedy Algorithms for Cone Constrained Optimization
with Convergence Guarantees.” Advances in Neural Information Processing Systems,
2017.
short: F. Locatello, M. Tschannen, G. Rätsch, M. Jaggi, in:, Advances in Neural
Information Processing Systems, 2017.
conference:
end_date: 2017-12-09
location: Long Beach, CA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2017-12-04
date_created: 2023-08-22T14:17:38Z
date_published: 2017-05-31T00:00:00Z
date_updated: 2023-09-13T08:32:23Z
day: '31'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1705.11041'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.11041
month: '05'
oa: 1
oa_version: Preprint
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781510860964'
publication_status: published
quality_controlled: '1'
status: public
title: Greedy algorithms for cone constrained optimization with convergence guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '14205'
abstract:
- lang: eng
text: Two of the most fundamental prototypes of greedy optimization are the matching
pursuit and Frank-Wolfe algorithms. In this paper, we take a unified view on both
classes of methods, leading to the first explicit convergence rates of matching
pursuit methods in an optimization sense, for general sets of atoms. We derive
sublinear (1/t) convergence for both classes on general smooth objectives, and
linear convergence on strongly convex objectives, as well as a clear correspondence
of algorithm variants. Our presented algorithms and rates are affine invariant,
and do not need any incoherence or sparsity assumptions.
article_processing_charge: No
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Rajiv
full_name: Khanna, Rajiv
last_name: Khanna
- first_name: Michael
full_name: Tschannen, Michael
last_name: Tschannen
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
citation:
ama: 'Locatello F, Khanna R, Tschannen M, Jaggi M. A unified optimization view on
generalized matching pursuit and Frank-Wolfe. In: Proceedings of the 20th International
Conference on Artificial Intelligence and Statistics. Vol 54. ML Research
Press; 2017:860-868.'
apa: 'Locatello, F., Khanna, R., Tschannen, M., & Jaggi, M. (2017). A unified
optimization view on generalized matching pursuit and Frank-Wolfe. In Proceedings
of the 20th International Conference on Artificial Intelligence and Statistics
(Vol. 54, pp. 860–868). Fort Lauderdale, FL, United States: ML Research Press.'
chicago: Locatello, Francesco, Rajiv Khanna, Michael Tschannen, and Martin Jaggi.
“A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe.”
In Proceedings of the 20th International Conference on Artificial Intelligence
and Statistics, 54:860–68. ML Research Press, 2017.
ieee: F. Locatello, R. Khanna, M. Tschannen, and M. Jaggi, “A unified optimization
view on generalized matching pursuit and Frank-Wolfe,” in Proceedings of the
20th International Conference on Artificial Intelligence and Statistics, Fort
Lauderdale, FL, United States, 2017, vol. 54, pp. 860–868.
ista: 'Locatello F, Khanna R, Tschannen M, Jaggi M. 2017. A unified optimization
view on generalized matching pursuit and Frank-Wolfe. Proceedings of the 20th
International Conference on Artificial Intelligence and Statistics. AISTATS: Conference
on Artificial Intelligence and Statistics vol. 54, 860–868.'
mla: Locatello, Francesco, et al. “A Unified Optimization View on Generalized Matching
Pursuit and Frank-Wolfe.” Proceedings of the 20th International Conference
on Artificial Intelligence and Statistics, vol. 54, ML Research Press, 2017,
pp. 860–68.
short: F. Locatello, R. Khanna, M. Tschannen, M. Jaggi, in:, Proceedings of the
20th International Conference on Artificial Intelligence and Statistics, ML Research
Press, 2017, pp. 860–868.
conference:
end_date: 2017-04-22
location: Fort Lauderdale, FL, United States
name: 'AISTATS: Conference on Artificial Intelligence and Statistics'
start_date: 2017-04-20
date_created: 2023-08-22T14:17:19Z
date_published: 2017-02-21T00:00:00Z
date_updated: 2023-09-13T09:49:10Z
day: '21'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1702.06457'
intvolume: ' 54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1702.06457
month: '02'
oa: 1
oa_version: Preprint
page: 860-868
publication: Proceedings of the 20th International Conference on Artificial Intelligence
and Statistics
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: A unified optimization view on generalized matching pursuit and Frank-Wolfe
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 54
year: '2017'
...
---
_id: '202'
abstract:
- lang: eng
text: 'Restriction-modification (RM) represents the simplest and possibly the most
widespread mechanism of self/non-self discrimination in nature. In order to provide
bacteria with immunity against bacteriophages and other parasitic genetic elements,
RM systems rely on a balance between two enzymes: the restriction enzyme, which
cleaves non-self DNA at specific restriction sites, and the modification enzyme,
which tags the host’s DNA as self and thus protects it from cleavage. In this
thesis, I use population and single-cell level experiments in combination with
mathematical modeling to study different aspects of the interplay between RM systems,
bacteria and bacteriophages. First, I analyze how mutations in phage restriction
sites affect the probability of phage escape – an inherently stochastic process,
during which phages accidently get modified instead of restricted. Next, I use
single-cell experiments to show that RM systems can, with a low probability, attack
the genome of their bacterial host and that this primitive form of autoimmunity
leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally,
I investigate the nature of interactions between bacteria, RM systems and temperate
bacteriophages to find that, as a consequence of phage escape and its impact on
population dynamics, RM systems can promote acquisition of symbiotic bacteriophages,
rather than limit it. The results presented here uncover new fundamental biological
properties of RM systems and highlight their importance in the ecology and evolution
of bacteria, bacteriophages and their interactions.'
acknowledgement: "During my PhD studies, I received help from many people, all of
which unfortunately cannot be listed here. I thank them deeply and hope that I never
made them regret their kindness.\r\nI would like to express my deepest gratitude
to Călin Guet, who went far beyond his responsibilities as an advisor and was to
me also a great mentor and a friend. Călin never questioned my potential or lacked
compassion and I cannot thank him enough for cultivating in me an independent scientist.
I was amazed by his ability to recognize the most fascinating scientific problems
in objects of study that others would find mundane. I hope I adopted at least a
fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his
support and especially for giving me the best possible example of how one can practice
excellent science with humor and style. Working with Bruce was a true privilege.\r\nI
thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the
Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI
thank all our lab members: Tobias Bergmiller for his guidance, especially in the
first years of my research, and for being a good friend throughout; Remy Chait for
staying in the lab at unreasonable hours and for the good laughs at bad jokes we
shared; Anna Staron for supportively listening to my whines whenever I had to run
a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for
keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek
for always being nice to me, no matter how much bench space I took from her.\r\nI
thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing
the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics
analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical
modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally,
I would like to thank my family and especially my wife Edita, who sacrificed a lot
so that I can pursue my goals and dreams.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
citation:
ama: Pleska M. Biology of restriction-modification systems at the single-cell and
population level. 2017. doi:10.15479/AT:ISTA:th_916
apa: Pleska, M. (2017). Biology of restriction-modification systems at the single-cell
and population level. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_916
chicago: Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell
and Population Level.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_916.
ieee: M. Pleska, “Biology of restriction-modification systems at the single-cell
and population level,” Institute of Science and Technology Austria, 2017.
ista: Pleska M. 2017. Biology of restriction-modification systems at the single-cell
and population level. Institute of Science and Technology Austria.
mla: Pleska, Maros. Biology of Restriction-Modification Systems at the Single-Cell
and Population Level. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_916.
short: M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell
and Population Level, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:45:10Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2023-09-15T12:04:56Z
day: '01'
ddc:
- '576'
- '579'
degree_awarded: PhD
department:
- _id: CaGu
doi: 10.15479/AT:ISTA:th_916
file:
- access_level: open_access
checksum: 33cfb59674e91f82e3738396d3fb3776
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:48Z
date_updated: 2020-07-14T12:45:24Z
file_id: '4710'
file_name: IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf
file_size: 18569590
relation: main_file
- access_level: closed
checksum: dcc239968decb233e7f98cf1083d8c26
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:33:14Z
date_updated: 2020-07-14T12:45:24Z
file_id: '6204'
file_name: 2017_Pleska_Maros_Thesis.docx
file_size: 2801649
relation: source_file
file_date_updated: 2020-07-14T12:45:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '126'
project:
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
grant_number: '24210'
name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
at the Single-Cell Level (DOC Fellowship)
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7711'
pubrep_id: '916'
related_material:
record:
- id: '1243'
relation: part_of_dissertation
status: public
- id: '561'
relation: part_of_dissertation
status: public
- id: '457'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
title: Biology of restriction-modification systems at the single-cell and population
level
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '6287'
abstract:
- lang: eng
text: The main objects considered in the present work are simplicial and CW-complexes
with vertices forming a random point cloud. In particular, we consider a Poisson
point process in R^n and study Delaunay and Voronoi complexes of the first and
higher orders and weighted Delaunay complexes obtained as sections of Delaunay
complexes, as well as the Čech complex. Further, we examine theDelaunay complex
of a Poisson point process on the sphere S^n, as well as of a uniform point cloud,
which is equivalent to the convex hull, providing a connection to the theory of
random polytopes. Each of the complexes in question can be endowed with a radius
function, which maps its cells to the radii of appropriately chosen circumspheres,
called the radius of the cell. Applying and developing discrete Morse theory for
these functions, joining it together with probabilistic and sometimes analytic
machinery, and developing several integral geometric tools, we aim at getting
the distributions of circumradii of typical cells. For all considered complexes,
we are able to generalize and obtain up to constants the distribution of radii
of typical intervals of all types. In low dimensions the constants can be computed
explicitly, thus providing the explicit expressions for the expected numbers of
cells. In particular, it allows to find the expected density of simplices of every
dimension for a Poisson point process in R^4, whereas the result for R^3 was known
already in 1970's.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
citation:
ama: Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:10.15479/AT:ISTA:th_873
apa: Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_873
chicago: Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute
of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_873.
ieee: A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of
Science and Technology Austria, 2017.
ista: Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute
of Science and Technology Austria.
mla: Nikitenko, Anton. Discrete Morse Theory for Random Complexes . Institute
of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_873.
short: A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science
and Technology Austria, 2017.
date_created: 2019-04-09T15:04:32Z
date_published: 2017-10-27T00:00:00Z
date_updated: 2023-09-15T12:10:34Z
day: '27'
ddc:
- '514'
- '516'
- '519'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_873
file:
- access_level: open_access
checksum: ece7e598a2f060b263c2febf7f3fe7f9
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T14:54:51Z
date_updated: 2020-07-14T12:47:26Z
file_id: '6289'
file_name: 2017_Thesis_Nikitenko.pdf
file_size: 2324870
relation: main_file
- access_level: closed
checksum: 99b7ad76e317efd447af60f91e29b49b
content_type: application/zip
creator: dernst
date_created: 2019-04-09T14:54:51Z
date_updated: 2020-07-14T12:47:26Z
file_id: '6290'
file_name: 2017_Thesis_Nikitenko_source.zip
file_size: 2863219
relation: source_file
file_date_updated: 2020-07-14T12:47:26Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
pubrep_id: '873'
related_material:
record:
- id: '718'
relation: part_of_dissertation
status: public
- id: '5678'
relation: part_of_dissertation
status: public
- id: '87'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: 'Discrete Morse theory for random complexes '
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...