---
_id: '7301'
abstract:
- lang: eng
text: Several problems arise at the O2 (positive) electrode in the Li-air battery,
including solvent/electrode decomposition and electrode passivation by insulating
Li2O2. Progress partially depends on exploring the basic electrochemistry of O2
reduction. Here we describe the effect of complexing-cations on the electrochemical
reduction of O2 in DMSO in the presence and absence of a Li salt. The solubility
of alkaline peroxides in DMSO is enhanced by the complexing-cations, consistent
with their strong interaction with reduced O2. The complexing-cations also increase
the rate of the 1-electron O2 reduction to O2•– by up to six-fold (k° = 2.4 ×10–3
to 1.5 × 10–2 cm s–1) whether or not Li+ ions are present. In the absence of Li+,
the complexing-cations also promote the reduction of O2•– to O22–. In the presence
of Li+ and complexing-cations, and despite the interaction of the reduced O2 with
the latter, SERS confirms that the product is still Li2O2.
article_processing_charge: No
article_type: original
author:
- first_name: Chunmei
full_name: Li, Chunmei
last_name: Li
- first_name: Olivier
full_name: Fontaine, Olivier
last_name: Fontaine
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Lee
full_name: Johnson, Lee
last_name: Johnson
- first_name: Sylvie
full_name: Grugeon, Sylvie
last_name: Grugeon
- first_name: Stéphane
full_name: Laruelle, Stéphane
last_name: Laruelle
- first_name: Peter G.
full_name: Bruce, Peter G.
last_name: Bruce
- first_name: Michel
full_name: Armand, Michel
last_name: Armand
citation:
ama: 'Li C, Fontaine O, Freunberger SA, et al. Aprotic Li–O2 battery: Influence
of complexing agents on oxygen reduction in an aprotic solvent. The Journal
of Physical Chemistry C. 2014;118(7):3393-3401. doi:10.1021/jp4093805'
apa: 'Li, C., Fontaine, O., Freunberger, S. A., Johnson, L., Grugeon, S., Laruelle,
S., … Armand, M. (2014). Aprotic Li–O2 battery: Influence of complexing agents
on oxygen reduction in an aprotic solvent. The Journal of Physical Chemistry
C. ACS. https://doi.org/10.1021/jp4093805'
chicago: 'Li, Chunmei, Olivier Fontaine, Stefan Alexander Freunberger, Lee Johnson,
Sylvie Grugeon, Stéphane Laruelle, Peter G. Bruce, and Michel Armand. “Aprotic
Li–O2 Battery: Influence of Complexing Agents on Oxygen Reduction in an Aprotic
Solvent.” The Journal of Physical Chemistry C. ACS, 2014. https://doi.org/10.1021/jp4093805.'
ieee: 'C. Li et al., “Aprotic Li–O2 battery: Influence of complexing agents
on oxygen reduction in an aprotic solvent,” The Journal of Physical Chemistry
C, vol. 118, no. 7. ACS, pp. 3393–3401, 2014.'
ista: 'Li C, Fontaine O, Freunberger SA, Johnson L, Grugeon S, Laruelle S, Bruce
PG, Armand M. 2014. Aprotic Li–O2 battery: Influence of complexing agents on oxygen
reduction in an aprotic solvent. The Journal of Physical Chemistry C. 118(7),
3393–3401.'
mla: 'Li, Chunmei, et al. “Aprotic Li–O2 Battery: Influence of Complexing Agents
on Oxygen Reduction in an Aprotic Solvent.” The Journal of Physical Chemistry
C, vol. 118, no. 7, ACS, 2014, pp. 3393–401, doi:10.1021/jp4093805.'
short: C. Li, O. Fontaine, S.A. Freunberger, L. Johnson, S. Grugeon, S. Laruelle,
P.G. Bruce, M. Armand, The Journal of Physical Chemistry C 118 (2014) 3393–3401.
date_created: 2020-01-15T12:17:28Z
date_published: 2014-01-29T00:00:00Z
date_updated: 2021-01-12T08:12:53Z
day: '29'
doi: 10.1021/jp4093805
extern: '1'
intvolume: ' 118'
issue: '7'
language:
- iso: eng
month: '01'
oa_version: None
page: 3393-3401
publication: The Journal of Physical Chemistry C
publication_identifier:
issn:
- 1932-7447
- 1932-7455
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: 'Aprotic Li–O2 battery: Influence of complexing agents on oxygen reduction
in an aprotic solvent'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2014'
...
---
_id: '7302'
abstract:
- lang: eng
text: Understanding charge carrier transport in Li2O2, the storage material in the
non-aqueous Li-O2 battery, is key to the development of this high-energy battery.
Here, we studied ionic transport properties and Li self-diffusion in nanocrystalline
Li2O2 by conductivity and temperature variable 7Li NMR spectroscopy. Nanostructured
Li2O2, characterized by a mean crystallite size of less than 50 nm as estimated
from X-ray diffraction peak broadening, was prepared by high-energy ball milling
of microcrystalline lithium peroxide with μm sized crystallites. At room temperature
the overall conductivity σ of the microcrystalline reference sample turned out
to be very low (3.4 × 10−13 S cm−1) which is in agreement with results from temperature-variable
7Li NMR line shape measurements. Ball-milling, however, leads to an increase of
σ by approximately two orders of magnitude (1.1 × 10−10 S cm−1); correspondingly,
the activation energy decreases from 0.89 eV to 0.82 eV. The electronic contribution
σeon, however, is in the order of 9 × 10−12 S cm−1 which makes less than 10% of
the total value. Interestingly, 7Li NMR lines of nano-Li2O2 undergo pronounced
heterogeneous motional narrowing which manifests in a two-component line shape
emerging with increasing temperatures. Most likely, the enhancement in σ can be
traced back to the generation of a spin reservoir with highly mobile Li ions;
these are expected to reside in the nearest neighbourhood of defects generated
or near the structurally disordered and defect-rich interfacial regions formed
during mechanical treatment.
article_processing_charge: No
article_type: original
author:
- first_name: A.
full_name: Dunst, A.
last_name: Dunst
- first_name: V.
full_name: Epp, V.
last_name: Epp
- first_name: I.
full_name: Hanzu, I.
last_name: Hanzu
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: M.
full_name: Wilkening, M.
last_name: Wilkening
citation:
ama: Dunst A, Epp V, Hanzu I, Freunberger SA, Wilkening M. Short-range Li diffusion
vs. long-range ionic conduction in nanocrystalline lithium peroxide Li2O2—the
discharge product in lithium-air batteries. Energy & Environmental Science.
2014;7(8):2739-2752. doi:10.1039/c4ee00496e
apa: Dunst, A., Epp, V., Hanzu, I., Freunberger, S. A., & Wilkening, M. (2014).
Short-range Li diffusion vs. long-range ionic conduction in nanocrystalline lithium
peroxide Li2O2—the discharge product in lithium-air batteries. Energy &
Environmental Science. RSC. https://doi.org/10.1039/c4ee00496e
chicago: Dunst, A., V. Epp, I. Hanzu, Stefan Alexander Freunberger, and M. Wilkening.
“Short-Range Li Diffusion vs. Long-Range Ionic Conduction in Nanocrystalline Lithium
Peroxide Li2O2—the Discharge Product in Lithium-Air Batteries.” Energy &
Environmental Science. RSC, 2014. https://doi.org/10.1039/c4ee00496e.
ieee: A. Dunst, V. Epp, I. Hanzu, S. A. Freunberger, and M. Wilkening, “Short-range
Li diffusion vs. long-range ionic conduction in nanocrystalline lithium peroxide
Li2O2—the discharge product in lithium-air batteries,” Energy & Environmental
Science, vol. 7, no. 8. RSC, pp. 2739–2752, 2014.
ista: Dunst A, Epp V, Hanzu I, Freunberger SA, Wilkening M. 2014. Short-range Li
diffusion vs. long-range ionic conduction in nanocrystalline lithium peroxide
Li2O2—the discharge product in lithium-air batteries. Energy & Environmental
Science. 7(8), 2739–2752.
mla: Dunst, A., et al. “Short-Range Li Diffusion vs. Long-Range Ionic Conduction
in Nanocrystalline Lithium Peroxide Li2O2—the Discharge Product in Lithium-Air
Batteries.” Energy & Environmental Science, vol. 7, no. 8, RSC, 2014,
pp. 2739–52, doi:10.1039/c4ee00496e.
short: A. Dunst, V. Epp, I. Hanzu, S.A. Freunberger, M. Wilkening, Energy &
Environmental Science 7 (2014) 2739–2752.
date_created: 2020-01-15T12:17:43Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T08:12:53Z
day: '01'
doi: 10.1039/c4ee00496e
extern: '1'
intvolume: ' 7'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: Published Version
page: 2739-2752
publication: Energy & Environmental Science
publication_identifier:
issn:
- 1754-5692
- 1754-5706
publication_status: published
publisher: RSC
quality_controlled: '1'
status: public
title: Short-range Li diffusion vs. long-range ionic conduction in nanocrystalline
lithium peroxide Li2O2—the discharge product in lithium-air batteries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2014'
...
---
_id: '7303'
abstract:
- lang: eng
text: The electrolyte in the non-aqueous (aprotic) lithium air battery has a profound
influence on the reactions that occur at the anode and cathode, and hence its
overall operation on discharge/charge. It must possess a wide range of attributes,
exceeding the requirements of electrolytes for Lithium ion batteries by far. The
most important additional issues are stability at both anode and cathode in the
presence of O2. The known problems with cycling the Li metal/non-aqueous electrolyte
interface are further complicated by O2. New and much less understood are the
reactions at the O2 cathode/electrolyte interface where the highly reversible
formation/decomposition of Li2O2 on discharge/charge is critical for the operation
of the non-aqueous lithium air battery. Many aprotic electrolytes exhibit decomposition
at the cathode during discharge and charge due to the presence of reactive reduced
O2 species affecting potential, capacity and kinetics on discharge and charge,
cyclability and calendar life. Identifying suitable electrolytes is one of the
key challenges for the non-aqueous lithium air battery at the present time. Following
the realisation that cyclability of such cells in the initially used organic carbonate
electrolytes is due to back-to-back irreversible reactions the stability of the
non-aqueous electrolytes became a major focus of research on rechargeable lithium
air batteries. This realisation led to the establishment of a suite of experimental
and computational methods capable of screening the stability of electrolytes.
These allow for greater mechanistic understanding of the reactivity and guide
the way towards designing more stable systems. A range of electrolytes based on
ethers, amides, sulfones, ionic liquids and dimethyl sulfoxide have been investigated.
All are more stable than the organic carbonates, but not all are equally stable.
Even though it was soon realised, by a number of groups, that ethers exhibit side
reactions on discharge and charge, they still remain the choice in many studies.
To date dimethyl sulfoxide and dimethylacetamide were identified as the most stable
electrolytes. In conjunction with the investigation of electrolyte stability the
importance of electrode stability became more prominent. The stability of the
electrolyte cannot be considered in isolation. Its stability depends on the synergy
between electrolyte and electrode. Carbon based electrodes promote electrolyte
decomposition and decompose on their own. Although great progress has been made
in only a few years, future work on aprotic electrolytes for Li-O2 batteries will
need to explore other electrolytes in the quest for yet lower cost, higher safety,
stability and low volatility.
article_processing_charge: No
author:
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Yuhui
full_name: Chen, Yuhui
last_name: Chen
- first_name: Fanny
full_name: Bardé, Fanny
last_name: Bardé
- first_name: Kensuke
full_name: Takechi, Kensuke
last_name: Takechi
- first_name: Fuminori
full_name: Mizuno, Fuminori
last_name: Mizuno
- first_name: Peter G.
full_name: Bruce, Peter G.
last_name: Bruce
citation:
ama: 'Freunberger SA, Chen Y, Bardé F, Takechi K, Mizuno F, Bruce PG. Nonaqueous
Electrolytes. In: Imanishi N, Luntz AC, Bruce P, eds. The Lithium Air Battery:
Fundamentals. New York, NY: Springer Nature; 2014:23-58. doi:10.1007/978-1-4899-8062-5_2'
apa: 'Freunberger, S. A., Chen, Y., Bardé, F., Takechi, K., Mizuno, F., & Bruce,
P. G. (2014). Nonaqueous Electrolytes. In N. Imanishi, A. C. Luntz, & P. Bruce
(Eds.), The Lithium Air Battery: Fundamentals (pp. 23–58). New York, NY:
Springer Nature. https://doi.org/10.1007/978-1-4899-8062-5_2'
chicago: 'Freunberger, Stefan Alexander, Yuhui Chen, Fanny Bardé, Kensuke Takechi,
Fuminori Mizuno, and Peter G. Bruce. “Nonaqueous Electrolytes.” In The Lithium
Air Battery: Fundamentals, edited by Nobuyuki Imanishi, Alan C. Luntz, and
Peter Bruce, 23–58. New York, NY: Springer Nature, 2014. https://doi.org/10.1007/978-1-4899-8062-5_2.'
ieee: 'S. A. Freunberger, Y. Chen, F. Bardé, K. Takechi, F. Mizuno, and P. G. Bruce,
“Nonaqueous Electrolytes,” in The Lithium Air Battery: Fundamentals, N.
Imanishi, A. C. Luntz, and P. Bruce, Eds. New York, NY: Springer Nature, 2014,
pp. 23–58.'
ista: 'Freunberger SA, Chen Y, Bardé F, Takechi K, Mizuno F, Bruce PG. 2014.Nonaqueous
Electrolytes. In: The Lithium Air Battery: Fundamentals. , 23–58.'
mla: 'Freunberger, Stefan Alexander, et al. “Nonaqueous Electrolytes.” The Lithium
Air Battery: Fundamentals, edited by Nobuyuki Imanishi et al., Springer Nature,
2014, pp. 23–58, doi:10.1007/978-1-4899-8062-5_2.'
short: 'S.A. Freunberger, Y. Chen, F. Bardé, K. Takechi, F. Mizuno, P.G. Bruce,
in:, N. Imanishi, A.C. Luntz, P. Bruce (Eds.), The Lithium Air Battery: Fundamentals,
Springer Nature, New York, NY, 2014, pp. 23–58.'
date_created: 2020-01-15T12:17:55Z
date_published: 2014-03-05T00:00:00Z
date_updated: 2021-01-12T08:12:54Z
day: '05'
doi: 10.1007/978-1-4899-8062-5_2
editor:
- first_name: Nobuyuki
full_name: Imanishi, Nobuyuki
last_name: Imanishi
- first_name: Alan C.
full_name: Luntz, Alan C.
last_name: Luntz
- first_name: Peter
full_name: Bruce, Peter
last_name: Bruce
extern: '1'
language:
- iso: eng
month: '03'
oa_version: None
page: 23-58
place: New York, NY
publication: 'The Lithium Air Battery: Fundamentals'
publication_identifier:
eisbn:
- '9781489980625'
isbn:
- '9781489980618'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Nonaqueous Electrolytes
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7304'
abstract:
- lang: eng
text: Lithium-air batteries have received extraordinary attention recently owing
to their theoretical gravimetric energies being considerably higher than those
of Li-ion batteries. There are, however, significant challenges to practical implementation,
including low energy efficiency, cycle life, and power capability. These are due
primarily to the lack of fundamental understanding of oxygen reduction and evolution
reaction kinetics and parasitic reactions between oxygen redox intermediate species
and nominally inactive battery components such as carbon in the oxygen electrode
and electrolytes. In this article, we discuss recent advances in the mechanistic
understanding of oxygen redox reactions in nonaqueous electrolytes and the search
for electrolytes and electrode materials that are chemically stable in the oxygen
electrode. In addition, methods to protect lithium metal against corrosion by
water and dendrite formation in aqueous lithium-air batteries are discussed. Further
materials innovations lie at the heart of research and development efforts that
are needed to enable the development of lithium-oxygen batteries with enhanced
round-trip efficiency and cycle life.
article_processing_charge: No
article_type: original
author:
- first_name: D.G.
full_name: Kwabi, D.G.
last_name: Kwabi
- first_name: N.
full_name: Ortiz-Vitoriano, N.
last_name: Ortiz-Vitoriano
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Y.
full_name: Chen, Y.
last_name: Chen
- first_name: N.
full_name: Imanishi, N.
last_name: Imanishi
- first_name: P.G.
full_name: Bruce, P.G.
last_name: Bruce
- first_name: Y.
full_name: Shao-Horn, Y.
last_name: Shao-Horn
citation:
ama: Kwabi DG, Ortiz-Vitoriano N, Freunberger SA, et al. Materials challenges in
rechargeable lithium-air batteries. MRS Bulletin. 2014;39(5):443-452. doi:10.1557/mrs.2014.87
apa: Kwabi, D. G., Ortiz-Vitoriano, N., Freunberger, S. A., Chen, Y., Imanishi,
N., Bruce, P. G., & Shao-Horn, Y. (2014). Materials challenges in rechargeable
lithium-air batteries. MRS Bulletin. CUP. https://doi.org/10.1557/mrs.2014.87
chicago: Kwabi, D.G., N. Ortiz-Vitoriano, Stefan Alexander Freunberger, Y. Chen,
N. Imanishi, P.G. Bruce, and Y. Shao-Horn. “Materials Challenges in Rechargeable
Lithium-Air Batteries.” MRS Bulletin. CUP, 2014. https://doi.org/10.1557/mrs.2014.87.
ieee: D. G. Kwabi et al., “Materials challenges in rechargeable lithium-air
batteries,” MRS Bulletin, vol. 39, no. 5. CUP, pp. 443–452, 2014.
ista: Kwabi DG, Ortiz-Vitoriano N, Freunberger SA, Chen Y, Imanishi N, Bruce PG,
Shao-Horn Y. 2014. Materials challenges in rechargeable lithium-air batteries.
MRS Bulletin. 39(5), 443–452.
mla: Kwabi, D. G., et al. “Materials Challenges in Rechargeable Lithium-Air Batteries.”
MRS Bulletin, vol. 39, no. 5, CUP, 2014, pp. 443–52, doi:10.1557/mrs.2014.87.
short: D.G. Kwabi, N. Ortiz-Vitoriano, S.A. Freunberger, Y. Chen, N. Imanishi, P.G.
Bruce, Y. Shao-Horn, MRS Bulletin 39 (2014) 443–452.
date_created: 2020-01-15T12:18:05Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2021-01-12T08:12:54Z
day: '01'
doi: 10.1557/mrs.2014.87
extern: '1'
intvolume: ' 39'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 443-452
publication: MRS Bulletin
publication_identifier:
issn:
- 0883-7694
- 1938-1425
publication_status: published
publisher: CUP
quality_controlled: '1'
status: public
title: Materials challenges in rechargeable lithium-air batteries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2014'
...
---
_id: '7305'
abstract:
- lang: eng
text: When lithium–oxygen batteries discharge, O2 is reduced at the cathode to form
solid Li2O2. Understanding the fundamental mechanism of O2 reduction in aprotic
solvents is therefore essential to realizing their technological potential. Two
different models have been proposed for Li2O2 formation, involving either solution
or electrode surface routes. Here, we describe a single unified mechanism, which,
unlike previous models, can explain O2 reduction across the whole range of solvents
and for which the two previous models are limiting cases. We observe that the
solvent influences O2 reduction through its effect on the solubility of LiO2,
or, more precisely, the free energy of the reaction LiO2* ⇌ Li(sol)+ + O2−(sol) + ion
pairs + higher aggregates (clusters). The unified mechanism shows that low-donor-number
solvents are likely to lead to premature cell death, and that the future direction
of research for lithium–oxygen batteries should focus on the search for new, stable,
high-donor-number electrolytes, because they can support higher capacities and
can better sustain discharge.
article_processing_charge: No
article_type: original
author:
- first_name: Lee
full_name: Johnson, Lee
last_name: Johnson
- first_name: Chunmei
full_name: Li, Chunmei
last_name: Li
- first_name: Zheng
full_name: Liu, Zheng
last_name: Liu
- first_name: Yuhui
full_name: Chen, Yuhui
last_name: Chen
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Praveen C.
full_name: Ashok, Praveen C.
last_name: Ashok
- first_name: Bavishna B.
full_name: Praveen, Bavishna B.
last_name: Praveen
- first_name: Kishan
full_name: Dholakia, Kishan
last_name: Dholakia
- first_name: Jean-Marie
full_name: Tarascon, Jean-Marie
last_name: Tarascon
- first_name: Peter G.
full_name: Bruce, Peter G.
last_name: Bruce
citation:
ama: Johnson L, Li C, Liu Z, et al. The role of LiO2 solubility in O2 reduction
in aprotic solvents and its consequences for Li–O2 batteries. Nature Chemistry.
2014;6(12):1091-1099. doi:10.1038/nchem.2101
apa: Johnson, L., Li, C., Liu, Z., Chen, Y., Freunberger, S. A., Ashok, P. C., …
Bruce, P. G. (2014). The role of LiO2 solubility in O2 reduction in aprotic solvents
and its consequences for Li–O2 batteries. Nature Chemistry. Springer Nature.
https://doi.org/10.1038/nchem.2101
chicago: Johnson, Lee, Chunmei Li, Zheng Liu, Yuhui Chen, Stefan Alexander Freunberger,
Praveen C. Ashok, Bavishna B. Praveen, Kishan Dholakia, Jean-Marie Tarascon, and
Peter G. Bruce. “The Role of LiO2 Solubility in O2 Reduction in Aprotic Solvents
and Its Consequences for Li–O2 Batteries.” Nature Chemistry. Springer Nature,
2014. https://doi.org/10.1038/nchem.2101.
ieee: L. Johnson et al., “The role of LiO2 solubility in O2 reduction in
aprotic solvents and its consequences for Li–O2 batteries,” Nature Chemistry,
vol. 6, no. 12. Springer Nature, pp. 1091–1099, 2014.
ista: Johnson L, Li C, Liu Z, Chen Y, Freunberger SA, Ashok PC, Praveen BB, Dholakia
K, Tarascon J-M, Bruce PG. 2014. The role of LiO2 solubility in O2 reduction in
aprotic solvents and its consequences for Li–O2 batteries. Nature Chemistry. 6(12),
1091–1099.
mla: Johnson, Lee, et al. “The Role of LiO2 Solubility in O2 Reduction in Aprotic
Solvents and Its Consequences for Li–O2 Batteries.” Nature Chemistry, vol.
6, no. 12, Springer Nature, 2014, pp. 1091–99, doi:10.1038/nchem.2101.
short: L. Johnson, C. Li, Z. Liu, Y. Chen, S.A. Freunberger, P.C. Ashok, B.B. Praveen,
K. Dholakia, J.-M. Tarascon, P.G. Bruce, Nature Chemistry 6 (2014) 1091–1099.
date_created: 2020-01-15T12:18:18Z
date_published: 2014-11-10T00:00:00Z
date_updated: 2021-01-12T08:12:55Z
day: '10'
doi: 10.1038/nchem.2101
extern: '1'
intvolume: ' 6'
issue: '12'
language:
- iso: eng
month: '11'
oa_version: None
page: 1091-1099
publication: Nature Chemistry
publication_identifier:
issn:
- 1755-4330
- 1755-4349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/nchem.2138
status: public
title: The role of LiO2 solubility in O2 reduction in aprotic solvents and its consequences
for Li–O2 batteries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2014'
...
---
_id: '7361'
abstract:
- lang: eng
text: Bistable switches are fundamental regulatory elements of complex systems,
ranging from electronics to living cells. Designed genetic toggle switches have
been constructed from pairs of natural transcriptional repressors wired to inhibit
one another. The complexity of the engineered regulatory circuits can be increased
using orthogonal transcriptional regulators based on designed DNA-binding domains.
However, a mutual repressor-based toggle switch comprising DNA-binding domains
of transcription-activator-like effectors (TALEs) did not support bistability
in mammalian cells. Here, the challenge of engineering a bistable switch based
on monomeric DNA-binding domains is solved via the introduction of a positive
feedback loop composed of activators based on the same TALE domains as their opposing
repressors and competition for the same DNA operator site. This design introduces
nonlinearity and results in epigenetic bistability. This principle could be used
to employ other monomeric DNA-binding domains such as CRISPR for applications
ranging from reprogramming cells to building digital biological memory.
article_number: '5007'
article_processing_charge: No
article_type: original
author:
- first_name: Tina
full_name: Lebar, Tina
last_name: Lebar
- first_name: Urban
full_name: Bezeljak, Urban
id: 2A58201A-F248-11E8-B48F-1D18A9856A87
last_name: Bezeljak
orcid: 0000-0003-1365-5631
- first_name: Anja
full_name: Golob, Anja
last_name: Golob
- first_name: Miha
full_name: Jerala, Miha
last_name: Jerala
- first_name: Lucija
full_name: Kadunc, Lucija
last_name: Kadunc
- first_name: Boštjan
full_name: Pirš, Boštjan
last_name: Pirš
- first_name: Martin
full_name: Stražar, Martin
last_name: Stražar
- first_name: Dušan
full_name: Vučko, Dušan
last_name: Vučko
- first_name: Uroš
full_name: Zupančič, Uroš
last_name: Zupančič
- first_name: Mojca
full_name: Benčina, Mojca
last_name: Benčina
- first_name: Vida
full_name: Forstnerič, Vida
last_name: Forstnerič
- first_name: Rok
full_name: Gaber, Rok
last_name: Gaber
- first_name: Jan
full_name: Lonzarić, Jan
last_name: Lonzarić
- first_name: Andreja
full_name: Majerle, Andreja
last_name: Majerle
- first_name: Alja
full_name: Oblak, Alja
last_name: Oblak
- first_name: Anže
full_name: Smole, Anže
last_name: Smole
- first_name: Roman
full_name: Jerala, Roman
last_name: Jerala
citation:
ama: Lebar T, Bezeljak U, Golob A, et al. A bistable genetic switch based on designable
DNA-binding domains. Nature Communications. 2014;5(1). doi:10.1038/ncomms6007
apa: Lebar, T., Bezeljak, U., Golob, A., Jerala, M., Kadunc, L., Pirš, B., … Jerala,
R. (2014). A bistable genetic switch based on designable DNA-binding domains.
Nature Communications. Springer Nature. https://doi.org/10.1038/ncomms6007
chicago: Lebar, Tina, Urban Bezeljak, Anja Golob, Miha Jerala, Lucija Kadunc, Boštjan
Pirš, Martin Stražar, et al. “A Bistable Genetic Switch Based on Designable DNA-Binding
Domains.” Nature Communications. Springer Nature, 2014. https://doi.org/10.1038/ncomms6007.
ieee: T. Lebar et al., “A bistable genetic switch based on designable DNA-binding
domains,” Nature Communications, vol. 5, no. 1. Springer Nature, 2014.
ista: Lebar T, Bezeljak U, Golob A, Jerala M, Kadunc L, Pirš B, Stražar M, Vučko
D, Zupančič U, Benčina M, Forstnerič V, Gaber R, Lonzarić J, Majerle A, Oblak
A, Smole A, Jerala R. 2014. A bistable genetic switch based on designable DNA-binding
domains. Nature Communications. 5(1), 5007.
mla: Lebar, Tina, et al. “A Bistable Genetic Switch Based on Designable DNA-Binding
Domains.” Nature Communications, vol. 5, no. 1, 5007, Springer Nature,
2014, doi:10.1038/ncomms6007.
short: T. Lebar, U. Bezeljak, A. Golob, M. Jerala, L. Kadunc, B. Pirš, M. Stražar,
D. Vučko, U. Zupančič, M. Benčina, V. Forstnerič, R. Gaber, J. Lonzarić, A. Majerle,
A. Oblak, A. Smole, R. Jerala, Nature Communications 5 (2014).
date_created: 2020-01-25T15:57:17Z
date_published: 2014-09-29T00:00:00Z
date_updated: 2021-01-12T08:13:15Z
day: '29'
doi: 10.1038/ncomms6007
extern: '1'
external_id:
pmid:
- '25264186'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
month: '09'
oa_version: None
pmid: 1
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: A bistable genetic switch based on designable DNA-binding domains
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2014'
...
---
_id: '7455'
abstract:
- lang: eng
text: 'The reaction between NiO and (0001)- and ([1\bar102])-oriented Al2O3 single
crystals has been investigated on model experimental systems by using the ReflEXAFS
technique. Depth-sensitive information is obtained by collecting data above and
below the critical angle for total reflection. A systematic protocol for data
analysis, based on the recently developed CARD code, was implemented, and a detailed
description of the reactive systems was obtained. In particular, for ([1\bar102])-oriented
Al2O3, the reaction with NiO is almost complete after heating for 6 h at 1273 K,
and an almost uniform layer of spinel is found below a mixed (NiO + spinel) layer
at the very upmost part of the sample. In the case of the (0001)-oriented Al2O3,
for the same temperature and heating time, the reaction shows a lower advancement
degree and a residual fraction of at least 30% NiO is detected in the ReflEXAFS
spectra. '
article_processing_charge: No
article_type: original
author:
- first_name: Tommaso
full_name: Costanzo, Tommaso
id: D93824F4-D9BA-11E9-BB12-F207E6697425
last_name: Costanzo
orcid: 0000-0001-9732-3815
- first_name: Federico
full_name: Benzi, Federico
last_name: Benzi
- first_name: Paolo
full_name: Ghigna, Paolo
last_name: Ghigna
- first_name: Sonia
full_name: Pin, Sonia
last_name: Pin
- first_name: Giorgio
full_name: Spinolo, Giorgio
last_name: Spinolo
- first_name: Francesco
full_name: d'Acapito, Francesco
last_name: d'Acapito
citation:
ama: Costanzo T, Benzi F, Ghigna P, Pin S, Spinolo G, d’Acapito F. Studying the
surface reaction between NiO and Al2O3viatotal reflection EXAFS (ReflEXAFS). Journal
of Synchrotron Radiation. 2014;21(2):395-400. doi:10.1107/s1600577513031299
apa: Costanzo, T., Benzi, F., Ghigna, P., Pin, S., Spinolo, G., & d’Acapito,
F. (2014). Studying the surface reaction between NiO and Al2O3viatotal reflection
EXAFS (ReflEXAFS). Journal of Synchrotron Radiation. International Union
of Crystallography. https://doi.org/10.1107/s1600577513031299
chicago: Costanzo, Tommaso, Federico Benzi, Paolo Ghigna, Sonia Pin, Giorgio Spinolo,
and Francesco d’Acapito. “Studying the Surface Reaction between NiO and Al2O3viatotal
Reflection EXAFS (ReflEXAFS).” Journal of Synchrotron Radiation. International
Union of Crystallography, 2014. https://doi.org/10.1107/s1600577513031299.
ieee: T. Costanzo, F. Benzi, P. Ghigna, S. Pin, G. Spinolo, and F. d’Acapito, “Studying
the surface reaction between NiO and Al2O3viatotal reflection EXAFS (ReflEXAFS),”
Journal of Synchrotron Radiation, vol. 21, no. 2. International Union of
Crystallography, pp. 395–400, 2014.
ista: Costanzo T, Benzi F, Ghigna P, Pin S, Spinolo G, d’Acapito F. 2014. Studying
the surface reaction between NiO and Al2O3viatotal reflection EXAFS (ReflEXAFS).
Journal of Synchrotron Radiation. 21(2), 395–400.
mla: Costanzo, Tommaso, et al. “Studying the Surface Reaction between NiO and Al2O3viatotal
Reflection EXAFS (ReflEXAFS).” Journal of Synchrotron Radiation, vol. 21,
no. 2, International Union of Crystallography, 2014, pp. 395–400, doi:10.1107/s1600577513031299.
short: T. Costanzo, F. Benzi, P. Ghigna, S. Pin, G. Spinolo, F. d’Acapito, Journal
of Synchrotron Radiation 21 (2014) 395–400.
date_created: 2020-02-05T14:14:48Z
date_published: 2014-01-10T00:00:00Z
date_updated: 2023-02-23T13:08:22Z
day: '10'
doi: 10.1107/s1600577513031299
extern: '1'
intvolume: ' 21'
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 395-400
publication: Journal of Synchrotron Radiation
publication_identifier:
issn:
- 1600-5775
publication_status: published
publisher: International Union of Crystallography
quality_controlled: '1'
status: public
title: Studying the surface reaction between NiO and Al2O3viatotal reflection EXAFS
(ReflEXAFS)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2014'
...
---
_id: '7598'
article_processing_charge: No
article_type: original
author:
- first_name: Shutang
full_name: Tan, Shutang
id: 2DE75584-F248-11E8-B48F-1D18A9856A87
last_name: Tan
orcid: 0000-0002-0471-8285
- first_name: Hong-Wei
full_name: Xue, Hong-Wei
last_name: Xue
citation:
ama: Tan S, Xue H-W. Casein kinase 1 regulates ethylene synthesis by phosphorylating
and promoting the turnover of ACS5. Cell Reports. 2014;9(5):1692-1702.
doi:10.1016/j.celrep.2014.10.047
apa: Tan, S., & Xue, H.-W. (2014). Casein kinase 1 regulates ethylene synthesis
by phosphorylating and promoting the turnover of ACS5. Cell Reports. Elsevier.
https://doi.org/10.1016/j.celrep.2014.10.047
chicago: Tan, Shutang, and Hong-Wei Xue. “Casein Kinase 1 Regulates Ethylene Synthesis
by Phosphorylating and Promoting the Turnover of ACS5.” Cell Reports. Elsevier,
2014. https://doi.org/10.1016/j.celrep.2014.10.047.
ieee: S. Tan and H.-W. Xue, “Casein kinase 1 regulates ethylene synthesis by phosphorylating
and promoting the turnover of ACS5,” Cell Reports, vol. 9, no. 5. Elsevier,
pp. 1692–1702, 2014.
ista: Tan S, Xue H-W. 2014. Casein kinase 1 regulates ethylene synthesis by phosphorylating
and promoting the turnover of ACS5. Cell Reports. 9(5), 1692–1702.
mla: Tan, Shutang, and Hong-Wei Xue. “Casein Kinase 1 Regulates Ethylene Synthesis
by Phosphorylating and Promoting the Turnover of ACS5.” Cell Reports, vol.
9, no. 5, Elsevier, 2014, pp. 1692–702, doi:10.1016/j.celrep.2014.10.047.
short: S. Tan, H.-W. Xue, Cell Reports 9 (2014) 1692–1702.
date_created: 2020-03-21T16:08:18Z
date_published: 2014-12-11T00:00:00Z
date_updated: 2021-01-12T08:14:24Z
day: '11'
ddc:
- '580'
doi: 10.1016/j.celrep.2014.10.047
extern: '1'
file:
- access_level: open_access
checksum: 23c30de4ac98ce9879fc054121517626
content_type: application/pdf
creator: dernst
date_created: 2020-03-23T12:23:40Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7613'
file_name: 2014_CellPress_Tan.pdf
file_size: 2755808
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '5'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1692-1702
publication: Cell Reports
publication_identifier:
issn:
- 2211-1247
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Casein kinase 1 regulates ethylene synthesis by phosphorylating and promoting
the turnover of ACS5
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '768'
abstract:
- lang: eng
text: 'Task allocation is a classic distributed problem in which a set of p potentially
faulty processes must cooperate to perform a set of tasks. This paper considers
a new dynamic version of the problem, in which tasks are injected adversarially
during an asynchronous execution. We give the first asynchronous shared-memory
algorithm for dynamic task allocation, and we prove that our solution is optimal
within logarithmic factors. The main algorithmic idea is a randomized concurrent
data structure called a dynamic to-do tree, which allows processes to pick new
tasks to perform at random from the set of available tasks, and to insert tasks
at random empty locations in the data structure. Our analysis shows that these
properties avoid duplicating work unnecessarily. On the other hand, since the
adversary controls the input as well the scheduling, it can induce executions
where lots of processes contend for a few available tasks, which is inefficient.
However, we prove that every algorithm has the same problem: given an arbitrary
input, if OPT is the worst-case complexity of the optimal algorithm on that input,
then the expected work complexity of our algorithm on the same input is O(OPT
log3 m), where m is an upper bound on the number of tasks that are present in
the system at any given time.'
acknowledgement: "Dan Alistarh - This author was supported by the SNF Postdoctoral
Fellows Program, NSF grant CCF-1217921, DoE ASCR grant ER26116/DE-SC0008923, and
by grants from the Oracle and Intel corporations.\r\nJames Aspnes - Supported in
part by NSF grant CCF-0916389.\r\nMichael A. Bender - This research was supported
in part by NSF grants CCF 1114809, CCF 1217708, IIS 1247726, and IIS 1251137.\r\nRati
Gelashvili - This work was supported in part by NSF grants CCF-1217921, CCF-1301926,
DoE ASCR grant ER26116/DE-SC0008923, and by grants from the Oracle and Intel corporations.\r\nSeth
Gilbert - Supported by Singapore AcRF-2 MOE2011-T2-2-042.\r\n"
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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Michael
full_name: Bender, Michael
last_name: Bender
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
citation:
ama: 'Alistarh D-A, Aspnes J, Bender M, Gelashvili R, Gilbert S. Dynamic task allocation
in asynchronous shared memory. In: SIAM; 2014:416-435. doi:10.1137/1.9781611973402.31'
apa: 'Alistarh, D.-A., Aspnes, J., Bender, M., Gelashvili, R., & Gilbert, S.
(2014). Dynamic task allocation in asynchronous shared memory (pp. 416–435). Presented
at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/1.9781611973402.31'
chicago: Alistarh, Dan-Adrian, James Aspnes, Michael Bender, Rati Gelashvili, and
Seth Gilbert. “Dynamic Task Allocation in Asynchronous Shared Memory,” 416–35.
SIAM, 2014. https://doi.org/10.1137/1.9781611973402.31.
ieee: 'D.-A. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, and S. Gilbert, “Dynamic
task allocation in asynchronous shared memory,” presented at the SODA: Symposium
on Discrete Algorithms, 2014, pp. 416–435.'
ista: 'Alistarh D-A, Aspnes J, Bender M, Gelashvili R, Gilbert S. 2014. Dynamic
task allocation in asynchronous shared memory. SODA: Symposium on Discrete Algorithms,
416–435.'
mla: Alistarh, Dan-Adrian, et al. Dynamic Task Allocation in Asynchronous Shared
Memory. SIAM, 2014, pp. 416–35, doi:10.1137/1.9781611973402.31.
short: D.-A. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, S. Gilbert, in:, SIAM,
2014, pp. 416–435.
conference:
name: 'SODA: Symposium on Discrete Algorithms'
date_created: 2018-12-11T11:48:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:13:52Z
day: '01'
doi: 10.1137/1.9781611973402.31
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 416 - 435
publication_status: published
publisher: SIAM
publist_id: '6886'
status: public
title: Dynamic task allocation in asynchronous shared memory
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '769'
abstract:
- lang: eng
text: 'This article presents the first tight bounds on the time complexity of shared-memory
renaming, a fundamental problem in distributed computing in which a set of processes
need to pick distinct identifiers from a small namespace. We first prove an individual
lower bound of ω(k) process steps for deterministic renaming into any namespace
of size subexponential in k, where k is the number of participants. The bound
is tight: it draws an exponential separation between deterministic and randomized
solutions, and implies new tight bounds for deterministic concurrent fetch-and-increment
counters, queues, and stacks. The proof is based on a new reduction from renaming
to another fundamental problem in distributed computing: mutual exclusion. We
complement this individual bound with a global lower bound of ω(klog(k/c)) on
the total step complexity of renaming into a namespace of size ck, for any c =
1. This result applies to randomized algorithms against a strong adversary, and
helps derive new global lower bounds for randomized approximate counter implementations,
that are tight within logarithmic factors. On the algorithmic side, we give a
protocol that transforms any sorting network into a randomized strong adaptive
renaming algorithm, with expected cost equal to the depth of the sorting network.
This gives a tight adaptive renaming algorithm with expected step complexity O(log
k), where k is the contention in the current execution. This algorithm is the
first to achieve sublinear time, and it is time-optimal as per our randomized
lower bound. Finally, we use this renaming protocol to build monotone-consistent
counters with logarithmic step complexity and linearizable fetch-and-increment
registers with polylogarithmic cost.'
acknowledgement: "The work of J. Aspnes was supported in part by NSF grant CCF-0916389.
The work of S. Gilbert was\r\nsupported by Singapore AcRF-2 MOE 2011-T2-2-042.\r\nK.
Censor-Hillel is a Shalon Fellow. Part of this work was performed while K. Censor-Hillel
was a postdoc at\r\nMIT, supported by the Simons Postdoctoral Fellowship."
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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Keren
full_name: Censor Hillel, Keren
last_name: Censor Hillel
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
citation:
ama: Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Guerraoui R. Tight bounds
for asynchronous renaming. Journal of the ACM. 2014;61(3). doi:10.1145/2597630
apa: Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., & Guerraoui,
R. (2014). Tight bounds for asynchronous renaming. Journal of the ACM.
ACM. https://doi.org/10.1145/2597630
chicago: Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert,
and Rachid Guerraoui. “Tight Bounds for Asynchronous Renaming.” Journal of
the ACM. ACM, 2014. https://doi.org/10.1145/2597630.
ieee: D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and R. Guerraoui,
“Tight bounds for asynchronous renaming,” Journal of the ACM, vol. 61,
no. 3. ACM, 2014.
ista: Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Guerraoui R. 2014. Tight
bounds for asynchronous renaming. Journal of the ACM. 61(3).
mla: Alistarh, Dan-Adrian, et al. “Tight Bounds for Asynchronous Renaming.” Journal
of the ACM, vol. 61, no. 3, ACM, 2014, doi:10.1145/2597630.
short: D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, R. Guerraoui, Journal
of the ACM 61 (2014).
date_created: 2018-12-11T11:48:24Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2023-02-23T13:14:09Z
day: '01'
doi: 10.1145/2597630
extern: '1'
intvolume: ' 61'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '6887'
status: public
title: Tight bounds for asynchronous renaming
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2014'
...
---
_id: '7699'
article_processing_charge: No
article_type: original
author:
- first_name: Lora Beatrice Jaeger
full_name: Sweeney, Lora Beatrice Jaeger
id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
last_name: Sweeney
orcid: 0000-0001-9242-5601
- first_name: Darcy B
full_name: Kelley, Darcy B
last_name: Kelley
citation:
ama: Sweeney LB, Kelley DB. Harnessing vocal patterns for social communication.
Current Opinion in Neurobiology. 2014;28(10):34-41. doi:10.1016/j.conb.2014.06.006
apa: Sweeney, L. B., & Kelley, D. B. (2014). Harnessing vocal patterns for social
communication. Current Opinion in Neurobiology. Elsevier. https://doi.org/10.1016/j.conb.2014.06.006
chicago: Sweeney, Lora B., and Darcy B Kelley. “Harnessing Vocal Patterns for Social
Communication.” Current Opinion in Neurobiology. Elsevier, 2014. https://doi.org/10.1016/j.conb.2014.06.006.
ieee: L. B. Sweeney and D. B. Kelley, “Harnessing vocal patterns for social communication,”
Current Opinion in Neurobiology, vol. 28, no. 10. Elsevier, pp. 34–41,
2014.
ista: Sweeney LB, Kelley DB. 2014. Harnessing vocal patterns for social communication.
Current Opinion in Neurobiology. 28(10), 34–41.
mla: Sweeney, Lora B., and Darcy B. Kelley. “Harnessing Vocal Patterns for Social
Communication.” Current Opinion in Neurobiology, vol. 28, no. 10, Elsevier,
2014, pp. 34–41, doi:10.1016/j.conb.2014.06.006.
short: L.B. Sweeney, D.B. Kelley, Current Opinion in Neurobiology 28 (2014) 34–41.
date_created: 2020-04-30T10:35:39Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2024-01-31T10:14:08Z
day: '01'
doi: 10.1016/j.conb.2014.06.006
extern: '1'
intvolume: ' 28'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 34-41
publication: Current Opinion in Neurobiology
publication_identifier:
issn:
- 0959-4388
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Harnessing vocal patterns for social communication
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2014'
...
---
_id: '770'
abstract:
- lang: eng
text: 'Dynamic memory reclamation is arguably the biggest open problem in concurrent
data structure design: All known solutions induce high overhead, or must be customized
to the specific data structure by the programmer, or both. This paper presents
StackTrack, the first concurrent memory reclamation scheme that can be applied
automatically by a compiler, while maintaining efficiency. StackTrack eliminates
most of the expensive bookkeeping required for memory reclamation by leveraging
the power of hardware transactional memory (HTM) in a new way: it tracks thread
variables dynamically, and in an atomic fashion. This effectively makes all memory
references visible without having threads pay the overhead of writing out this
information. Our empirical results show that this new approach matches or outperforms
prior, non-automated, techniques.'
acknowledgement: "Dan Alistarh - Part of this work was performed while the
\ author was a Postdoctoral\r\nAssociate a MIT CSAIL, supported in part by NSF
grant CCF-1217921,\r\nDoE ASCR grant ER26116/DE-SC0008923, and by grants from the
Oracle\r\nand Intel corporations.\r\nPatrick Eugester - Supported in part by DARPA
grant N11AP20014 and NSF grant CNS-\r\n1117065.\r\nMaurice Herlihy - Supported by
NSF grant 1301924.\r\nNir Shavit - Supported in part by NSF grants CCF-1217921 and
CCF-1301926, DoE\r\nASCR grant ER26116/DE-SC0008923, and by grants from the Oracle
and\r\nIntel 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: Patrick
full_name: Eugster, Patrick
last_name: Eugster
- first_name: Maurice
full_name: Herlihy, Maurice
last_name: Herlihy
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Eugster P, Herlihy M, Matveev A, Shavit N. StackTrack: An automated
transactional approach to concurrent memory reclamation. In: ACM; 2014. doi:10.1145/2592798.2592808'
apa: 'Alistarh, D.-A., Eugster, P., Herlihy, M., Matveev, A., & Shavit, N. (2014).
StackTrack: An automated transactional approach to concurrent memory reclamation.
Presented at the EuroSys: European Conference on Computer Systems, ACM. https://doi.org/10.1145/2592798.2592808'
chicago: 'Alistarh, Dan-Adrian, Patrick Eugster, Maurice Herlihy, Alexander Matveev,
and Nir Shavit. “StackTrack: An Automated Transactional Approach to Concurrent
Memory Reclamation.” ACM, 2014. https://doi.org/10.1145/2592798.2592808.'
ieee: 'D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, and N. Shavit, “StackTrack:
An automated transactional approach to concurrent memory reclamation,” presented
at the EuroSys: European Conference on Computer Systems, 2014.'
ista: 'Alistarh D-A, Eugster P, Herlihy M, Matveev A, Shavit N. 2014. StackTrack:
An automated transactional approach to concurrent memory reclamation. EuroSys:
European Conference on Computer Systems.'
mla: 'Alistarh, Dan-Adrian, et al. StackTrack: An Automated Transactional Approach
to Concurrent Memory Reclamation. ACM, 2014, doi:10.1145/2592798.2592808.'
short: D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, N. Shavit, in:, ACM,
2014.
conference:
name: 'EuroSys: European Conference on Computer Systems'
date_created: 2018-12-11T11:48:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:14:25Z
day: '01'
doi: 10.1145/2592798.2592808
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
publication_status: published
publisher: ACM
publist_id: '6888'
status: public
title: 'StackTrack: An automated transactional approach to concurrent memory reclamation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '771'
abstract:
- lang: eng
text: 'We consider the following natural problem: n failure-prone servers, communicating
synchronously through message passing, must assign themselves one-to-one to n
distinct items. Existing literature suggests two possible approaches to this problem.
First, model it as an instance of tight renaming in synchronous message-passing
systems; for deterministic solutions, a tight bound of ©(logn) communication rounds
is known. Second, model the scenario as an instance of randomized load-balancing,
for which elegant sub-logarithmic solutions exist. However, careful examination
reveals that known load-balancing schemes do not apply to our scenario, because
they either do not tolerate faults or do not ensure one-to-one allocation. It
is thus natural to ask if sublogarithmic solutions exist for this apparently simple
but intriguing problem. In this paper, we combine the two approaches to provide
a new randomized solution for tight renaming, which terminates in O (log log n)
communication rounds with high probability, against a strong adaptive adversary.
Our solution, called Balls-into-Leaves, combines the deterministic approach with
a new randomized scheme to obtain perfectly balanced allocations. The algorithm
arranges the items as leaves of a tree, and participants repeatedly perform random
choices among the leaves. The algorithm exchanges information in each round to
split the participants into progressively smaller groups whose random choices
do not conflict. We then extend the algorithm to terminate early in O(log log)
rounds w.h.p., where is the actual number of failures. These results imply an
exponential separation between deterministic and randomized algorithms for the
tight renaming problem in message-passing systems.'
acknowledgement: "Dan Alistarh was partially supported by the SNF Post-\r\ndoctoral
Fellows Program, NSF grant CCF-1217921, DoE\r\nASCR grant ER26116/DE-SC0008923,
and by grants from\r\nthe Oracle and Intel corporations.\r\nOksana Denysyuk and
Lu ́ıs Rodrigues were partially supported by Funda ̧c ̃ao para a Ciˆencia e Tecnologia
(FCT) via\r\nthe project PEPITA (PTDC/EEI-SCR/2776/2012) and via\r\nthe INESC-ID
multi-annual funding through the PIDDAC\r\nProgram fund grant, under project PEst-OE/EEI/LA0021/\r\n2013.\r\nNir
Shavit was supported in part by NSF grants CCF-1217921 and CCF-1301926, DoE ASCR
grant ER26116/DE-SC0008923, and by grants from the Oracle and 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: Oksana
full_name: Denysyuk, Oksana
last_name: Denysyuk
- first_name: Luís
full_name: Rodrígues, Luís
last_name: Rodrígues
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Denysyuk O, Rodrígues L, Shavit N. Balls-into-Leaves: Sub-logarithmic
renaming in synchronous message-passing systems. In: ACM; 2014:232-241. doi:10.1145/2611462.2611499'
apa: 'Alistarh, D.-A., Denysyuk, O., Rodrígues, L., & Shavit, N. (2014). Balls-into-Leaves:
Sub-logarithmic renaming in synchronous message-passing systems (pp. 232–241).
Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2611462.2611499'
chicago: 'Alistarh, Dan-Adrian, Oksana Denysyuk, Luís Rodrígues, and Nir Shavit.
“Balls-into-Leaves: Sub-Logarithmic Renaming in Synchronous Message-Passing Systems,”
232–41. ACM, 2014. https://doi.org/10.1145/2611462.2611499.'
ieee: 'D.-A. Alistarh, O. Denysyuk, L. Rodrígues, and N. Shavit, “Balls-into-Leaves:
Sub-logarithmic renaming in synchronous message-passing systems,” presented at
the PODC: Principles of Distributed Computing, 2014, pp. 232–241.'
ista: 'Alistarh D-A, Denysyuk O, Rodrígues L, Shavit N. 2014. Balls-into-Leaves:
Sub-logarithmic renaming in synchronous message-passing systems. PODC: Principles
of Distributed Computing, 232–241.'
mla: 'Alistarh, Dan-Adrian, et al. Balls-into-Leaves: Sub-Logarithmic Renaming
in Synchronous Message-Passing Systems. ACM, 2014, pp. 232–41, doi:10.1145/2611462.2611499.'
short: D.-A. Alistarh, O. Denysyuk, L. Rodrígues, N. Shavit, in:, ACM, 2014, pp.
232–241.
conference:
name: 'PODC: Principles of Distributed Computing'
date_created: 2018-12-11T11:48:25Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:14:49Z
day: '01'
doi: 10.1145/2611462.2611499
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 232 - 241
publication_status: published
publisher: ACM
publist_id: '6884'
status: public
title: 'Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing
systems'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '772'
abstract:
- lang: eng
text: Lock-free concurrent algorithms guarantee that some concurrent operation will
always make progress in a finite number of steps. Yet programmers prefer to treat
concurrent code as if it were wait-free, guaranteeing that all operations always
make progress. Unfortunately, designing wait-free algorithms is generally a very
complex task, and the resulting algorithms are not always efficient. While obtaining
efficient wait-free algorithms has been a long-time goal for the theory community,
most non-blocking commercial code is only lock-free. This paper suggests a simple
solution to this problem. We show that, for a large class of lock-free algorithms,
under scheduling conditions which approximate those found in commercial hardware
architectures, lock-free algorithms behave as if they are wait-free. In other
words, programmers can keep on designing simple lock-free algorithms instead of
complex wait-free ones, and in practice, they will get wait-free progress. Our
main contribution is a new way of analyzing a general class of lock-free algorithms
under a stochastic scheduler. Our analysis relates the individual performance
of processes with the global performance of the system using Markov chain lifting
between a complex per-process chain and a simpler system progress chain. We show
that lock-free algorithms are not only wait-free with probability 1, but that
in fact a general subset of lock-free algorithms can be closely bounded in terms
of the average number of steps required until an operation completes. To the best
of our knowledge, this is the first attempt to analyze progress conditions, typically
stated in relation to a worst case adversary, in a stochastic model capturing
their expected asymptotic behavior.
acknowledgement: "Dan Alistarh - Part of this work was performed while the author
was a Postdoctoral Associate at MIT CSAIL, where he was supported by SNF\r\nPostdoctoral
Fellows Program, NSF grant CCF-1217921, DoE\r\nASCR grant ER26116/DE-SC0008923,
and by grants from the Oracle and Intel corporations.\r\nKeron Censor-Hillel - Shalon
Fellow\r\nNir Shavit - This work was supported in part by NSF grants CCF-1217921
and\r\nCCF-1301926, DoE ASCR grant ER26116/DE-SC0008923, and\r\nby grants from the
Oracle and Intel corporations."
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: Keren
full_name: Censor Hillel, Keren
last_name: Censor Hillel
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Censor Hillel K, Shavit N. Are lock-free concurrent algorithms
practically wait-free? In: ACM; 2014:714-723. doi:10.1145/2591796.2591836'
apa: 'Alistarh, D.-A., Censor Hillel, K., & Shavit, N. (2014). Are lock-free
concurrent algorithms practically wait-free? (pp. 714–723). Presented at the STOC:
Symposium on Theory of Computing, ACM. https://doi.org/10.1145/2591796.2591836'
chicago: Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock-Free
Concurrent Algorithms Practically Wait-Free?,” 714–23. ACM, 2014. https://doi.org/10.1145/2591796.2591836.
ieee: 'D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock-free concurrent
algorithms practically wait-free?,” presented at the STOC: Symposium on Theory
of Computing, 2014, pp. 714–723.'
ista: 'Alistarh D-A, Censor Hillel K, Shavit N. 2014. Are lock-free concurrent algorithms
practically wait-free? STOC: Symposium on Theory of Computing, 714–723.'
mla: Alistarh, Dan-Adrian, et al. Are Lock-Free Concurrent Algorithms Practically
Wait-Free? ACM, 2014, pp. 714–23, doi:10.1145/2591796.2591836.
short: D.-A. Alistarh, K. Censor Hillel, N. Shavit, in:, ACM, 2014, pp. 714–723.
conference:
name: 'STOC: Symposium on Theory of Computing'
date_created: 2018-12-11T11:48:25Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:15:13Z
day: '01'
doi: 10.1145/2591796.2591836
extern: '1'
external_id:
arxiv:
- '1311.3200'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.3200
month: '01'
oa: 1
oa_version: Preprint
page: 714 - 723
publication_status: published
publisher: ACM
publist_id: '6885'
status: public
title: Are lock-free concurrent algorithms practically wait-free?
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '773'
abstract:
- lang: eng
text: "We describe a new randomized consensus protocol with expected message complexity
O(n2log2n) when fewer than n/2 processes may fail by crashing. This is an almost-linear
improvement over the best previously known protocol, and within logarithmic factors
of a known Ω(n2) message lower bound. The protocol further ensures that no process
sends more than O(n log3n) messages in expectation, which is again within logarithmic
factors of optimal.We also present a generalization of the algorithm to an arbitrary
number of failures t, which uses expected O(nt + t2log2t) total messages. Our
protocol uses messages of size O(log n), and can therefore scale to large networks.\r\n\r\nWe
consider the problem of consensus in the challenging classic model. In this model,
the adversary is adaptive; it can choose which processors crash at any point during
the course of the algorithm. Further, communication is via asynchronous message
passing: there is no known upper bound on the time to send a message from one
processor to another, and all messages and coin flips are seen by the adversary.\r\n\r\nOur
approach is to build a message-efficient, resilient mechanism for aggregating
individual processor votes, implementing the message-passing equivalent of a weak
shared coin. Roughly, in our protocol, a processor first announces its votes to
small groups, then propagates them to increasingly larger groups as it generates
more and more votes. To bound the number of messages that an individual process
might have to send or receive, the protocol progressively increases the weight
of generated votes. The main technical challenge is bounding the impact of votes
that are still “in flight” (generated, but not fully propagated) on the final
outcome of the shared coin, especially since such votes might have different weights.
We achieve this by leveraging the structure of the algorithm, and a technical
argument based on martingale concentration bounds. Overall, we show that it is
possible to build an efficient message-passing implementation of a shared coin,
and in the process (almost-optimally) solve the classic consensus problem in the
asynchronous message-passing model."
alternative_title:
- LNCS
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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Valerie
full_name: King, Valerie
last_name: King
- first_name: Jared
full_name: Saia, Jared
last_name: Saia
citation:
ama: 'Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized
consensus. In: Kuhn F, ed. Vol 8784. Springer; 2014:61-75. doi:10.1007/978-3-662-45174-8_5'
apa: 'Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2014). Communication-efficient
randomized consensus. In F. Kuhn (Ed.) (Vol. 8784, pp. 61–75). Presented at the
DISC: Distributed Computing, Austin, USA: Springer. https://doi.org/10.1007/978-3-662-45174-8_5'
chicago: Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient
Randomized Consensus.” edited by Fabian Kuhn, 8784:61–75. Springer, 2014. https://doi.org/10.1007/978-3-662-45174-8_5.
ieee: 'D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient
randomized consensus,” presented at the DISC: Distributed Computing, Austin, USA,
2014, vol. 8784, pp. 61–75.'
ista: 'Alistarh D-A, Aspnes J, King V, Saia J. 2014. Communication-efficient randomized
consensus. DISC: Distributed Computing, LNCS, vol. 8784, 61–75.'
mla: Alistarh, Dan-Adrian, et al. Communication-Efficient Randomized Consensus.
Edited by Fabian Kuhn, vol. 8784, Springer, 2014, pp. 61–75, doi:10.1007/978-3-662-45174-8_5.
short: D.-A. Alistarh, J. Aspnes, V. King, J. Saia, in:, F. Kuhn (Ed.), Springer,
2014, pp. 61–75.
conference:
end_date: 2014-10-15
location: Austin, USA
name: 'DISC: Distributed Computing'
start_date: 2014-10-12
date_created: 2018-12-11T11:48:25Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:15:36Z
day: '01'
doi: 10.1007/978-3-662-45174-8_5
editor:
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
extern: '1'
intvolume: ' 8784'
language:
- iso: eng
month: '01'
oa_version: None
page: 61 - 75
publication_status: published
publisher: Springer
publist_id: '6881'
status: public
title: Communication-efficient randomized consensus
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8784
year: '2014'
...
---
_id: '774'
abstract:
- lang: eng
text: Lock-free concurrent algorithms guarantee that some concurrent operation will
always make progress in a finite number of steps. Yet programmers would prefer
to treat concurrent code as if it were wait-free, guaranteeing that all operations
always make progress. Unfortunately, designing wait-free algorithms is in general
a complex undertaking, and the resulting algorithms are not always efficient,
so most non-blocking commercial code is only lock-free, and the design of efficient
wait-free algorithms has been left to the academic community. In [2], we suggest
a solution to this problem. We show that, for a large class of lock-free algorithms,
under scheduling conditions which approximate those found in commercial hardware
architectures, lock-free algorithms behave as if they are wait-free. In other
words, programmers can keep on designing simple lock-free algorithms instead of
complex wait-free ones, and in practice, they will get wait-free progress. Our
main contribution is a new way of analyzing a general class of lock-free algorithms
under a stochastic scheduler. Our analysis relates the individual performance
of processes with the global performance of the system using Markov chain lifting
between a complex per-process chain and a simpler system progress chain. We show
that lock-free algorithms are not only wait-free with probability 1, but that
in fact a broad subset of lock-free algorithms can be closely bounded in terms
of the average number of steps required until an operation completes.
acknowledgement: "Dan Alistarh - Part of this work was performed while the
\ author was a\r\nPostdoctoral Associate at MIT CSAIL, where he was supported
\ by SNF Postdoctoral Fellows Program, NSF grant\r\nCCF-1217921, DoE ASCR
grant ER26116/DE-SC0008923,\r\nand by grants from the Oracle and Intel corporations.\r\nKeren
Censor-Hille - Shalon Fellow\r\nNir Shavit - This work was supported in part
\ by NSF grants CCF-1217921 and CCF-1301926, DoE ASCR grant ER26116/DE-\r\nSC0008923,
and by grants from the Oracle and 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: Keren
full_name: Censor Hille, Keren
last_name: Censor Hille
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Censor Hille K, Shavit N. Brief announcement: Are lock-free
concurrent algorithms practically wait-free? In: ACM; 2014:50-52. doi:10.1145/2611462.2611502'
apa: 'Alistarh, D.-A., Censor Hille, K., & Shavit, N. (2014). Brief announcement:
Are lock-free concurrent algorithms practically wait-free? (pp. 50–52). Presented
at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2611462.2611502'
chicago: 'Alistarh, Dan-Adrian, Keren Censor Hille, and Nir Shavit. “Brief Announcement:
Are Lock-Free Concurrent Algorithms Practically Wait-Free?,” 50–52. ACM, 2014.
https://doi.org/10.1145/2611462.2611502.'
ieee: 'D.-A. Alistarh, K. Censor Hille, and N. Shavit, “Brief announcement: Are
lock-free concurrent algorithms practically wait-free?,” presented at the PODC:
Principles of Distributed Computing, 2014, pp. 50–52.'
ista: 'Alistarh D-A, Censor Hille K, Shavit N. 2014. Brief announcement: Are lock-free
concurrent algorithms practically wait-free? PODC: Principles of Distributed Computing,
50–52.'
mla: 'Alistarh, Dan-Adrian, et al. Brief Announcement: Are Lock-Free Concurrent
Algorithms Practically Wait-Free? ACM, 2014, pp. 50–52, doi:10.1145/2611462.2611502.'
short: D.-A. Alistarh, K. Censor Hille, N. Shavit, in:, ACM, 2014, pp. 50–52.
conference:
name: 'PODC: Principles of Distributed Computing'
date_created: 2018-12-11T11:48:26Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T13:15:54Z
day: '01'
doi: 10.1145/2611462.2611502
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 52
publication_status: published
publisher: ACM
publist_id: '6882'
status: public
title: 'Brief announcement: Are lock-free concurrent algorithms practically wait-free?'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7743'
abstract:
- lang: eng
text: Experimental studies have demonstrated that environmental variation can create
genotype‐environment interactions (GEIs) in the traits involved in sexual selection.
Understanding the genetic architecture of phenotype across environments will require
statistical tests that can describe both changes in genetic variance and covariance
across environments. This chapter outlines the theoretical framework for the processes
of sexual selection in the wild, identifying key parameters in wild systems, and
highlighting the potential effects of the environment. It describes the proposed
approaches for the estimation of these key parameters in a quantitative genetic
framework within naturally occurring pedigreed populations. The chapter provides
a worked example for a range of analysis methods. It aims to provide an overview
of the analytical methods that can be used to model GEIs for traits involved in
sexual selection in naturally occurring pedigreed populations.
article_processing_charge: No
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: Anna
full_name: Qvarnström, Anna
last_name: Qvarnström
citation:
ama: 'Robinson MR, Qvarnström A. Influence of the environment on the genetic architecture
of traits involved in sexual selection within wild populations. In: Hunt J, Hosken
D, eds. Genotype-by-Environment Interactions and Sexual Selection. Chichester,
UK: Wiley; 2014:137-168. doi:10.1002/9781118912591.ch6'
apa: 'Robinson, M. R., & Qvarnström, A. (2014). Influence of the environment
on the genetic architecture of traits involved in sexual selection within wild
populations. In J. Hunt & D. Hosken (Eds.), Genotype-by-Environment Interactions
and Sexual Selection (pp. 137–168). Chichester, UK: Wiley. https://doi.org/10.1002/9781118912591.ch6'
chicago: 'Robinson, Matthew Richard, and Anna Qvarnström. “Influence of the Environment
on the Genetic Architecture of Traits Involved in Sexual Selection within Wild
Populations.” In Genotype-by-Environment Interactions and Sexual Selection,
edited by John Hunt and David Hosken, 137–68. Chichester, UK: Wiley, 2014. https://doi.org/10.1002/9781118912591.ch6.'
ieee: 'M. R. Robinson and A. Qvarnström, “Influence of the environment on the genetic
architecture of traits involved in sexual selection within wild populations,”
in Genotype-by-Environment Interactions and Sexual Selection, J. Hunt and
D. Hosken, Eds. Chichester, UK: Wiley, 2014, pp. 137–168.'
ista: 'Robinson MR, Qvarnström A. 2014.Influence of the environment on the genetic
architecture of traits involved in sexual selection within wild populations. In:
Genotype-by-Environment Interactions and Sexual Selection. , 137–168.'
mla: Robinson, Matthew Richard, and Anna Qvarnström. “Influence of the Environment
on the Genetic Architecture of Traits Involved in Sexual Selection within Wild
Populations.” Genotype-by-Environment Interactions and Sexual Selection,
edited by John Hunt and David Hosken, Wiley, 2014, pp. 137–68, doi:10.1002/9781118912591.ch6.
short: M.R. Robinson, A. Qvarnström, in:, J. Hunt, D. Hosken (Eds.), Genotype-by-Environment
Interactions and Sexual Selection, Wiley, Chichester, UK, 2014, pp. 137–168.
date_created: 2020-04-30T10:58:39Z
date_published: 2014-08-29T00:00:00Z
date_updated: 2021-01-12T08:15:13Z
day: '29'
doi: 10.1002/9781118912591.ch6
editor:
- first_name: John
full_name: Hunt, John
last_name: Hunt
- first_name: David
full_name: Hosken, David
last_name: Hosken
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 137-168
place: Chichester, UK
publication: Genotype-by-Environment Interactions and Sexual Selection
publication_identifier:
eisbn:
- '9781118912591'
isbn:
- '9780470671795'
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Influence of the environment on the genetic architecture of traits involved
in sexual selection within wild populations
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7744'
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: Naomi R.
full_name: Wray, Naomi R.
last_name: Wray
- first_name: Peter M.
full_name: Visscher, Peter M.
last_name: Visscher
citation:
ama: Robinson MR, Wray NR, Visscher PM. Explaining additional genetic variation
in complex traits. Trends in Genetics. 2014;30(4):124-132. doi:10.1016/j.tig.2014.02.003
apa: Robinson, M. R., Wray, N. R., & Visscher, P. M. (2014). Explaining additional
genetic variation in complex traits. Trends in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2014.02.003
chicago: Robinson, Matthew Richard, Naomi R. Wray, and Peter M. Visscher. “Explaining
Additional Genetic Variation in Complex Traits.” Trends in Genetics. Elsevier,
2014. https://doi.org/10.1016/j.tig.2014.02.003.
ieee: M. R. Robinson, N. R. Wray, and P. M. Visscher, “Explaining additional genetic
variation in complex traits,” Trends in Genetics, vol. 30, no. 4. Elsevier,
pp. 124–132, 2014.
ista: Robinson MR, Wray NR, Visscher PM. 2014. Explaining additional genetic variation
in complex traits. Trends in Genetics. 30(4), 124–132.
mla: Robinson, Matthew Richard, et al. “Explaining Additional Genetic Variation
in Complex Traits.” Trends in Genetics, vol. 30, no. 4, Elsevier, 2014,
pp. 124–32, doi:10.1016/j.tig.2014.02.003.
short: M.R. Robinson, N.R. Wray, P.M. Visscher, Trends in Genetics 30 (2014) 124–132.
date_created: 2020-04-30T10:58:58Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T08:15:14Z
day: '01'
doi: 10.1016/j.tig.2014.02.003
extern: '1'
intvolume: ' 30'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 124-132
publication: Trends in Genetics
publication_identifier:
issn:
- 0168-9525
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Explaining additional genetic variation in complex traits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2014'
...
---
_id: '775'
abstract:
- lang: eng
text: 'The long-lived renaming problem appears in shared-memory systems where a
set of threads need to register and deregister frequently from the computation,
while concurrent operations scan the set of currently registered threads. Instances
of this problem show up in concurrent implementations of transactional memory,
flat combining, thread barriers, and memory reclamation schemes for lock-free
data structures. In this paper, we analyze a randomized solution for long-lived
renaming. The algorithmic technique we consider, called the Level Array, has previously
been used for hashing and one-shot (single-use) renaming. Our main contribution
is to prove that, in long-lived executions, where processes may register and deregister
polynomially many times, the technique guarantees constant steps on average and
O (log log n) steps with high probability for registering, unit cost for deregistering,
and O (n) steps for collect queries, where n is an upper bound on the number of
processes that may be active at any point in time. We also show that the algorithm
has the surprising property that it is self-healing: under reasonable assumptions
on the schedule, operations running while the data structure is in a degraded
state implicitly help the data structure re-balance itself. This subtle mechanism
obviates the need for expensive periodic rebuilding procedures. Our benchmarks
validate this approach, showing that, for typical use parameters, the average
number of steps a process takes to register is less than two and the worst-case
number of steps is bounded by six, even in executions with billions of operations.
We contrast this with other randomized implementations, whose worst-case behavior
we show to be unreliable, and with deterministic implementations, whose cost is
linear in n.'
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: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Kopinsky J, Matveev A, Shavit N. The levelarray: A fast, practical
long-lived renaming algorithm. In: IEEE; 2014:348-357. doi:10.1109/ICDCS.2014.43'
apa: 'Alistarh, D.-A., Kopinsky, J., Matveev, A., & Shavit, N. (2014). The levelarray:
A fast, practical long-lived renaming algorithm (pp. 348–357). Presented at the
ICDCS: International Conference on Distributed Computing Systems, IEEE. https://doi.org/10.1109/ICDCS.2014.43'
chicago: 'Alistarh, Dan-Adrian, Justin Kopinsky, Alexander Matveev, and Nir Shavit.
“The Levelarray: A Fast, Practical Long-Lived Renaming Algorithm,” 348–57. IEEE,
2014. https://doi.org/10.1109/ICDCS.2014.43.'
ieee: 'D.-A. Alistarh, J. Kopinsky, A. Matveev, and N. Shavit, “The levelarray:
A fast, practical long-lived renaming algorithm,” presented at the ICDCS: International
Conference on Distributed Computing Systems, 2014, pp. 348–357.'
ista: 'Alistarh D-A, Kopinsky J, Matveev A, Shavit N. 2014. The levelarray: A fast,
practical long-lived renaming algorithm. ICDCS: International Conference on Distributed
Computing Systems, 348–357.'
mla: 'Alistarh, Dan-Adrian, et al. The Levelarray: A Fast, Practical Long-Lived
Renaming Algorithm. IEEE, 2014, pp. 348–57, doi:10.1109/ICDCS.2014.43.'
short: D.-A. Alistarh, J. Kopinsky, A. Matveev, N. Shavit, in:, IEEE, 2014, pp.
348–357.
conference:
name: 'ICDCS: International Conference on Distributed Computing Systems'
date_created: 2018-12-11T11:48:26Z
date_published: 2014-08-29T00:00:00Z
date_updated: 2023-02-23T13:16:18Z
day: '29'
doi: 10.1109/ICDCS.2014.43
extern: '1'
external_id:
arxiv:
- '1405.5461'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.5461
month: '08'
oa: 1
oa_version: Preprint
page: 348 - 357
publication_status: published
publisher: IEEE
publist_id: '6883'
status: public
title: 'The levelarray: A fast, practical long-lived renaming algorithm'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '468'
abstract:
- lang: eng
text: Invasive alien parasites and pathogens are a growing threat to biodiversity
worldwide, which can contribute to the extinction of endemic species. On the Galápagos
Islands, the invasive parasitic fly Philornis downsi poses a major threat to the
endemic avifauna. Here, we investigated the influence of this parasite on the
breeding success of two Darwin's finch species, the warbler finch (Certhidea olivacea)
and the sympatric small tree finch (Camarhynchus parvulus), on Santa Cruz Island
in 2010 and 2012. While the population of the small tree finch appeared to be
stable, the warbler finch has experienced a dramatic decline in population size
on Santa Cruz Island since 1997. We aimed to identify whether warbler finches
are particularly vulnerable during different stages of the breeding cycle. Contrary
to our prediction, breeding success was lower in the small tree finch than in
the warbler finch. In both species P. downsi had a strong negative impact on breeding
success and our data suggest that heavy rain events also lowered the fledging
success. On the one hand parents might be less efficient in compensating their
chicks' energy loss due to parasitism as they might be less efficient in foraging
on days of heavy rain. On the other hand, intense rainfalls might lead to increased
humidity and more rapid cooling of the nests. In the case of the warbler finch
we found that the control of invasive plant species with herbicides had a significant
additive negative impact on the breeding success. It is very likely that the availability
of insects (i.e. food abundance) is lower in such controlled areas, as herbicide
usage led to the removal of the entire understory. Predation seems to be a minor
factor in brood loss.
acknowledgement: The study was funded by the University of Vienna (Focus of Excellence
grant), the Galápagos Conservation Trust, and the Ethologische Gesellschaft e.V.
article_number: '0107518'
author:
- first_name: Arno
full_name: Cimadom, Arno
last_name: Cimadom
- first_name: Angel
full_name: Ulloa, Angel
last_name: Ulloa
- first_name: Patrick
full_name: Meidl, Patrick
id: 4709BCE6-F248-11E8-B48F-1D18A9856A87
last_name: Meidl
- first_name: Markus
full_name: Zöttl, Markus
last_name: Zöttl
- first_name: Elisabet
full_name: Zöttl, Elisabet
last_name: Zöttl
- first_name: Birgit
full_name: Fessl, Birgit
last_name: Fessl
- first_name: Erwin
full_name: Nemeth, Erwin
last_name: Nemeth
- first_name: Michael
full_name: Dvorak, Michael
last_name: Dvorak
- first_name: Francesca
full_name: Cunninghame, Francesca
last_name: Cunninghame
- first_name: Sabine
full_name: Tebbich, Sabine
last_name: Tebbich
citation:
ama: Cimadom A, Ulloa A, Meidl P, et al. Invasive parasites habitat change and heavy
rainfall reduce breeding success in Darwin’s finches. PLoS One. 2014;9(9).
doi:10.1371/journal.pone.0107518
apa: Cimadom, A., Ulloa, A., Meidl, P., Zöttl, M., Zöttl, E., Fessl, B., … Tebbich,
S. (2014). Invasive parasites habitat change and heavy rainfall reduce breeding
success in Darwin’s finches. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0107518
chicago: Cimadom, Arno, Angel Ulloa, Patrick Meidl, Markus Zöttl, Elisabet Zöttl,
Birgit Fessl, Erwin Nemeth, Michael Dvorak, Francesca Cunninghame, and Sabine
Tebbich. “Invasive Parasites Habitat Change and Heavy Rainfall Reduce Breeding
Success in Darwin’s Finches.” PLoS One. Public Library of Science, 2014.
https://doi.org/10.1371/journal.pone.0107518.
ieee: A. Cimadom et al., “Invasive parasites habitat change and heavy rainfall
reduce breeding success in Darwin’s finches,” PLoS One, vol. 9, no. 9.
Public Library of Science, 2014.
ista: Cimadom A, Ulloa A, Meidl P, Zöttl M, Zöttl E, Fessl B, Nemeth E, Dvorak M,
Cunninghame F, Tebbich S. 2014. Invasive parasites habitat change and heavy rainfall
reduce breeding success in Darwin’s finches. PLoS One. 9(9), 0107518.
mla: Cimadom, Arno, et al. “Invasive Parasites Habitat Change and Heavy Rainfall
Reduce Breeding Success in Darwin’s Finches.” PLoS One, vol. 9, no. 9,
0107518, Public Library of Science, 2014, doi:10.1371/journal.pone.0107518.
short: A. Cimadom, A. Ulloa, P. Meidl, M. Zöttl, E. Zöttl, B. Fessl, E. Nemeth,
M. Dvorak, F. Cunninghame, S. Tebbich, PLoS One 9 (2014).
date_created: 2018-12-11T11:46:38Z
date_published: 2014-09-23T00:00:00Z
date_updated: 2021-01-12T08:00:48Z
day: '23'
ddc:
- '576'
department:
- _id: CampIT
doi: 10.1371/journal.pone.0107518
file:
- access_level: open_access
checksum: b24e7518ccd41effed0d7d9e2498f67f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:48Z
date_updated: 2020-07-14T12:46:34Z
file_id: '5103'
file_name: IST-2018-954-v1+1_2014_Meidl_Invasive_parasites.PDF
file_size: 489387
relation: main_file
file_date_updated: 2020-07-14T12:46:34Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '7352'
pubrep_id: '954'
quality_controlled: '1'
scopus_import: 1
status: public
title: Invasive parasites habitat change and heavy rainfall reduce breeding success
in Darwin's finches
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...