---
_id: '232'
abstract:
- lang: eng
text: We study the average order of the divisor function, as it ranges over the
values of binary quartic forms that are reducible over ℚ.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Régis
full_name: De La Bretèche, Régis
last_name: De La Bretèche
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: De La Bretèche R, Browning TD. Le problème des diviseurs pour des formes binaires
de degré 4. Journal fur die Reine und Angewandte Mathematik. 2010;(646):1-44.
doi:10.1515/CRELLE.2010.064
apa: De La Bretèche, R., & Browning, T. D. (2010). Le problème des diviseurs
pour des formes binaires de degré 4. Journal Fur Die Reine Und Angewandte Mathematik.
Walter de Gruyter. https://doi.org/10.1515/CRELLE.2010.064
chicago: De La Bretèche, Régis, and Timothy D Browning. “Le Problème Des Diviseurs
Pour Des Formes Binaires de Degré 4.” Journal Fur Die Reine Und Angewandte
Mathematik. Walter de Gruyter, 2010. https://doi.org/10.1515/CRELLE.2010.064.
ieee: R. De La Bretèche and T. D. Browning, “Le problème des diviseurs pour des
formes binaires de degré 4,” Journal fur die Reine und Angewandte Mathematik,
no. 646. Walter de Gruyter, pp. 1–44, 2010.
ista: De La Bretèche R, Browning TD. 2010. Le problème des diviseurs pour des formes
binaires de degré 4. Journal fur die Reine und Angewandte Mathematik. (646), 1–44.
mla: De La Bretèche, Régis, and Timothy D. Browning. “Le Problème Des Diviseurs
Pour Des Formes Binaires de Degré 4.” Journal Fur Die Reine Und Angewandte
Mathematik, no. 646, Walter de Gruyter, 2010, pp. 1–44, doi:10.1515/CRELLE.2010.064.
short: R. De La Bretèche, T.D. Browning, Journal Fur Die Reine Und Angewandte Mathematik
(2010) 1–44.
date_created: 2018-12-11T11:45:20Z
date_published: 2010-09-17T00:00:00Z
date_updated: 2021-01-12T06:56:45Z
day: '17'
doi: 10.1515/CRELLE.2010.064
extern: '1'
external_id:
arxiv:
- '0808.2340'
issue: '646'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0808.2340
month: '09'
oa: 1
oa_version: Preprint
page: 1 - 44
publication: Journal fur die Reine und Angewandte Mathematik
publication_status: published
publisher: Walter de Gruyter
publist_id: '7672'
quality_controlled: '1'
status: public
title: Le problème des diviseurs pour des formes binaires de degré 4
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '2322'
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Frank R, Lieb É, Seiringer R. Equivalence of Sobolev inequalities and Lieb-Thirring
inequalities. In: World Scientific Publishing; 2010:523-535. doi:10.1142/9789814304634_0045 '
apa: 'Frank, R., Lieb, É., & Seiringer, R. (2010). Equivalence of Sobolev inequalities
and Lieb-Thirring inequalities (pp. 523–535). Presented at the ICMP: International
Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814304634_0045 '
chicago: Frank, Rupert, Élliott Lieb, and Robert Seiringer. “ Equivalence of Sobolev
Inequalities and Lieb-Thirring Inequalities,” 523–35. World Scientific Publishing,
2010. https://doi.org/10.1142/9789814304634_0045
.
ieee: 'R. Frank, É. Lieb, and R. Seiringer, “ Equivalence of Sobolev inequalities
and Lieb-Thirring inequalities,” presented at the ICMP: International Congress
on Mathematical Physics, 2010, pp. 523–535.'
ista: 'Frank R, Lieb É, Seiringer R. 2010. Equivalence of Sobolev inequalities
and Lieb-Thirring inequalities. ICMP: International Congress on Mathematical Physics,
523–535.'
mla: Frank, Rupert, et al. Equivalence of Sobolev Inequalities and Lieb-Thirring
Inequalities. World Scientific Publishing, 2010, pp. 523–35, doi:10.1142/9789814304634_0045 .
short: R. Frank, É. Lieb, R. Seiringer, in:, World Scientific Publishing, 2010,
pp. 523–535.
conference:
name: 'ICMP: International Congress on Mathematical Physics'
date_created: 2018-12-11T11:56:59Z
date_published: 2010-03-31T00:00:00Z
date_updated: 2021-01-12T06:56:46Z
day: '31'
doi: '10.1142/9789814304634_0045 '
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0909.5449
month: '03'
oa: 1
page: 523 - 535
publication_status: published
publisher: World Scientific Publishing
publist_id: '4605'
quality_controlled: 0
status: public
title: ' Equivalence of Sobolev inequalities and Lieb-Thirring inequalities'
type: conference
year: '2010'
...
---
_id: '2323'
abstract:
- lang: eng
text: Since the first experimental realization of Bose-Einstein condensation in
cold atomic gases in 1995 there has been a surge of activity in this field. Ingenious
experiments have allowed us to probe matter close to zero temperature and reveal
some of the fascinating effects quantum mechanics has bestowed on nature. It is
a challenge for mathematical physicists to understand these various phenomena
from first principles, that is, starting from the underlying many-body Schrödinger
equation. Recent progress in this direction concerns mainly equilibrium properties
of dilute, cold quantum gases. We shall explain some of the results in this article,
and describe the mathematics involved in understanding these phenomena. Topics
include the ground state energy and the free energy at positive temperature, the
effect of interparticle interaction on the critical temperature for Bose-Einstein
condensation, as well as the occurrence of superfluidity and quantized vortices
in rapidly rotating gases.
author:
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Seiringer R. Hot topics on cold gases. In: World Scientific Publishing; 2010:231-245.
doi:10.1142/9789814304634_0013'
apa: 'Seiringer, R. (2010). Hot topics on cold gases (pp. 231–245). Presented at
the ICMP: International Congress on Mathematical Physics, World Scientific Publishing.
https://doi.org/10.1142/9789814304634_0013'
chicago: Seiringer, Robert. “Hot Topics on Cold Gases,” 231–45. World Scientific
Publishing, 2010. https://doi.org/10.1142/9789814304634_0013.
ieee: 'R. Seiringer, “Hot topics on cold gases,” presented at the ICMP: International
Congress on Mathematical Physics, 2010, pp. 231–245.'
ista: 'Seiringer R. 2010. Hot topics on cold gases. ICMP: International Congress
on Mathematical Physics, 231–245.'
mla: Seiringer, Robert. Hot Topics on Cold Gases. World Scientific Publishing,
2010, pp. 231–45, doi:10.1142/9789814304634_0013.
short: R. Seiringer, in:, World Scientific Publishing, 2010, pp. 231–245.
conference:
name: 'ICMP: International Congress on Mathematical Physics'
date_created: 2018-12-11T11:56:59Z
date_published: 2010-03-31T00:00:00Z
date_updated: 2021-01-12T06:56:46Z
day: '31'
doi: 10.1142/9789814304634_0013
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0908.3686
month: '03'
oa: 1
page: 231 - 245
publication_status: published
publisher: World Scientific Publishing
publist_id: '4604'
quality_controlled: 0
status: public
title: Hot topics on cold gases
type: conference
year: '2010'
...
---
_id: '2324'
abstract:
- lang: eng
text: We determine the sharp constant in the Hardy inequality for fractional Sobolev
spaces on half-spaces. Our proof relies on a nonlinear and nonlocal version of
the ground state representation.
alternative_title:
- International Mathematical Series
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Frank R, Seiringer R. Sharp fractional Hardy inequalities in half-spaces.
In: Around the Research of Vladimir Maz’ya I. Vol 11. Springer; 2010:161-167.
doi:10.1007/978-1-4419-1341-8_6'
apa: Frank, R., & Seiringer, R. (2010). Sharp fractional Hardy inequalities
in half-spaces. In Around the Research of Vladimir Maz’ya I (Vol. 11, pp.
161–167). Springer. https://doi.org/10.1007/978-1-4419-1341-8_6
chicago: Frank, Rupert, and Robert Seiringer. “Sharp Fractional Hardy Inequalities
in Half-Spaces.” In Around the Research of Vladimir Maz’ya I, 11:161–67.
Springer, 2010. https://doi.org/10.1007/978-1-4419-1341-8_6.
ieee: R. Frank and R. Seiringer, “Sharp fractional Hardy inequalities in half-spaces,”
in Around the Research of Vladimir Maz’ya I, vol. 11, Springer, 2010, pp.
161–167.
ista: 'Frank R, Seiringer R. 2010.Sharp fractional Hardy inequalities in half-spaces.
In: Around the Research of Vladimir Maz’ya I. International Mathematical Series,
vol. 11, 161–167.'
mla: Frank, Rupert, and Robert Seiringer. “Sharp Fractional Hardy Inequalities in
Half-Spaces.” Around the Research of Vladimir Maz’ya I, vol. 11, Springer,
2010, pp. 161–67, doi:10.1007/978-1-4419-1341-8_6.
short: R. Frank, R. Seiringer, in:, Around the Research of Vladimir Maz’ya I, Springer,
2010, pp. 161–167.
date_created: 2018-12-11T11:56:59Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:46Z
day: '01'
doi: 10.1007/978-1-4419-1341-8_6
extern: 1
intvolume: ' 11'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0906.1561
month: '01'
oa: 1
page: 161 - 167
publication: Around the Research of Vladimir Maz'ya I
publication_status: published
publisher: Springer
publist_id: '4603'
quality_controlled: 0
status: public
title: Sharp fractional Hardy inequalities in half-spaces
type: book_chapter
volume: 11
year: '2010'
...
---
_id: '2389'
abstract:
- lang: eng
text: We study the eigenvalues of Schrödinger type operators T + λV and their asymptotic
behavior in the small coupling limit λ → 0, in the case where the symbol of the
kinetic energy, T (p), strongly degenerates on a non-trivial manifold of codimension
one.
author:
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Hainzl C, Seiringer R. Asymptotic behavior of eigenvalues of Schrödinger type
operators with degenerate kinetic energy. Mathematische Nachrichten. 2010;283(3):489-499.
doi:10.1002/mana.200810195
apa: Hainzl, C., & Seiringer, R. (2010). Asymptotic behavior of eigenvalues
of Schrödinger type operators with degenerate kinetic energy. Mathematische
Nachrichten. Wiley-Blackwell. https://doi.org/10.1002/mana.200810195
chicago: Hainzl, Christian, and Robert Seiringer. “Asymptotic Behavior of Eigenvalues
of Schrödinger Type Operators with Degenerate Kinetic Energy.” Mathematische
Nachrichten. Wiley-Blackwell, 2010. https://doi.org/10.1002/mana.200810195.
ieee: C. Hainzl and R. Seiringer, “Asymptotic behavior of eigenvalues of Schrödinger
type operators with degenerate kinetic energy,” Mathematische Nachrichten,
vol. 283, no. 3. Wiley-Blackwell, pp. 489–499, 2010.
ista: Hainzl C, Seiringer R. 2010. Asymptotic behavior of eigenvalues of Schrödinger
type operators with degenerate kinetic energy. Mathematische Nachrichten. 283(3),
489–499.
mla: Hainzl, Christian, and Robert Seiringer. “Asymptotic Behavior of Eigenvalues
of Schrödinger Type Operators with Degenerate Kinetic Energy.” Mathematische
Nachrichten, vol. 283, no. 3, Wiley-Blackwell, 2010, pp. 489–99, doi:10.1002/mana.200810195.
short: C. Hainzl, R. Seiringer, Mathematische Nachrichten 283 (2010) 489–499.
date_created: 2018-12-11T11:57:23Z
date_published: 2010-03-01T00:00:00Z
date_updated: 2021-01-12T06:57:11Z
day: '01'
doi: 10.1002/mana.200810195
extern: 1
intvolume: ' 283'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0808.3737
month: '03'
oa: 1
page: 489 - 499
publication: Mathematische Nachrichten
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4537'
quality_controlled: 0
status: public
title: Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate
kinetic energy
type: journal_article
volume: 283
year: '2010'
...
---
_id: '2392'
abstract:
- lang: eng
text: The binding of polarons, or its absence, is an old and subtle topic. Here
we prove two things rigorously. First, the transition from many-body collapse
to the existence of a thermodynamic limit for N polarons occurs precisely at U=2α,
where U is the electronic Coulomb repulsion and α is the polaron coupling constant.
Second, if U is large enough, there is no multipolaron binding of any kind. Considering
the known fact that there is binding for some U>2α, these conclusions are not
obvious and their proof has been an open problem for some time.
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Lawrence
full_name: Thomas, Lawrence E
last_name: Thomas
citation:
ama: Frank R, Lieb É, Seiringer R, Thomas L. Bipolaron and N-polaron binding energies.
Physical Review Letters. 2010;104(21). doi:10.1103/PhysRevLett.104.210402
apa: Frank, R., Lieb, É., Seiringer, R., & Thomas, L. (2010). Bipolaron and
N-polaron binding energies. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/PhysRevLett.104.210402
chicago: Frank, Rupert, Élliott Lieb, Robert Seiringer, and Lawrence Thomas. “Bipolaron
and N-Polaron Binding Energies.” Physical Review Letters. American Physical
Society, 2010. https://doi.org/10.1103/PhysRevLett.104.210402.
ieee: R. Frank, É. Lieb, R. Seiringer, and L. Thomas, “Bipolaron and N-polaron binding
energies,” Physical Review Letters, vol. 104, no. 21. American Physical
Society, 2010.
ista: Frank R, Lieb É, Seiringer R, Thomas L. 2010. Bipolaron and N-polaron binding
energies. Physical Review Letters. 104(21).
mla: Frank, Rupert, et al. “Bipolaron and N-Polaron Binding Energies.” Physical
Review Letters, vol. 104, no. 21, American Physical Society, 2010, doi:10.1103/PhysRevLett.104.210402.
short: R. Frank, É. Lieb, R. Seiringer, L. Thomas, Physical Review Letters 104 (2010).
date_created: 2018-12-11T11:57:24Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:12Z
day: '01'
doi: 10.1103/PhysRevLett.104.210402
extern: 1
intvolume: ' 104'
issue: '21'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1004.1196
month: '01'
oa: 1
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4536'
quality_controlled: 0
status: public
title: Bipolaron and N-polaron binding energies
type: journal_article
volume: 104
year: '2010'
...
---
_id: '2409'
abstract:
- lang: eng
text: "Background: The availability of many gene alignments with overlapping taxon
sets raises the question of which strategy is the best to infer species phylogenies
from multiple gene information. Methods and programs abound that use the gene
alignment in different ways to reconstruct the species tree. In particular, different
methods combine the original data at different points along the way from the underlying
sequences to the final tree. Accordingly, they are classified into superalignment,
supertree and medium-level approaches. Here, we present a simulation study to
compare different methods from each of these three approaches.\r\n\r\nResults:
We observe that superalignment methods usually outperform the other approaches
over a wide range of parameters including sparse data and gene-specific evolutionary
parameters. In the presence of high incongruency among gene trees, however, other
combination methods show better performance than the superalignment approach.
Surprisingly, some supertree and medium-level methods exhibit, on average, worse
results than a single gene phylogeny with complete taxon information.\r\n\r\nConclusions:
For some methods, using the reconstructed gene tree as an estimation of the species
tree is superior to the combination of incomplete information. Superalignment
usually performs best since it is less susceptible to stochastic error. Supertree
methods can outperform superalignment in the presence of gene-tree conflict."
acknowledgement: Financial support from the Wiener Wissenschafts-, Forschungs- and
Technologiefonds (WWTF) is greatly appreciated. A.v.H. acknowledges support from
the German Research Foundation (DFG, SPP-1174).
article_number: '37'
author:
- first_name: Anne
full_name: Kupczok, Anne
id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
last_name: Kupczok
- first_name: Heiko
full_name: Schmidt, Heiko
last_name: Schmidt
- first_name: Arndt
full_name: Von Haeseler, Arndt
last_name: Von Haeseler
citation:
ama: Kupczok A, Schmidt H, Von Haeseler A. Accuracy of phylogeny reconstruction
methods combining overlapping gene data sets . Algorithms for Molecular Biology.
2010;5(1). doi:10.1186/1748-7188-5-37
apa: Kupczok, A., Schmidt, H., & Von Haeseler, A. (2010). Accuracy of phylogeny
reconstruction methods combining overlapping gene data sets . Algorithms for
Molecular Biology. BioMed Central. https://doi.org/10.1186/1748-7188-5-37
chicago: Kupczok, Anne, Heiko Schmidt, and Arndt Von Haeseler. “Accuracy of Phylogeny
Reconstruction Methods Combining Overlapping Gene Data Sets .” Algorithms for
Molecular Biology. BioMed Central, 2010. https://doi.org/10.1186/1748-7188-5-37.
ieee: A. Kupczok, H. Schmidt, and A. Von Haeseler, “Accuracy of phylogeny reconstruction
methods combining overlapping gene data sets ,” Algorithms for Molecular Biology,
vol. 5, no. 1. BioMed Central, 2010.
ista: Kupczok A, Schmidt H, Von Haeseler A. 2010. Accuracy of phylogeny reconstruction
methods combining overlapping gene data sets . Algorithms for Molecular Biology.
5(1), 37.
mla: Kupczok, Anne, et al. “Accuracy of Phylogeny Reconstruction Methods Combining
Overlapping Gene Data Sets .” Algorithms for Molecular Biology, vol. 5,
no. 1, 37, BioMed Central, 2010, doi:10.1186/1748-7188-5-37.
short: A. Kupczok, H. Schmidt, A. Von Haeseler, Algorithms for Molecular Biology
5 (2010).
date_created: 2018-12-11T11:57:30Z
date_published: 2010-12-06T00:00:00Z
date_updated: 2021-01-12T06:57:18Z
day: '06'
ddc:
- '576'
department:
- _id: JoBo
doi: 10.1186/1748-7188-5-37
file:
- access_level: open_access
checksum: e2497285388bc4da629bafb46662eb43
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:16Z
date_updated: 2020-07-14T12:45:40Z
file_id: '4739'
file_name: IST-2018-939-v1+1_2010_Kupczok_Accuracy_of.pdf
file_size: 723929
relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: Algorithms for Molecular Biology
publication_status: published
publisher: BioMed Central
publist_id: '4517'
pubrep_id: '939'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Accuracy of phylogeny reconstruction methods combining overlapping gene data
sets '
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2010'
...
---
_id: '2435'
abstract:
- lang: eng
text: |
We consider a generalization of the van Kampen-Flores Theorem and relate it to the long-standing g-conjecture for simplicial spheres.
author:
- first_name: Eran
full_name: Nevo, Eran
last_name: Nevo
- first_name: Uli
full_name: Uli Wagner
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Nevo E, Wagner U. On the embeddability of skeleta of spheres. Israel Journal
of Mathematics. 2010;174(1):381-402. doi:10.1007/s11856-009-0119-5
apa: Nevo, E., & Wagner, U. (2010). On the embeddability of skeleta of spheres.
Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-009-0119-5
chicago: Nevo, Eran, and Uli Wagner. “On the Embeddability of Skeleta of Spheres.”
Israel Journal of Mathematics. Springer, 2010. https://doi.org/10.1007/s11856-009-0119-5.
ieee: E. Nevo and U. Wagner, “On the embeddability of skeleta of spheres,” Israel
Journal of Mathematics, vol. 174, no. 1. Springer, pp. 381–402, 2010.
ista: Nevo E, Wagner U. 2010. On the embeddability of skeleta of spheres. Israel
Journal of Mathematics. 174(1), 381–402.
mla: Nevo, Eran, and Uli Wagner. “On the Embeddability of Skeleta of Spheres.” Israel
Journal of Mathematics, vol. 174, no. 1, Springer, 2010, pp. 381–402, doi:10.1007/s11856-009-0119-5.
short: E. Nevo, U. Wagner, Israel Journal of Mathematics 174 (2010) 381–402.
date_created: 2018-12-11T11:57:38Z
date_published: 2010-11-01T00:00:00Z
date_updated: 2021-01-12T06:57:28Z
day: '01'
doi: 10.1007/s11856-009-0119-5
extern: 1
intvolume: ' 174'
issue: '1'
month: '11'
page: 381 - 402
publication: Israel Journal of Mathematics
publication_status: published
publisher: Springer
publist_id: '4472'
quality_controlled: 0
status: public
title: On the embeddability of skeleta of spheres
type: journal_article
volume: 174
year: '2010'
...
---
_id: '7078'
abstract:
- lang: eng
text: We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction,
magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy
measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate
that our Bridgman-grown single crystals have a p-type carrier concentration of
3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3.
Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K,
the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature
of 294 K. For each sample type, three-terminal capacitive dilatometry measurements
detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on
SnTe show elastic hardening near the structural transition, pointing to co-elastic
behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening,
pointing to ferroelastic behavior. Effective Debye temperature, θD, values of
SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the
range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In
addition, a precursor softening extending over approximately 100 K anticipates
this collapse at the critical temperature and quantitative analysis over three
decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02,
a value indicating a three-dimensional softening of phonon branches at a temperature
T0∼75 K, considerably below Tc. We suggest that the differences in these two types
of elastic behaviors lie in the absence of elastic domain-wall motion in the one
case and their nucleation in the other.
article_number: '184112'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: E. K. H.
full_name: Salje, E. K. H.
last_name: Salje
- first_name: D. J.
full_name: Safarik, D. J.
last_name: Safarik
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: J. E.
full_name: Gubernatis, J. E.
last_name: Gubernatis
- first_name: J. C.
full_name: Cooley, J. C.
last_name: Cooley
- first_name: R. D.
full_name: Taylor, R. D.
last_name: Taylor
- first_name: B.
full_name: Mihaila, B.
last_name: Mihaila
- first_name: A.
full_name: Saxena, A.
last_name: Saxena
- first_name: T.
full_name: Lookman, T.
last_name: Lookman
- first_name: J. L.
full_name: Smith, J. L.
last_name: Smith
- first_name: R. A.
full_name: Fisher, R. A.
last_name: Fisher
- first_name: M.
full_name: Pasternak, M.
last_name: Pasternak
- first_name: C. P.
full_name: Opeil, C. P.
last_name: Opeil
- first_name: T.
full_name: Siegrist, T.
last_name: Siegrist
- first_name: P. B.
full_name: Littlewood, P. B.
last_name: Littlewood
- first_name: J. C.
full_name: Lashley, J. C.
last_name: Lashley
citation:
ama: 'Salje EKH, Safarik DJ, Modic KA, et al. Tin telluride: A weakly co-elastic
metal. Physical Review B. 2010;82(18). doi:10.1103/physrevb.82.184112'
apa: 'Salje, E. K. H., Safarik, D. J., Modic, K. A., Gubernatis, J. E., Cooley,
J. C., Taylor, R. D., … Lashley, J. C. (2010). Tin telluride: A weakly co-elastic
metal. Physical Review B. APS. https://doi.org/10.1103/physrevb.82.184112'
chicago: 'Salje, E. K. H., D. J. Safarik, Kimberly A Modic, J. E. Gubernatis, J.
C. Cooley, R. D. Taylor, B. Mihaila, et al. “Tin Telluride: A Weakly Co-Elastic
Metal.” Physical Review B. APS, 2010. https://doi.org/10.1103/physrevb.82.184112.'
ieee: 'E. K. H. Salje et al., “Tin telluride: A weakly co-elastic metal,”
Physical Review B, vol. 82, no. 18. APS, 2010.'
ista: 'Salje EKH, Safarik DJ, Modic KA, Gubernatis JE, Cooley JC, Taylor RD, Mihaila
B, Saxena A, Lookman T, Smith JL, Fisher RA, Pasternak M, Opeil CP, Siegrist T,
Littlewood PB, Lashley JC. 2010. Tin telluride: A weakly co-elastic metal. Physical
Review B. 82(18), 184112.'
mla: 'Salje, E. K. H., et al. “Tin Telluride: A Weakly Co-Elastic Metal.” Physical
Review B, vol. 82, no. 18, 184112, APS, 2010, doi:10.1103/physrevb.82.184112.'
short: E.K.H. Salje, D.J. Safarik, K.A. Modic, J.E. Gubernatis, J.C. Cooley, R.D.
Taylor, B. Mihaila, A. Saxena, T. Lookman, J.L. Smith, R.A. Fisher, M. Pasternak,
C.P. Opeil, T. Siegrist, P.B. Littlewood, J.C. Lashley, Physical Review B 82 (2010).
date_created: 2019-11-19T13:46:28Z
date_published: 2010-11-18T00:00:00Z
date_updated: 2021-01-12T08:11:44Z
day: '18'
doi: 10.1103/physrevb.82.184112
extern: '1'
external_id:
arxiv:
- '1011.1445'
intvolume: ' 82'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1011.1445
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
issn:
- 1098-0121
- 1550-235X
publication_status: published
publisher: APS
quality_controlled: '1'
status: public
title: 'Tin telluride: A weakly co-elastic metal'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2010'
...
---
_id: '7079'
abstract:
- lang: eng
text: We have observed that reacting Pb:Te:Ag:Se in a 1:1:1.9:1 molar ratio gives
rise to what appears to be a predominantly single-phase alloy, which crystallizes
in the PbSe cF8 fcc structure. However, further investigation of the structure
using energy dispersive x-ray analysis reveals the presence of two phases, PbSe
and β-Ag2Te, with identical lattice parameters. The total thermal conductivity
of the formed alloy is remarkably low for a crystalline material, κT<0.6W∕mK at
675K, it is reproducible, and in addition, the compound has good mechanical properties.
article_number: '033519'
article_processing_charge: No
article_type: original
author:
- first_name: Fivos R.
full_name: Drymiotis, Fivos R.
last_name: Drymiotis
- first_name: Tyler B.
full_name: Drye, Tyler B.
last_name: Drye
- first_name: Yisha
full_name: Wang, Yisha
last_name: Wang
- first_name: Jian
full_name: He, Jian
last_name: He
- first_name: Daniel
full_name: Rhodes, Daniel
last_name: Rhodes
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Samantha
full_name: Cawthorne, Samantha
last_name: Cawthorne
- first_name: Qiu Run
full_name: Zhang, Qiu Run
last_name: Zhang
citation:
ama: Drymiotis FR, Drye TB, Wang Y, et al. Structure formation and very low thermal
conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. 2010;107(3).
doi:10.1063/1.3284946
apa: Drymiotis, F. R., Drye, T. B., Wang, Y., He, J., Rhodes, D., Modic, K. A.,
… Zhang, Q. R. (2010). Structure formation and very low thermal conductivity in
Pb:Te:Ag:Se mixtures. Journal of Applied Physics. AIP. https://doi.org/10.1063/1.3284946
chicago: Drymiotis, Fivos R., Tyler B. Drye, Yisha Wang, Jian He, Daniel Rhodes,
Kimberly A Modic, Samantha Cawthorne, and Qiu Run Zhang. “Structure Formation
and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” Journal of Applied
Physics. AIP, 2010. https://doi.org/10.1063/1.3284946.
ieee: F. R. Drymiotis et al., “Structure formation and very low thermal conductivity
in Pb:Te:Ag:Se mixtures,” Journal of Applied Physics, vol. 107, no. 3.
AIP, 2010.
ista: Drymiotis FR, Drye TB, Wang Y, He J, Rhodes D, Modic KA, Cawthorne S, Zhang
QR. 2010. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se
mixtures. Journal of Applied Physics. 107(3), 033519.
mla: Drymiotis, Fivos R., et al. “Structure Formation and Very Low Thermal Conductivity
in Pb:Te:Ag:Se Mixtures.” Journal of Applied Physics, vol. 107, no. 3,
033519, AIP, 2010, doi:10.1063/1.3284946.
short: F.R. Drymiotis, T.B. Drye, Y. Wang, J. He, D. Rhodes, K.A. Modic, S. Cawthorne,
Q.R. Zhang, Journal of Applied Physics 107 (2010).
date_created: 2019-11-19T13:47:24Z
date_published: 2010-02-09T00:00:00Z
date_updated: 2021-01-12T08:11:44Z
day: '09'
doi: 10.1063/1.3284946
extern: '1'
intvolume: ' 107'
issue: '3'
language:
- iso: eng
month: '02'
oa_version: None
publication: Journal of Applied Physics
publication_identifier:
issn:
- 0021-8979
- 1089-7550
publication_status: published
publisher: AIP
quality_controlled: '1'
status: public
title: Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 107
year: '2010'
...
---
_id: '7318'
abstract:
- lang: eng
text: The decomposition reaction of H2O2 aqueous solutions (H2O2 - H2O + 1/2O2)
catalyzed by transition metal oxide powders has been compared with the charging
voltage of nonaqueous Li-O2 cells containing the same catalyst. An inverse linear
relationship between Ln k (rate constant for the H2O2 decomposition) and the charging
voltage has been found, despite differences in media and possible mechanistic
differences. The results suggest that the decomposition may be a reliable, useful,
and fast screening tool for materials that promote the charging process of the
Li-O2 battery and may ultimately give insight into the charging mechanism.
article_number: A180
article_processing_charge: No
article_type: letter_note
author:
- first_name: V.
full_name: Giordani, V.
last_name: Giordani
- 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: P. G.
full_name: Bruce, P. G.
last_name: Bruce
- first_name: J.-M.
full_name: Tarascon, J.-M.
last_name: Tarascon
- first_name: D.
full_name: Larcher, D.
last_name: Larcher
citation:
ama: Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. H2O2 decomposition
reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and
Solid-State Letters. 2010;13(12). doi:10.1149/1.3494045
apa: Giordani, V., Freunberger, S. A., Bruce, P. G., Tarascon, J.-M., & Larcher,
D. (2010). H2O2 decomposition reaction as selecting tool for catalysts in Li–O2
cells. Electrochemical and Solid-State Letters. The Electrochemical Society.
https://doi.org/10.1149/1.3494045
chicago: Giordani, V., Stefan Alexander Freunberger, P. G. Bruce, J.-M. Tarascon,
and D. Larcher. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in
Li–O2 Cells.” Electrochemical and Solid-State Letters. The Electrochemical
Society, 2010. https://doi.org/10.1149/1.3494045.
ieee: V. Giordani, S. A. Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher,
“H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells,”
Electrochemical and Solid-State Letters, vol. 13, no. 12. The Electrochemical
Society, 2010.
ista: Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. 2010. H2O2
decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical
and Solid-State Letters. 13(12), A180.
mla: Giordani, V., et al. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts
in Li–O2 Cells.” Electrochemical and Solid-State Letters, vol. 13, no.
12, A180, The Electrochemical Society, 2010, doi:10.1149/1.3494045.
short: V. Giordani, S.A. Freunberger, P.G. Bruce, J.-M. Tarascon, D. Larcher, Electrochemical
and Solid-State Letters 13 (2010).
date_created: 2020-01-15T12:21:06Z
date_published: 2010-10-04T00:00:00Z
date_updated: 2021-01-12T08:13:01Z
day: '04'
doi: 10.1149/1.3494045
extern: '1'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
month: '10'
oa_version: None
publication: Electrochemical and Solid-State Letters
publication_identifier:
issn:
- 1099-0062
publication_status: published
publisher: The Electrochemical Society
quality_controlled: '1'
status: public
title: H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2010'
...
---
_id: '754'
abstract:
- lang: eng
text: 'Most people believe that renaming is easy: simply choose a name at random;
if more than one process selects the same name, then try again. We highlight the
issues that occur when trying to implement such a scheme and shed new light on
the read-write complexity of randomized renaming in an asynchronous environment.
At the heart of our new perspective stands an adaptive implementation of a randomized
test-and-set object, that has poly-logarithmic step complexity per operation,
with high probability. Interestingly, our implementation is anonymous, as it does
not require process identifiers. Based on this implementation, we present two
new randomized renaming algorithms. The first ensures a tight namespace of n names
using O( n log4 n) total steps, with high probability. This significantly improves
on the complexity of the best previously known namespace-optimal algorithms. The
second algorithm achieves a namespace of size k (1 + ε) using O( k log4 k / log2
(1 + ε) ) total steps, both with high probability, where k is the total contention
in the execution. It is the first adaptive randomized renaming algorithm, and
it improves on existing deterministic solutions by providing a smaller namespace,
and by lowering step complexity.'
acknowledgement: The work of Dan Alistarh is supported by the Swiss NCCR MICS project.
The work of Hagit Attiya is supported in part by the Israel Science Foundation (grant
number 953/06).
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: Hagit
full_name: Attiya, Hagit
last_name: Attiya
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Andrei
full_name: Giurgiu, Andrei
last_name: Giurgiu
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
citation:
ama: 'Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. Fast randomized
test-and-set and renaming. In: Vol 6343 LNCS. Springer; 2010:94-108. doi:10.1007/978-3-642-15763-9_9'
apa: 'Alistarh, D.-A., Attiya, H., Gilbert, S., Giurgiu, A., & Guerraoui, R.
(2010). Fast randomized test-and-set and renaming (Vol. 6343 LNCS, pp. 94–108).
Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-15763-9_9'
chicago: Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid
Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer,
2010. https://doi.org/10.1007/978-3-642-15763-9_9.
ieee: 'D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast
randomized test-and-set and renaming,” presented at the DISC: Distributed Computing,
2010, vol. 6343 LNCS, pp. 94–108.'
ista: 'Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. 2010. Fast randomized
test-and-set and renaming. DISC: Distributed Computing, LNCS, vol. 6343 LNCS,
94–108.'
mla: Alistarh, Dan-Adrian, et al. Fast Randomized Test-and-Set and Renaming.
Vol. 6343 LNCS, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-15763-9_9.
short: D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, R. Guerraoui, in:, Springer,
2010, pp. 94–108.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:19Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:21Z
day: '01'
doi: 10.1007/978-3-642-15763-9_9
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 94 - 108
publication_status: published
publisher: Springer
publist_id: '6900'
status: public
title: Fast randomized test-and-set and renaming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6343 LNCS
year: '2010'
...
---
_id: '755'
abstract:
- lang: eng
text: 'Gossip, also known as epidemic dissemination, is becoming an increasingly
popular technique in distributed systems. Yet, it has remained a partially open
question: how robust are such protocols? We consider a natural extension of the
random phone-call model (introduced by Karp et al. [1]), and we analyze two different
notions of robustness: the ability to tolerate adaptive failures, and the ability
to tolerate oblivious failures. For adaptive failures, we present a new gossip
protocol, TrickleGossip, which achieves near-optimal O(n log 3 n) message complexity.
To the best of our knowledge, this is the first epidemic-style protocol that can
tolerate adaptive failures. We also show a direct relation between resilience
and message complexity, demonstrating that gossip protocols which tolerate a large
number of adaptive failures need to use a super-linear number of messages with
high probability. For oblivious failures, we present a new gossip protocol, CoordinatedGossip,
that achieves optimal O(n) message complexity. This protocol makes novel use of
the universe reduction technique to limit the message complexity.'
acknowledgement: We would like to thank Prof. Hagit Attiya and the anonymous reviewers
for their useful comments on earlier drafts of this paper.
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: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Morteza
full_name: Zadimoghaddam, Morteza
last_name: Zadimoghaddam
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. How efficient can gossip
be? (On the cost of resilient information exchange). In: Vol 6199 LNCS. Springer;
2010:115-126. doi:10.1007/978-3-642-14162-1_10'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Zadimoghaddam, M. (2010).
How efficient can gossip be? (On the cost of resilient information exchange) (Vol.
6199 LNCS, pp. 115–126). Presented at the ICALP: International Colloquium on Automota,
Languages and Programming, Springer. https://doi.org/10.1007/978-3-642-14162-1_10'
chicago: Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam.
“How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),”
6199 LNCS:115–26. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_10.
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient
can gossip be? (On the cost of resilient information exchange),” presented at
the ICALP: International Colloquium on Automota, Languages and Programming, 2010,
vol. 6199 LNCS, no. PART 2, pp. 115–126.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. 2010. How efficient
can gossip be? (On the cost of resilient information exchange). ICALP: International
Colloquium on Automota, Languages and Programming, LNCS, vol. 6199 LNCS, 115–126.'
mla: Alistarh, Dan-Adrian, et al. How Efficient Can Gossip Be? (On the Cost of
Resilient Information Exchange). Vol. 6199 LNCS, no. PART 2, Springer, 2010,
pp. 115–26, doi:10.1007/978-3-642-14162-1_10.
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, in:, Springer,
2010, pp. 115–126.
conference:
name: 'ICALP: International Colloquium on Automota, Languages and Programming'
date_created: 2018-12-11T11:48:20Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:40Z
day: '01'
doi: 10.1007/978-3-642-14162-1_10
extern: '1'
issue: PART 2
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 126
publication_status: published
publisher: Springer
publist_id: '6901'
status: public
title: How efficient can gossip be? (On the cost of resilient information exchange)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6199 LNCS
year: '2010'
...
---
_id: '756'
abstract:
- lang: eng
text: This paper studies non-cryptographic authenticated broadcast in radio networks
subject to malicious failures. We introduce two protocols that address this problem.
The first, NeighborWatchRB, makes use of a novel strategy in which honest devices
monitor their neighbors for malicious behavior. Second, we present a more robust
variant, MultiPathRB, that tolerates the maximum possible density of malicious
devices per region, using an elaborate voting strategy. We also introduce a new
proof technique to show that both protocols ensure asymptotically optimal running
time. We demonstrate the fault tolerance of our protocols through extensive simulation.
Simulations show the practical superiority of the NeighborWatchRB protocol (an
advantage hidden in the constants of the asymptotic complexity). The NeighborWatchRB
protocol even performs relatively well when compared to the simple, fast epidemic
protocols commonly used in the radio setting, protocols that tolerate no malicious
faults. We therefore believe that the overhead for ensuring authenticated broadcast
is reasonable, especially in applications that use authenticated broadcast only
when necessary, such as distributing an authenticated digest.
acknowledgement: "The authors would like to thank Prof. Guevara Noubir for his useful
comments on earlier\r\ndrafts 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: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Žarko
full_name: Milošević, Žarko
last_name: Milošević
- first_name: Calvin
full_name: Newport, Calvin
last_name: Newport
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. Securing every
bit: Authenticated broadcast in radio networks. In: ACM; 2010:50-59. doi:10.1145/1810479.1810489'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., Milošević, Ž., & Newport,
C. (2010). Securing every bit: Authenticated broadcast in radio networks (pp.
50–59). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures,
ACM. https://doi.org/10.1145/1810479.1810489'
chicago: 'Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, Žarko Milošević,
and Calvin Newport. “Securing Every Bit: Authenticated Broadcast in Radio Networks,”
50–59. ACM, 2010. https://doi.org/10.1145/1810479.1810489.'
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, and C. Newport, “Securing
every bit: Authenticated broadcast in radio networks,” presented at the SPAA:
Symposium on Parallelism in Algorithms and Architectures, 2010, pp. 50–59.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. 2010. Securing
every bit: Authenticated broadcast in radio networks. SPAA: Symposium on Parallelism
in Algorithms and Architectures, 50–59.'
mla: 'Alistarh, Dan-Adrian, et al. Securing Every Bit: Authenticated Broadcast
in Radio Networks. ACM, 2010, pp. 50–59, doi:10.1145/1810479.1810489.'
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, C. Newport, in:,
ACM, 2010, pp. 50–59.
conference:
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
date_created: 2018-12-11T11:48:20Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:56Z
day: '01'
doi: 10.1145/1810479.1810489
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 59
publication_status: published
publisher: ACM
publist_id: '6902'
status: public
title: 'Securing every bit: Authenticated broadcast in radio networks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '758'
abstract:
- lang: eng
text: Set agreement [4] is a fundamental problem in distributed computing, in which
processes collectively choose a small subset of values from a larger set of proposals.
Set agreement has been extensively studied in both synchronous and asynchronous
systems [10,11,3,5,8,9]. Real world distributed systems, however, are neither
purely synchronous nor purely asynchronous. To describe such a system, Dwork et
al. [6] introduced the idea of partial synchrony. They assume for every execution
some (unknown) time GST (global stabilization time), after which the system is
synchronous. In a recent paper [1,2], we study the complexity of set agreement
in the context of partially synchronous systems, determining the minimum-sized
window of synchrony in which set agreement can be solved. We show that at least
⌊t/k⌋ + 2 synchronous rounds are required for k-set agreement, where t < n
is the number of crashes, and k is the agreement parameter of the set agreement
task. We then introduce an algorithm that terminates in any window of synchrony
of size at least ⌊t/k⌋ + 4 rounds. Together, these results tightly bound the inherent
price of tolerating some asynchrony.
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: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Brief announcement: New bounds
for partially synchronous set agreement. In: Vol 6343 LNCS. Springer; 2010:404-405.
doi:10.1007/978-3-642-15763-9_40'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2010). Brief
announcement: New bounds for partially synchronous set agreement (Vol. 6343 LNCS,
pp. 404–405). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-15763-9_40'
chicago: 'Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers.
“Brief Announcement: New Bounds for Partially Synchronous Set Agreement,” 6343
LNCS:404–5. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_40.'
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Brief announcement:
New bounds for partially synchronous set agreement,” presented at the DISC: Distributed
Computing, 2010, vol. 6343 LNCS, pp. 404–405.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2010. Brief announcement:
New bounds for partially synchronous set agreement. DISC: Distributed Computing,
LNCS, vol. 6343 LNCS, 404–405.'
mla: 'Alistarh, Dan-Adrian, et al. Brief Announcement: New Bounds for Partially
Synchronous Set Agreement. Vol. 6343 LNCS, Springer, 2010, pp. 404–05, doi:10.1007/978-3-642-15763-9_40.'
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2010,
pp. 404–405.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:21Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:11:26Z
day: '01'
doi: 10.1007/978-3-642-15763-9_40
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 404 - 405
publication_status: published
publisher: Springer
publist_id: '6899'
status: public
title: 'Brief announcement: New bounds for partially synchronous set agreement'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6343 LNCS
year: '2010'
...
---
_id: '7703'
abstract:
- lang: eng
text: By combining gene expression profiling with image registration, Tomer et al.
(2010) find that the mushroom body of the segmented worm Platynereis dumerilii
shares many features with the mammalian cerebral cortex. The authors propose that
the mushroom body and cortex evolved from the same structure in the common ancestor
of vertebrates and invertebrates.
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: Liqun
full_name: Luo, Liqun
last_name: Luo
citation:
ama: 'Sweeney LB, Luo L. ‘Fore brain: A hint of the ancestral cortex. Cell.
2010;142(5):679-681. doi:10.1016/j.cell.2010.08.024'
apa: 'Sweeney, L. B., & Luo, L. (2010). ‘Fore brain: A hint of the ancestral
cortex. Cell. Elsevier. https://doi.org/10.1016/j.cell.2010.08.024'
chicago: 'Sweeney, Lora B., and Liqun Luo. “‘Fore Brain: A Hint of the Ancestral
Cortex.” Cell. Elsevier, 2010. https://doi.org/10.1016/j.cell.2010.08.024.'
ieee: 'L. B. Sweeney and L. Luo, “‘Fore brain: A hint of the ancestral cortex,”
Cell, vol. 142, no. 5. Elsevier, pp. 679–681, 2010.'
ista: 'Sweeney LB, Luo L. 2010. ‘Fore brain: A hint of the ancestral cortex. Cell.
142(5), 679–681.'
mla: 'Sweeney, Lora B., and Liqun Luo. “‘Fore Brain: A Hint of the Ancestral Cortex.”
Cell, vol. 142, no. 5, Elsevier, 2010, pp. 679–81, doi:10.1016/j.cell.2010.08.024.'
short: L.B. Sweeney, L. Luo, Cell 142 (2010) 679–681.
date_created: 2020-04-30T10:36:52Z
date_published: 2010-09-03T00:00:00Z
date_updated: 2024-01-31T10:14:59Z
day: '03'
doi: 10.1016/j.cell.2010.08.024
extern: '1'
intvolume: ' 142'
issue: '5'
language:
- iso: eng
month: '09'
oa_version: None
page: 679-681
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: '‘Fore brain: A hint of the ancestral cortex'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 142
year: '2010'
...
---
_id: '474'
abstract:
- lang: eng
text: 'Classical models of gene flow fail in three ways: they cannot explain large-scale
patterns; they predict much more genetic diversity than is observed; and they
assume that loosely linked genetic loci evolve independently. We propose a new
model that deals with these problems. Extinction events kill some fraction of
individuals in a region. These are replaced by offspring from a small number of
parents, drawn from the preexisting population. This model of evolution forwards
in time corresponds to a backwards model, in which ancestral lineages jump to
a new location if they are hit by an event, and may coalesce with other lineages
that are hit by the same event. We derive an expression for the identity in allelic
state, and show that, over scales much larger than the largest event, this converges
to the classical value derived by Wright and Malécot. However, rare events that
cover large areas cause low genetic diversity, large-scale patterns, and correlations
in ancestry between unlinked loci.'
acknowledgement: This work has made use of the resources provided by the Edinburgh
Compute and Data Facility (ECDF). The ECDF is partially supported by the eDIKT initiative.
NHB is supported in part by EPSRC Grant EP/E066070/1; JK is supported by EPSRC Grant
EP/E066070/1; and AME is supported in part by EPSRC Grant EP/E065945/1.
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Jerome
full_name: Kelleher, Jerome
last_name: Kelleher
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
citation:
ama: 'Barton NH, Kelleher J, Etheridge A. A new model for extinction and recolonization
in two dimensions: Quantifying phylogeography. Evolution. 2010;64(9):2701-2715.
doi:10.1111/j.1558-5646.2010.01019.x'
apa: 'Barton, N. H., Kelleher, J., & Etheridge, A. (2010). A new model for extinction
and recolonization in two dimensions: Quantifying phylogeography. Evolution.
Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.2010.01019.x'
chicago: 'Barton, Nicholas H, Jerome Kelleher, and Alison Etheridge. “A New Model
for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.”
Evolution. Wiley-Blackwell, 2010. https://doi.org/10.1111/j.1558-5646.2010.01019.x.'
ieee: 'N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction
and recolonization in two dimensions: Quantifying phylogeography,” Evolution,
vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 2010.'
ista: 'Barton NH, Kelleher J, Etheridge A. 2010. A new model for extinction and
recolonization in two dimensions: Quantifying phylogeography. Evolution. 64(9),
2701–2715.'
mla: 'Barton, Nicholas H., et al. “A New Model for Extinction and Recolonization
in Two Dimensions: Quantifying Phylogeography.” Evolution, vol. 64, no.
9, Wiley-Blackwell, 2010, pp. 2701–15, doi:10.1111/j.1558-5646.2010.01019.x.'
short: N.H. Barton, J. Kelleher, A. Etheridge, Evolution 64 (2010) 2701–2715.
date_created: 2018-12-11T11:46:40Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2021-01-12T08:00:52Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/j.1558-5646.2010.01019.x
intvolume: ' 64'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 2701 - 2715
publication: Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2780'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'A new model for extinction and recolonization in two dimensions: Quantifying
phylogeography'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2010'
...
---
_id: '488'
abstract:
- lang: eng
text: 'Streaming string transducers [1] define (partial) functions from input strings
to output strings. A streaming string transducer makes a single pass through the
input string and uses a finite set of variables that range over strings from the
output alphabet. At every step, the transducer processes an input symbol, and
updates all the variables in parallel using assignments whose right-hand-sides
are concatenations of output symbols and variables with the restriction that a
variable can be used at most once in a right-hand-side expression. It has been
shown that streaming string transducers operating on strings over infinite data
domains are of interest in algorithmic verification of list-processing programs,
as they lead to PSPACE decision procedures for checking pre/post conditions and
for checking semantic equivalence, for a well-defined class of heap-manipulating
programs. In order to understand the theoretical expressiveness of streaming transducers,
we focus on streaming transducers processing strings over finite alphabets, given
the existence of a robust and well-studied class of "regular" transductions
for this case. Such regular transductions can be defined either by two-way deterministic
finite-state transducers, or using a logical MSO-based characterization. Our main
result is that the expressiveness of streaming string transducers coincides exactly
with this class of regular transductions. '
alternative_title:
- LIPIcs
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
citation:
ama: 'Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:10.4230/LIPIcs.FSTTCS.2010.1'
apa: 'Alur, R., & Cerny, P. (2010). Expressiveness of streaming string transducers
(Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology
and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1'
chicago: Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,”
8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1.
ieee: 'R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented
at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science,
Chennai, India, 2010, vol. 8, pp. 1–12.'
ista: 'Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS:
Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol.
8, 1–12.'
mla: Alur, Rajeev, and Pavol Cerny. Expressiveness of Streaming String Transducers.
Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:10.4230/LIPIcs.FSTTCS.2010.1.
short: R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2010, pp. 1–12.
conference:
end_date: 2010-12-18
location: Chennai, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2010-12-15
date_created: 2018-12-11T11:46:45Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T08:01:00Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2010.1
file:
- access_level: open_access
checksum: 5845be5aa19791830f7407d8853f2df0
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:29Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4690'
file_name: IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf
file_size: 492344
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1 - 12
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7331'
pubrep_id: '948'
quality_controlled: '1'
scopus_import: 1
status: public
title: Expressiveness of streaming string transducers
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2010'
...
---
_id: '489'
abstract:
- lang: eng
text: 'Graph games of infinite length are a natural model for open reactive processes:
one player represents the controller, trying to ensure a given specification,
and the other represents a hostile environment. The evolution of the system depends
on the decisions of both players, supplemented by chance. In this work, we focus
on the notion of randomised strategy. More specifically, we show that three natural
definitions may lead to very different results: in the most general cases, an
almost-surely winning situation may become almost-surely losing if the player
is only allowed to use a weaker notion of strategy. In more reasonable settings,
translations exist, but they require infinite memory, even in simple cases. Finally,
some traditional problems becomes undecidable for the strongest type of strategies.'
alternative_title:
- EPTCS
author:
- first_name: Julien
full_name: Cristau, Julien
last_name: Cristau
- first_name: Claire
full_name: David, Claire
last_name: David
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: 'Cristau J, David C, Horn F. How do we remember the past in randomised strategies?
. In: Proceedings of GandALF 2010. Vol 25. Open Publishing Association;
2010:30-39. doi:10.4204/EPTCS.25.7'
apa: 'Cristau, J., David, C., & Horn, F. (2010). How do we remember the past
in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp.
30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.25.7'
chicago: Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the
Past in Randomised Strategies? .” In Proceedings of GandALF 2010, 25:30–39.
Open Publishing Association, 2010. https://doi.org/10.4204/EPTCS.25.7.
ieee: J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised
strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy,
2010, vol. 25, pp. 30–39.
ista: 'Cristau J, David C, Horn F. 2010. How do we remember the past in randomised
strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and
Formal Verification, EPTCS, vol. 25, 30–39.'
mla: Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies?
.” Proceedings of GandALF 2010, vol. 25, Open Publishing Association, 2010,
pp. 30–39, doi:10.4204/EPTCS.25.7.
short: J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing
Association, 2010, pp. 30–39.
conference:
end_date: 2010-06-18
location: Minori, Amalfi Coast, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2010-06-17
date_created: 2018-12-11T11:46:45Z
date_published: 2010-06-09T00:00:00Z
date_updated: 2021-01-12T08:01:01Z
day: '09'
department:
- _id: KrCh
doi: 10.4204/EPTCS.25.7
intvolume: ' 25'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1006.1404v1
month: '06'
oa: 1
oa_version: Published Version
page: 30 - 39
publication: Proceedings of GandALF 2010
publication_status: published
publisher: Open Publishing Association
publist_id: '7332'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'How do we remember the past in randomised strategies? '
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2010'
...
---
_id: '533'
abstract:
- lang: eng
text: Any programming error that can be revealed before compiling a program saves
precious time for the programmer. While integrated development environments already
do a good job by detecting, e.g., data-flow abnormalities, current static analysis
tools suffer from false positives ("noise") or require strong user interaction.
We propose to avoid this deficiency by defining a new class of errors. A program
fragment is doomed if its execution will inevitably fail, regardless of which
state it is started in. We use a formal verification method to identify such errors
fully automatically and, most significantly, without producing noise. We report
on experiments with a prototype tool.
author:
- first_name: Jochen
full_name: Hoenicke, Jochen
last_name: Hoenicke
- first_name: Kari
full_name: Leino, Kari
last_name: Leino
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Martin
full_name: Schäf, Martin
last_name: Schäf
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. Formal
Methods in System Design. 2010;37(2-3):171-199. doi:10.1007/s10703-010-0102-0
apa: Hoenicke, J., Leino, K., Podelski, A., Schäf, M., & Wies, T. (2010). Doomed
program points. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-010-0102-0
chicago: Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas
Wies. “Doomed Program Points.” Formal Methods in System Design. Springer,
2010. https://doi.org/10.1007/s10703-010-0102-0.
ieee: J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program
points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp.
171–199, 2010.
ista: Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points.
Formal Methods in System Design. 37(2–3), 171–199.
mla: Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System
Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.
short: J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in
System Design 37 (2010) 171–199.
date_created: 2018-12-11T11:47:01Z
date_published: 2010-12-01T00:00:00Z
date_updated: 2021-01-12T08:01:28Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/s10703-010-0102-0
intvolume: ' 37'
issue: 2-3
language:
- iso: eng
month: '12'
oa_version: None
page: 171 - 199
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '7284'
quality_controlled: '1'
scopus_import: 1
status: public
title: Doomed program points
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2010'
...