---
_id: '933'
abstract:
- lang: eng
text: Although collective cell motion plays an important role, for example during
wound healing, embryogenesis, or cancer progression, the fundamental rules governing
this motion are still not well understood, in particular at high cell density.
We study here the motion of human bronchial epithelial cells within a monolayer,
over long times. We observe that, as the monolayer ages, the cells slow down monotonously,
while the velocity correlation length first increases as the cells slow down but
eventually decreases at the slowest motions. By comparing experiments, analytic
model, and detailed particle-based simulations, we shed light on this biological
amorphous solidification process, demonstrating that the observed dynamics can
be explained as a consequence of the combined maturation and strengthening of
cell-cell and cell-substrate adhesions. Surprisingly, the increase of cell surface
density due to proliferation is only secondary in this process. This analysis
is confirmed with two other cell types. The very general relations between the
mean cell velocity and velocity correlation lengths, which apply for aggregates
of self-propelled particles, as well as motile cells, can possibly be used to
discriminate between various parameter changes in vivo, from noninvasive microscopy
data.
author:
- first_name: Simón
full_name: García, Simón
last_name: García
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Jens
full_name: Elgeti, Jens
last_name: Elgeti
- first_name: Jean
full_name: Joanny, Jean
last_name: Joanny
- first_name: Pascal
full_name: Silberzan, Pascal
last_name: Silberzan
- first_name: Nir
full_name: Gov, Nir
last_name: Gov
citation:
ama: García S, Hannezo EB, Elgeti J, Joanny J, Silberzan P, Gov N. Physics of active
jamming during collective cellular motion in a monolayer. PNAS. 2015;112(50):15314-15319.
doi:10.1073/pnas.1510973112
apa: García, S., Hannezo, E. B., Elgeti, J., Joanny, J., Silberzan, P., & Gov,
N. (2015). Physics of active jamming during collective cellular motion in a monolayer.
PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1510973112
chicago: García, Simón, Edouard B Hannezo, Jens Elgeti, Jean Joanny, Pascal Silberzan,
and Nir Gov. “Physics of Active Jamming during Collective Cellular Motion in a
Monolayer.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1510973112.
ieee: S. García, E. B. Hannezo, J. Elgeti, J. Joanny, P. Silberzan, and N. Gov,
“Physics of active jamming during collective cellular motion in a monolayer,”
PNAS, vol. 112, no. 50. National Academy of Sciences, pp. 15314–15319,
2015.
ista: García S, Hannezo EB, Elgeti J, Joanny J, Silberzan P, Gov N. 2015. Physics
of active jamming during collective cellular motion in a monolayer. PNAS. 112(50),
15314–15319.
mla: García, Simón, et al. “Physics of Active Jamming during Collective Cellular
Motion in a Monolayer.” PNAS, vol. 112, no. 50, National Academy of Sciences,
2015, pp. 15314–19, doi:10.1073/pnas.1510973112.
short: S. García, E.B. Hannezo, J. Elgeti, J. Joanny, P. Silberzan, N. Gov, PNAS
112 (2015) 15314–15319.
date_created: 2018-12-11T11:49:16Z
date_published: 2015-12-15T00:00:00Z
date_updated: 2021-01-12T08:22:01Z
day: '15'
doi: 10.1073/pnas.1510973112
extern: '1'
external_id:
pmid:
- '26627719'
intvolume: ' 112'
issue: '50'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.pnas.org/content/pnas/112/50/15314.full.pdf
month: '12'
oa: 1
oa_version: None
page: 15314 - 15319
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '6511'
quality_controlled: '1'
status: public
title: Physics of active jamming during collective cellular motion in a monolayer
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '7739'
abstract:
- lang: eng
text: Currently, there is much debate on the genetic architecture of quantitative
traits in wild populations. Is trait variation influenced by many genes of small
effect or by a few genes of major effect? Where is additive genetic variation
located in the genome? Do the same loci cause similar phenotypic variation in
different populations? Great tits (Parus major) have been studied extensively
in long‐term studies across Europe and consequently are considered an ecological
‘model organism’. Recently, genomic resources have been developed for the great
tit, including a custom SNP chip and genetic linkage map. In this study, we used
a suite of approaches to investigate the genetic architecture of eight quantitative
traits in two long‐term study populations of great tits—one in the Netherlands
and the other in the United Kingdom. Overall, we found little evidence for the
presence of genes of large effects in either population. Instead, traits appeared
to be influenced by many genes of small effect, with conservative estimates of
the number of contributing loci ranging from 31 to 310. Despite concordance between
population‐specific heritabilities, we found no evidence for the presence of loci
having similar effects in both populations. While population‐specific genetic
architectures are possible, an undetected shared architecture cannot be rejected
because of limited power to map loci of small and moderate effects. This study
is one of few examples of genetic architecture analysis in replicated wild populations
and highlights some of the challenges and limitations researchers will face when
attempting similar molecular quantitative genetic studies in free‐living populations.
article_processing_charge: No
article_type: original
author:
- first_name: Anna W.
full_name: Santure, Anna W.
last_name: Santure
- first_name: Jocelyn
full_name: Poissant, Jocelyn
last_name: Poissant
- first_name: Isabelle
full_name: De Cauwer, Isabelle
last_name: De Cauwer
- first_name: Kees
full_name: van Oers, Kees
last_name: van Oers
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: John L.
full_name: Quinn, John L.
last_name: Quinn
- first_name: Martien A. M.
full_name: Groenen, Martien A. M.
last_name: Groenen
- first_name: Marcel E.
full_name: Visser, Marcel E.
last_name: Visser
- first_name: Ben C.
full_name: Sheldon, Ben C.
last_name: Sheldon
- first_name: Jon
full_name: Slate, Jon
last_name: Slate
citation:
ama: Santure AW, Poissant J, De Cauwer I, et al. Replicated analysis of the genetic
architecture of quantitative traits in two wild great tit populations. Molecular
Ecology. 2015;24:6148-6162. doi:10.1111/mec.13452
apa: Santure, A. W., Poissant, J., De Cauwer, I., van Oers, K., Robinson, M. R.,
Quinn, J. L., … Slate, J. (2015). Replicated analysis of the genetic architecture
of quantitative traits in two wild great tit populations. Molecular Ecology.
Wiley. https://doi.org/10.1111/mec.13452
chicago: Santure, Anna W., Jocelyn Poissant, Isabelle De Cauwer, Kees van Oers,
Matthew Richard Robinson, John L. Quinn, Martien A. M. Groenen, Marcel E. Visser,
Ben C. Sheldon, and Jon Slate. “Replicated Analysis of the Genetic Architecture
of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology.
Wiley, 2015. https://doi.org/10.1111/mec.13452.
ieee: A. W. Santure et al., “Replicated analysis of the genetic architecture
of quantitative traits in two wild great tit populations,” Molecular Ecology,
vol. 24. Wiley, pp. 6148–6162, 2015.
ista: Santure AW, Poissant J, De Cauwer I, van Oers K, Robinson MR, Quinn JL, Groenen
MAM, Visser ME, Sheldon BC, Slate J. 2015. Replicated analysis of the genetic
architecture of quantitative traits in two wild great tit populations. Molecular
Ecology. 24, 6148–6162.
mla: Santure, Anna W., et al. “Replicated Analysis of the Genetic Architecture of
Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology,
vol. 24, Wiley, 2015, pp. 6148–62, doi:10.1111/mec.13452.
short: A.W. Santure, J. Poissant, I. De Cauwer, K. van Oers, M.R. Robinson, J.L.
Quinn, M.A.M. Groenen, M.E. Visser, B.C. Sheldon, J. Slate, Molecular Ecology
24 (2015) 6148–6162.
date_created: 2020-04-30T10:51:01Z
date_published: 2015-12-10T00:00:00Z
date_updated: 2021-01-12T08:15:12Z
day: '10'
doi: 10.1111/mec.13452
extern: '1'
intvolume: ' 24'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/mec.13452
month: '12'
oa: 1
oa_version: Published Version
page: 6148-6162
publication: Molecular Ecology
publication_identifier:
issn:
- 0962-1083
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Replicated analysis of the genetic architecture of quantitative traits in two
wild great tit populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2015'
...
---
_id: '7741'
abstract:
- lang: eng
text: Phenotypes expressed in a social context are not only a function of the individual,
but can also be shaped by the phenotypes of social partners. These social effects
may play a major role in the evolution of cooperative breeding if social partners
differ in the quality of care they provide and if individual carers adjust their
effort in relation to that of other carers. When applying social effects models
to wild study systems, it is also important to explore sources of individual plasticity
that could masquerade as social effects. We studied offspring provisioning rates
of parents and helpers in a wild population of long-tailed tits Aegithalos caudatus
using a quantitative genetic framework to identify these social effects and partition
them into genetic, permanent environment and current environment components. Controlling
for other effects, individuals were consistent in their provisioning effort at
a given nest, but adjusted their effort based on who was in their social group,
indicating the presence of social effects. However, these social effects differed
between years and social contexts, indicating a current environment effect, rather
than indicating a genetic or permanent environment effect. While this study reveals
the importance of examining environmental and genetic sources of social effects,
the framework we present is entirely general, enabling a greater understanding
of potentially important social effects within any ecological population.
article_number: '20150689'
article_processing_charge: No
article_type: original
author:
- first_name: Mark James
full_name: Adams, Mark James
last_name: Adams
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Maria-Elena
full_name: Mannarelli, Maria-Elena
last_name: Mannarelli
- first_name: Ben J.
full_name: Hatchwell, Ben J.
last_name: Hatchwell
citation:
ama: 'Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. Social genetic and social
environment effects on parental and helper care in a cooperatively breeding bird.
Proceedings of the Royal Society B: Biological Sciences. 2015;282(1810).
doi:10.1098/rspb.2015.0689'
apa: 'Adams, M. J., Robinson, M. R., Mannarelli, M.-E., & Hatchwell, B. J. (2015).
Social genetic and social environment effects on parental and helper care in a
cooperatively breeding bird. Proceedings of the Royal Society B: Biological
Sciences. The Royal Society. https://doi.org/10.1098/rspb.2015.0689'
chicago: 'Adams, Mark James, Matthew Richard Robinson, Maria-Elena Mannarelli, and
Ben J. Hatchwell. “Social Genetic and Social Environment Effects on Parental and
Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society
B: Biological Sciences. The Royal Society, 2015. https://doi.org/10.1098/rspb.2015.0689.'
ieee: 'M. J. Adams, M. R. Robinson, M.-E. Mannarelli, and B. J. Hatchwell, “Social
genetic and social environment effects on parental and helper care in a cooperatively
breeding bird,” Proceedings of the Royal Society B: Biological Sciences,
vol. 282, no. 1810. The Royal Society, 2015.'
ista: 'Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. 2015. Social genetic
and social environment effects on parental and helper care in a cooperatively
breeding bird. Proceedings of the Royal Society B: Biological Sciences. 282(1810),
20150689.'
mla: 'Adams, Mark James, et al. “Social Genetic and Social Environment Effects on
Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of
the Royal Society B: Biological Sciences, vol. 282, no. 1810, 20150689, The
Royal Society, 2015, doi:10.1098/rspb.2015.0689.'
short: 'M.J. Adams, M.R. Robinson, M.-E. Mannarelli, B.J. Hatchwell, Proceedings
of the Royal Society B: Biological Sciences 282 (2015).'
date_created: 2020-04-30T10:58:07Z
date_published: 2015-07-07T00:00:00Z
date_updated: 2021-01-12T08:15:12Z
day: '07'
doi: 10.1098/rspb.2015.0689
extern: '1'
external_id:
pmid:
- '26063846'
intvolume: ' 282'
issue: '1810'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1098/rspb.2015.0689
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
publication: 'Proceedings of the Royal Society B: Biological Sciences'
publication_identifier:
issn:
- 0962-8452
- 1471-2954
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
status: public
title: Social genetic and social environment effects on parental and helper care in
a cooperatively breeding bird
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 282
year: '2015'
...
---
_id: '7779'
abstract:
- lang: eng
text: "The fact that a disordered material is not constrained in its properties
in\r\nthe same way as a crystal presents significant and yet largely untapped\r\npotential
for novel material design. However, unlike their crystalline\r\ncounterparts,
disordered solids are not well understood. One of the primary\r\nobstacles is
the lack of a theoretical framework for thinking about disorder\r\nand its relation
to mechanical properties. To this end, we study an idealized\r\nsystem of frictionless
athermal soft spheres that, when compressed, undergoes a\r\njamming phase transition
with diverging length scales and clean power-law\r\nsignatures. This critical
point is the cornerstone of a much larger \"jamming\r\nscenario\" that has the
potential to provide the essential theoretical\r\nfoundation necessary for a unified
understanding of the mechanics of disordered\r\nsolids. We begin by showing that
jammed sphere packings have a valid linear\r\nregime despite the presence of \"contact
nonlinearities.\" We then investigate\r\nthe critical nature of the transition,
focusing on diverging length scales and\r\nfinite-size effects. Next, we argue
that jamming plays the same role for\r\ndisordered solids as the perfect crystal
plays for crystalline solids. Not only\r\ncan it be considered an idealized starting
point for understanding disordered\r\nmaterials, but it can even influence systems
that have a relatively high amount\r\nof crystalline order. The behavior of solids
can thus be thought of as existing\r\non a spectrum, with the perfect crystal
and the jamming transition at opposing\r\nends. Finally, we introduce a new principle
wherein the contribution of an\r\nindividual bond to one global property is independent
of its contribution to\r\nanother. This principle allows the different global
responses of a disordered\r\nsystem to be manipulated independently and provides
a great deal of flexibility\r\nin designing materials with unique, textured and
tunable properties."
article_processing_charge: No
arxiv: 1
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
citation:
ama: 'Goodrich CP. Unearthing the anticrystal: Criticality in the linear response
of disordered solids. arXiv:151008820. 2015.'
apa: 'Goodrich, C. P. (2015). Unearthing the anticrystal: Criticality in the linear
response of disordered solids. arXiv:1510.08820.'
chicago: 'Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the
Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.'
ieee: 'C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response
of disordered solids,” arXiv:1510.08820. 2015.'
ista: 'Goodrich CP. 2015. Unearthing the anticrystal: Criticality in the linear
response of disordered solids. arXiv:1510.08820, .'
mla: 'Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear
Response of Disordered Solids.” ArXiv:1510.08820, 2015.'
short: C.P. Goodrich, ArXiv:1510.08820 (2015).
date_created: 2020-04-30T12:16:18Z
date_published: 2015-10-29T00:00:00Z
date_updated: 2021-01-12T08:15:28Z
day: '29'
extern: '1'
external_id:
arxiv:
- '1510.08820'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1510.08820
month: '10'
oa: 1
oa_version: Preprint
page: '242'
publication: arXiv:1510.08820
publication_status: published
status: public
title: 'Unearthing the anticrystal: Criticality in the linear response of disordered
solids'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '778'
abstract:
- lang: eng
text: Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed
to complement the fast, but best-effort nature of Hardware Transactional Memory
(HTM) with a slow, reliable software backup. However, the costs of providing concurrency
between hardware and software transactions in HyTM are still not well understood.
In this paper, we propose a general model for HyTM implementations, which captures
the ability of hardware transactions to buffer memory accesses. The model allows
us to formally quantify and analyze the amount of overhead (instrumentation) caused
by the potential presence of software transactions.We prove that (1) it is impossible
to build a strictly serializable HyTM implementation that has both uninstrumented
reads and writes, even for very weak progress guarantees, and (2) the instrumentation
cost incurred by a hardware transaction in any progressive opaque HyTM is linear
in the size of the transaction’s data set.We further describe two implementations
which exhibit optimal instrumentation costs for two different progress conditions.
In sum, this paper proposes the first formal HyTM model and captures for the first
time the trade-off between the degree of hardware-software TM concurrency and
the amount of instrumentation overhead.
acknowledgement: P. Kuznetsov-The author is supported by the Agence Nationale de la
Recherche, ANR-14-CE35-0010-01, project DISCMAT. N. Shavit-Support is gratfeully
acknowledgedfrom the National Science Foundation under grants CCF-1217921, CCF-1201926,
and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and
the Oracle and Intel corporations.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
- first_name: Srivatsan
full_name: Ravi, Srivatsan
last_name: Ravi
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations
of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13'
apa: 'Alistarh, D.-A., Kopinsky, J., Kuznetsov, P., Ravi, S., & Shavit, N. (2015).
Inherent limitations of hybrid transactional memory (Vol. 9363, pp. 185–199).
Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-662-48653-5_13'
chicago: Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi,
and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99.
Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13.
ieee: 'D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent
limitations of hybrid transactional memory,” presented at the DISC: Distributed
Computing, 2015, vol. 9363, pp. 185–199.'
ista: 'Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. 2015. Inherent limitations
of hybrid transactional memory. DISC: Distributed Computing, LNCS, vol. 9363,
185–199.'
mla: Alistarh, Dan-Adrian, et al. Inherent Limitations of Hybrid Transactional
Memory. Vol. 9363, Springer, 2015, pp. 185–99, doi:10.1007/978-3-662-48653-5_13.
short: D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer,
2015, pp. 185–199.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:27Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T13:17:35Z
day: '01'
doi: 10.1007/978-3-662-48653-5_13
extern: '1'
external_id:
arxiv:
- '1405.5689'
intvolume: ' 9363'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.5689
month: '01'
oa: 1
oa_version: None
page: 185 - 199
publication_status: published
publisher: Springer
publist_id: '6880'
quality_controlled: '1'
status: public
title: Inherent limitations of hybrid transactional memory
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9363
year: '2015'
...
---
_id: '780'
abstract:
- lang: eng
text: 'Population protocols are networks of finite-state agents, interacting randomly,
and updating their states using simple rules. Despite their extreme simplicity,
these systems have been shown to cooperatively perform complex computational tasks,
such as simulating register machines to compute standard arithmetic functions.
The election of a unique leader agent is a key requirement in such computational
constructions. Yet, the fastest currently known population protocol for electing
a leader only has linear convergence time, and it has recently been shown that
no population protocol using a constant number of states per node may overcome
this linear bound. In this paper, we give the first population protocol for leader
election with polylogarithmic convergence time, using polylogarithmic memory states
per node. The protocol structure is quite simple: each node has an associated
value, and is either a leader (still in contention) or a minion (following some
leader). A leader keeps incrementing its value and “defeats” other leaders in
one-to-one interactions, and will drop from contention and become a minion if
it meets a leader with higher value. Importantly, a leader also drops out if it
meets a minion with higher absolute value. While these rules are quite simple,
the proof that this algorithm achieves polylogarithmic convergence time is non-trivial.
In particular, the argument combines careful use of concentration inequalities
with anti-concentration bounds, showing that the leaders’ values become spread
apart as the execution progresses, which in turn implies that straggling leaders
get quickly eliminated. We complement our analysis with empirical results, showing
that our protocol converges extremely fast, even for large network sizes.'
acknowledgement: Support is gratefully acknowledged from the National Science Foundation
under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy
under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.”
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
citation:
ama: 'Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population
protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38'
apa: 'Alistarh, D.-A., & Gelashvili, R. (2015). Polylogarithmic-time leader
election in population protocols (Vol. 9135, pp. 479–491). Presented at the ICALP:
International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-662-47666-6_38'
chicago: Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader
Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38.
ieee: 'D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in
population protocols,” presented at the ICALP: International Colloquium on Automota,
Languages and Programming, 2015, vol. 9135, pp. 479–491.'
ista: 'Alistarh D-A, Gelashvili R. 2015. Polylogarithmic-time leader election in
population protocols. ICALP: International Colloquium on Automota, Languages and
Programming vol. 9135, 479–491.'
mla: Alistarh, Dan-Adrian, and Rati Gelashvili. Polylogarithmic-Time Leader Election
in Population Protocols. Vol. 9135, Springer, 2015, pp. 479–91, doi:10.1007/978-3-662-47666-6_38.
short: D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.
conference:
name: 'ICALP: International Colloquium on Automota, Languages and Programming'
date_created: 2018-12-11T11:48:28Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T13:18:11Z
day: '01'
doi: 10.1007/978-3-662-47666-6_38
extern: '1'
external_id:
arxiv:
- '1502.05745'
intvolume: ' 9135'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.05745
month: '01'
oa: 1
oa_version: Preprint
page: 479 - 491
publication_status: published
publisher: Springer
publist_id: '6877'
status: public
title: Polylogarithmic-time leader election in population protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9135
year: '2015'
...
---
_id: '783'
abstract:
- lang: eng
text: 'The problem of electing a leader from among n contenders is one of the fundamental
questions in distributed computing. In its simplest formulation, the task is as
follows: given n processors, all participants must eventually return a win or
lose indication, such that a single contender may win. Despite a considerable
amount of work on leader election, the following question is still open: can we
elect a leader in an asynchronous fault-prone system faster than just running
a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper,
we answer this question in the affirmative, improving on a decades-old upper bound.
We introduce two new algorithmic ideas to reduce the time complexity of electing
a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application
of our algorithm is a new upper bound for the tight renaming problem, assigning
n items to the n participants in expected O(log2 n) time and O(n2) messages. We
complement our results with lower bound of Ω(n2) messages for solving these two
problems, closing the question of their message complexity.'
acknowledgement: "Support is gratefully acknowledged from the National Science Foundation
under grants CCF-1217921, CCF-1301926,\r\nand IIS-1447786, the Department of
\ Energy under grant\r\nER26116/DE-SC0008923, and the Oracle and Intel corporations.\r\nThe
authors would like to thank Prof. Nir Shavit for ad-\r\nvice and encouragement
during this work, and the anonymous reviewers for their very useful suggestions."
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
citation:
ama: 'Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament.
In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420'
apa: 'Alistarh, D.-A., Gelashvili, R., & Vladu, A. (2015). How to elect a leader
faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC:
Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420'
chicago: Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect
a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.
ieee: 'D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster
than a tournament,” presented at the PODC: Principles of Distributed Computing,
2015, vol. 2015–July, pp. 365–374.'
ista: 'Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than
a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.'
mla: Alistarh, Dan-Adrian, et al. How to Elect a Leader Faster than a Tournament.
Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420.
short: D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.
conference:
name: 'PODC: Principles of Distributed Computing'
date_created: 2018-12-11T11:48:28Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2023-02-23T13:18:55Z
day: '21'
doi: 10.1145/2767386.2767420
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1411.1001
month: '07'
oa: 1
oa_version: None
page: 365 - 374
publication_status: published
publisher: ACM
publist_id: '6875'
status: public
title: How to elect a leader faster than a tournament
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-July
year: '2015'
...
---
_id: '8183'
abstract:
- lang: eng
text: "We study conditions under which a finite simplicial complex $K$ can be mapped
to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding
is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint
simplices of $K$ do not have a common point. We show that if $r$ is not a prime
power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg
conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex
in $\\mathbb R^d$. This improves on previous constructions of counterexamples
(for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P.
Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors.
The counterexamples are obtained by proving the following algebraic criterion
in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there
exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists
a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection
number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero.
This result can be restated in terms of cohomological obstructions or equivariant
maps, and extends an analogous codimension 3 criterion by the second and fourth
authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup
S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M.
Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is
false. We prove a lemma on singular higher-dimensional Borromean rings, yielding
an elementary proof of the counterexample."
acknowledgement: We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M.
Tancer, P. Teichner and anonymous referees for helpful discussions.
article_number: '1511.03501'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: A.
full_name: Skopenkov, A.
last_name: Skopenkov
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv.
apa: Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating
higher-multiplicity intersections, III. Codimension 2. arXiv.
chicago: Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating
Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d.
ieee: S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity
intersections, III. Codimension 2,” arXiv. .
ista: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv, 1511.03501.
mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III.
Codimension 2.” ArXiv, 1511.03501.
short: S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).
date_created: 2020-07-30T10:45:19Z
date_published: 2015-11-15T00:00:00Z
date_updated: 2023-09-07T13:12:17Z
day: '15'
department:
- _id: UlWa
external_id:
arxiv:
- '1511.03501'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03501
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '9308'
relation: later_version
status: public
- id: '10220'
relation: later_version
status: public
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Eliminating higher-multiplicity intersections, III. Codimension 2
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1481'
abstract:
- lang: eng
text: 'Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role
not only in the development of mathematical and logical skills, but also in the
emotional and social development. In this paper, we address the problem of generating
targeted starting positions for such games. This can facilitate new approaches
for bringing novice players to mastery, and also leads to discovery of interesting
game variants. We present an approach that generates starting states of varying
hardness levels for player 1 in a two-player board game, given rules of the board
game, the desired number of steps required for player 1 to win, and the expertise
levels of the two players. Our approach leverages symbolic methods and iterative
simulation to efficiently search the extremely large state space. We present experimental
results that include discovery of states of varying hardness levels for several
simple grid-based board games. The presence of such states for standard game variants
like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played
as the default start state is heavily biased. '
acknowledgement: "A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n"
article_processing_charge: No
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: 'Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting
positions for simple traditional board games. In: Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.'
apa: 'Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation
of alternative starting positions for simple traditional board games. In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp.
745–752). Austin, TX, USA: AAAI Press.'
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation
of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52.
AAAI Press, 2015.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative
starting positions for simple traditional board games,” in Proceedings of the
Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA,
2015, vol. 2, pp. 745–752.
ista: 'Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative
starting positions for simple traditional board games. Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 2, 745–752.'
mla: Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions
for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference
on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.
short: U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.
conference:
end_date: 2015-01-30
location: Austin, TX, USA
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2015-01-25
date_created: 2018-12-11T11:52:16Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:07Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
intvolume: ' 2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300
month: '01'
oa: 1
oa_version: None
page: 745 - 752
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
publication: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '5713'
quality_controlled: '1'
related_material:
record:
- id: '5410'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Automatic generation of alternative starting positions for simple traditional
board games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '1483'
abstract:
- lang: eng
text: Topological data analysis offers a rich source of valuable information to
study vision problems. Yet, so far we lack a theoretically sound connection to
popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In
this work, we establish such a connection by designing a multi-scale kernel for
persistence diagrams, a stable summary representation of topological features
in data. We show that this kernel is positive definite and prove its stability
with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets
for 3D shape classification/retrieval and texture recognition show considerable
performance gains of the proposed method compared to an alternative approach that
is based on the recently introduced persistence landscapes.
author:
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
citation:
ama: 'Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for
topological machine learning. In: IEEE; 2015:4741-4748. doi:10.1109/CVPR.2015.7299106'
apa: 'Reininghaus, J., Huber, S., Bauer, U., & Kwitt, R. (2015). A stable multi-scale
kernel for topological machine learning (pp. 4741–4748). Presented at the CVPR:
Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7299106'
chicago: Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable
Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299106.
ieee: 'J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel
for topological machine learning,” presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.'
ista: 'Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel
for topological machine learning. CVPR: Computer Vision and Pattern Recognition,
4741–4748.'
mla: Reininghaus, Jan, et al. A Stable Multi-Scale Kernel for Topological Machine
Learning. IEEE, 2015, pp. 4741–48, doi:10.1109/CVPR.2015.7299106.
short: J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.
conference:
end_date: 2015-06-12
location: Boston, MA, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:52:17Z
date_published: 2015-10-14T00:00:00Z
date_updated: 2021-01-12T06:51:03Z
day: '14'
department:
- _id: HeEd
doi: 10.1109/CVPR.2015.7299106
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.6821
month: '10'
oa: 1
oa_version: Preprint
page: 4741 - 4748
publication_identifier:
eisbn:
- '978-1-4673-6964-0 '
publication_status: published
publisher: IEEE
publist_id: '5709'
scopus_import: 1
status: public
title: A stable multi-scale kernel for topological machine learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1495'
abstract:
- lang: eng
text: 'Motivated by biological questions, we study configurations of equal-sized
disks in the Euclidean plane that neither pack nor cover. Measuring the quality
by the probability that a random point lies in exactly one disk, we show that
the regular hexagonal grid gives the maximum among lattice configurations. '
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
- first_name: Vitaliy
full_name: Kurlin, Vitaliy
last_name: Kurlin
citation:
ama: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: Proceedings
of the 27th Canadian Conference on Computational Geometry. Vol 2015-August.
Queen’s University; 2015:128-135.'
apa: 'Edelsbrunner, H., Iglesias Ham, M., & Kurlin, V. (2015). Relaxed disk
packing. In Proceedings of the 27th Canadian Conference on Computational Geometry
(Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.'
chicago: Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed
Disk Packing.” In Proceedings of the 27th Canadian Conference on Computational
Geometry, 2015–August:128–35. Queen’s University, 2015.
ieee: H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in
Proceedings of the 27th Canadian Conference on Computational Geometry,
Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.
ista: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings
of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference
on Computational Geometry vol. 2015–August, 128–135.'
mla: Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the
27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s
University, 2015, pp. 128–35.
short: H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th
Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.
conference:
end_date: 2015-08-12
location: Ontario, Canada
name: 'CCCG: Canadian Conference on Computational Geometry'
start_date: 2015-08-10
date_created: 2018-12-11T11:52:21Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:09Z
day: '01'
department:
- _id: HeEd
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1505.03402
month: '08'
oa: 1
oa_version: Submitted Version
page: 128-135
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the 27th Canadian Conference on Computational Geometry
publication_status: published
publisher: Queen's University
publist_id: '5684'
quality_controlled: '1'
scopus_import: 1
status: public
title: Relaxed disk packing
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2015-August
year: '2015'
...
---
_id: '1497'
abstract:
- lang: eng
text: Detecting allelic biases from high-throughput sequencing data requires an
approach that maximises sensitivity while minimizing false positives. Here, we
present Allelome.PRO, an automated user-friendly bioinformatics pipeline, which
uses high-throughput sequencing data from reciprocal crosses of two genetically
distinct mouse strains to detect allele-specific expression and chromatin modifications.
Allelome.PRO extends approaches used in previous studies that exclusively analyzed
imprinted expression to give a complete picture of the ‘allelome’ by automatically
categorising the allelic expression of all genes in a given cell type into imprinted,
strain-biased, biallelic or non-informative. Allelome.PRO offers increased sensitivity
to analyze lowly expressed transcripts, together with a robust false discovery
rate empirically calculated from variation in the sequencing data. We used RNA-seq
data from mouse embryonic fibroblasts from F1 reciprocal crosses to determine
a biologically relevant allelic ratio cutoff, and define for the first time an
entire allelome. Furthermore, we show that Allelome.PRO detects differential enrichment
of H3K4me3 over promoters from ChIP-seq data validating the RNA-seq results. This
approach can be easily extended to analyze histone marks of active enhancers,
or transcription factor binding sites and therefore provides a powerful tool to
identify candidate cis regulatory elements genome wide.
acknowledgement: "Austrian Science Fund [FWF P25185-B22, FWF F4302- B09, FWFW1207-B09].
Funding for open access charge: Austrian Science Fund.\r\nWe thank Florian Breitwieser
for advice during the early stages of this project. High-throughput sequencing was
conducted by the Biomedical Sequencing Facility (BSF) at CeMM in Vienna."
article_number: e146
author:
- first_name: Daniel
full_name: Andergassen, Daniel
last_name: Andergassen
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
- first_name: Tomasz
full_name: Kulinski, Tomasz
last_name: Kulinski
- first_name: Philipp
full_name: Guenzl, Philipp
last_name: Guenzl
- first_name: Philipp
full_name: Bammer, Philipp
last_name: Bammer
- first_name: Denise
full_name: Barlow, Denise
last_name: Barlow
- first_name: Florian
full_name: Pauler, Florian
last_name: Pauler
- first_name: Quanah
full_name: Hudson, Quanah
last_name: Hudson
citation:
ama: Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define
allele-specific genomic features from high-throughput sequencing data. Nucleic
Acids Research. 2015;43(21). doi:10.1093/nar/gkv727
apa: Andergassen, D., Dotter, C., Kulinski, T., Guenzl, P., Bammer, P., Barlow,
D., … Hudson, Q. (2015). Allelome.PRO, a pipeline to define allele-specific genomic
features from high-throughput sequencing data. Nucleic Acids Research.
Oxford University Press. https://doi.org/10.1093/nar/gkv727
chicago: Andergassen, Daniel, Christoph Dotter, Tomasz Kulinski, Philipp Guenzl,
Philipp Bammer, Denise Barlow, Florian Pauler, and Quanah Hudson. “Allelome.PRO,
a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing
Data.” Nucleic Acids Research. Oxford University Press, 2015. https://doi.org/10.1093/nar/gkv727.
ieee: D. Andergassen et al., “Allelome.PRO, a pipeline to define allele-specific
genomic features from high-throughput sequencing data,” Nucleic Acids Research,
vol. 43, no. 21. Oxford University Press, 2015.
ista: Andergassen D, Dotter C, Kulinski T, Guenzl P, Bammer P, Barlow D, Pauler
F, Hudson Q. 2015. Allelome.PRO, a pipeline to define allele-specific genomic
features from high-throughput sequencing data. Nucleic Acids Research. 43(21),
e146.
mla: Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific
Genomic Features from High-Throughput Sequencing Data.” Nucleic Acids Research,
vol. 43, no. 21, e146, Oxford University Press, 2015, doi:10.1093/nar/gkv727.
short: D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow,
F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).
date_created: 2018-12-11T11:52:22Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2021-01-12T06:51:09Z
day: '21'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.1093/nar/gkv727
file:
- access_level: open_access
checksum: 385b83854fd0eb2e4f386867da2823e2
content_type: application/pdf
creator: dernst
date_created: 2018-12-20T14:18:57Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5768'
file_name: 2015_NucleicAcidsRes_Andergassen.pdf
file_size: 6863297
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 43'
issue: '21'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '5682'
quality_controlled: '1'
scopus_import: 1
status: public
title: Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput
sequencing data
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: 43
year: '2015'
...
---
_id: '1498'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly,
due to asynchronous communication and the occurrence of faults, such as the network
dropping messages or computers crashing. Nonetheless there is surprisingly little
language and verification support to build distributed systems based on fault-tolerant
algorithms. In this paper, we present some of the challenges that a designer has
to overcome to implement a fault-tolerant distributed system. Then we review different
models that have been proposed to reason about distributed algorithms and sketch
how such a model can form the basis for a domain-specific programming language.
Adopting a high-level programming model can simplify the programmer's life and
make the code amenable to automated verification, while still compiling to efficiently
executable code. We conclude by summarizing the current status of an ongoing language
design and implementation project that is based on this idea.
alternative_title:
- LIPIcs
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- 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: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant
distributed systems. 2015;32:90-102. doi:10.4230/LIPIcs.SNAPL.2015.90
apa: 'Dragoi, C., Henzinger, T. A., & Zufferey, D. (2015). The need for language
support for fault-tolerant distributed systems. Presented at the SNAPL: Summit
oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90'
chicago: Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for
Language Support for Fault-Tolerant Distributed Systems.” Leibniz International
Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90.
ieee: C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support
for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, pp. 90–102, 2015.
ista: Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for
fault-tolerant distributed systems. 32, 90–102.
mla: Dragoi, Cezara, et al. The Need for Language Support for Fault-Tolerant
Distributed Systems. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015, pp. 90–102, doi:10.4230/LIPIcs.SNAPL.2015.90.
short: C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.
conference:
end_date: 2015-05-06
location: Asilomar, CA, United States
name: 'SNAPL: Summit oN Advances in Programming Languages'
start_date: 2015-05-03
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2020-08-11T10:09:14Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.SNAPL.2015.90
ec_funded: 1
file:
- access_level: open_access
checksum: cf5e94baa89a2dc4c5de01abc676eda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:02Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5050'
file_name: IST-2016-499-v1+1_9.pdf
file_size: 489362
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 32'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 90 - 102
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- '978-3-939897-80-4 '
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5681'
pubrep_id: '499'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: The need for language support for fault-tolerant distributed systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2015'
...
---
_id: '1499'
abstract:
- lang: eng
text: "We consider weighted automata with both positive and negative integer weights
on edges and\r\nstudy the problem of synchronization using adaptive strategies
that may only observe whether\r\nthe current weight-level is negative or nonnegative.
We show that the synchronization problem is decidable in polynomial time for deterministic
weighted automata."
acknowledgement: "The research leading to these results has received funding from
the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement
601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center
IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM),
the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein
Award), the Czech Science Foundation under grant agreement P202/12/G061, and People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme
(FP7/2007-2013) REA Grant No 291734."
alternative_title:
- LIPIcs
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Kim
full_name: Larsen, Kim
last_name: Larsen
- first_name: Simon
full_name: Laursen, Simon
last_name: Laursen
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: 'Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of
weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2015:142-154. doi:10.4230/LIPIcs.CONCUR.2015.142'
apa: 'Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial
time decidability of weighted synchronization under partial observability (Vol.
42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142'
chicago: Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time
Decidability of Weighted Synchronization under Partial Observability,” 42:142–54.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.
ieee: 'J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability
of weighted synchronization under partial observability,” presented at the CONCUR:
Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.'
ista: 'Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability
of weighted synchronization under partial observability. CONCUR: Concurrency Theory,
LIPIcs, vol. 42, 142–154.'
mla: Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization
under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.
short: J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2015, pp. 142–154.
conference:
end_date: 2015-09-04
location: Madrid, Spain
name: 'CONCUR: Concurrency Theory'
start_date: 2015-09-01
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:10Z
day: '01'
ddc:
- '000'
- '003'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2015.142
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:12Z
date_updated: 2020-07-14T12:44:58Z
file_id: '4672'
file_name: IST-2016-498-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 42'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 142 - 154
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: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5680'
pubrep_id: '498'
quality_controlled: '1'
scopus_import: 1
status: public
title: Polynomial time decidability of weighted synchronization under partial observability
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
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).'
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.
date_created: 2018-12-11T11:52:23Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-015-0235-2
ec_funded: 1
intvolume: ' 47'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
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 '
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: 2023-09-07T11:58:33Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1145/2737166.2737175
ec_funded: 1
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'
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: The Wittgenstein Prize
- _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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1503'
abstract:
- lang: eng
text: A Herman-Avila-Bochi type formula is obtained for the average sum of the top
d Lyapunov exponents over a one-parameter family of double-struck G-cocycles,
where double-struck G is the group that leaves a certain, non-degenerate Hermitian
form of signature (c, d) invariant. The generic example of such a group is the
pseudo-unitary group U(c, d) or, in the case c = d, the Hermitian-symplectic group
HSp(2d) which naturally appears for cocycles related to Schrödinger operators.
In the case d = 1, the formula for HSp(2d) cocycles reduces to the Herman-Avila-Bochi
formula for SL(2, ℝ) cocycles.
author:
- first_name: Christian
full_name: Sadel, Christian
id: 4760E9F8-F248-11E8-B48F-1D18A9856A87
last_name: Sadel
orcid: 0000-0001-8255-3968
citation:
ama: Sadel C. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems.
2015;35(5):1582-1591. doi:10.1017/etds.2013.103
apa: Sadel, C. (2015). A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems.
Cambridge University Press. https://doi.org/10.1017/etds.2013.103
chicago: Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional
Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” Ergodic Theory and Dynamical
Systems. Cambridge University Press, 2015. https://doi.org/10.1017/etds.2013.103.
ieee: C. Sadel, “A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles,” Ergodic Theory and Dynamical Systems,
vol. 35, no. 5. Cambridge University Press, pp. 1582–1591, 2015.
ista: Sadel C. 2015. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems. 35(5),
1582–1591.
mla: Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary
and Hermitian-Symplectic-Cocycles.” Ergodic Theory and Dynamical Systems,
vol. 35, no. 5, Cambridge University Press, 2015, pp. 1582–91, doi:10.1017/etds.2013.103.
short: C. Sadel, Ergodic Theory and Dynamical Systems 35 (2015) 1582–1591.
date_created: 2018-12-11T11:52:24Z
date_published: 2015-03-14T00:00:00Z
date_updated: 2021-01-12T06:51:13Z
day: '14'
doi: 10.1017/etds.2013.103
extern: '1'
intvolume: ' 35'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1307.8414
month: '03'
oa: 1
oa_version: Preprint
page: 1582 - 1591
publication: Ergodic Theory and Dynamical Systems
publication_status: published
publisher: Cambridge University Press
publist_id: '5675'
quality_controlled: '1'
status: public
title: A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2015'
...
---
_id: '1504'
abstract:
- lang: eng
text: Let Q = (Q1, . . . , Qn) be a random vector drawn from the uniform distribution
on the set of all n! permutations of {1, 2, . . . , n}. Let Z = (Z1, . . . , Zn),
where Zj is the mean zero variance one random variable obtained by centralizing
and normalizing Qj , j = 1, . . . , n. Assume that Xi , i = 1, . . . ,p are i.i.d.
copies of 1/√ p Z and X = Xp,n is the p × n random matrix with Xi as its ith row.
Then Sn = XX is called the p × n Spearman's rank correlation matrix which can
be regarded as a high dimensional extension of the classical nonparametric statistic
Spearman's rank correlation coefficient between two independent random variables.
In this paper, we establish a CLT for the linear spectral statistics of this nonparametric
random matrix model in the scenario of high dimension, namely, p = p(n) and p/n→c
∈ (0,∞) as n→∞.We propose a novel evaluation scheme to estimate the core quantity
in Anderson and Zeitouni's cumulant method in [Ann. Statist. 36 (2008) 2553-2576]
to bypass the so-called joint cumulant summability. In addition, we raise a two-step
comparison approach to obtain the explicit formulae for the mean and covariance
functions in the CLT. Relying on this CLT, we then construct a distribution-free
statistic to test complete independence for components of random vectors. Owing
to the nonparametric property, we can use this test on generally distributed random
variables including the heavy-tailed ones.
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Liang
full_name: Lin, Liang
last_name: Lin
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Lin L, Pan G, Zhou W. Spectral statistics of large dimensional spearman
s rank correlation matrix and its application. Annals of Statistics. 2015;43(6):2588-2623.
doi:10.1214/15-AOS1353
apa: Bao, Z., Lin, L., Pan, G., & Zhou, W. (2015). Spectral statistics of large
dimensional spearman s rank correlation matrix and its application. Annals
of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/15-AOS1353
chicago: Bao, Zhigang, Liang Lin, Guangming Pan, and Wang Zhou. “Spectral Statistics
of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.”
Annals of Statistics. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/15-AOS1353.
ieee: Z. Bao, L. Lin, G. Pan, and W. Zhou, “Spectral statistics of large dimensional
spearman s rank correlation matrix and its application,” Annals of Statistics,
vol. 43, no. 6. Institute of Mathematical Statistics, pp. 2588–2623, 2015.
ista: Bao Z, Lin L, Pan G, Zhou W. 2015. Spectral statistics of large dimensional
spearman s rank correlation matrix and its application. Annals of Statistics.
43(6), 2588–2623.
mla: Bao, Zhigang, et al. “Spectral Statistics of Large Dimensional Spearman s Rank
Correlation Matrix and Its Application.” Annals of Statistics, vol. 43,
no. 6, Institute of Mathematical Statistics, 2015, pp. 2588–623, doi:10.1214/15-AOS1353.
short: Z. Bao, L. Lin, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 2588–2623.
date_created: 2018-12-11T11:52:24Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
doi: 10.1214/15-AOS1353
extern: '1'
intvolume: ' 43'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.5119
month: '12'
oa: 1
oa_version: Published Version
page: 2588 - 2623
publication: Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5674'
quality_controlled: '1'
status: public
title: Spectral statistics of large dimensional spearman s rank correlation matrix
and its application
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2015'
...
---
_id: '1505'
abstract:
- lang: eng
text: This paper is aimed at deriving the universality of the largest eigenvalue
of a class of high-dimensional real or complex sample covariance matrices of the
form W N =Σ 1/2XX∗Σ 1/2 . Here, X = (xij )M,N is an M× N random matrix with independent
entries xij , 1 ≤ i M,≤ 1 ≤ j ≤ N such that Exij = 0, E|xij |2 = 1/N . On dimensionality,
we assume that M = M(N) and N/M → d ε (0, ∞) as N ∞→. For a class of general deterministic
positive-definite M × M matrices Σ , under some additional assumptions on the
distribution of xij 's, we show that the limiting behavior of the largest eigenvalue
of W N is universal, via pursuing a Green function comparison strategy raised
in [Probab. Theory Related Fields 154 (2012) 341-407, Adv. Math. 229 (2012) 1435-1515]
by Erd″os, Yau and Yin for Wigner matrices and extended by Pillai and Yin [Ann.
Appl. Probab. 24 (2014) 935-1001] to sample covariance matrices in the null case
(&Epsi = I ). Consequently, in the standard complex case (Ex2 ij = 0), combing
this universality property and the results known for Gaussian matrices obtained
by El Karoui in [Ann. Probab. 35 (2007) 663-714] (nonsingular case) and Onatski
in [Ann. Appl. Probab. 18 (2008) 470-490] (singular case), we show that after
an appropriate normalization the largest eigenvalue of W N converges weakly to
the type 2 Tracy-Widom distribution TW2 . Moreover, in the real case, we show
that whenΣ is spiked with a fixed number of subcritical spikes, the type 1 Tracy-Widom
limit TW1 holds for the normalized largest eigenvalue of W N , which extends a
result of Féral and Péché in [J. Math. Phys. 50 (2009) 073302] to the scenario
of nondiagonal Σ and more generally distributed X . In summary, we establish the
Tracy-Widom type universality for the largest eigenvalue of generally distributed
sample covariance matrices under quite light assumptions on &Sigma . Applications
of these limiting results to statistical signal detection and structure recognition
of separable covariance matrices are also discussed.
acknowledgement: "B.Z. was supported in part by NSFC Grant 11071213, ZJNSF
\ Grant R6090034 and SRFDP Grant 20100101110001. P.G. was supported in part
by the Ministry of Education, Singapore, under Grant ARC 14/11. Z.W. was supported
\ in part by the Ministry of Education, Singapore, under Grant ARC 14/11,
\ and by a Grant R-155-000-131-112 at the National University of Singapore\r\n"
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Pan G, Zhou W. Universality for the largest eigenvalue of sample covariance
matrices with general population. Annals of Statistics. 2015;43(1):382-421.
doi:10.1214/14-AOS1281
apa: Bao, Z., Pan, G., & Zhou, W. (2015). Universality for the largest eigenvalue
of sample covariance matrices with general population. Annals of Statistics.
Institute of Mathematical Statistics. https://doi.org/10.1214/14-AOS1281
chicago: Bao, Zhigang, Guangming Pan, and Wang Zhou. “Universality for the Largest
Eigenvalue of Sample Covariance Matrices with General Population.” Annals of
Statistics. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/14-AOS1281.
ieee: Z. Bao, G. Pan, and W. Zhou, “Universality for the largest eigenvalue of sample
covariance matrices with general population,” Annals of Statistics, vol.
43, no. 1. Institute of Mathematical Statistics, pp. 382–421, 2015.
ista: Bao Z, Pan G, Zhou W. 2015. Universality for the largest eigenvalue of sample
covariance matrices with general population. Annals of Statistics. 43(1), 382–421.
mla: Bao, Zhigang, et al. “Universality for the Largest Eigenvalue of Sample Covariance
Matrices with General Population.” Annals of Statistics, vol. 43, no. 1,
Institute of Mathematical Statistics, 2015, pp. 382–421, doi:10.1214/14-AOS1281.
short: Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.
date_created: 2018-12-11T11:52:25Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/14-AOS1281
intvolume: ' 43'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1304.5690
month: '02'
oa: 1
oa_version: Preprint
page: 382 - 421
publication: Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5672'
quality_controlled: '1'
status: public
title: Universality for the largest eigenvalue of sample covariance matrices with
general population
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2015'
...
---
_id: '1506'
abstract:
- lang: eng
text: Consider the square random matrix An = (aij)n,n, where {aij:= a(n)ij , i,
j = 1, . . . , n} is a collection of independent real random variables with means
zero and variances one. Under the additional moment condition supn max1≤i,j ≤n
Ea4ij <∞, we prove Girko's logarithmic law of det An in the sense that as n→∞
log | detAn| ? (1/2) log(n-1)! d/→√(1/2) log n N(0, 1).
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Pan G, Zhou W. The logarithmic law of random determinant. Bernoulli.
2015;21(3):1600-1628. doi:10.3150/14-BEJ615
apa: Bao, Z., Pan, G., & Zhou, W. (2015). The logarithmic law of random determinant.
Bernoulli. Bernoulli Society for Mathematical Statistics and Probability.
https://doi.org/10.3150/14-BEJ615
chicago: Bao, Zhigang, Guangming Pan, and Wang Zhou. “The Logarithmic Law of Random
Determinant.” Bernoulli. Bernoulli Society for Mathematical Statistics
and Probability, 2015. https://doi.org/10.3150/14-BEJ615.
ieee: Z. Bao, G. Pan, and W. Zhou, “The logarithmic law of random determinant,”
Bernoulli, vol. 21, no. 3. Bernoulli Society for Mathematical Statistics
and Probability, pp. 1600–1628, 2015.
ista: Bao Z, Pan G, Zhou W. 2015. The logarithmic law of random determinant. Bernoulli.
21(3), 1600–1628.
mla: Bao, Zhigang, et al. “The Logarithmic Law of Random Determinant.” Bernoulli,
vol. 21, no. 3, Bernoulli Society for Mathematical Statistics and Probability,
2015, pp. 1600–28, doi:10.3150/14-BEJ615.
short: Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628.
date_created: 2018-12-11T11:52:25Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
department:
- _id: LaEr
doi: 10.3150/14-BEJ615
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1208.5823
month: '08'
oa: 1
oa_version: Preprint
page: 1600 - 1628
publication: Bernoulli
publication_status: published
publisher: Bernoulli Society for Mathematical Statistics and Probability
publist_id: '5671'
quality_controlled: '1'
status: public
title: The logarithmic law of random determinant
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2015'
...