---
_id: '17694'
abstract:
- lang: eng
text: Constraining the properties of Population III (Pop III) stars will be very
challenging because they reside in small galaxies at high redshift which will
be difficult to directly detect. In this paper, we suggest that intensity mapping
may be a promising method to study Pop III stars. Intensity mapping is a technique
proposed to measure large-scale fluctuations of galaxy line emission in three
dimensions without resolving individual sources. This technique is well suited
for observing many faint galaxies because it can measure their cumulative emission
even if they cannot be directly detected. We focus on intensity mapping of He
ii recombination lines. These lines are much stronger in Pop III stars than Pop
II stars because the harder spectra of Pop III stars are expected to produce many
He ii ionizing photons. Measuring the He ii 1640 Å intensity mapping signal, along
with the signals from other lines such as Lyα, Hα, and metal lines, could give
constraints on the initial mass function (IMF) and star formation rate density
of Pop III stars as a function of redshift. To demonstrate the feasibility of
these observations, we estimate the strength of the Pop III He ii 1640 Å intensity
mapping signal from z = 10–20. We show that at z ≈ 10, the signal could be measured
accurately by two different hypothetical future instruments, one which cross-correlates
He ii 1640 Å with CO(1–0) line emission from galaxies and the other with 21 cm
emission from the intergalactic medium.
article_processing_charge: No
article_type: original
author:
- first_name: Eli
full_name: Visbal, Eli
last_name: Visbal
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
- first_name: Greg L.
full_name: Bryan, Greg L.
last_name: Bryan
citation:
ama: Visbal E, Haiman Z, Bryan GL. Looking for Population III stars with He ii line
intensity mapping. Monthly Notices of the Royal Astronomical Society. 2015;450(3):2506-2513.
doi:10.1093/mnras/stv785
apa: Visbal, E., Haiman, Z., & Bryan, G. L. (2015). Looking for Population III
stars with He ii line intensity mapping. Monthly Notices of the Royal Astronomical
Society. Oxford University Press. https://doi.org/10.1093/mnras/stv785
chicago: Visbal, Eli, Zoltán Haiman, and Greg L. Bryan. “Looking for Population
III Stars with He Ii Line Intensity Mapping.” Monthly Notices of the Royal
Astronomical Society. Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv785.
ieee: E. Visbal, Z. Haiman, and G. L. Bryan, “Looking for Population III stars with
He ii line intensity mapping,” Monthly Notices of the Royal Astronomical Society,
vol. 450, no. 3. Oxford University Press, pp. 2506–2513, 2015.
ista: Visbal E, Haiman Z, Bryan GL. 2015. Looking for Population III stars with
He ii line intensity mapping. Monthly Notices of the Royal Astronomical Society.
450(3), 2506–2513.
mla: Visbal, Eli, et al. “Looking for Population III Stars with He Ii Line Intensity
Mapping.” Monthly Notices of the Royal Astronomical Society, vol. 450,
no. 3, Oxford University Press, 2015, pp. 2506–13, doi:10.1093/mnras/stv785.
short: E. Visbal, Z. Haiman, G.L. Bryan, Monthly Notices of the Royal Astronomical
Society 450 (2015) 2506–2513.
date_created: 2024-09-06T08:40:33Z
date_published: 2015-05-06T00:00:00Z
date_updated: 2024-09-25T10:05:24Z
day: '06'
doi: 10.1093/mnras/stv785
extern: '1'
intvolume: ' 450'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/mnras/stv785
month: '05'
oa: 1
oa_version: Published Version
page: 2506-2513
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
issn:
- 0035-8711
- 1365-2966
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Looking for Population III stars with He ii line intensity mapping
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 450
year: '2015'
...
---
_id: '17702'
abstract:
- lang: eng
text: Weak gravitational lensing is a powerful cosmological probe, with non--Gaussian
features potentially containing the majority of the information. We examine constraints
on the parameter triplet (Ωm,w,σ8) from non-Gaussian features of the weak lensing
convergence field, including a set of moments (up to 4th order) and Minkowski
functionals, using publicly available data from the 154deg2 CFHTLenS survey. We
utilize a suite of ray--tracing N-body simulations spanning 91 points in (Ωm,w,σ8)
parameter space, replicating the galaxy sky positions, redshifts and shape noise
in the CFHTLenS catalogs. We then build an emulator that interpolates the simulated
descriptors as a function of (Ωm,w,σ8), and use it to compute the likelihood function
and parameter constraints. We employ a principal component analysis to reduce
dimensionality and to help stabilize the constraints with respect to the number
of bins used to construct each statistic. Using the full set of statistics, we
find Σ8≡σ8(Ωm/0.27)^0.55=0.75±0.04 (68% C.L.), in agreement with previous values.
We find that constraints on the (Ωm,σ8) doublet from the Minkowski functionals
suffer a strong bias. However, high-order moments break the (Ωm,σ8) degeneracy
and provide a tight constraint on these parameters with no apparent bias. The
main contribution comes from quartic moments of derivatives.
article_number: '103511'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Andrea
full_name: Petri, Andrea
last_name: Petri
- first_name: Jia
full_name: Liu, Jia
last_name: Liu
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
- first_name: Morgan
full_name: May, Morgan
last_name: May
- first_name: Lam
full_name: Hui, Lam
last_name: Hui
- first_name: Jan M.
full_name: Kratochvil, Jan M.
last_name: Kratochvil
citation:
ama: 'Petri A, Liu J, Haiman Z, May M, Hui L, Kratochvil JM. Emulating the CFHTLenS
weak lensing data: Cosmological constraints from moments and Minkowski functionals.
Physical Review D. 2015;91(10). doi:10.1103/physrevd.91.103511'
apa: 'Petri, A., Liu, J., Haiman, Z., May, M., Hui, L., & Kratochvil, J. M.
(2015). Emulating the CFHTLenS weak lensing data: Cosmological constraints from
moments and Minkowski functionals. Physical Review D. American Physical
Society. https://doi.org/10.1103/physrevd.91.103511'
chicago: 'Petri, Andrea, Jia Liu, Zoltán Haiman, Morgan May, Lam Hui, and Jan M.
Kratochvil. “Emulating the CFHTLenS Weak Lensing Data: Cosmological Constraints
from Moments and Minkowski Functionals.” Physical Review D. American Physical
Society, 2015. https://doi.org/10.1103/physrevd.91.103511.'
ieee: 'A. Petri, J. Liu, Z. Haiman, M. May, L. Hui, and J. M. Kratochvil, “Emulating
the CFHTLenS weak lensing data: Cosmological constraints from moments and Minkowski
functionals,” Physical Review D, vol. 91, no. 10. American Physical Society,
2015.'
ista: 'Petri A, Liu J, Haiman Z, May M, Hui L, Kratochvil JM. 2015. Emulating the
CFHTLenS weak lensing data: Cosmological constraints from moments and Minkowski
functionals. Physical Review D. 91(10), 103511.'
mla: 'Petri, Andrea, et al. “Emulating the CFHTLenS Weak Lensing Data: Cosmological
Constraints from Moments and Minkowski Functionals.” Physical Review D,
vol. 91, no. 10, 103511, American Physical Society, 2015, doi:10.1103/physrevd.91.103511.'
short: A. Petri, J. Liu, Z. Haiman, M. May, L. Hui, J.M. Kratochvil, Physical Review
D 91 (2015).
date_created: 2024-09-06T08:48:07Z
date_published: 2015-05-15T00:00:00Z
date_updated: 2024-09-25T11:29:05Z
day: '15'
doi: 10.1103/physrevd.91.103511
extern: '1'
external_id:
arxiv:
- '1503.06214'
intvolume: ' 91'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1503.06214'
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review D
publication_identifier:
issn:
- 1550-7998
- 1550-2368
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Emulating the CFHTLenS weak lensing data: Cosmological constraints from moments
and Minkowski functionals'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 91
year: '2015'
...
---
_id: '17710'
abstract:
- lang: eng
text: Lensing peaks have been proposed as a useful statistic, containing cosmological
information from non-Gaussianities that is inaccessible from traditional two-point
statistics such as the power spectrum or two-point correlation functions. Here
we examine constraints on cosmological parameters from weak lensing peak counts,
using the publicly available data from the 154 deg^2 CFHTLenS survey. We utilize
a new suite of ray-tracing N-body simulations on a grid of 91 cosmological models,
covering broad ranges of the three parameters Ωm, σ8, and w, and replicating the
Galaxy sky positions, redshifts, and shape noise in the CFHTLenS observations.
We then build an emulator that interpolates the power spectrum and the peak counts
to an accuracy of ≤5%, and compute the likelihood in the three-dimensional parameter
space (Ωm, σ8, w) from both observables. We find that constraints from peak counts
are comparable to those from the power spectrum, and somewhat tighter when different
smoothing scales are combined. Neither observable can constrain w without external
data. When the power spectrum and peak counts are combined, the area of the error
"banana'' in the (Ωm, σ8) plane reduces by a factor of ≈2, compared to using the
power spectrum alone. For a flat Λ cold dark matter model, combining both statistics,
we obtain the constraint σ8(Ωm/0.27)^0.63=0.85+0.03−0.03.
article_number: '063507'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jia
full_name: Liu, Jia
last_name: Liu
- first_name: Andrea
full_name: Petri, Andrea
last_name: Petri
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
- first_name: Lam
full_name: Hui, Lam
last_name: Hui
- first_name: Jan M.
full_name: Kratochvil, Jan M.
last_name: Kratochvil
- first_name: Morgan
full_name: May, Morgan
last_name: May
citation:
ama: Liu J, Petri A, Haiman Z, Hui L, Kratochvil JM, May M. Cosmology constraints
from the weak lensing peak counts and the power spectrum in CFHTLenS data. Physical
Review D. 2015;91(6). doi:10.1103/physrevd.91.063507
apa: Liu, J., Petri, A., Haiman, Z., Hui, L., Kratochvil, J. M., & May, M. (2015).
Cosmology constraints from the weak lensing peak counts and the power spectrum
in CFHTLenS data. Physical Review D. American Physical Society. https://doi.org/10.1103/physrevd.91.063507
chicago: Liu, Jia, Andrea Petri, Zoltán Haiman, Lam Hui, Jan M. Kratochvil, and
Morgan May. “Cosmology Constraints from the Weak Lensing Peak Counts and the Power
Spectrum in CFHTLenS Data.” Physical Review D. American Physical Society,
2015. https://doi.org/10.1103/physrevd.91.063507.
ieee: J. Liu, A. Petri, Z. Haiman, L. Hui, J. M. Kratochvil, and M. May, “Cosmology
constraints from the weak lensing peak counts and the power spectrum in CFHTLenS
data,” Physical Review D, vol. 91, no. 6. American Physical Society, 2015.
ista: Liu J, Petri A, Haiman Z, Hui L, Kratochvil JM, May M. 2015. Cosmology constraints
from the weak lensing peak counts and the power spectrum in CFHTLenS data. Physical
Review D. 91(6), 063507.
mla: Liu, Jia, et al. “Cosmology Constraints from the Weak Lensing Peak Counts and
the Power Spectrum in CFHTLenS Data.” Physical Review D, vol. 91, no. 6,
063507, American Physical Society, 2015, doi:10.1103/physrevd.91.063507.
short: J. Liu, A. Petri, Z. Haiman, L. Hui, J.M. Kratochvil, M. May, Physical Review
D 91 (2015).
date_created: 2024-09-06T08:54:57Z
date_published: 2015-03-04T00:00:00Z
date_updated: 2024-09-25T12:03:54Z
day: '04'
doi: 10.1103/physrevd.91.063507
extern: '1'
external_id:
arxiv:
- '1412.0757'
intvolume: ' 91'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1412.0757'
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review D
publication_identifier:
issn:
- 1550-7998
- 1550-2368
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cosmology constraints from the weak lensing peak counts and the power spectrum
in CFHTLenS data
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 91
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: '7742'
abstract:
- lang: eng
text: Across-nation differences in the mean values for complex traits are common1,2,3,4,5,6,7,8,
but the reasons for these differences are unknown. Here we find that many independent
loci contribute to population genetic differences in height and body mass index
(BMI) in 9,416 individuals across 14 European countries. Using discovery data
on over 250,000 individuals and unbiased effect size estimates from 17,500 sibling
pairs, we estimate that 24% (95% credible interval (CI) = 9%, 41%) and 8% (95%
CI = 4%, 16%) of the captured additive genetic variance for height and BMI, respectively,
reflect population genetic differences. Population genetic divergence differed
significantly from that in a null model (height, P < 3.94 × 10−8; BMI, P < 5.95
× 10−4), and we find an among-population genetic correlation for tall and slender
individuals (r = −0.80, 95% CI = −0.95, −0.60), consistent with correlated selection
for both phenotypes. Observed differences in height among populations reflected
the predicted genetic means (r = 0.51; P < 0.001), but environmental differences
across Europe masked genetic differentiation for BMI (P < 0.58).
article_processing_charge: No
article_type: original
author:
- 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: Gibran
full_name: Hemani, Gibran
last_name: Hemani
- first_name: Carolina
full_name: Medina-Gomez, Carolina
last_name: Medina-Gomez
- first_name: Massimo
full_name: Mezzavilla, Massimo
last_name: Mezzavilla
- first_name: Tonu
full_name: Esko, Tonu
last_name: Esko
- first_name: Konstantin
full_name: Shakhbazov, Konstantin
last_name: Shakhbazov
- first_name: Joseph E
full_name: Powell, Joseph E
last_name: Powell
- first_name: Anna
full_name: Vinkhuyzen, Anna
last_name: Vinkhuyzen
- first_name: Sonja I
full_name: Berndt, Sonja I
last_name: Berndt
- first_name: Stefan
full_name: Gustafsson, Stefan
last_name: Gustafsson
- first_name: Anne E
full_name: Justice, Anne E
last_name: Justice
- first_name: Bratati
full_name: Kahali, Bratati
last_name: Kahali
- first_name: Adam E
full_name: Locke, Adam E
last_name: Locke
- first_name: Tune H
full_name: Pers, Tune H
last_name: Pers
- first_name: Sailaja
full_name: Vedantam, Sailaja
last_name: Vedantam
- first_name: Andrew R
full_name: Wood, Andrew R
last_name: Wood
- first_name: Wouter
full_name: van Rheenen, Wouter
last_name: van Rheenen
- first_name: Ole A
full_name: Andreassen, Ole A
last_name: Andreassen
- first_name: Paolo
full_name: Gasparini, Paolo
last_name: Gasparini
- first_name: Andres
full_name: Metspalu, Andres
last_name: Metspalu
- first_name: Leonard H van den
full_name: Berg, Leonard H van den
last_name: Berg
- first_name: Jan H
full_name: Veldink, Jan H
last_name: Veldink
- first_name: Fernando
full_name: Rivadeneira, Fernando
last_name: Rivadeneira
- first_name: Thomas M
full_name: Werge, Thomas M
last_name: Werge
- first_name: Goncalo R
full_name: Abecasis, Goncalo R
last_name: Abecasis
- first_name: Dorret I
full_name: Boomsma, Dorret I
last_name: Boomsma
- first_name: Daniel I
full_name: Chasman, Daniel I
last_name: Chasman
- first_name: Eco J C
full_name: de Geus, Eco J C
last_name: de Geus
- first_name: Timothy M
full_name: Frayling, Timothy M
last_name: Frayling
- first_name: Joel N
full_name: Hirschhorn, Joel N
last_name: Hirschhorn
- first_name: Jouke Jan
full_name: Hottenga, Jouke Jan
last_name: Hottenga
- first_name: Erik
full_name: Ingelsson, Erik
last_name: Ingelsson
- first_name: Ruth J F
full_name: Loos, Ruth J F
last_name: Loos
- first_name: Patrik K E
full_name: Magnusson, Patrik K E
last_name: Magnusson
- first_name: Nicholas G
full_name: Martin, Nicholas G
last_name: Martin
- first_name: Grant W
full_name: Montgomery, Grant W
last_name: Montgomery
- first_name: Kari E
full_name: North, Kari E
last_name: North
- first_name: Nancy L
full_name: Pedersen, Nancy L
last_name: Pedersen
- first_name: Timothy D
full_name: Spector, Timothy D
last_name: Spector
- first_name: Elizabeth K
full_name: Speliotes, Elizabeth K
last_name: Speliotes
- first_name: Michael E
full_name: Goddard, Michael E
last_name: Goddard
- first_name: Jian
full_name: Yang, Jian
last_name: Yang
- first_name: Peter M
full_name: Visscher, Peter M
last_name: Visscher
citation:
ama: Robinson MR, Hemani G, Medina-Gomez C, et al. Population genetic differentiation
of height and body mass index across Europe. Nature Genetics. 2015;47(11):1357-1362.
doi:10.1038/ng.3401
apa: Robinson, M. R., Hemani, G., Medina-Gomez, C., Mezzavilla, M., Esko, T., Shakhbazov,
K., … Visscher, P. M. (2015). Population genetic differentiation of height and
body mass index across Europe. Nature Genetics. Springer Nature. https://doi.org/10.1038/ng.3401
chicago: Robinson, Matthew Richard, Gibran Hemani, Carolina Medina-Gomez, Massimo
Mezzavilla, Tonu Esko, Konstantin Shakhbazov, Joseph E Powell, et al. “Population
Genetic Differentiation of Height and Body Mass Index across Europe.” Nature
Genetics. Springer Nature, 2015. https://doi.org/10.1038/ng.3401.
ieee: M. R. Robinson et al., “Population genetic differentiation of height
and body mass index across Europe,” Nature Genetics, vol. 47, no. 11. Springer
Nature, pp. 1357–1362, 2015.
ista: Robinson MR, Hemani G, Medina-Gomez C, Mezzavilla M, Esko T, Shakhbazov K,
Powell JE, Vinkhuyzen A, Berndt SI, Gustafsson S, Justice AE, Kahali B, Locke
AE, Pers TH, Vedantam S, Wood AR, van Rheenen W, Andreassen OA, Gasparini P, Metspalu
A, Berg LH van den, Veldink JH, Rivadeneira F, Werge TM, Abecasis GR, Boomsma
DI, Chasman DI, de Geus EJC, Frayling TM, Hirschhorn JN, Hottenga JJ, Ingelsson
E, Loos RJF, Magnusson PKE, Martin NG, Montgomery GW, North KE, Pedersen NL, Spector
TD, Speliotes EK, Goddard ME, Yang J, Visscher PM. 2015. Population genetic differentiation
of height and body mass index across Europe. Nature Genetics. 47(11), 1357–1362.
mla: Robinson, Matthew Richard, et al. “Population Genetic Differentiation of Height
and Body Mass Index across Europe.” Nature Genetics, vol. 47, no. 11, Springer
Nature, 2015, pp. 1357–62, doi:10.1038/ng.3401.
short: M.R. Robinson, G. Hemani, C. Medina-Gomez, M. Mezzavilla, T. Esko, K. Shakhbazov,
J.E. Powell, A. Vinkhuyzen, S.I. Berndt, S. Gustafsson, A.E. Justice, B. Kahali,
A.E. Locke, T.H. Pers, S. Vedantam, A.R. Wood, W. van Rheenen, O.A. Andreassen,
P. Gasparini, A. Metspalu, L.H. van den Berg, J.H. Veldink, F. Rivadeneira, T.M.
Werge, G.R. Abecasis, D.I. Boomsma, D.I. Chasman, E.J.C. de Geus, T.M. Frayling,
J.N. Hirschhorn, J.J. Hottenga, E. Ingelsson, R.J.F. Loos, P.K.E. Magnusson, N.G.
Martin, G.W. Montgomery, K.E. North, N.L. Pedersen, T.D. Spector, E.K. Speliotes,
M.E. Goddard, J. Yang, P.M. Visscher, Nature Genetics 47 (2015) 1357–1362.
date_created: 2020-04-30T10:58:23Z
date_published: 2015-09-14T00:00:00Z
date_updated: 2021-01-12T08:15:13Z
day: '14'
doi: 10.1038/ng.3401
extern: '1'
intvolume: ' 47'
issue: '11'
language:
- iso: eng
month: '09'
oa_version: None
page: 1357-1362
publication: Nature Genetics
publication_identifier:
issn:
- 1061-4036
- 1546-1718
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Population genetic differentiation of height and body mass index across Europe
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2015'
...
---
_id: '776'
abstract:
- lang: eng
text: High-performance concurrent priority queues are essential for applications
such as task scheduling and discrete event simulation. Unfortunately, even the
best performing implementations do not scale past a number of threads in the single
digits. This is because of the sequential bottleneck in accessing the elements
at the head of the queue in order to perform a DeleteMin operation. In this paper,
we present the SprayList, a scalable priority queue with relaxed ordering semantics.
Starting from a non-blocking SkipList, the main innovation behind our design is
that the DeleteMin operations avoid a sequential bottleneck by "spraying"
themselves onto the head of the SkipList list in a coordinated fashion. The spraying
is implemented using a carefully designed random walk, so that DeleteMin returns
an element among the first O(plog3p) in the list, with high probability, where
p is the number of threads. We prove that the running time of a DeleteMin operation
is O(log3p), with high probability, independent of the size of the list. Our experiments
show that the relaxed semantics allow the data structure to scale for high thread
counts, comparable to a classic unordered SkipList. Furthermore, we observe that,
for reasonably parallel workloads, the scalability benefits of relaxation considerably
outweigh the additional work due to out-of-order execution.
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\r\nand Intel corporations."
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: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Kopinsky J, Li J, Shavit N. The SprayList: A scalable relaxed
priority queue. In: Vol 2015-January. ACM; 2015:11-20. doi:10.1145/2688500.2688523'
apa: 'Alistarh, D.-A., Kopinsky, J., Li, J., & Shavit, N. (2015). The SprayList:
A scalable relaxed priority queue (Vol. 2015–January, pp. 11–20). Presented at
the PPoPP: Principles and Practice of Parallel Pogramming, ACM. https://doi.org/10.1145/2688500.2688523'
chicago: 'Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The
SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015.
https://doi.org/10.1145/2688500.2688523.'
ieee: 'D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable
relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel
Pogramming, 2015, vol. 2015–January, pp. 11–20.'
ista: 'Alistarh D-A, Kopinsky J, Li J, Shavit N. 2015. The SprayList: A scalable
relaxed priority queue. PPoPP: Principles and Practice of Parallel Pogramming
vol. 2015–January, 11–20.'
mla: 'Alistarh, Dan-Adrian, et al. The SprayList: A Scalable Relaxed Priority
Queue. Vol. 2015–January, ACM, 2015, pp. 11–20, doi:10.1145/2688500.2688523.'
short: D.-A. Alistarh, J. Kopinsky, J. Li, N. Shavit, in:, ACM, 2015, pp. 11–20.
conference:
name: 'PPoPP: Principles and Practice of Parallel Pogramming'
date_created: 2018-12-11T11:48:26Z
date_published: 2015-01-24T00:00:00Z
date_updated: 2023-02-23T13:16:43Z
day: '24'
doi: 10.1145/2688500.2688523
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 11 - 20
publication_status: published
publisher: ACM
publist_id: '6878'
status: public
title: 'The SprayList: A scalable relaxed priority queue'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-January
year: '2015'
...
---
_id: '7765'
abstract:
- lang: eng
text: 'We introduce a principle unique to disordered solids wherein the contribution
of any bond to one global perturbation is uncorrelated with its contribution to
another. Coupled with sufficient variability in the contributions of different
bonds, this “independent bond-level response” paves the way for the design of
real materials with unusual and exquisitely tuned properties. To illustrate this,
we choose two global perturbations: compression and shear. By applying a bond
removal procedure that is both simple and experimentally relevant to remove a
very small fraction of bonds, we can drive disordered spring networks to both
the incompressible and completely auxetic limits of mechanical behavior.'
article_number: '225501'
article_processing_charge: No
article_type: original
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: 'Goodrich CP, Liu AJ, Nagel SR. The principle of independent bond-level response:
Tuning by pruning to exploit disorder for global behavior. Physical Review
Letters. 2015;114(22). doi:10.1103/physrevlett.114.225501'
apa: 'Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). The principle of independent
bond-level response: Tuning by pruning to exploit disorder for global behavior.
Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.114.225501'
chicago: 'Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “The Principle
of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for
Global Behavior.” Physical Review Letters. American Physical Society, 2015.
https://doi.org/10.1103/physrevlett.114.225501.'
ieee: 'C. P. Goodrich, A. J. Liu, and S. R. Nagel, “The principle of independent
bond-level response: Tuning by pruning to exploit disorder for global behavior,”
Physical Review Letters, vol. 114, no. 22. American Physical Society, 2015.'
ista: 'Goodrich CP, Liu AJ, Nagel SR. 2015. The principle of independent bond-level
response: Tuning by pruning to exploit disorder for global behavior. Physical
Review Letters. 114(22), 225501.'
mla: 'Goodrich, Carl Peter, et al. “The Principle of Independent Bond-Level Response:
Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review
Letters, vol. 114, no. 22, 225501, American Physical Society, 2015, doi:10.1103/physrevlett.114.225501.'
short: C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 114 (2015).
date_created: 2020-04-30T11:41:08Z
date_published: 2015-06-04T00:00:00Z
date_updated: 2021-01-12T08:15:23Z
day: '04'
doi: 10.1103/physrevlett.114.225501
extern: '1'
intvolume: ' 114'
issue: '22'
language:
- iso: eng
month: '06'
oa_version: None
publication: Physical Review Letters
publication_identifier:
issn:
- 0031-9007
- 1079-7114
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: 'The principle of independent bond-level response: Tuning by pruning to exploit
disorder for global behavior'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2015'
...
---
_id: '7766'
abstract:
- lang: eng
text: We study the vibrational properties near a free surface of disordered spring
networks derived from jammed sphere packings. In bulk systems, without surfaces,
it is well understood that such systems have a plateau in the density of vibrational
modes extending down to a frequency scale ω*. This frequency is controlled by
ΔZ = 〈Z〉 − 2d, the difference between the average coordination of the spheres
and twice the spatial dimension, d, of the system, which vanishes at the jamming
transition. In the presence of a free surface we find that there is a density
of disordered vibrational modes associated with the surface that extends far below
ω*. The total number of these low-frequency surface modes is controlled by ΔZ,
and the profile of their decay into the bulk has two characteristic length scales,
which diverge as ΔZ−1/2 and ΔZ−1 as the jamming transition is approached.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel M.
full_name: Sussman, Daniel M.
last_name: Sussman
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: Sussman DM, Goodrich CP, Liu AJ, Nagel SR. Disordered surface vibrations in
jammed sphere packings. Soft Matter. 2015;11(14):2745-2751. doi:10.1039/c4sm02905d
apa: Sussman, D. M., Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). Disordered
surface vibrations in jammed sphere packings. Soft Matter. Royal Society
of Chemistry. https://doi.org/10.1039/c4sm02905d
chicago: Sussman, Daniel M., Carl Peter Goodrich, Andrea J. Liu, and Sidney R. Nagel.
“Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter.
Royal Society of Chemistry, 2015. https://doi.org/10.1039/c4sm02905d.
ieee: D. M. Sussman, C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Disordered surface
vibrations in jammed sphere packings,” Soft Matter, vol. 11, no. 14. Royal
Society of Chemistry, pp. 2745–2751, 2015.
ista: Sussman DM, Goodrich CP, Liu AJ, Nagel SR. 2015. Disordered surface vibrations
in jammed sphere packings. Soft Matter. 11(14), 2745–2751.
mla: Sussman, Daniel M., et al. “Disordered Surface Vibrations in Jammed Sphere
Packings.” Soft Matter, vol. 11, no. 14, Royal Society of Chemistry, 2015,
pp. 2745–51, doi:10.1039/c4sm02905d.
short: D.M. Sussman, C.P. Goodrich, A.J. Liu, S.R. Nagel, Soft Matter 11 (2015)
2745–2751.
date_created: 2020-04-30T11:41:23Z
date_published: 2015-02-15T00:00:00Z
date_updated: 2021-01-12T08:15:23Z
day: '15'
doi: 10.1039/c4sm02905d
extern: '1'
intvolume: ' 11'
issue: '14'
language:
- iso: eng
month: '02'
oa_version: None
page: 2745-2751
publication: Soft Matter
publication_identifier:
issn:
- 1744-683X
- 1744-6848
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
status: public
title: Disordered surface vibrations in jammed sphere packings
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2015'
...
---
_id: '7767'
abstract:
- lang: eng
text: We present a model of soft active particles that leads to a rich array of
collective behavior found also in dense biological swarms of bacteria and other
unicellular organisms. Our model uses only local interactions, such as Vicsek-type
nearest-neighbor alignment, short-range repulsion, and a local boundary term.
Changing the relative strength of these interactions leads to migrating swarms,
rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble
motion, alternating between migration and either rotating or jammed states. Interestingly,
although a migrating swarm moves slower than an individual particle, the diffusion
constant can be up to three orders of magnitude larger, suggesting that collective
motion can be highly advantageous, for example, when searching for food.
article_number: '032706'
article_processing_charge: No
article_type: original
author:
- first_name: Ruben
full_name: van Drongelen, Ruben
last_name: van Drongelen
- first_name: Anshuman
full_name: Pal, Anshuman
last_name: Pal
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Timon
full_name: Idema, Timon
last_name: Idema
citation:
ama: van Drongelen R, Pal A, Goodrich CP, Idema T. Collective dynamics of soft active
particles. Physical Review E. 2015;91(3). doi:10.1103/physreve.91.032706
apa: van Drongelen, R., Pal, A., Goodrich, C. P., & Idema, T. (2015). Collective
dynamics of soft active particles. Physical Review E. American Physical
Society. https://doi.org/10.1103/physreve.91.032706
chicago: Drongelen, Ruben van, Anshuman Pal, Carl Peter Goodrich, and Timon Idema.
“Collective Dynamics of Soft Active Particles.” Physical Review E. American
Physical Society, 2015. https://doi.org/10.1103/physreve.91.032706.
ieee: R. van Drongelen, A. Pal, C. P. Goodrich, and T. Idema, “Collective dynamics
of soft active particles,” Physical Review E, vol. 91, no. 3. American
Physical Society, 2015.
ista: van Drongelen R, Pal A, Goodrich CP, Idema T. 2015. Collective dynamics of
soft active particles. Physical Review E. 91(3), 032706.
mla: van Drongelen, Ruben, et al. “Collective Dynamics of Soft Active Particles.”
Physical Review E, vol. 91, no. 3, 032706, American Physical Society, 2015,
doi:10.1103/physreve.91.032706.
short: R. van Drongelen, A. Pal, C.P. Goodrich, T. Idema, Physical Review E 91 (2015).
date_created: 2020-04-30T11:41:38Z
date_published: 2015-03-01T00:00:00Z
date_updated: 2021-01-12T08:15:24Z
day: '01'
doi: 10.1103/physreve.91.032706
extern: '1'
intvolume: ' 91'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
publication: Physical Review E
publication_identifier:
issn:
- 1539-3755
- 1550-2376
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Collective dynamics of soft active particles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2015'
...
---
_id: '777'
abstract:
- lang: eng
text: 'In many applications, the data is of rich structure that can be represented
by a hypergraph, where the data items are represented by vertices and the associations
among items are represented by hyperedges. Equivalently, we are given an input
bipartite graph with two types of vertices: items, and associations (which we
refer to as topics). We consider the problem of partitioning the set of items
into a given number of components such that the maximum number of topics covered
by a component is minimized. This is a clustering problem with various applications,
e.g. partitioning of a set of information objects such as documents, images, and
videos, and load balancing in the context of modern computation platforms.Inthis
paper, we focus on the streaming computation model for this problem, in which
items arrive online one at a time and each item must be assigned irrevocably to
a component at its arrival time. Motivated by scalability requirements, we focus
on the class of streaming computation algorithms with memory limited to be at
most linear in the number of components. We show that a greedy assignment strategy
is able to recover a hidden co-clustering of items under a natural set of recovery
conditions. We also report results of an extensive empirical evaluation, which
demonstrate that this greedy strategy yields superior performance when compared
with alternative approaches.'
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: Jennifer
full_name: Iglesias, Jennifer
last_name: Iglesias
- first_name: Milan
full_name: Vojnović, Milan
last_name: Vojnović
citation:
ama: 'Alistarh D-A, Iglesias J, Vojnović M. Streaming min-max hypergraph partitioning.
In: Vol 2015-January. Neural Information Processing Systems; 2015:1900-1908.'
apa: 'Alistarh, D.-A., Iglesias, J., & Vojnović, M. (2015). Streaming min-max
hypergraph partitioning (Vol. 2015–January, pp. 1900–1908). Presented at the NIPS:
Neural Information Processing Systems, Neural Information Processing Systems.'
chicago: Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming
Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing
Systems, 2015.
ieee: 'D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph
partitioning,” presented at the NIPS: Neural Information Processing Systems, 2015,
vol. 2015–January, pp. 1900–1908.'
ista: 'Alistarh D-A, Iglesias J, Vojnović M. 2015. Streaming min-max hypergraph
partitioning. NIPS: Neural Information Processing Systems vol. 2015–January, 1900–1908.'
mla: Alistarh, Dan-Adrian, et al. Streaming Min-Max Hypergraph Partitioning.
Vol. 2015–January, Neural Information Processing Systems, 2015, pp. 1900–08.
short: D.-A. Alistarh, J. Iglesias, M. Vojnović, in:, Neural Information Processing
Systems, 2015, pp. 1900–1908.
conference:
name: 'NIPS: Neural Information Processing Systems'
date_created: 2018-12-11T11:48:27Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T13:17:09Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://papers.nips.cc/paper/5897-streaming-min-max-hypergraph-partitioning
month: '01'
oa_version: None
page: 1900 - 1908
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '6879'
status: public
title: Streaming min-max hypergraph partitioning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-January
year: '2015'
...
---
OA_type: green
_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_number: '1510.08820'
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. doi:10.48550/arXiv.1510.08820'
apa: 'Goodrich, C. P. (n.d.). Unearthing the anticrystal: Criticality in the linear
response of disordered solids. arXiv. https://doi.org/10.48550/arXiv.1510.08820'
chicago: 'Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the
Linear Response of Disordered Solids.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1510.08820.'
ieee: 'C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response
of disordered solids,” arXiv. .'
ista: 'Goodrich CP. 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, doi:10.48550/arXiv.1510.08820.'
short: C.P. Goodrich, ArXiv (n.d.).
date_created: 2020-04-30T12:16:18Z
date_published: 2015-10-29T00:00:00Z
date_updated: 2025-06-26T10:26:40Z
day: '29'
doi: 10.48550/arXiv.1510.08820
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
publication: arXiv
publication_status: submitted
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: '779'
abstract:
- lang: eng
text: 'The concurrent memory reclamation problem is that of devising a way for a
deallocating thread to verify that no other concurrent threads hold references
to a memory block being deallocated. To date, in the absence of automatic garbage
collection, there is no satisfactory solution to this problem; existing tracking
methods like hazard pointers, reference counters, or epoch-based techniques like
RCU, are either prohibitively expensive or require significant programming expertise,
to the extent that implementing them efficiently can be worthy of a publication.
None of the existing techniques are automatic or even semi-automated. In this
paper, we take a new approach to concurrent memory reclamation: instead of manually
tracking access to memory locations as done in techniques like hazard pointers,
or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm,
called ThreadScan, leverages operating system signaling to automatically detect
which memory locations are being accessed by concurrent threads. Initial empirical
evidence shows that ThreadScan scales surprisingly well and requires negligible
programming effort beyond the standard use of Malloc and Free.'
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 corporation. In particular, we
would like to thank Dave Dice, Alex Kogan, and Mark Moir from the Oracle Scalable
Synchronization Research Group for very useful feedback on earlier drafts of this
paper.
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: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Matveev A, Leiserson W, Shavit N. ThreadScan: Automatic and
scalable memory reclamation. In: Vol 2015-June. ACM; 2015:123-132. doi:10.1145/2755573.2755600'
apa: 'Alistarh, D.-A., Matveev, A., Leiserson, W., & Shavit, N. (2015). ThreadScan:
Automatic and scalable memory reclamation (Vol. 2015–June, pp. 123–132). Presented
at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2755573.2755600'
chicago: 'Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit.
“ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM,
2015. https://doi.org/10.1145/2755573.2755600.'
ieee: 'D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic
and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism
in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.'
ista: 'Alistarh D-A, Matveev A, Leiserson W, Shavit N. 2015. ThreadScan: Automatic
and scalable memory reclamation. SPAA: Symposium on Parallelism in Algorithms
and Architectures vol. 2015–June, 123–132.'
mla: 'Alistarh, Dan-Adrian, et al. ThreadScan: Automatic and Scalable Memory
Reclamation. Vol. 2015–June, ACM, 2015, pp. 123–32, doi:10.1145/2755573.2755600.'
short: D.-A. Alistarh, A. Matveev, W. Leiserson, N. Shavit, in:, ACM, 2015, pp.
123–132.
conference:
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
date_created: 2018-12-11T11:48:27Z
date_published: 2015-06-13T00:00:00Z
date_updated: 2023-02-23T12:35:42Z
day: '13'
doi: 10.1145/2755573.2755600
extern: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: 123 - 132
publication_status: published
publisher: ACM
publist_id: '6876'
related_material:
record:
- id: '6001'
relation: later_version
status: public
status: public
title: 'ThreadScan: Automatic and scalable memory reclamation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-June
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: '781'
abstract:
- lang: eng
text: 'Population protocols, roughly defined as systems consisting of large numbers
of simple identical agents, interacting at random and updating their state following
simple rules, are an important research topic at the intersection of distributed
computing and biology. One of the fundamental tasks that a population protocol
may solve is majority: each node starts in one of two states; the goal is for
all nodes to reach a correct consensus on which of the two states was initially
the majority. Despite considerable research effort, known protocols for this problem
are either exact but slow (taking linear parallel time to converge), or fast but
approximate (with non-zero probability of error). In this paper, we show that
this trade-off between preciasion and speed is not inherent. We present a new
protocol called Average and Conquer (AVC) that solves majority ex-actly in expected
parallel convergence time O(log n/(sε) + log n log s), where n is the number of
nodes, εn is the initial node advantage of the majority state, and s = Ω(log n
log log n) is the number of states the protocol employs. This shows that the majority
problem can be solved exactly in time poly-logarithmic in n, provided that the
memory per node is s = Ω(1/ε + lognlog1/ε). On the negative side, we establish
a lower bound of Ω(1/ε) on the expected paraallel convergence time for the case
of four memory states per node, and a lower bound of Ω(logn) parallel time for
protocols using any number of memory states per node.per node, and a lower bound
of (log n) parallel time for protocols using any number of memory states per node.'
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: Milan
full_name: Vojnović, Milan
last_name: Vojnović
citation:
ama: 'Alistarh D-A, Gelashvili R, Vojnović M. Fast and exact majority in population
protocols. In: Vol 2015-July. ACM; 2015:47-56. doi:10.1145/2767386.2767429'
apa: 'Alistarh, D.-A., Gelashvili, R., & Vojnović, M. (2015). Fast and exact
majority in population protocols (Vol. 2015–July, pp. 47–56). Presented at the
PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767429'
chicago: Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact
Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429.
ieee: 'D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority
in population protocols,” presented at the PODC: Principles of Distributed Computing,
2015, vol. 2015–July, pp. 47–56.'
ista: 'Alistarh D-A, Gelashvili R, Vojnović M. 2015. Fast and exact majority in
population protocols. PODC: Principles of Distributed Computing vol. 2015–July,
47–56.'
mla: Alistarh, Dan-Adrian, et al. Fast and Exact Majority in Population Protocols.
Vol. 2015–July, ACM, 2015, pp. 47–56, doi:10.1145/2767386.2767429.
short: D.-A. Alistarh, R. Gelashvili, M. Vojnović, in:, ACM, 2015, pp. 47–56.
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:35Z
day: '21'
doi: 10.1145/2767386.2767429
extern: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 47 - 56
publication_status: published
publisher: ACM
publist_id: '6873'
status: public
title: Fast and exact majority in population protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-July
year: '2015'
...
---
_id: '782'
abstract:
- lang: eng
text: 'In this work, we consider the following random process, mo- Tivated by the
analysis of lock-free concurrent algorithms under high memory contention. In each
round, a new scheduling step is allocated to one of n threads, according to a
distribution p = (p1; p2; : : : ; pn), where thread i is scheduled with probability
pi. When some thread first reaches a set threshold of executed steps, it registers
a win, completing its current operation, and resets its step count to 1. At the
same time, threads whose step count was close to the threshold also get reset
because of the win, but to 0 steps, being penalized for almost winning. We are
interested in two questions: how often does some thread complete an operation
(system latency), and how often does a specific thread complete an operation (individual
latency)? We provide asymptotically tight bounds for the system and individual
latency of this general concurrency pattern, for arbitrary scheduling distributions
p. Surprisingly, a sim- ple characterization exists: in expectation, the system
will complete a new operation every Θ(1/p 2) steps, while thread i will complete
a new operation every Θ(1/2=p i ) steps. The proof is interesting in its own right,
as it requires a careful analysis of how the higher norms of the vector p inuence
the thread step counts and latencies in this random process. Our result offers
a simple connection between the scheduling distribution and the average performance
of concurrent algorithms, which has several applications.'
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: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Milan
full_name: Vojnović, Milan
last_name: Vojnović
citation:
ama: 'Alistarh D-A, Sauerwald T, Vojnović M. Lock-Free algorithms under stochastic
schedulers. In: Vol 2015-July. ACM; 2015:251-260. doi:10.1145/2767386.2767430'
apa: 'Alistarh, D.-A., Sauerwald, T., & Vojnović, M. (2015). Lock-Free algorithms
under stochastic schedulers (Vol. 2015–July, pp. 251–260). Presented at the PODC:
Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767430'
chicago: Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free
Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430.
ieee: 'D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under
stochastic schedulers,” presented at the PODC: Principles of Distributed Computing,
2015, vol. 2015–July, pp. 251–260.'
ista: 'Alistarh D-A, Sauerwald T, Vojnović M. 2015. Lock-Free algorithms under stochastic
schedulers. PODC: Principles of Distributed Computing vol. 2015–July, 251–260.'
mla: Alistarh, Dan-Adrian, et al. Lock-Free Algorithms under Stochastic Schedulers.
Vol. 2015–July, ACM, 2015, pp. 251–60, doi:10.1145/2767386.2767430.
short: D.-A. Alistarh, T. Sauerwald, M. Vojnović, in:, ACM, 2015, pp. 251–260.
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:50Z
day: '21'
doi: 10.1145/2767386.2767430
extern: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 251 - 260
publication_status: published
publisher: ACM
publist_id: '6874'
status: public
title: Lock-Free algorithms under stochastic schedulers
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-July
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: '784'
abstract:
- lang: eng
text: We demonstrate an optical switch design that can scale up to a thousand ports
with high per-port bandwidth (25 Gbps+) and low switching latency (40 ns). Our
design uses a broadcast and select architecture, based on a passive star coupler
and fast tunable transceivers. In addition we employ time division multiplexing
to achieve very low switching latency. Our demo shows the feasibility of the switch
data plane using a small testbed, comprising two transmitters and a receiver,
connected through a star coupler.
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: Hitesh
full_name: Ballani, Hitesh
last_name: Ballani
- first_name: Paolo
full_name: Costa, Paolo
last_name: Costa
- first_name: Adam
full_name: Funnell, Adam
last_name: Funnell
- first_name: Joshua
full_name: Benjamin, Joshua
last_name: Benjamin
- first_name: Philip
full_name: Watts, Philip
last_name: Watts
- first_name: Benn
full_name: Thomsen, Benn
last_name: Thomsen
citation:
ama: 'Alistarh D-A, Ballani H, Costa P, et al. A high-radix, low-latency optical
switch for data centers. In: ACM; 2015:367-368. doi:10.1145/2785956.2790035'
apa: 'Alistarh, D.-A., Ballani, H., Costa, P., Funnell, A., Benjamin, J., Watts,
P., & Thomsen, B. (2015). A high-radix, low-latency optical switch for data
centers (pp. 367–368). Presented at the SIGCOMM: Special Interest Group on Data
Communication, London, United Kindgdom: ACM. https://doi.org/10.1145/2785956.2790035'
chicago: Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua
Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch
for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035.
ieee: 'D.-A. Alistarh et al., “A high-radix, low-latency optical switch for
data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication,
London, United Kindgdom, 2015, pp. 367–368.'
ista: 'Alistarh D-A, Ballani H, Costa P, Funnell A, Benjamin J, Watts P, Thomsen
B. 2015. A high-radix, low-latency optical switch for data centers. SIGCOMM: Special
Interest Group on Data Communication, 367–368.'
mla: Alistarh, Dan-Adrian, et al. A High-Radix, Low-Latency Optical Switch for
Data Centers. ACM, 2015, pp. 367–68, doi:10.1145/2785956.2790035.
short: D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts,
B. Thomsen, in:, ACM, 2015, pp. 367–368.
conference:
end_date: 2015-08-21
location: London, United Kindgdom
name: 'SIGCOMM: Special Interest Group on Data Communication'
start_date: 2015-08-17
date_created: 2018-12-11T11:48:29Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T13:18:57Z
day: '01'
doi: 10.1145/2785956.2790035
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 367 - 368
publication_identifier:
isbn:
- 978-1-4503-3542-3
publication_status: published
publisher: ACM
publist_id: '6872'
quality_controlled: '1'
status: public
title: A high-radix, low-latency optical switch for data centers
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '802'
abstract:
- lang: eng
text: Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at
the plasma membrane of various eukaryotes with the important exception of mammals.
In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man)
linked at position 2 of the inositol. However, several pathogenic fungi additionally
synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at
this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC
core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC,
which is the most abundant GIPC synthesized by this fungus. In this study, we
identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate
its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted
deletion of the gene encoding GntA in A. fumigatus resulted in complete absence
of zwitterionic GIPC; a phenotype that could be reverted by episomal expression
of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was
substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces
cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore
shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid
product resistant to saponification and to digestion by phosphatidylinositol-phospholipase
C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation
of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.
article_processing_charge: No
author:
- first_name: Jakob
full_name: Engel, Jakob
last_name: Engel
- first_name: Philipp S
full_name: Schmalhorst, Philipp S
id: 309D50DA-F248-11E8-B48F-1D18A9856A87
last_name: Schmalhorst
orcid: 0000-0002-5795-0133
- first_name: Anke
full_name: Kruger, Anke
last_name: Kruger
- first_name: Christina
full_name: Muller, Christina
last_name: Muller
- first_name: Falk
full_name: Buettner, Falk
last_name: Buettner
- first_name: Françoise
full_name: Routier, Françoise
last_name: Routier
citation:
ama: Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization
of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic
glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430.
doi:10.1093/glycob/cwv059
apa: Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., &
Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved
in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis.
Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059
chicago: Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk
Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase
Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.”
Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059.
ieee: J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier,
“Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology,
vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.
ista: Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015.
Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology.
25(12), 1423–1430.
mla: Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase
Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.”
Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30,
doi:10.1093/glycob/cwv059.
short: J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier,
Glycobiology 25 (2015) 1423–1430.
date_created: 2018-12-11T11:48:35Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2025-09-23T08:14:24Z
day: '01'
department:
- _id: CaHe
doi: 10.1093/glycob/cwv059
external_id:
isi:
- '000368443700010'
pmid:
- '26306635'
intvolume: ' 25'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 1423 - 1430
pmid: 1
publication: Glycobiology
publication_status: published
publisher: Oxford University Press
publist_id: '6851'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 25
year: '2015'
...