---
OA_place: repository
OA_type: green
_id: '1729'
abstract:
- lang: eng
text: We present a computer-aided programming approach to concurrency. The approach
allows programmers to program assuming a friendly, non-preemptive scheduler, and
our synthesis procedure inserts synchronization to ensure that the final program
works even with a preemptive scheduler. The correctness specification is implicit,
inferred from the non-preemptive behavior. Let us consider sequences of calls
that the program makes to an external interface. The specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of such sequences produced under a non-preemptive scheduler. The solution
is based on a finitary abstraction, an algorithm for bounded language inclusion
modulo an independence relation, and rules for inserting synchronization. We apply
the approach to device-driver programming, where the driver threads call the software
interface of the device and the API provided by the operating system. Our experiments
demonstrate that our synthesis method is precise and efficient, and, since it
does not require explicit specifications, is more practical than the conventional
approach based on user-provided assertions.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Leonid
full_name: Ryzhyk, Leonid
last_name: Ryzhyk
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling
using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11
apa: 'Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta,
R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using
synchronization synthesis. Presented at the CAV: Computer Aided Verification,
San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11'
chicago: Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid
Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive
Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science.
Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.
ieee: P. Cerny et al., “From non-preemptive to preemptive scheduling using
synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
ista: Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach
T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis.
9207, 180–197.
mla: Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using
Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.
short: P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta,
T. Tarrach, 9207 (2015) 180–197.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:53:42Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-04-09T10:54:00Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-21668-3_11
ec_funded: 1
external_id:
isi:
- '000491470400011'
file:
- access_level: open_access
checksum: 6ff58ac220e2f20cb001ba35d4924495
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:53Z
date_updated: 2025-06-26T07:12:35Z
file_id: '4715'
file_name: IST-2015-336-v1+1_long_version.pdf
file_size: 481922
relation: main_file
file_date_updated: 2025-06-26T07:12:35Z
has_accepted_license: '1'
intvolume: ' 9207'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 180 - 197
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: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5398'
pubrep_id: '336'
quality_controlled: '1'
related_material:
record:
- id: '1338'
relation: later_version
status: public
- id: '1130'
relation: dissertation_contains
status: public
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: From non-preemptive to preemptive scheduling using synchronization synthesis
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9207
year: '2015'
...
---
_id: '1666'
abstract:
- lang: eng
text: Evolution of gene regulation is crucial for our understanding of the phenotypic
differences between species, populations and individuals. Sequence-specific binding
of transcription factors to the regulatory regions on the DNA is a key regulatory
mechanism that determines gene expression and hence heritable phenotypic variation.
We use a biophysical model for directional selection on gene expression to estimate
the rates of gain and loss of transcription factor binding sites (TFBS) in finite
populations under both point and insertion/deletion mutations. Our results show
that these rates are typically slow for a single TFBS in an isolated DNA region,
unless the selection is extremely strong. These rates decrease drastically with
increasing TFBS length or increasingly specific protein-DNA interactions, making
the evolution of sites longer than ∼ 10 bp unlikely on typical eukaryotic speciation
timescales. Similarly, evolution converges to the stationary distribution of binding
sequences very slowly, making the equilibrium assumption questionable. The availability
of longer regulatory sequences in which multiple binding sites can evolve simultaneously,
the presence of “pre-sites” or partially decayed old sites in the initial sequence,
and biophysical cooperativity between transcription factors, can all facilitate
gain of TFBS and reconcile theoretical calculations with timescales inferred from
comparative genomics.
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Tugrul M, Paixao T, Barton NH, Tkačik G. Dynamics of transcription factor binding
site evolution. PLoS Genetics. 2015;11(11). doi:10.1371/journal.pgen.1005639
apa: Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Dynamics of
transcription factor binding site evolution. PLoS Genetics. Public Library
of Science. https://doi.org/10.1371/journal.pgen.1005639
chicago: Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Dynamics
of Transcription Factor Binding Site Evolution.” PLoS Genetics. Public
Library of Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.
ieee: M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Dynamics of transcription
factor binding site evolution,” PLoS Genetics, vol. 11, no. 11. Public
Library of Science, 2015.
ista: Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Dynamics of transcription factor
binding site evolution. PLoS Genetics. 11(11).
mla: Tugrul, Murat, et al. “Dynamics of Transcription Factor Binding Site Evolution.”
PLoS Genetics, vol. 11, no. 11, Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.
short: M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, PLoS Genetics 11 (2015).
date_created: 2018-12-11T11:53:21Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2026-04-09T10:52:40Z
day: '06'
ddc:
- '576'
department:
- _id: NiBa
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pgen.1005639
ec_funded: 1
external_id:
isi:
- '000366179000022'
file:
- access_level: open_access
checksum: a4e72fca5ccf40ddacf4d08c8e46b554
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:58Z
date_updated: 2020-07-14T12:45:10Z
file_id: '4657'
file_name: IST-2016-463-v1+1_journal.pgen.1005639.pdf
file_size: 2580778
relation: main_file
file_date_updated: 2020-07-14T12:45:10Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: PLoS Genetics
publication_status: published
publisher: Public Library of Science
publist_id: '5483'
pubrep_id: '463'
quality_controlled: '1'
related_material:
record:
- id: '9712'
relation: research_data
status: public
- id: '1131'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Dynamics of transcription factor binding site evolution
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2015'
...
---
OA_place: publisher
_id: '1401'
abstract:
- lang: eng
text: 'The human ability to recognize objects in complex scenes has driven research
in the computer vision field over couple of decades. This thesis focuses on the
object recognition task in images. That is, given the image, we want the computer
system to be able to predict the class of the object that appears in the image.
A recent successful attempt to bridge semantic understanding of the image perceived
by humans and by computers uses attribute-based models. Attributes are semantic
properties of the objects shared across different categories, which humans and
computers can decide on. To explore the attribute-based models we take a statistical
machine learning approach, and address two key learning challenges in view of
object recognition task: learning augmented attributes as mid-level discriminative
feature representation, and learning with attributes as privileged information.
Our main contributions are parametric and non-parametric models and algorithms
to solve these frameworks. In the parametric approach, we explore an autoencoder
model combined with the large margin nearest neighbor principle for mid-level
feature learning, and linear support vector machines for learning with privileged
information. In the non-parametric approach, we propose a supervised Indian Buffet
Process for automatic augmentation of semantic attributes, and explore the Gaussian
Processes classification framework for learning with privileged information. A
thorough experimental analysis shows the effectiveness of the proposed models
in both parametric and non-parametric views.'
acknowledgement: "I would like to thank my supervisor, Christoph Lampert, for guidance
throughout my studies and for patience in transforming me into a scientist, and
my thesis committee, Chris Wojtan and Horst Bischof, for their help and advice.
\r\n\r\nI would like to thank Elisabeth Hacker who perfectly assisted all my administrative
needs and was always nice and friendly to me, and the campus team for making the
IST Austria campus my second home. \r\nI was honored to collaborate with brilliant
researchers and to learn from their experience. Undoubtedly, I learned most of all
from Novi Quadrianto: brainstorming our projects and getting exciting results was
the most enjoyable part of my work – thank you! I am also grateful to David Knowles,
Zoubin Ghahramani, Daniel Hernández-Lobato, Kristian Kersting and Anastasia Pentina
for the fantastic projects we worked on together, and to Kristen Grauman and Adriana
Kovashka for the exceptional experience working with user studies. I would like
to thank my colleagues at IST Austria and my office mates who shared their happy
moods, scientific breakthroughs and thought-provoking conversations with me: Chao,
Filip, Rustem, Asya, Sameh, Alex, Vlad, Mayu, Neel, Csaba, Thomas, Vladimir, Cristina,
Alex Z., Avro, Amelie and Emilie, Andreas H. and Andreas E., Chris, Lena, Michael,
Ali and Ipek, Vera, Igor, Katia. Special thanks to Morten for the countless games
of table soccer we played together and the tournaments we teamed up for: we will
definitely win next time:) A very warm hug to Asya for always being so inspiring
and supportive to me, and for helping me to increase the proportion of female computer
scientists in our group. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
citation:
ama: 'Sharmanska V. Learning with attributes for object recognition: Parametric
and non-parametrics views. 2015. doi:10.15479/at:ista:1401'
apa: 'Sharmanska, V. (2015). Learning with attributes for object recognition:
Parametric and non-parametrics views. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:1401'
chicago: 'Sharmanska, Viktoriia. “Learning with Attributes for Object Recognition:
Parametric and Non-Parametrics Views.” Institute of Science and Technology Austria,
2015. https://doi.org/10.15479/at:ista:1401.'
ieee: 'V. Sharmanska, “Learning with attributes for object recognition: Parametric
and non-parametrics views,” Institute of Science and Technology Austria, 2015.'
ista: 'Sharmanska V. 2015. Learning with attributes for object recognition: Parametric
and non-parametrics views. Institute of Science and Technology Austria.'
mla: 'Sharmanska, Viktoriia. Learning with Attributes for Object Recognition:
Parametric and Non-Parametrics Views. Institute of Science and Technology
Austria, 2015, doi:10.15479/at:ista:1401.'
short: 'V. Sharmanska, Learning with Attributes for Object Recognition: Parametric
and Non-Parametrics Views, Institute of Science and Technology Austria, 2015.'
corr_author: '1'
date_created: 2018-12-11T11:51:48Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2026-04-09T14:25:49Z
day: '01'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ChLa
- _id: GradSch
doi: 10.15479/at:ista:1401
file:
- access_level: open_access
checksum: 3605b402bb6934e09ae4cf672c84baf7
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:33:17Z
date_updated: 2021-02-22T11:33:17Z
file_id: '9177'
file_name: 2015_Thesis_Sharmanska.pdf
file_size: 7964342
relation: main_file
success: 1
- access_level: closed
checksum: e37593b3ee75bf3180629df2d6ca8f4e
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-16T14:40:45Z
date_updated: 2021-11-17T13:47:24Z
file_id: '10297'
file_name: 2015_Thesis_Sharmanska_pdfa.pdf
file_size: 7372241
relation: main_file
file_date_updated: 2021-11-17T13:47:24Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://users.sussex.ac.uk/~nq28/viktoriia/Thesis_Sharmanska.pdf
month: '04'
oa: 1
oa_version: Published Version
page: '144'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5806'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: 'Learning with attributes for object recognition: Parametric and non-parametrics
views'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2015'
...
---
_id: '1792'
abstract:
- lang: eng
text: Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop
a new concept of variation of multivariate functions on a compact Hausdorff space
with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka
theorem that holds for this notion of variation and discrepancy with respect to
D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions,
such as extreme or isotropic discrepancy. For extreme discrepancy, our result
coincides with the usual Koksma-Hlawka theorem. We show that the space of functions
of bounded D-variation contains important discontinuous functions and is closed
under natural algebraic operations. Finally, we illustrate the results on concrete
integration problems from integral geometry and stereology.
acknowledgement: F.P. is supported by the Graduate School of IST Austria, A.M.S is
supported by the Centre for Stochastic Geometry and Advanced Bioimaging funded by
a grant from the Villum Foundation.
article_processing_charge: No
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
- first_name: Anne
full_name: Svane, Anne
last_name: Svane
citation:
ama: Pausinger F, Svane A. A Koksma-Hlawka inequality for general discrepancy systems.
Journal of Complexity. 2015;31(6):773-797. doi:10.1016/j.jco.2015.06.002
apa: Pausinger, F., & Svane, A. (2015). A Koksma-Hlawka inequality for general
discrepancy systems. Journal of Complexity. Academic Press. https://doi.org/10.1016/j.jco.2015.06.002
chicago: Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General
Discrepancy Systems.” Journal of Complexity. Academic Press, 2015. https://doi.org/10.1016/j.jco.2015.06.002.
ieee: F. Pausinger and A. Svane, “A Koksma-Hlawka inequality for general discrepancy
systems,” Journal of Complexity, vol. 31, no. 6. Academic Press, pp. 773–797,
2015.
ista: Pausinger F, Svane A. 2015. A Koksma-Hlawka inequality for general discrepancy
systems. Journal of Complexity. 31(6), 773–797.
mla: Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General
Discrepancy Systems.” Journal of Complexity, vol. 31, no. 6, Academic Press,
2015, pp. 773–97, doi:10.1016/j.jco.2015.06.002.
short: F. Pausinger, A. Svane, Journal of Complexity 31 (2015) 773–797.
corr_author: '1'
date_created: 2018-12-11T11:54:02Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2026-04-09T14:26:05Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jco.2015.06.002
external_id:
isi:
- '000362926900001'
intvolume: ' 31'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
oa_version: None
page: 773 - 797
publication: Journal of Complexity
publication_status: published
publisher: Academic Press
publist_id: '5320'
quality_controlled: '1'
related_material:
record:
- id: '1399'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A Koksma-Hlawka inequality for general discrepancy systems
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 31
year: '2015'
...
---
_id: '1709'
abstract:
- lang: eng
text: The competition for resources among cells, individuals or species is a fundamental
characteristic of evolution. Biological all-pay auctions have been used to model
situations where multiple individuals compete for a single resource. However,
in many situations multiple resources with various values exist and single reward
auctions are not applicable. We generalize the model to multiple rewards and study
the evolution of strategies. In biological all-pay auctions the bid of an individual
corresponds to its strategy and is equivalent to its payment in the auction. The
decreasingly ordered rewards are distributed according to the decreasingly ordered
bids of the participating individuals. The reproductive success of an individual
is proportional to its fitness given by the sum of the rewards won minus its payments.
Hence, successful bidding strategies spread in the population. We find that the
results for the multiple reward case are very different from the single reward
case. While the mixed strategy equilibrium in the single reward case with more
than two players consists of mostly low-bidding individuals, we show that the
equilibrium can convert to many high-bidding individuals and a few low-bidding
individuals in the multiple reward case. Some reward values lead to a specialization
among the individuals where one subpopulation competes for the rewards and the
other subpopulation largely avoids costly competitions. Whether the mixed strategy
equilibrium is an evolutionarily stable strategy (ESS) depends on the specific
values of the rewards.
acknowledgement: 'This work was supported by grants from the John Templeton Foundation,
ERC Start Grant (279307: Graph Games), FWF NFN Grant (No S11407N23 RiSE/SHiNE),
FWF Grant (No P23499N23) and a Microsoft faculty fellows award.'
article_processing_charge: No
article_type: original
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. Biological auctions with
multiple rewards. Proceedings of the Royal Society of London Series B Biological
Sciences. 2015;282(1812). doi:10.1098/rspb.2015.1041
apa: Reiter, J., Kanodia, A., Gupta, R., Nowak, M., & Chatterjee, K. (2015).
Biological auctions with multiple rewards. Proceedings of the Royal Society
of London Series B Biological Sciences. Royal Society. https://doi.org/10.1098/rspb.2015.1041
chicago: Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu
Chatterjee. “Biological Auctions with Multiple Rewards.” Proceedings of the
Royal Society of London Series B Biological Sciences. Royal Society, 2015.
https://doi.org/10.1098/rspb.2015.1041.
ieee: J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological
auctions with multiple rewards,” Proceedings of the Royal Society of London
Series B Biological Sciences, vol. 282, no. 1812. Royal Society, 2015.
ista: Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions
with multiple rewards. Proceedings of the Royal Society of London Series B Biological
Sciences. 282(1812).
mla: Reiter, Johannes, et al. “Biological Auctions with Multiple Rewards.” Proceedings
of the Royal Society of London Series B Biological Sciences, vol. 282, no.
1812, Royal Society, 2015, doi:10.1098/rspb.2015.1041.
short: J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of
the Royal Society of London Series B Biological Sciences 282 (2015).
corr_author: '1'
date_created: 2018-12-11T11:53:35Z
date_published: 2015-07-15T00:00:00Z
date_updated: 2026-04-09T14:26:23Z
day: '15'
department:
- _id: KrCh
doi: 10.1098/rspb.2015.1041
external_id:
isi:
- '000362305500021'
pmid:
- '26180069'
intvolume: ' 282'
isi: 1
issue: '1812'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528522/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Royal Society of London Series B Biological Sciences
publication_status: published
publisher: Royal Society
publist_id: '5425'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Biological auctions with multiple rewards
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 282
year: '2015'
...
---
OA_place: publisher
_id: '1400'
abstract:
- lang: eng
text: Cancer results from an uncontrolled growth of abnormal cells. Sequentially
accumulated genetic and epigenetic alterations decrease cell death and increase
cell replication. We used mathematical models to quantify the effect of driver
gene mutations. The recently developed targeted therapies can lead to dramatic
regressions. However, in solid cancers, clinical responses are often short-lived
because resistant cancer cells evolve. We estimated that approximately 50 different
mutations can confer resistance to a typical targeted therapeutic agent. We find
that resistant cells are likely to be present in expanded subclones before the
start of the treatment. The dominant strategy to prevent the evolution of resistance
is combination therapy. Our analytical results suggest that in most patients,
dual therapy, but not monotherapy, can result in long-term disease control. However,
long-term control can only occur if there are no possible mutations in the genome
that can cause cross-resistance to both drugs. Furthermore, we showed that simultaneous
therapy with two drugs is much more likely to result in long-term disease control
than sequential therapy with the same drugs. To improve our understanding of the
underlying subclonal evolution we reconstruct the evolutionary history of a patient's
cancer from next-generation sequencing data of spatially-distinct DNA samples.
Using a quantitative measure of genetic relatedness, we found that pancreatic
cancers and their metastases demonstrated a higher level of relatedness than that
expected for any two cells randomly taken from a normal tissue. This minimal amount
of genetic divergence among advanced lesions indicates that genetic heterogeneity,
when quantitatively defined, is not a fundamental feature of the natural history
of untreated pancreatic cancers. Our newly developed, phylogenomic tool Treeomics
finds evidence for seeding patterns of metastases and can directly be used to
discover rules governing the evolution of solid malignancies to transform cancer
into a more predictable disease.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
citation:
ama: Reiter J. The subclonal evolution of cancer. 2015.
apa: Reiter, J. (2015). The subclonal evolution of cancer. Institute of Science
and Technology Austria.
chicago: Reiter, Johannes. “The Subclonal Evolution of Cancer.” Institute of Science
and Technology Austria, 2015.
ieee: J. Reiter, “The subclonal evolution of cancer,” Institute of Science and Technology
Austria, 2015.
ista: Reiter J. 2015. The subclonal evolution of cancer. Institute of Science and
Technology Austria.
mla: Reiter, Johannes. The Subclonal Evolution of Cancer. Institute of Science
and Technology Austria, 2015.
short: J. Reiter, The Subclonal Evolution of Cancer, Institute of Science and Technology
Austria, 2015.
corr_author: '1'
date_created: 2018-12-11T11:51:48Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2026-04-09T14:26:24Z
day: '01'
degree_awarded: PhD
department:
- _id: KrCh
language:
- iso: eng
month: '04'
oa_version: None
page: '183'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5807'
related_material:
record:
- id: '2000'
relation: part_of_dissertation
status: public
- id: '1709'
relation: part_of_dissertation
status: public
- id: '2858'
relation: part_of_dissertation
status: public
- id: '2816'
relation: part_of_dissertation
status: public
- id: '2247'
relation: part_of_dissertation
status: public
- id: '3260'
relation: part_of_dissertation
status: public
- id: '3157'
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: The subclonal evolution of cancer
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2015'
...
---
_id: '1502'
abstract:
- lang: eng
text: We extend the theory of input-output conformance with operators for merge
and quotient. The former is useful when testing against multiple requirements
or views. The latter can be used to generate tests for patches of an already tested
system. Both operators can combine systems with different action alphabets, which
is usually the case when constructing complex systems and specifications from
parts, for instance different views as well as newly defined functionality of
a~previous version of the system.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme
(Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013)
under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373
(nSafeCer). Jan Křetínský has been partially supported by the Czech Science Foundation,
grant No. P202/12/G061. Nikola Beneš has been supported by the\r\nMEYS project
No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for
Scientific Excellence."
alternative_title:
- 'Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering '
article_processing_charge: No
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- 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: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
citation:
ama: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition
operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:10.1145/2737166.2737175'
apa: 'Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., & Nickovic, D. (2015).
Complete composition operators for IOCO-testing theory (pp. 101–110). Presented
at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.
https://doi.org/10.1145/2737166.2737175'
chicago: Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and
Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10.
ACM, 2015. https://doi.org/10.1145/2737166.2737175.
ieee: 'N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete
composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based
Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.'
ista: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition
operators for IOCO-testing theory. CBSE: Component-Based Software Engineering
, Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering , , 101–110.'
mla: Beneš, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory.
ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.
short: N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015,
pp. 101–110.
conference:
end_date: 2015-05-08
location: Montreal, QC, Canada
name: 'CBSE: Component-Based Software Engineering '
start_date: 2015-05-04
date_created: 2018-12-11T11:52:24Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2026-04-15T10:02:12Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1145/2737166.2737175
ec_funded: 1
external_id:
isi:
- '000380554800013'
file:
- access_level: open_access
checksum: c6ce681035c163a158751f240cb7d389
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:46Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5303'
file_name: IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf
file_size: 467561
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 101 - 110
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: Formal methods for the design and analysis of complex systems
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_identifier:
isbn:
- 978-1-4503-3471-6
publication_status: published
publisher: ACM
publist_id: '5676'
pubrep_id: '625'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Complete composition operators for IOCO-testing theory
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2015'
...
---
_id: '1501'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability. We introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph algorithms with quadratic complexity to compute the simulation
relation. We present an automated technique for assume-guarantee style reasoning
for compositional analysis of two-player games by giving a counterexample guided
abstraction-refinement approach to compute our new simulation relation. We show
a tight link between two-player games and MDPs, and as a consequence the results
for games are lifted to MDPs with qualitative properties. We have implemented
our algorithms and show that the compositional analysis leads to significant improvements. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE),
and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games),
Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive
Modeling).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
citation:
ama: Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative
properties in Markov decision processes. Formal Methods in System Design.
2015;47(2):230-264. doi:10.1007/s10703-015-0235-2
apa: Chatterjee, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional
analysis of qualitative properties in Markov decision processes. Formal Methods
in System Design. Springer. https://doi.org/10.1007/s10703-015-0235-2
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for
Compositional Analysis of Qualitative Properties in Markov Decision Processes.”
Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
ieee: K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis
of qualitative properties in Markov decision processes,” Formal Methods in
System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
ista: Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of
qualitative properties in Markov decision processes. Formal Methods in System
Design. 47(2), 230–264.
mla: Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative
Properties in Markov Decision Processes.” Formal Methods in System Design,
vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.
short: K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015)
230–264.
corr_author: '1'
date_created: 2018-12-11T11:52:23Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2026-04-15T10:02:12Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-015-0235-2
ec_funded: 1
external_id:
arxiv:
- '1405.0835'
isi:
- '000361752300003'
intvolume: ' 47'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.0835
month: '10'
oa: 1
oa_version: Preprint
page: 230 - 264
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'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '5677'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: CEGAR for compositional analysis of qualitative properties in Markov decision
processes
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 47
year: '2015'
...
---
OA_place: publisher
_id: '1399'
abstract:
- lang: eng
text: This thesis is concerned with the computation and approximation of intrinsic
volumes. Given a smooth body M and a certain digital approximation of it, we develop
algorithms to approximate various intrinsic volumes of M using only measurements
taken from its digital approximations. The crucial idea behind our novel algorithms
is to link the recent theory of persistent homology to the theory of intrinsic
volumes via the Crofton formula from integral geometry and, in particular, via
Euler characteristic computations. Our main contributions are a multigrid convergent
digital algorithm to compute the first intrinsic volume of a solid body in R^n
as well as an appropriate integration pipeline to approximate integral-geometric
integrals defined over the Grassmannian manifold.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Pausinger F. On the approximation of intrinsic volumes. 2015.
apa: Pausinger, F. (2015). On the approximation of intrinsic volumes. Institute
of Science and Technology Austria.
chicago: Pausinger, Florian. “On the Approximation of Intrinsic Volumes.” Institute
of Science and Technology Austria, 2015.
ieee: F. Pausinger, “On the approximation of intrinsic volumes,” Institute of Science
and Technology Austria, 2015.
ista: Pausinger F. 2015. On the approximation of intrinsic volumes. Institute of
Science and Technology Austria.
mla: Pausinger, Florian. On the Approximation of Intrinsic Volumes. Institute
of Science and Technology Austria, 2015.
short: F. Pausinger, On the Approximation of Intrinsic Volumes, Institute of Science
and Technology Austria, 2015.
corr_author: '1'
date_created: 2018-12-11T11:51:48Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2026-04-16T10:09:04Z
day: '01'
degree_awarded: PhD
department:
- _id: HeEd
language:
- iso: eng
month: '06'
oa_version: None
page: '144'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5808'
related_material:
record:
- id: '1662'
relation: part_of_dissertation
status: public
- id: '1792'
relation: part_of_dissertation
status: public
- id: '2255'
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: On the approximation of intrinsic volumes
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2015'
...
---
OA_place: publisher
OA_type: gold
_id: '1525'
abstract:
- lang: eng
text: 'Based on 16 recommendations, efforts should be made to achieve the following
goal: By 2025, all scholarly publication activity in Austria should be Open Access.
In other words, the final versions of all scholarly publications resulting from
the support of public resources must be freely accessible on the Internet without
delay (Gold Open Access). The resources required to meet this obligation shall
be provided to the authors, or the cost of the publication venues shall be borne
directly by the research organisations.'
article_processing_charge: No
article_type: original
author:
- first_name: Bruno
full_name: Bauer, Bruno
last_name: Bauer
- first_name: Guido
full_name: Blechl, Guido
last_name: Blechl
- first_name: Christoph
full_name: Bock, Christoph
last_name: Bock
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Andreas
full_name: Ferus, Andreas
last_name: Ferus
- first_name: Anton
full_name: Graschopf, Anton
last_name: Graschopf
- first_name: Thomas
full_name: König, Thomas
last_name: König
- first_name: Katja
full_name: Mayer, Katja
last_name: Mayer
- first_name: Falk
full_name: Reckling, Falk
last_name: Reckling
- first_name: Katharina
full_name: Rieck, Katharina
last_name: Rieck
- first_name: Peter
full_name: Seitz, Peter
last_name: Seitz
- first_name: Herwig
full_name: Stöger, Herwig
last_name: Stöger
- first_name: Elvira
full_name: Welzig, Elvira
last_name: Welzig
citation:
ama: Bauer B, Blechl G, Bock C, et al. Arbeitsgruppe „Nationale Strategie“ des Open
Access Network Austria OANA. VÖB Mitteilungen. 2015;68(3):580-607. doi:10.5281/zenodo.33178
apa: Bauer, B., Blechl, G., Bock, C., Danowski, P., Ferus, A., Graschopf, A., …
Welzig, E. (2015). Arbeitsgruppe „Nationale Strategie“ des Open Access Network
Austria OANA. VÖB Mitteilungen. Verein Österreichischer Bibliothekare.
https://doi.org/10.5281/zenodo.33178
chicago: Bauer, Bruno, Guido Blechl, Christoph Bock, Patrick Danowski, Andreas Ferus,
Anton Graschopf, Thomas König, et al. “Arbeitsgruppe „Nationale Strategie“ Des
Open Access Network Austria OANA.” VÖB Mitteilungen. Verein Österreichischer
Bibliothekare, 2015. https://doi.org/10.5281/zenodo.33178.
ieee: B. Bauer et al., “Arbeitsgruppe „Nationale Strategie“ des Open Access
Network Austria OANA,” VÖB Mitteilungen, vol. 68, no. 3. Verein Österreichischer
Bibliothekare, pp. 580–607, 2015.
ista: Bauer B, Blechl G, Bock C, Danowski P, Ferus A, Graschopf A, König T, Mayer
K, Reckling F, Rieck K, Seitz P, Stöger H, Welzig E. 2015. Arbeitsgruppe „Nationale
Strategie“ des Open Access Network Austria OANA. VÖB Mitteilungen. 68(3), 580–607.
mla: Bauer, Bruno, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network
Austria OANA.” VÖB Mitteilungen, vol. 68, no. 3, Verein Österreichischer
Bibliothekare, 2015, pp. 580–607, doi:10.5281/zenodo.33178.
short: B. Bauer, G. Blechl, C. Bock, P. Danowski, A. Ferus, A. Graschopf, T. König,
K. Mayer, F. Reckling, K. Rieck, P. Seitz, H. Stöger, E. Welzig, VÖB Mitteilungen
68 (2015) 580–607.
date_created: 2018-12-11T11:52:31Z
date_published: 2015-11-12T00:00:00Z
date_updated: 2026-04-29T05:58:40Z
day: '12'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.33178
file:
- access_level: open_access
checksum: a495fe253bbc7615b1d60e9e85c94408
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:59Z
date_updated: 2020-07-14T12:45:00Z
file_id: '5317'
file_name: IST-2016-720-v1+1_OANA_OA-Empfehlungen_12-11-2015.pdf
file_size: 931707
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 68'
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 580 - 607
publication: VÖB Mitteilungen
publication_status: published
publisher: Verein Österreichischer Bibliothekare
publist_id: '5648'
pubrep_id: '720'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA
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: 68
year: '2015'
...
---
_id: '9719'
abstract:
- lang: eng
text: Parasitism creates selection for resistance mechanisms in host populations
and is hypothesized to promote increased host evolvability. However, the influence
of these traits on host evolution when parasites are no longer present is unclear.
We used experimental evolution and whole-genome sequencing of Escherichia coli
to determine the effects of past and present exposure to parasitic viruses (phages)
on the spread of mutator alleles, resistance, and bacterial competitive fitness.
We found that mutator alleles spread rapidly during adaptation to any of four
different phage species, and this pattern was even more pronounced with multiple
phages present simultaneously. However, hypermutability did not detectably accelerate
adaptation in the absence of phages and recovery of fitness costs associated with
resistance. Several lineages evolved phage resistance through elevated mucoidy,
and during subsequent evolution in phage-free conditions they rapidly reverted
to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this
phenotypic reversion was achieved by additional genetic changes rather than by
genotypic reversion of the initial resistance mutations. Insertion sequence (IS)
elements played a key role in both the acquisition of resistance and adaptation
in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions
were not more frequent in mutator lineages. Our results provide a genetic explanation
for rapid reversion of mucoidy, a phenotype observed in other bacterial species
including human pathogens. Moreover, this demonstrates that the types of genetic
change underlying adaptation to fitness costs, and consequently the impact of
evolvability mechanisms such as increased point-mutation rates, depend critically
on the mechanism of resistance.
article_processing_charge: No
author:
- first_name: Sébastien
full_name: Wielgoss, Sébastien
last_name: Wielgoss
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Anna M.
full_name: Bischofberger, Anna M.
last_name: Bischofberger
- first_name: Alex R.
full_name: Hall, Alex R.
last_name: Hall
citation:
ama: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria.
2015. doi:10.5061/dryad.cj910'
apa: 'Wielgoss, S., Bergmiller, T., Bischofberger, A. M., & Hall, A. R. (2015).
Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria. Dryad. https://doi.org/10.5061/dryad.cj910'
chicago: 'Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex
R. Hall. “Data from: Adaptation to Parasites and Costs of Parasite Resistance
in Mutator and Non-Mutator Bacteria.” Dryad, 2015. https://doi.org/10.5061/dryad.cj910.'
ieee: 'S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Data from:
Adaptation to parasites and costs of parasite resistance in mutator and non-mutator
bacteria.” Dryad, 2015.'
ista: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2015. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria,
Dryad, 10.5061/dryad.cj910.'
mla: 'Wielgoss, Sébastien, et al. Data from: Adaptation to Parasites and Costs
of Parasite Resistance in Mutator and Non-Mutator Bacteria. Dryad, 2015, doi:10.5061/dryad.cj910.'
short: S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, (2015).
date_created: 2021-07-26T08:44:04Z
date_published: 2015-12-21T00:00:00Z
date_updated: 2026-04-29T05:57:01Z
day: '21'
department:
- _id: CaGu
doi: 10.5061/dryad.cj910
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.cj910
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '5749'
relation: used_in_publication
status: public
status: public
title: 'Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1610'
abstract:
- lang: eng
text: The edit distance between two words w1, w2 is the minimal number of word operations
(letter insertions, deletions, and substitutions) necessary to transform w1 to
w2. The edit distance generalizes to languages L1,L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses. The problem of computing edit
distance to pushdown automata is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under\r\ngrant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects\r\nS11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-\r\nN23,
FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph\r\nGames), and
MSR faculty fellows award."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown
automata. In: 42nd International Colloquium on Automata, Languages, and Programming.
Vol 9135. Springer Nature; 2015:121-133. doi:10.1007/978-3-662-47666-6_10'
apa: 'Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. In 42nd International Colloquium on Automata,
Languages, and Programming (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer
Nature. https://doi.org/10.1007/978-3-662-47666-6_10'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium
on Automata, Languages, and Programming, 9135:121–33. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-47666-6_10.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance
for pushdown automata,” in 42nd International Colloquium on Automata, Languages,
and Programming, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
ista: 'Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata. 42nd International Colloquium on Automata, Languages, and Programming.
ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.'
mla: Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” 42nd
International Colloquium on Automata, Languages, and Programming, vol. 9135,
no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International
Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp.
121–133.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: Automata, Languages and Programming'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:01Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-04-29T06:14:48Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-662-47666-6_10
ec_funded: 1
external_id:
arxiv:
- '1504.08259'
isi:
- '000364317900010'
intvolume: ' 9135'
isi: 1
issue: Part II
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.08259
month: '07'
oa: 1
oa_version: Preprint
page: 121 - 133
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: Formal methods for the design and analysis of complex systems
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 42nd International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-662-47665-9
publication_status: published
publisher: Springer Nature
publist_id: '5556'
pubrep_id: '321'
quality_controlled: '1'
related_material:
record:
- id: '5438'
relation: earlier_version
status: public
- id: '465'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Edit distance for pushdown automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9135
year: '2015'
...
---
_id: '5438'
abstract:
- lang: eng
text: "The edit distance between two words w1, w2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses.\r\nThe problem of computing edit
distance to a pushdown automaton is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown
Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance
for pushdown automata. IST Austria, 2015.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata, IST Austria, 15p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata.
IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for
Pushdown Automata, IST Austria, 2015.
date_created: 2018-12-12T11:39:20Z
date_published: 2015-05-05T00:00:00Z
date_updated: 2026-04-29T06:14:48Z
day: '05'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-334-v1-1
file:
- access_level: open_access
checksum: 8a5f2d77560e552af87eb1982437a43b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:56Z
date_updated: 2020-07-14T12:46:55Z
file_id: '5518'
file_name: IST-2015-334-v1+1_report.pdf
file_size: 422573
relation: main_file
file_date_updated: 2020-07-14T12:46:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '15'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '334'
related_material:
record:
- id: '465'
relation: later_version
status: public
- id: '1610'
relation: later_version
status: public
status: public
title: Edit distance for pushdown automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1619'
abstract:
- lang: eng
text: The emergence of drug resistant pathogens is a serious public health problem.
It is a long-standing goal to predict rates of resistance evolution and design
optimal treatment strategies accordingly. To this end, it is crucial to reveal
the underlying causes of drug-specific differences in the evolutionary dynamics
leading to resistance. However, it remains largely unknown why the rates of resistance
evolution via spontaneous mutations and the diversity of mutational paths vary
substantially between drugs. Here we comprehensively quantify the distribution
of fitness effects (DFE) of mutations, a key determinant of evolutionary dynamics,
in the presence of eight antibiotics representing the main modes of action. Using
precise high-throughput fitness measurements for genome-wide Escherichia coli
gene deletion strains, we find that the width of the DFE varies dramatically between
antibiotics and, contrary to conventional wisdom, for some drugs the DFE width
is lower than in the absence of stress. We show that this previously underappreciated
divergence in DFE width among antibiotics is largely caused by their distinct
drug-specific dose-response characteristics. Unlike the DFE, the magnitude of
the changes in tolerated drug concentration resulting from genome-wide mutations
is similar for most drugs but exceptionally small for the antibiotic nitrofurantoin,
i.e., mutations generally have considerably smaller resistance effects for nitrofurantoin
than for other drugs. A population genetics model predicts that resistance evolution
for drugs with this property is severely limited and confined to reproducible
mutational paths. We tested this prediction in laboratory evolution experiments
using the “morbidostat”, a device for evolving bacteria in well-controlled drug
environments. Nitrofurantoin resistance indeed evolved extremely slowly via reproducible
mutations—an almost paradoxical behavior since this drug causes DNA damage and
increases the mutation rate. Overall, we identified novel quantitative characteristics
of the evolutionary landscape that provide the conceptual foundation for predicting
the dynamics of drug resistance evolution.
article_number: e1002299
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Dravecka, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Dravecka
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay
full_name: Ayhan, Dilay
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Quantifying the determinants of
evolutionary dynamics leading to drug resistance. PLoS Biology. 2015;13(11).
doi:10.1371/journal.pbio.1002299
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D., Toprak,
E., & Bollenbach, M. T. (2015). Quantifying the determinants of evolutionary
dynamics leading to drug resistance. PLoS Biology. Public Library of Science.
https://doi.org/10.1371/journal.pbio.1002299
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Quantifying the Determinants
of Evolutionary Dynamics Leading to Drug Resistance.” PLoS Biology. Public
Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.
ieee: G. Chevereau et al., “Quantifying the determinants of evolutionary
dynamics leading to drug resistance,” PLoS Biology, vol. 13, no. 11. Public
Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan D, Toprak E, Bollenbach
MT. 2015. Quantifying the determinants of evolutionary dynamics leading to drug
resistance. PLoS Biology. 13(11), e1002299.
mla: Chevereau, Guillaume, et al. “Quantifying the Determinants of Evolutionary
Dynamics Leading to Drug Resistance.” PLoS Biology, vol. 13, no. 11, e1002299,
Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D. Ayhan, E. Toprak,
M.T. Bollenbach, PLoS Biology 13 (2015).
corr_author: '1'
date_created: 2018-12-11T11:53:04Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2026-05-04T22:30:54Z
day: '18'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299
ec_funded: 1
external_id:
isi:
- '000365898900011'
file:
- access_level: open_access
checksum: 0e82e3279f50b15c6c170c042627802b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:00Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4723'
file_name: IST-2016-468-v1+1_journal.pbio.1002299.pdf
file_size: 1387760
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
grant_number: RGP0042/2013
name: Revealing the fundamental limits of cell growth
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27201-B22
name: Revealing the mechanisms underlying drug interactions
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303507'
name: Optimality principles in responses to antibiotics
publication: PLoS Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5547'
pubrep_id: '468'
quality_controlled: '1'
related_material:
record:
- id: '9711'
relation: research_data
status: public
- id: '9765'
relation: research_data
status: public
- id: '6263'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Quantifying the determinants of evolutionary dynamics leading to drug resistance
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2015'
...
---
_id: '11582'
abstract:
- lang: eng
text: We have observed a sample of typical z ∼ 1 star-forming galaxies, selected
from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared,
multi-integral field unit instrument on the Very Large Telescope (VLT), in order
to obtain their dynamics and metallicity gradients. The majority of our galaxies
have a metallicity gradient consistent with being flat or negative (i.e. higher
metallicity cores than outskirts). Intriguingly, we find a trend between metallicity
gradient and specific star formation rate (sSFR), such that galaxies with a high
sSFR tend to have relatively metal poor centres, a result which is strengthened
when combined with data sets from the literature. This result appears to explain
the discrepancies reported between different high-redshift studies and varying
claims for evolution. From a galaxy evolution perspective, the trend we see would
mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can
be funnelled into its core, triggered either by merging or through efficient accretion.
In fact, merging may play a significant role as it is the starburst galaxies at
all epochs, which have the more positive metallicity gradients. Our results may
help to explain the origin of the fundamental metallicity relation, in which galaxies
at a fixed mass are observed to have lower metallicities at higher star formation
rates, especially if the metallicity is measured in an aperture encompassing only
the central regions of the galaxy. Finally, we note that this study demonstrates
the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys.
acknowledgement: First, we acknowledge the referee for their comments, which have
improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1).
IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL
and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from
NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting
grant. PNB acknowledges STFC for financial support.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: John P.
full_name: Stott, John P.
last_name: Stott
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: A. M.
full_name: Swinbank, A. M.
last_name: Swinbank
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: Richard
full_name: Bower, Richard
last_name: Bower
- first_name: Philip N.
full_name: Best, Philip N.
last_name: Best
- first_name: Ray M.
full_name: Sharples, Ray M.
last_name: Sharples
- first_name: James E.
full_name: Geach, James E.
last_name: Geach
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
citation:
ama: Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star
formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS.
Monthly Notices of the Royal Astronomical Society. 2014;443(3):2695-2704.
doi:10.1093/mnras/stu1343
apa: Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N.,
… Matthee, J. J. (2014). A relationship between specific star formation rate and
metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices
of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stu1343
chicago: Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower,
Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship
between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies
from KMOS-HiZELS.” Monthly Notices of the Royal Astronomical Society. Oxford
University Press, 2014. https://doi.org/10.1093/mnras/stu1343.
ieee: J. P. Stott et al., “A relationship between specific star formation
rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” Monthly
Notices of the Royal Astronomical Society, vol. 443, no. 3. Oxford University
Press, pp. 2695–2704, 2014.
ista: Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach
JE, Matthee JJ. 2014. A relationship between specific star formation rate and
metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of
the Royal Astronomical Society. 443(3), 2695–2704.
mla: Stott, John P., et al. “A Relationship between Specific Star Formation Rate
and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” Monthly Notices
of the Royal Astronomical Society, vol. 443, no. 3, Oxford University Press,
2014, pp. 2695–704, doi:10.1093/mnras/stu1343.
short: J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M.
Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical
Society 443 (2014) 2695–2704.
date_created: 2022-07-14T12:16:10Z
date_published: 2014-09-21T00:00:00Z
date_updated: 2022-08-19T08:27:25Z
day: '21'
doi: 10.1093/mnras/stu1343
extern: '1'
external_id:
arxiv:
- '1407.1047'
intvolume: ' 443'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: abundances'
- 'galaxies: evolution'
- 'galaxies: kinematics and dynamics'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1407.1047
month: '09'
oa: 1
oa_version: Preprint
page: 2695-2704
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A relationship between specific star formation rate and metallicity gradient
within z ∼ 1 galaxies from KMOS-HiZELS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 443
year: '2014'
...
---
_id: '11583'
abstract:
- lang: eng
text: 'Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely
deep surveys, probing very small areas. As a consequence, candidates are very
faint, making spectroscopic confirmation practically impossible. In order to overcome
such limitations, we have undertaken the CF-HiZELS survey, which is a large-area,
medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα)
emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii
Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity
limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following
criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from
CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually
checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric
redshifts and remove a significant amount of dusty lower redshift line-emitters
at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked
as strong candidates, but the majority have very weak constraints on their spectral
energy distributions. Using follow-up observations with SINFONI/VLT, we are able
to exclude the most robust candidates as LAEs. We put a strong constraint on the
Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and
future surveys. Our results show that surveys for the highest redshift LAEs are
susceptible of multiple contaminations and that spectroscopic follow-up is absolutely
necessary.'
acknowledgement: We thank the anonymous referee for the comments and suggestions which
improved both the quality and clarity of this work. DS acknowledges financial support
from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship.
IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the
ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson
Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges
the support from the Creative Research Initiative Program, no. 2008- 0060544, of
the National Research Foundation of Korea (NRF) funded by the Korean government
(MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The
Dark Cosmology Centre is funded by the Danish National Research Foundation. This
work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey.
Based on observations obtained with MegaPrime/MegaCam, a joint project of CFHT and
CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the
National Research Council (NRC) of Canada, the Institut National des Science de
l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France and
the University of Hawaii. This work is based in part on data products produced at
Terapix available at the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii
Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was
only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope.
The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent
legacy and complementary value – without such high-quality data sets, this research
would not have been possible.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: A. M.
full_name: Swinbank, A. M.
last_name: Swinbank
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: P. N.
full_name: Best, P. N.
last_name: Best
- first_name: Jae-Woo
full_name: Kim, Jae-Woo
last_name: Kim
- first_name: Marijn
full_name: Franx, Marijn
last_name: Franx
- first_name: Bo
full_name: Milvang-Jensen, Bo
last_name: Milvang-Jensen
- first_name: Johan
full_name: Fynbo, Johan
last_name: Fynbo
citation:
ama: 'Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8
with spectroscopic follow-up: Strong constraints on the luminosity function and
implications for other surveys. Monthly Notices of the Royal Astronomical Society.
2014;440(3):2375-2387. doi:10.1093/mnras/stu392'
apa: 'Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim,
J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic
follow-up: Strong constraints on the luminosity function and implications for
other surveys. Monthly Notices of the Royal Astronomical Society. Oxford
University Press. https://doi.org/10.1093/mnras/stu392'
chicago: 'Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best,
Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman
α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity
Function and Implications for Other Surveys.” Monthly Notices of the Royal
Astronomical Society. Oxford University Press, 2014. https://doi.org/10.1093/mnras/stu392.'
ieee: 'J. J. Matthee et al., “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic
follow-up: Strong constraints on the luminosity function and implications for
other surveys,” Monthly Notices of the Royal Astronomical Society, vol.
440, no. 3. Oxford University Press, pp. 2375–2387, 2014.'
ista: 'Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen
B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up:
Strong constraints on the luminosity function and implications for other surveys.
Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.'
mla: 'Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic
Follow-up: Strong Constraints on the Luminosity Function and Implications for
Other Surveys.” Monthly Notices of the Royal Astronomical Society, vol.
440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:10.1093/mnras/stu392.'
short: J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M.
Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical
Society 440 (2014) 2375–2387.
date_created: 2022-07-14T12:33:24Z
date_published: 2014-05-21T00:00:00Z
date_updated: 2024-10-14T11:37:28Z
day: '21'
doi: 10.1093/mnras/stu392
extern: '1'
external_id:
arxiv:
- '1402.6697'
intvolume: ' 440'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'cosmology: observations'
- dark ages
- reionization
- first stars
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1402.6697
month: '05'
oa: 1
oa_version: Preprint
page: 2375-2387
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints
on the luminosity function and implications for other surveys'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 440
year: '2014'
...
---
_id: '11750'
abstract:
- lang: eng
text: We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find
a significant increase in the magnetic susceptibility in our sample when compared
with the values previously reported for the polycrystalline sample. The pronounced
Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole.
In the intrinsic conductivity region, the susceptibility due to free carriers
shows thermally activated behavior and is consistent with the data reported for
single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic
susceptibility in our sample comes mainly from a small amount of unreacted Fe,
the contribution from the enhanced carrier density due to lattice and strain defects
arising from the ball milling process is also significant. Existence of an unreacted
Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300
K.
article_number: '6675864'
article_processing_charge: No
article_type: original
author:
- first_name: Mani
full_name: Pokharel, Mani
last_name: Pokharel
- first_name: Huaizhou
full_name: Zhao, Huaizhou
last_name: Zhao
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Zhifeng
full_name: Ren, Zhifeng
last_name: Ren
- first_name: Cyril
full_name: Opeil, Cyril
last_name: Opeil
citation:
ama: Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. Magnetic properties of hot-pressed
FeSb2. IEEE Transactions on Magnetics. 2014;50(5). doi:10.1109/TMAG.2013.2292607
apa: Pokharel, M., Zhao, H., Modic, K. A., Ren, Z., & Opeil, C. (2014). Magnetic
properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. Institute
of Electrical and Electronics Engineers. https://doi.org/10.1109/TMAG.2013.2292607
chicago: Pokharel, Mani, Huaizhou Zhao, Kimberly A Modic, Zhifeng Ren, and Cyril
Opeil. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE Transactions on Magnetics.
Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/TMAG.2013.2292607.
ieee: M. Pokharel, H. Zhao, K. A. Modic, Z. Ren, and C. Opeil, “Magnetic properties
of hot-pressed FeSb2,” IEEE Transactions on Magnetics, vol. 50, no. 5.
Institute of Electrical and Electronics Engineers, 2014.
ista: Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. 2014. Magnetic properties of
hot-pressed FeSb2. IEEE Transactions on Magnetics. 50(5), 6675864.
mla: Pokharel, Mani, et al. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE
Transactions on Magnetics, vol. 50, no. 5, 6675864, Institute of Electrical
and Electronics Engineers, 2014, doi:10.1109/TMAG.2013.2292607.
short: M. Pokharel, H. Zhao, K.A. Modic, Z. Ren, C. Opeil, IEEE Transactions on
Magnetics 50 (2014).
date_created: 2022-08-08T08:26:02Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2022-08-11T09:51:22Z
day: '01'
doi: 10.1109/TMAG.2013.2292607
extern: '1'
intvolume: ' 50'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
publication: IEEE Transactions on Magnetics
publication_identifier:
eissn:
- 1941-0069
issn:
- 0018-9464
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Magnetic properties of hot-pressed FeSb2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2014'
...
---
_id: '11789'
abstract:
- lang: eng
text: "We study a weighted online bipartite matching problem: G(V 1, V 2, E) is
a weighted bipartite graph where V 1 is known beforehand and the vertices of V
2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices
in V 1, so as to maximize the sum of weights of edges in the matching. If assignments
to V 1 cannot be changed, no bounded competitive ratio is achievable. We study
the weighted online matching problem with free disposal, where vertices in V 1
can be assigned multiple times, but only get credit for the maximum weight edge
assigned to them over the course of the algorithm. For this problem, the greedy
algorithm is 0.5-competitive and determining whether a better competitive ratio
is achievable is a well known open problem.\r\n\r\nWe identify an interesting
special case where the edge weights are decomposable as the product of two factors,
one corresponding to each end point of the edge. This is analogous to the well
studied related machines model in the scheduling literature, although the objective
functions are different. For this case of decomposable edge weights, we design
a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show
that such instances with decomposable weights are non-trivial by establishing
upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA
tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1
case as well as the case where edge weights depend on the offline vertices only,
but for these cases, reassignments cannot change the quality of the solution.
Beating 0.5 for weighted matching where reassignments are necessary has been a
significant challenge. We thus give the first online algorithm with competitive
ratio strictly better than 0.5 for a non-trivial case of weighted matching with
free disposal."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Moses
full_name: Charikar, Moses
last_name: Charikar
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Huy L.
full_name: Nguyễn, Huy L.
last_name: Nguyễn
citation:
ama: 'Charikar M, Henzinger M, Nguyễn HL. Online bipartite matching with decomposable
weights. In: 22nd Annual European Symposium on Algorithms. Vol 8737. Springer
Nature; 2014:260-271. doi:10.1007/978-3-662-44777-2_22'
apa: 'Charikar, M., Henzinger, M., & Nguyễn, H. L. (2014). Online bipartite
matching with decomposable weights. In 22nd Annual European Symposium on Algorithms
(Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-44777-2_22'
chicago: Charikar, Moses, Monika Henzinger, and Huy L. Nguyễn. “Online Bipartite
Matching with Decomposable Weights.” In 22nd Annual European Symposium on Algorithms,
8737:260–71. Springer Nature, 2014. https://doi.org/10.1007/978-3-662-44777-2_22.
ieee: M. Charikar, M. Henzinger, and H. L. Nguyễn, “Online bipartite matching with
decomposable weights,” in 22nd Annual European Symposium on Algorithms,
Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.
ista: 'Charikar M, Henzinger M, Nguyễn HL. 2014. Online bipartite matching with
decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual
European Symposium on Algorithms, LNCS, vol. 8737, 260–271.'
mla: Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.”
22nd Annual European Symposium on Algorithms, vol. 8737, Springer Nature,
2014, pp. 260–71, doi:10.1007/978-3-662-44777-2_22.
short: M. Charikar, M. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium
on Algorithms, Springer Nature, 2014, pp. 260–271.
conference:
end_date: 2014-09-10
location: Wroclaw, Poland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2014-09-08
date_created: 2022-08-11T10:41:47Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2024-11-06T12:11:36Z
day: '01'
doi: 10.1007/978-3-662-44777-2_22
extern: '1'
external_id:
arxiv:
- '1409.2139'
intvolume: ' 8737'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.2139
month: '09'
oa: 1
oa_version: Preprint
page: 260 - 271
publication: 22nd Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-366244776-5
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online bipartite matching with decomposable weights
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8737
year: '2014'
...
---
_id: '11790'
abstract:
- lang: eng
text: "Assume a seller wants to sell a digital product in a social network where
a buyer’s valuation of the item has positive network externalities from her neighbors
that already have the item. The goal of the seller is to maximize his revenue.
Previous work on this problem [7] studies the case where clients are offered the
item in sequence and have to pay personalized prices. This is highly infeasible
in large scale networks such as the Facebook graph: (1) Offering items to the
clients one after the other consumes a large amount of time, and (2) price-discrimination
of clients could appear unfair to them and result in negative client reaction
or could conflict with legal requirements.\r\n\r\nWe study a setting dealing with
these issues. Specifically, the item is offered in parallel to multiple clients
at the same time and at the same price. This is called a round. We show that with
O(logn) rounds, where n is the number of clients, a constant factor of the revenue
with price discrimination can be achieved and that this is not possible with o(logn)
rounds. Moreover we show that it is APX-hard to maximize the revenue and we give
constant factor approximation algorithms for various further settings of limited
price discrimination."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luděk
full_name: Cigler, Luděk
last_name: Cigler
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: 'Cigler L, Dvořák W, Henzinger M, Starnberger M. Limiting price discrimination
when selling products with positive network externalities. In: 10th International
Conference of Web and Internet Economics. Vol 8877. Springer Nature; 2014:44-57.
doi:10.1007/978-3-319-13129-0_4'
apa: 'Cigler, L., Dvořák, W., Henzinger, M., & Starnberger, M. (2014). Limiting
price discrimination when selling products with positive network externalities.
In 10th International Conference of Web and Internet Economics (Vol. 8877,
pp. 44–57). Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-319-13129-0_4'
chicago: Cigler, Luděk, Wolfgang Dvořák, Monika Henzinger, and Martin Starnberger.
“Limiting Price Discrimination When Selling Products with Positive Network Externalities.”
In 10th International Conference of Web and Internet Economics, 8877:44–57.
Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13129-0_4.
ieee: L. Cigler, W. Dvořák, M. Henzinger, and M. Starnberger, “Limiting price discrimination
when selling products with positive network externalities,” in 10th International
Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877,
pp. 44–57.
ista: 'Cigler L, Dvořák W, Henzinger M, Starnberger M. 2014. Limiting price discrimination
when selling products with positive network externalities. 10th International
Conference of Web and Internet Economics. WINE: International Conference on Web
and Internet Economics, LNCS, vol. 8877, 44–57.'
mla: Cigler, Luděk, et al. “Limiting Price Discrimination When Selling Products
with Positive Network Externalities.” 10th International Conference of Web
and Internet Economics, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:10.1007/978-3-319-13129-0_4.
short: L. Cigler, W. Dvořák, M. Henzinger, M. Starnberger, in:, 10th International
Conference of Web and Internet Economics, Springer Nature, 2014, pp. 44–57.
conference:
end_date: 2014-12-17
location: Beijing, China
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2014-12-14
date_created: 2022-08-11T10:58:44Z
date_published: 2014-12-01T00:00:00Z
date_updated: 2024-11-06T12:11:48Z
day: '01'
doi: 10.1007/978-3-319-13129-0_4
extern: '1'
intvolume: ' 8877'
language:
- iso: eng
month: '12'
oa_version: None
page: 44 - 57
publication: 10th International Conference of Web and Internet Economics
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Limiting price discrimination when selling products with positive network externalities
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8877
year: '2014'
...
---
_id: '118'
abstract:
- lang: eng
text: While the penetration of objects into granular media is well-studied, there
is little understanding of how objects settle in gravities, geff, different from
that of Earth - a scenario potentially relevant to the geomorphology of planets
and asteroids and also to their exploration using man-made devices. By conducting
experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2
g. Surprisingly, we find that the rest depth is independent of geff and also that
the time required for the object to come to rest scales like geff-1/2. With discrete
element modeling simulations, we reproduce the experimental results and extend
the range of geff to objects as small as asteroids and as large as Jupiter. Our
results shed light on the initial stage of sedimentation into dry granular media
across a range of celestial bodies and also have implications for the design of
man-made, extraterrestrial vehicles and structures. Key Points The settling depth
in granular media is independent of gravity The settling time scales like g-1/2
Layering driven by granular sedimentation should be similar.
acknowledgement: 'The Spanish MINECO project FIS2011-26675, the PIUNA program (U.
Navarra), and the Project 29942WL (Fonds de Solidarité Prioritaire France-Cuba)
have partially supported this research. '
author:
- first_name: Ernesto
full_name: Altshuler, Ernesto
last_name: Altshuler
- first_name: H
full_name: Torres, H
last_name: Torres
- first_name: A
full_name: González_Pita, A
last_name: González_Pita
- first_name: Colina G
full_name: Sánchez, Colina G
last_name: Sánchez
- first_name: Carlos
full_name: Pérez Penichet, Carlos
last_name: Pérez Penichet
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Rauól
full_name: Hidalgo, Rauól
last_name: Hidalgo
citation:
ama: Altshuler E, Torres H, González_Pita A, et al. Settling into dry granular media
in different gravities. Geophysical Research Letters. 2014;41(9):3032-3037.
doi:10.1002/2014GL059229
apa: Altshuler, E., Torres, H., González_Pita, A., Sánchez, C. G., Pérez Penichet,
C., Waitukaitis, S. R., & Hidalgo, R. (2014). Settling into dry granular media
in different gravities. Geophysical Research Letters. Wiley-Blackwell.
https://doi.org/10.1002/2014GL059229
chicago: Altshuler, Ernesto, H Torres, A González_Pita, Colina G Sánchez, Carlos
Pérez Penichet, Scott R Waitukaitis, and Rauól Hidalgo. “Settling into Dry Granular
Media in Different Gravities.” Geophysical Research Letters. Wiley-Blackwell,
2014. https://doi.org/10.1002/2014GL059229.
ieee: E. Altshuler et al., “Settling into dry granular media in different
gravities,” Geophysical Research Letters, vol. 41, no. 9. Wiley-Blackwell,
pp. 3032–3037, 2014.
ista: Altshuler E, Torres H, González_Pita A, Sánchez CG, Pérez Penichet C, Waitukaitis
SR, Hidalgo R. 2014. Settling into dry granular media in different gravities.
Geophysical Research Letters. 41(9), 3032–3037.
mla: Altshuler, Ernesto, et al. “Settling into Dry Granular Media in Different Gravities.”
Geophysical Research Letters, vol. 41, no. 9, Wiley-Blackwell, 2014, pp.
3032–37, doi:10.1002/2014GL059229.
short: E. Altshuler, H. Torres, A. González_Pita, C.G. Sánchez, C. Pérez Penichet,
S.R. Waitukaitis, R. Hidalgo, Geophysical Research Letters 41 (2014) 3032–3037.
date_created: 2018-12-11T11:44:43Z
date_published: 2014-05-16T00:00:00Z
date_updated: 2021-01-12T06:48:53Z
day: '16'
doi: 10.1002/2014GL059229
extern: '1'
intvolume: ' 41'
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 3032 - 3037
publication: Geophysical Research Letters
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7936'
quality_controlled: '1'
status: public
title: Settling into dry granular media in different gravities
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2014'
...