---
_id: '2261'
abstract:
- lang: eng
text: To reveal the full potential of human pluripotent stem cells, new methods
for rapid, site-specific genomic engineering are needed. Here, we describe a system
for precise genetic modification of human embryonic stem cells (ESCs) and induced
pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located
in a safe, intergenic, transcriptionally active region of chromosome 22, as the
recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient
cell lines were established by site-specific placement of a ‘landing pad’ cassette
carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous
or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE)
mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked
by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This
system provided complete control over content, direction and copy number of inserted
genes, with a specificity of 100%. A series of genes, including mCherry and various
combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted
in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from
a Parkinson’s disease patient and a normal sibling control. The DICE system offers
rapid, efficient and precise gene insertion in ESC and iPSC and is particularly
well suited for repeated modifications of the same locus.
acknowledgement: "California Institute for Regenerative Medicine [RT2-01880 and TR2-01756].
Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880
and TR2-01756]\r\nCC BY 3,0"
article_number: e34
author:
- first_name: Fangfang
full_name: Zhu, Fangfang
last_name: Zhu
- first_name: Matthew
full_name: Gamboa, Matthew
last_name: Gamboa
- first_name: Alfonso
full_name: Farruggio, Alfonso
last_name: Farruggio
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Bosiljka
full_name: Tasic, Bosiljka
last_name: Tasic
- first_name: Birgitt
full_name: Schüle, Birgitt
last_name: Schüle
- first_name: Yanru
full_name: Chen Tsai, Yanru
last_name: Chen Tsai
- first_name: Michele
full_name: Calos, Michele
last_name: Calos
citation:
ama: Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative
genomic editing in human pluripotent stem cells. Nucleic Acids Research.
2014;42(5). doi:10.1093/nar/gkt1290
apa: Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B.,
… Calos, M. (2014). DICE, an efficient system for iterative genomic editing in
human pluripotent stem cells. Nucleic Acids Research. Oxford University
Press. https://doi.org/10.1093/nar/gkt1290
chicago: Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka
Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient
System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic
Acids Research. Oxford University Press, 2014. https://doi.org/10.1093/nar/gkt1290.
ieee: F. Zhu et al., “DICE, an efficient system for iterative genomic editing
in human pluripotent stem cells,” Nucleic Acids Research, vol. 42, no.
5. Oxford University Press, 2014.
ista: Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai
Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human
pluripotent stem cells. Nucleic Acids Research. 42(5), e34.
mla: Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing
in Human Pluripotent Stem Cells.” Nucleic Acids Research, vol. 42, no.
5, e34, Oxford University Press, 2014, doi:10.1093/nar/gkt1290.
short: F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y.
Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).
date_created: 2018-12-11T11:56:38Z
date_published: 2014-03-05T00:00:00Z
date_updated: 2021-01-12T06:56:22Z
day: '05'
ddc:
- '571'
- '610'
department:
- _id: SiHi
doi: 10.1093/nar/gkt1290
file:
- access_level: open_access
checksum: e9268f5f96a820f04d7ebbf85927c3cb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:15Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4738'
file_name: IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf
file_size: 11044478
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 42'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Preprint
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '4684'
pubrep_id: '961'
quality_controlled: '1'
scopus_import: 1
status: public
title: DICE, an efficient system for iterative genomic editing in human pluripotent
stem cells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2014'
...
---
_id: '2265'
abstract:
- lang: eng
text: Coordinated migration of newly-born neurons to their target territories is
essential for correct neuronal circuit assembly in the developing brain. Although
a cohort of signaling pathways has been implicated in the regulation of cortical
projection neuron migration, the precise molecular mechanisms and how a balanced
interplay of cell-autonomous and non-autonomous functions of candidate signaling
molecules controls the discrete steps in the migration process, are just being
revealed. In this chapter, I will focally review recent advances that improved
our understanding of the cell-autonomous and possible cell-nonautonomous functions
of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential
steps of cortical projection neuron migration. I will then elaborate on the emerging
concept that the Reelin signaling pathway, acts exactly at precise stages in the
course of cortical projection neuron migration. Lastly, I will discuss how finely
tuned transcriptional programs and downstream effectors govern particular aspects
in driving radial migration at discrete stages and how they regulate the precise
positioning of cortical projection neurons in the developing cerebral cortex.
alternative_title:
- Advances in Experimental Medicine and Biology
author:
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: 'Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical
projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control
of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1'
apa: Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps
of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and
Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1
chicago: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps
of Cortical Projection Neuron Migration.” In Cellular and Molecular Control
of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014.
https://doi.org/10.1007/978-94-007-7687-6_1.
ieee: S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical
projection neuron migration,” in Cellular and Molecular Control of Neuronal
Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.
ista: 'Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of
cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal
Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.'
mla: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of
Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal
Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1.
short: S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of
Neuronal Migration, Springer, 2014, pp. 1–24.
date_created: 2018-12-11T11:56:39Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:23Z
day: '01'
department:
- _id: SiHi
doi: 10.1007/978-94-007-7687-6_1
editor:
- first_name: Laurent
full_name: Nguyen, Laurent
last_name: Nguyen
intvolume: ' 800'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 24
publication: ' Cellular and Molecular Control of Neuronal Migration'
publication_status: published
publisher: Springer
publist_id: '4679'
quality_controlled: '1'
scopus_import: 1
status: public
title: Molecular pathways controlling the sequential steps of cortical projection
neuron migration
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 800
year: '2014'
...
---
_id: '2275'
abstract:
- lang: eng
text: "Energies with high-order non-submodular interactions have been shown to be
very useful in vision due to their high modeling power. Optimization of such energies,
however, is generally NP-hard. A naive approach that works for small problem instances
is exhaustive search, that is, enumeration of all possible labelings of the underlying
graph. We propose a general minimization approach for large graphs based on enumeration
of labelings of certain small patches. \r\nThis partial enumeration technique
reduces complex high-order energy formulations to pairwise Constraint Satisfaction
Problems with unary costs (uCSP), which can be efficiently solved using standard
methods like TRW-S. Our approach outperforms a number of existing state-of-the-art
algorithms on well known difficult problems (e.g. curvature regularization, stereo,
deconvolution); it gives near global minimum and better speed. \r\nOur main application
of interest is curvature regularization. In the context of segmentation, our partial
enumeration technique allows to evaluate curvature directly on small patches using
a novel integral geometry approach.\r\n"
author:
- first_name: Carl
full_name: Olsson, Carl
last_name: Olsson
- first_name: Johannes
full_name: Ulen, Johannes
last_name: Ulen
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature
regularization. In: IEEE; 2014:2936-2943. doi:10.1109/ICCV.2013.365'
apa: 'Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration
and curvature regularization (pp. 2936–2943). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365'
chicago: Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial
Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365.
ieee: 'C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and
curvature regularization,” presented at the ICCV: International Conference on
Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.'
ista: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature
regularization. ICCV: International Conference on Computer Vision, 2936–2943.'
mla: Olsson, Carl, et al. Partial Enumeration and Curvature Regularization.
IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
short: C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:42Z
date_published: 2014-03-03T00:00:00Z
date_updated: 2021-01-12T06:56:28Z
day: '03'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/ICCV.2013.365
file:
- access_level: open_access
checksum: 4a74b5c92d6dcd2348c2c10ec8dd18bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:30Z
date_updated: 2020-07-14T12:45:36Z
file_id: '4754'
file_name: IST-2016-566-v1+1_iccv13_part_enumeration.pdf
file_size: 378601
relation: main_file
file_date_updated: 2020-07-14T12:45:36Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 2936 - 2943
publication_status: published
publisher: IEEE
publist_id: '4669'
pubrep_id: '566'
quality_controlled: '1'
scopus_import: 1
status: public
title: Partial enumeration and curvature regularization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2285'
abstract:
- lang: eng
text: GABAergic inhibitory interneurons control fundamental aspects of neuronal
network function. Their functional roles are assumed to be defined by the identity
of their input synapses, the architecture of their dendritic tree, the passive
and active membrane properties and finally the nature of their postsynaptic targets.
Indeed, interneurons display a high degree of morphological and physiological
heterogeneity. However, whether their morphological and physiological characteristics
are correlated and whether interneuron diversity can be described by a continuum
of GABAergic cell types or by distinct classes has remained unclear. Here we perform
a detailed morphological and physiological characterization of GABAergic cells
in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased
and efficient sampling and classification we used knock-in mice expressing the
enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive
neurons and performed cluster analysis. We identified five interneuron classes,
each of them characterized by a distinct set of anatomical and physiological parameters.
Cross-correlation analysis further revealed a direct relation between morphological
and physiological properties indicating that dentate gyrus interneurons fall into
functionally distinct classes which may differentially control neuronal network
activity.
acknowledgement: 'Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505,
SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann
Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation);
Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank
Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript.
They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical
assistance.'
author:
- first_name: Jonas
full_name: Hosp, Jonas
last_name: Hosp
- first_name: Michael
full_name: Strüber, Michael
last_name: Strüber
- first_name: Yuchio
full_name: Yanagawa, Yuchio
last_name: Yanagawa
- first_name: Kunihiko
full_name: Obata, Kunihiko
last_name: Obata
- first_name: Imre
full_name: Vida, Imre
last_name: Vida
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Marlene
full_name: Bartos, Marlene
last_name: Bartos
citation:
ama: Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide
dentate gyrus interneurons into classes. Hippocampus. 2014;23(2):189-203.
doi:10.1002/hipo.22214
apa: Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &
Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons
into classes. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.22214
chicago: Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida,
Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate
Gyrus Interneurons into Classes.” Hippocampus. Wiley-Blackwell, 2014. https://doi.org/10.1002/hipo.22214.
ieee: J. Hosp et al., “Morpho-physiological criteria divide dentate gyrus
interneurons into classes,” Hippocampus, vol. 23, no. 2. Wiley-Blackwell,
pp. 189–203, 2014.
ista: Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014.
Morpho-physiological criteria divide dentate gyrus interneurons into classes.
Hippocampus. 23(2), 189–203.
mla: Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons
into Classes.” Hippocampus, vol. 23, no. 2, Wiley-Blackwell, 2014, pp.
189–203, doi:10.1002/hipo.22214.
short: J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos,
Hippocampus 23 (2014) 189–203.
date_created: 2018-12-11T11:56:46Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2021-01-12T06:56:32Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22214
file:
- access_level: open_access
checksum: ff6bc75a79dbc985a2e31b79253e6444
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:54Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5178'
file_name: IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf
file_size: 801589
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 23'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 189 - 203
publication: Hippocampus
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4646'
pubrep_id: '461'
quality_controlled: '1'
scopus_import: 1
status: public
title: Morpho-physiological criteria divide dentate gyrus interneurons into classes
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2014'
...
---
_id: '2407'
abstract:
- lang: eng
text: 'Two definitions of the effective mass of a particle interacting with a quantum
field, such as a polaron, are considered and shown to be equal in models similar
to the Fröhlich polaron model. These are: 1. the mass defined by the low momentum
energy E(P)≈E(0)+P2/2 M of the translation invariant system constrained to have
momentum P and 2. the mass M of a simple particle in an arbitrary slowly varying
external potential, V, described by the nonrelativistic Schrödinger equation,
whose ground state energy equals that of the combined particle/field system in
a bound state in the same V.'
author:
- first_name: Élliott
full_name: Lieb, Élliott
last_name: Lieb
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Lieb É, Seiringer R. Equivalence of two definitions of the effective mass of
a polaron. Journal of Statistical Physics. 2014;154(1-2):51-57. doi:10.1007/s10955-013-0791-z
apa: Lieb, É., & Seiringer, R. (2014). Equivalence of two definitions of the
effective mass of a polaron. Journal of Statistical Physics. Springer.
https://doi.org/10.1007/s10955-013-0791-z
chicago: Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of
the Effective Mass of a Polaron.” Journal of Statistical Physics. Springer,
2014. https://doi.org/10.1007/s10955-013-0791-z.
ieee: É. Lieb and R. Seiringer, “Equivalence of two definitions of the effective
mass of a polaron,” Journal of Statistical Physics, vol. 154, no. 1–2.
Springer, pp. 51–57, 2014.
ista: Lieb É, Seiringer R. 2014. Equivalence of two definitions of the effective
mass of a polaron. Journal of Statistical Physics. 154(1–2), 51–57.
mla: Lieb, Élliott, and Robert Seiringer. “Equivalence of Two Definitions of the
Effective Mass of a Polaron.” Journal of Statistical Physics, vol. 154,
no. 1–2, Springer, 2014, pp. 51–57, doi:10.1007/s10955-013-0791-z.
short: É. Lieb, R. Seiringer, Journal of Statistical Physics 154 (2014) 51–57.
date_created: 2018-12-11T11:57:29Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:18Z
day: '01'
doi: 10.1007/s10955-013-0791-z
extern: '1'
intvolume: ' 154'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1304.1780
month: '01'
oa: 1
oa_version: Submitted Version
page: 51 - 57
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '4519'
quality_controlled: '1'
status: public
title: Equivalence of two definitions of the effective mass of a polaron
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 154
year: '2014'
...
---
_id: '248'
abstract:
- lang: eng
text: For any pencil of conics or higher-dimensional quadrics over ℚ, with all degenerate
fibres defined over ℚ, we show that the Brauer–Manin obstruction controls weak
approximation. The proof is based on the Hasse principle and weak approximation
for some special intersections of quadrics over ℚ, which is a consequence of recent
advances in additive combinatorics.
acknowledgement: While working on this paper the first two authors were supported
by EPSRC grant EP/E053262/1, and the first author was further supported by ERC grant
306457.
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Lilian
full_name: Matthiesen, Lilian
last_name: Matthiesen
- first_name: Alexei
full_name: Skorobogatov, Alexei N
last_name: Skorobogatov
citation:
ama: Browning TD, Matthiesen L, Skorobogatov A. Rational points on pencils of conics
and quadrics with many degenerate fibres. Annals of Mathematics. 2014;180(1):381-402.
doi:https://doi.org/10.4007/annals.2014.180.1.8
apa: Browning, T. D., Matthiesen, L., & Skorobogatov, A. (2014). Rational points
on pencils of conics and quadrics with many degenerate fibres. Annals of Mathematics.
John Hopkins University Press. https://doi.org/10.4007/annals.2014.180.1.8
chicago: Browning, Timothy D, Lilian Matthiesen, and Alexei Skorobogatov. “Rational
Points on Pencils of Conics and Quadrics with Many Degenerate Fibres.” Annals
of Mathematics. John Hopkins University Press, 2014. https://doi.org/10.4007/annals.2014.180.1.8.
ieee: T. D. Browning, L. Matthiesen, and A. Skorobogatov, “Rational points on pencils
of conics and quadrics with many degenerate fibres,” Annals of Mathematics,
vol. 180, no. 1. John Hopkins University Press, pp. 381–402, 2014.
ista: Browning TD, Matthiesen L, Skorobogatov A. 2014. Rational points on pencils
of conics and quadrics with many degenerate fibres. Annals of Mathematics. 180(1),
381–402.
mla: Browning, Timothy D., et al. “Rational Points on Pencils of Conics and Quadrics
with Many Degenerate Fibres.” Annals of Mathematics, vol. 180, no. 1, John
Hopkins University Press, 2014, pp. 381–402, doi:https://doi.org/10.4007/annals.2014.180.1.8.
short: T.D. Browning, L. Matthiesen, A. Skorobogatov, Annals of Mathematics 180
(2014) 381–402.
date_created: 2018-12-11T11:45:25Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:57:44Z
day: '01'
doi: https://doi.org/10.4007/annals.2014.180.1.8
extern: 1
intvolume: ' 180'
issue: '1'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1209.0207
month: '07'
oa: 1
page: 381 - 402
publication: Annals of Mathematics
publication_status: published
publisher: John Hopkins University Press
publist_id: '7655'
quality_controlled: 0
status: public
title: Rational points on pencils of conics and quadrics with many degenerate fibres
type: journal_article
volume: 180
year: '2014'
...
---
_id: '249'
abstract:
- lang: eng
text: 'A version of the Hardy-Littlewood circle method is developed for number fields
K/ℚ and is used to show that nonsingular projective cubic hypersurfaces over K
always have a K-rational point when they have dimension at least 8. '
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Pankaj
full_name: Vishe, Pankaj
last_name: Vishe
citation:
ama: Browning TD, Vishe P. Cubic hypersurfaces and a version of the circle method
for number fields. Duke Mathematical Journal. 2014;163(10):1825-1883. doi:10.1215/00127094-2738530
apa: Browning, T. D., & Vishe, P. (2014). Cubic hypersurfaces and a version
of the circle method for number fields. Duke Mathematical Journal. Duke
University Press. https://doi.org/10.1215/00127094-2738530
chicago: Browning, Timothy D, and Pankaj Vishe. “Cubic Hypersurfaces and a Version
of the Circle Method for Number Fields.” Duke Mathematical Journal. Duke
University Press, 2014. https://doi.org/10.1215/00127094-2738530.
ieee: T. D. Browning and P. Vishe, “Cubic hypersurfaces and a version of the circle
method for number fields,” Duke Mathematical Journal, vol. 163, no. 10.
Duke University Press, pp. 1825–1883, 2014.
ista: Browning TD, Vishe P. 2014. Cubic hypersurfaces and a version of the circle
method for number fields. Duke Mathematical Journal. 163(10), 1825–1883.
mla: Browning, Timothy D., and Pankaj Vishe. “Cubic Hypersurfaces and a Version
of the Circle Method for Number Fields.” Duke Mathematical Journal, vol.
163, no. 10, Duke University Press, 2014, pp. 1825–83, doi:10.1215/00127094-2738530.
short: T.D. Browning, P. Vishe, Duke Mathematical Journal 163 (2014) 1825–1883.
date_created: 2018-12-11T11:45:26Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:57:47Z
day: '01'
doi: 10.1215/00127094-2738530
extern: 1
intvolume: ' 163'
issue: '10'
month: '07'
page: 1825 - 1883
publication: Duke Mathematical Journal
publication_status: published
publisher: Duke University Press
publist_id: '7653'
quality_controlled: 0
status: public
title: Cubic hypersurfaces and a version of the circle method for number fields
type: journal_article
volume: 163
year: '2014'
...
---
_id: '252'
abstract:
- lang: eng
text: For any number field k, upper bounds are established for the number of k-rational
points of bounded height on non-singular del Pezzo surfaces defined over k, which
are equipped with suitable conic bundle structures over k.
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Michael
full_name: Jones, Michael S
last_name: Jones
citation:
ama: Browning TD, Jones M. Counting rational points on del Pezzo surfaces with a
conic bundle structure. Acta Arithmetica. 2014;163(3):271-298. doi:10.4064/aa163-3-6
apa: Browning, T. D., & Jones, M. (2014). Counting rational points on del Pezzo
surfaces with a conic bundle structure. Acta Arithmetica. Instytut Matematyczny.
https://doi.org/10.4064/aa163-3-6
chicago: Browning, Timothy D, and Michael Jones. “Counting Rational Points on Del
Pezzo Surfaces with a Conic Bundle Structure.” Acta Arithmetica. Instytut
Matematyczny, 2014. https://doi.org/10.4064/aa163-3-6.
ieee: T. D. Browning and M. Jones, “Counting rational points on del Pezzo surfaces
with a conic bundle structure,” Acta Arithmetica, vol. 163, no. 3. Instytut
Matematyczny, pp. 271–298, 2014.
ista: Browning TD, Jones M. 2014. Counting rational points on del Pezzo surfaces
with a conic bundle structure. Acta Arithmetica. 163(3), 271–298.
mla: Browning, Timothy D., and Michael Jones. “Counting Rational Points on Del Pezzo
Surfaces with a Conic Bundle Structure.” Acta Arithmetica, vol. 163, no.
3, Instytut Matematyczny, 2014, pp. 271–98, doi:10.4064/aa163-3-6.
short: T.D. Browning, M. Jones, Acta Arithmetica 163 (2014) 271–298.
date_created: 2018-12-11T11:45:26Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:59Z
day: '01'
doi: 10.4064/aa163-3-6
extern: 1
intvolume: ' 163'
issue: '3'
month: '01'
page: 271 - 298
publication: Acta Arithmetica
publication_status: published
publisher: Instytut Matematyczny
publist_id: '7650'
quality_controlled: 0
status: public
title: Counting rational points on del Pezzo surfaces with a conic bundle structure
type: journal_article
volume: 163
year: '2014'
...
---
_id: '254'
abstract:
- lang: eng
text: A new "polynomial sieve" is presented and used to show that almost
all integers have at most one representation as a sum of two values of a given
polynomial of degree at least 3.
acknowledgement: While working on this paper, the author was supported by ERC grant
306457 and a Philip Leverhulme Prize.
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. The polynomial sieve and equal sums of like polynomials. International
Mathematics Research Notices. 2014;2015(7):1987-2019. doi:10.1093/imrn/rnt350
apa: Browning, T. D. (2014). The polynomial sieve and equal sums of like polynomials.
International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnt350
chicago: Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.”
International Mathematics Research Notices. Oxford University Press, 2014.
https://doi.org/10.1093/imrn/rnt350.
ieee: T. D. Browning, “The polynomial sieve and equal sums of like polynomials,”
International Mathematics Research Notices, vol. 2015, no. 7. Oxford University
Press, pp. 1987–2019, 2014.
ista: Browning TD. 2014. The polynomial sieve and equal sums of like polynomials.
International Mathematics Research Notices. 2015(7), 1987–2019.
mla: Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.”
International Mathematics Research Notices, vol. 2015, no. 7, Oxford University
Press, 2014, pp. 1987–2019, doi:10.1093/imrn/rnt350.
short: T.D. Browning, International Mathematics Research Notices 2015 (2014) 1987–2019.
date_created: 2018-12-11T11:45:27Z
date_published: 2014-01-31T00:00:00Z
date_updated: 2021-01-12T06:58:07Z
day: '31'
doi: 10.1093/imrn/rnt350
extern: 1
intvolume: ' 2015'
issue: '7'
month: '01'
page: 1987 - 2019
publication: International Mathematics Research Notices
publication_status: published
publisher: Oxford University Press
publist_id: '7648'
quality_controlled: 0
status: public
title: The polynomial sieve and equal sums of like polynomials
type: journal_article
volume: 2015
year: '2014'
...
---
_id: '255'
abstract:
- lang: eng
text: We investigate the Hasse principle for complete intersections cut out by a
quadric hypersurface and a cubic hypersurface defined over the rational numbers.
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Rainer
full_name: Dietmann, Rainer
last_name: Dietmann
- first_name: Roger
full_name: Heath Brown, Roger
last_name: Heath Brown
citation:
ama: Browning TD, Dietmann R, Heath Brown R. Rational points on intersections of
cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of
Jussieu. 2014;14(4):703-749. doi:10.1017/S1474748014000127
apa: Browning, T. D., Dietmann, R., & Heath Brown, R. (2014). Rational points
on intersections of cubic and quadric hypersurfaces. Journal of the Institute
of Mathematics of Jussieu. Cambridge University Press. https://doi.org/10.1017/S1474748014000127
chicago: Browning, Timothy D, Rainer Dietmann, and Roger Heath Brown. “Rational
Points on Intersections of Cubic and Quadric Hypersurfaces.” Journal of the
Institute of Mathematics of Jussieu. Cambridge University Press, 2014. https://doi.org/10.1017/S1474748014000127.
ieee: T. D. Browning, R. Dietmann, and R. Heath Brown, “Rational points on intersections
of cubic and quadric hypersurfaces,” Journal of the Institute of Mathematics
of Jussieu, vol. 14, no. 4. Cambridge University Press, pp. 703–749, 2014.
ista: Browning TD, Dietmann R, Heath Brown R. 2014. Rational points on intersections
of cubic and quadric hypersurfaces. Journal of the Institute of Mathematics of
Jussieu. 14(4), 703–749.
mla: Browning, Timothy D., et al. “Rational Points on Intersections of Cubic and
Quadric Hypersurfaces.” Journal of the Institute of Mathematics of Jussieu,
vol. 14, no. 4, Cambridge University Press, 2014, pp. 703–49, doi:10.1017/S1474748014000127.
short: T.D. Browning, R. Dietmann, R. Heath Brown, Journal of the Institute of Mathematics
of Jussieu 14 (2014) 703–749.
date_created: 2018-12-11T11:45:27Z
date_published: 2014-01-05T00:00:00Z
date_updated: 2021-11-16T08:07:06Z
day: '05'
doi: 10.1017/S1474748014000127
extern: '1'
intvolume: ' 14'
issue: '4'
language:
- iso: eng
month: '01'
oa_version: None
page: 703 - 749
publication: Journal of the Institute of Mathematics of Jussieu
publication_status: published
publisher: Cambridge University Press
publist_id: '7647'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1017/S1474748014000279
status: public
title: Rational points on intersections of cubic and quadric hypersurfaces
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 14
year: '2014'
...
---
_id: '2699'
abstract:
- lang: eng
text: "We prove the universality of the β-ensembles with convex analytic potentials
and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases
at any inverse temperature β coincide with those of the Gaussian β-ensembles."
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical
Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752
apa: Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles.
Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752
chicago: Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.”
Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752.
ieee: L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,”
Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp.
1127–1190, 2014.
ista: Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke
Mathematical Journal. 163(6), 1127–1190.
mla: Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical
Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752.
short: L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.
date_created: 2018-12-11T11:59:08Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:59:07Z
day: '01'
department:
- _id: LaEr
doi: 10.1215/00127094-2649752
intvolume: ' 163'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2272
month: '04'
oa: 1
oa_version: Preprint
page: 1127 - 1190
publication: Duke Mathematical Journal
publication_status: published
publisher: Duke University Press
publist_id: '4197'
quality_controlled: '1'
scopus_import: 1
status: public
title: Universality of general β-ensembles
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 163
year: '2014'
...
---
_id: '2716'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω ω -regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on vector addition systems with
states. Second, we present an optimal symbolic and incremental algorithm to compute
a finite-memory winning strategy (if one exists) in such games. Finally, we give
a complete characterization of when finite memory of strategies can be traded
off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: "Krishnendu Chatterjee is supported by Austrian Science Fund (FWF)
Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307:
Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS.
fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499:
inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary
draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful
to the anonymous reviewers for their insightful comments. "
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6
apa: Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for
multi-dimensional quantitative objectives. Acta Informatica. Springer.
https://doi.org/10.1007/s00236-013-0182-6
chicago: Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis
for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer,
2014. https://doi.org/10.1007/s00236-013-0182-6.
ieee: K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer,
pp. 129–163, 2014.
ista: Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 51(3–4), 129–163.
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63,
doi:10.1007/s00236-013-0182-6.
short: K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
date_created: 2018-12-11T11:59:14Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2023-02-21T16:06:56Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00236-013-0182-6
external_id:
arxiv:
- '1201.5073'
intvolume: ' 51'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1201.5073
month: '06'
oa: 1
oa_version: Preprint
page: 129 - 163
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '4176'
quality_controlled: '1'
related_material:
record:
- id: '10904'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_id: '2905'
abstract:
- lang: eng
text: "Persistent homology is a recent grandchild of homology that has found use
in\r\nscience and engineering as well as in mathematics. This paper surveys the
method as well\r\nas the applications, neglecting completeness in favor of highlighting
ideas and directions."
acknowledgement: This research is partially supported by NSF under grant DBI-0820624,
by ESF under the Research Networking Programme, and by the Russian Government Project
11.G34.31.0053.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozovy, Dmitriy
last_name: Morozovy
citation:
ama: 'Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In:
European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3'
apa: 'Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and
practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics,
Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3'
chicago: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory
and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.'
ieee: 'H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,”
presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014,
pp. 31–50.'
ista: 'Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice.
ECM: European Congress of Mathematics, 31–50.'
mla: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory
and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50,
doi:10.4171/120-1/3.'
short: H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing
House, 2014, pp. 31–50.
conference:
end_date: 2012-07-07
location: Kraków, Poland
name: 'ECM: European Congress of Mathematics'
start_date: 2012-07-02
date_created: 2018-12-11T12:00:16Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4171/120-1/3
file:
- access_level: open_access
checksum: 1d4a046f1af945c407c5c4d411d4c5e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:43Z
date_updated: 2020-07-14T12:45:52Z
file_id: '5232'
file_name: IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf
file_size: 435320
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 31 - 50
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '3842'
pubrep_id: '544'
quality_controlled: '1'
status: public
title: 'Persistent homology: Theory and practice'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '1733'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a distance for interfaces, called interface simulation distance. It makes the
alternating refinement preorder quantitative by, intuitively, tolerating errors
(while counting them) in the alternating simulation game. We show that the interface
simulation distance satisfies the triangle inequality, that the distance between
two interfaces does not increase under parallel composition with a third interface,
that the distance between two interfaces can be bounded from above and below by
distances between abstractions of the two interfaces, and how to synthesize an
interface from incompatible requirements. We illustrate the framework, and the
properties of the distances under composition of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances.
Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019
apa: Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface
simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” Theoretical Computer Science. Elsevier,
2014. https://doi.org/10.1016/j.tcs.2014.08.019.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation
distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp.
348–363, 2014.
ista: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation
distances. Theoretical Computer Science. 560(3), 348–363.
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer
Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer
Science 560 (2014) 348–363.
date_created: 2018-12-11T11:53:43Z
date_published: 2014-12-04T00:00:00Z
date_updated: 2023-02-23T11:04:00Z
day: '04'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1016/j.tcs.2014.08.019
ec_funded: 1
intvolume: ' 560'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '12'
oa: 1
oa_version: Submitted Version
page: 348 - 363
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5392'
quality_controlled: '1'
related_material:
record:
- id: '2916'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Interface simulation distances
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 560
year: '2014'
...
---
_id: '2141'
abstract:
- lang: eng
text: The computation of the winning set for Büchi objectives in alternating games
on graphs is a central problem in computer-aided verification with a large number
of applications. The long-standing best known upper bound for solving the problem
is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in
the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new
technique that reduces the running time to O(n2). This bound also leads to O(n2)-time
algorithms for computing the set of almost-sure winning vertices for Büchi objectives
(1) in alternating games with probabilistic transitions (improving an earlier
bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving
an earlier bound of O(n3)), and (3) in Markov decision processes (improving for
m>n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning
set for Büchi objectives in alternating games under a sequence of edge insertions
or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms
are the first dynamic algorithms for this problem. We then consider another core
graph theoretic problem in verification of probabilistic systems, namely computing
the maximal end-component decomposition of a graph. We present two improved static
algorithms for the maximal end-component decomposition problem. Our first algorithm
is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm
which is obtained using the same technique as for alternating Büchi games. Thus,
we obtain an O(min &lcu;m ⋅ √m,n2})-time algorithm improving the long-standing
O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component
decomposition of a graph under a sequence of edge insertions or a sequence of
edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time
per edge insertion. Again, our algorithms are the first dynamic algorithms for
this problem.
article_number: a15
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition. Journal of the ACM.
2014;61(3). doi:10.1145/2597631
apa: Chatterjee, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms
for alternating Büchi games and maximal end-component decomposition. Journal
of the ACM. ACM. https://doi.org/10.1145/2597631
chicago: Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic
Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.”
Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.
ieee: K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition,” Journal of the ACM,
vol. 61, no. 3. ACM, 2014.
ista: Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3),
a15.
mla: Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms
for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal
of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.
short: K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014).
date_created: 2018-12-11T11:55:57Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2023-02-23T11:15:12Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2597631
ec_funded: 1
intvolume: ' 61'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprints.cs.univie.ac.at/3933/
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '4883'
quality_controlled: '1'
related_material:
record:
- id: '3165'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Efficient and dynamic algorithms for alternating Büchi games and maximal end-component
decomposition
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 61
year: '2014'
...
---
_id: '3263'
abstract:
- lang: eng
text: Adaptation in the retina is thought to optimize the encoding of natural light
signals into sequences of spikes sent to the brain. While adaptive changes in
retinal processing to the variations of the mean luminance level and second-order
stimulus statistics have been documented before, no such measurements have been
performed when higher-order moments of the light distribution change. We therefore
measured the ganglion cell responses in the tiger salamander retina to controlled
changes in the second (contrast), third (skew) and fourth (kurtosis) moments of
the light intensity distribution of spatially uniform temporally independent stimuli.
The skew and kurtosis of the stimuli were chosen to cover the range observed in
natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear
models that capture well the retinal encoding properties across all stimuli. We
found that the encoding properties of retinal ganglion cells change only marginally
when higher-order statistics change, compared to the changes observed in response
to the variation in contrast. By analyzing optimal coding in LN-type models, we
showed that neurons can maintain a high information rate without large dynamic
adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli,
spatio-temporal summation within the receptive field averages away non-gaussian
aspects of the light intensity distribution.
acknowledgement: "This work was supported by The Israel Science Foundation and The
Human Frontiers Science Program.\r\nWe thank the referees for helping significantly
improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason
Prentice for stimulating discussions. GT wishes to thank the faculty and students
of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory,
Woods Hole.\r\n"
article_number: e85841
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Anandamohan
full_name: Ghosh, Anandamohan
last_name: Ghosh
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: Ronen
full_name: Segev, Ronen
last_name: Segev
citation:
ama: Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841
apa: Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to
changes in higher-order stimulus statistics in the salamander retina. PLoS
One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841
chicago: Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation
to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS
One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841.
ieee: G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in
higher-order stimulus statistics in the salamander retina,” PLoS One, vol.
9, no. 1. Public Library of Science, 2014.
ista: Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.
mla: Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics
in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library
of Science, 2014, doi:10.1371/journal.pone.0085841.
short: G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).
date_created: 2018-12-11T12:02:20Z
date_published: 2014-01-21T00:00:00Z
date_updated: 2021-01-12T07:42:14Z
day: '21'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pone.0085841
file:
- access_level: open_access
checksum: 1d5816b343abe5eadc3eb419bcece971
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:28Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5011'
file_name: IST-2016-432-v1+1_journal.pone.0085841.pdf
file_size: 1568524
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3385'
pubrep_id: '432'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptation to changes in higher-order stimulus statistics in the salamander
retina
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: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '332'
abstract:
- lang: eng
text: 'Cu2ZnSnS4, based on abundant and environmental friendly elements and with
a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion
through both photovoltaics and photocatalysis. We detail here the synthesis of
quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions.
We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured
nanoparticles. Such heterostructured nanoparticles are shown to have excellent
photocatalytic properties toward degradation of Rhodamine B and hydrogen generation
by water splitting. '
article_processing_charge: No
article_type: original
author:
- first_name: Xuelian
full_name: Yu, Xuelian
last_name: Yu
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Xiaoqiang
full_name: An, Xiaoqiang
last_name: An
- first_name: Zhishan
full_name: Luo, Zhishan
last_name: Luo
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au
heterostructured nanoparticles for photocatalytic water splitting and pollutant
degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239.
doi:10.1021/ja502076b
apa: Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt
and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting
and pollutant degradation. Journal of the American Chemical Society. ACS.
https://doi.org/10.1021/ja502076b
chicago: Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and
Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for
Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American
Chemical Society. ACS, 2014. https://doi.org/10.1021/ja502076b.
ieee: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and
Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting
and pollutant degradation,” Journal of the American Chemical Society, vol.
136, no. 26. ACS, pp. 9236–9239, 2014.
ista: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au
heterostructured nanoparticles for photocatalytic water splitting and pollutant
degradation. Journal of the American Chemical Society. 136(26), 9236–9239.
mla: Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles
for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the
American Chemical Society, vol. 136, no. 26, ACS, 2014, pp. 9236–39, doi:10.1021/ja502076b.
short: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American
Chemical Society 136 (2014) 9236–9239.
date_created: 2018-12-11T11:45:52Z
date_published: 2014-06-11T00:00:00Z
date_updated: 2021-01-12T07:42:37Z
day: '11'
doi: 10.1021/ja502076b
extern: '1'
intvolume: ' 136'
issue: '26'
language:
- iso: eng
month: '06'
oa_version: None
page: 9236 - 9239
publication: Journal of the American Chemical Society
publication_status: published
publisher: ACS
publist_id: '7513'
quality_controlled: '1'
status: public
title: Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic
water splitting and pollutant degradation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 136
year: '2014'
...
---
_id: '2054'
abstract:
- lang: eng
text: 'We study two-player concurrent games on finite-state graphs played for an
infinite number of rounds, where in each round, the two players (player 1 and
player 2) choose their moves independently and simultaneously; the current state
and the two moves determine the successor state. The objectives are ω-regular
winning conditions specified as parity objectives. We consider the qualitative
analysis problems: the computation of the almost-sure and limit-sure winning set
of states, where player 1 can ensure to win with probability 1 and with probability
arbitrarily close to 1, respectively. In general the almost-sure and limit-sure
winning strategies require both infinite-memory as well as infinite-precision
(to describe probabilities). While the qualitative analysis problem for concurrent
parity games with infinite-memory, infinite-precision randomized strategies was
studied before, we study the bounded-rationality problem for qualitative analysis
of concurrent parity games, where the strategy set for player 1 is restricted
to bounded-resource strategies. In terms of precision, strategies can be deterministic,
uniform, finite-precision, or infinite-precision; and in terms of memory, strategies
can be memoryless, finite-memory, or infinite-memory. We present a precise and
complete characterization of the qualitative winning sets for all combinations
of classes of strategies. In particular, we show that uniform memoryless strategies
are as powerful as finite-precision infinite-memory strategies, and infinite-precision
memoryless strategies are as powerful as infinite-precision finite-memory strategies.
We show that the winning sets can be computed in (n2d+3) time, where n is the
size of the game structure and 2d is the number of priorities (or colors), and
our algorithms are symbolic. The membership problem of whether a state belongs
to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based
on a characterization of the winning sets as μ-calculus formulas, however, our
μ-calculus formulas are crucially different from the ones for concurrent parity
games (without bounded rationality); and our memoryless witness strategy constructions
are significantly different from the infinite-memory witness strategy constructions
for concurrent parity games.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In:
Baldan P, Gorla D, eds. Lecture Notes in Computer Science (Including Subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:10.1007/978-3-662-44584-6_37'
apa: 'Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality.
In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.1007/978-3-662-44584-6_37'
chicago: 'Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded
Rationality.” In Lecture Notes in Computer Science (Including Subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited
by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_37.'
ieee: 'K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,”
in Lecture Notes in Computer Science (including subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy,
2014, vol. 8704, pp. 544–559.'
ista: 'Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory,
LNCS, vol. 8704, 544–559.'
mla: 'Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan
and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 544–59, doi:10.1007/978-3-662-44584-6_37.'
short: K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer
Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014,
pp. 544–559.
conference:
end_date: 2014-09-05
location: Rome, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2014-09-02
date_created: 2018-12-11T11:55:27Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2023-02-23T11:23:36Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-44584-6_37
ec_funded: 1
editor:
- first_name: Paolo
full_name: Baldan, Paolo
last_name: Baldan
- first_name: Daniele
full_name: Gorla, Daniele
last_name: Gorla
intvolume: ' 8704'
language:
- iso: eng
month: '09'
oa_version: None
page: 544 - 559
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4992'
quality_controlled: '1'
related_material:
record:
- id: '3354'
relation: earlier_version
status: public
status: public
title: 'Qualitative concurrent parity games: Bounded rationality'
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8704
year: '2014'
...
---
_id: '349'
abstract:
- lang: eng
text: 'Thermoelectricity is a key technology with the potential to improve the efficiency
of energy conversion processes, which may strongly benefit from advances in the
field of nanotechnology. Nanostructured materials are very appealing for thermoelectric
applications, but the full development of their potential requires precise control
of their properties at the nanoscale. Bottom-up assembly of nanoparticles provides
access to a three-dimensional composition control at the nanoscale not attainable
in any other technology. In particular, colloidal nanoheterostructures are especially
interesting building blocks for the bottom-up production of functional nanomaterials.
In the present work, we use PbTe@PbS core-shell nanoparticles as building blocks
for the bottom-up production of PbTe-PbS nanocomposites. We used a ligand exchange
strategy and a hot press process to promote the electrical conductivity of the
nanocomposite and to increase its density. These two approaches allowed us to
improve the performance of bottom-up assembled PbTe-PbS bulk nanostructured materials. '
article_processing_charge: No
article_type: original
author:
- first_name: Silvia
full_name: Ortega, Silvia
last_name: Ortega
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Ortega S, Ibáñez M, Cadavid D, Cabot A. Bottom up processing of PbTe PbS thermoelectric
nanocomposites. International Journal of Nanotechnology. 2014;11(9-11):955-970.
doi:10.1504/IJNT.2014.063802
apa: Ortega, S., Ibáñez, M., Cadavid, D., & Cabot, A. (2014). Bottom up processing
of PbTe PbS thermoelectric nanocomposites. International Journal of Nanotechnology.
Inderscience Enterprises Limited . https://doi.org/10.1504/IJNT.2014.063802
chicago: Ortega, Silvia, Maria Ibáñez, Doris Cadavid, and Andreu Cabot. “Bottom
up Processing of PbTe PbS Thermoelectric Nanocomposites.” International Journal
of Nanotechnology. Inderscience Enterprises Limited , 2014. https://doi.org/10.1504/IJNT.2014.063802.
ieee: S. Ortega, M. Ibáñez, D. Cadavid, and A. Cabot, “Bottom up processing of PbTe
PbS thermoelectric nanocomposites,” International Journal of Nanotechnology,
vol. 11, no. 9–11. Inderscience Enterprises Limited , pp. 955–970, 2014.
ista: Ortega S, Ibáñez M, Cadavid D, Cabot A. 2014. Bottom up processing of PbTe
PbS thermoelectric nanocomposites. International Journal of Nanotechnology. 11(9–11),
955–970.
mla: Ortega, Silvia, et al. “Bottom up Processing of PbTe PbS Thermoelectric Nanocomposites.”
International Journal of Nanotechnology, vol. 11, no. 9–11, Inderscience
Enterprises Limited , 2014, pp. 955–70, doi:10.1504/IJNT.2014.063802.
short: S. Ortega, M. Ibáñez, D. Cadavid, A. Cabot, International Journal of Nanotechnology
11 (2014) 955–970.
date_created: 2018-12-11T11:45:57Z
date_published: 2014-07-21T00:00:00Z
date_updated: 2021-01-12T07:43:48Z
day: '21'
doi: 10.1504/IJNT.2014.063802
extern: '1'
intvolume: ' 11'
issue: 9-11
language:
- iso: eng
month: '07'
oa_version: None
page: 955 - 970
publication: International Journal of Nanotechnology
publication_status: published
publisher: 'Inderscience Enterprises Limited '
publist_id: '7477'
quality_controlled: '1'
status: public
title: Bottom up processing of PbTe PbS thermoelectric nanocomposites
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2014'
...
---
_id: '355'
abstract:
- lang: eng
text: 'We report on the photocatalytic hydrogen evolution under full-arc light irradiation
of CuIn1-xGaxS2 wurtzite nanocrystals in the presence of SO3 2- and S2- as sacrificial
reagents. We analyzed the hydrogen generation rate as a function of the Ga content
and associated it with the energy band positions. For photocatalytic water splitting,
the CuInS2 bandgap is slightly too low to efficiently overcome the reaction over-potential.
The presence of Ga shifts up the CuInS2 conduction band edge providing a larger
driving force for photogenerated carriers to activate the water splitting reduction
reaction. The larger the Ga content, the more energetically favorable the electron
injection, and thus a more efficient use of the photogenerated carriers is reached.
However, the band gap increase associated with the Ga incorporation reduces the
concentration of photogenerated carriers available for water splitting, and consequently
a lower hydrogen conversion rate is obtained for very high Ga contents. The optimum
Ga concentration was experimentally found at CuIn0.3Ga0.7S2. '
acknowledgement: "The research was supported by the European Regional Development\r\nFunds
(ERDF, “FEDER Programa Competitivitat de\r\nCatalunya 2007-2013”) and the Framework
7 program under\r\nproject SCALENANO (FP7-NMP-ENERGY-2011-284486)."
article_processing_charge: No
article_type: original
author:
- first_name: Xuelian
full_name: Yu, Xuelian
last_name: Yu
- first_name: Xiaoqiang
full_name: An, Xiaoqiang
last_name: An
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Yu X, An X, Shavel A, Ibáñez M, Cabot A. The effect of the Ga content on the
photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal of
Materials Chemistry A. 2014;2(31):12317-12322. doi:10.1039/c4ta01315h
apa: Yu, X., An, X., Shavel, A., Ibáñez, M., & Cabot, A. (2014). The effect
of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals.
Journal of Materials Chemistry A. Royal Society of Chemistry. https://doi.org/10.1039/c4ta01315h
chicago: Yu, Xuelian, Xiaoqiang An, Alexey Shavel, Maria Ibáñez, and Andreu Cabot.
“The Effect of the Ga Content on the Photocatalytic Hydrogen Evolution of CuIn1-XGaxS2
Nanocrystals.” Journal of Materials Chemistry A. Royal Society of Chemistry,
2014. https://doi.org/10.1039/c4ta01315h.
ieee: X. Yu, X. An, A. Shavel, M. Ibáñez, and A. Cabot, “The effect of the Ga content
on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals,” Journal
of Materials Chemistry A, vol. 2, no. 31. Royal Society of Chemistry, pp.
12317–12322, 2014.
ista: Yu X, An X, Shavel A, Ibáñez M, Cabot A. 2014. The effect of the Ga content
on the photocatalytic hydrogen evolution of CuIn1-xGaxS2 nanocrystals. Journal
of Materials Chemistry A. 2(31), 12317–12322.
mla: Yu, Xuelian, et al. “The Effect of the Ga Content on the Photocatalytic Hydrogen
Evolution of CuIn1-XGaxS2 Nanocrystals.” Journal of Materials Chemistry A,
vol. 2, no. 31, Royal Society of Chemistry, 2014, pp. 12317–22, doi:10.1039/c4ta01315h.
short: X. Yu, X. An, A. Shavel, M. Ibáñez, A. Cabot, Journal of Materials Chemistry
A 2 (2014) 12317–12322.
date_created: 2018-12-11T11:45:59Z
date_published: 2014-08-21T00:00:00Z
date_updated: 2021-01-12T07:44:14Z
day: '21'
doi: 10.1039/c4ta01315h
extern: '1'
intvolume: ' 2'
issue: '31'
language:
- iso: eng
month: '08'
oa_version: None
page: 12317 - 12322
publication: Journal of Materials Chemistry A
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7471'
quality_controlled: '1'
status: public
title: The effect of the Ga content on the photocatalytic hydrogen evolution of CuIn1-xGaxS2
nanocrystals
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2014'
...
---
_id: '357'
abstract:
- lang: eng
text: 'Near-resonant Raman scattering measurements of zinc sulfide nanoparticles
and thin films have been made and correlated to grain and particle size, respectively,
using a 325 nm wavelength excitation source. The area ratios between the first,
second, and third order peaks of ZnS identified as the T 2(LO) mode decrease with
increasing ZnS grain size. This is an effect attributed to changes in the bandgap
energy from quantum confinement due to the varying grain size between the films/particles,
as noted by a shift in the room temperature photoluminescence emission corresponding
to the free exciton emission energy. While Raman scattering spectroscopy is typically
limited to identification of phases and their crystalline properties, it is possible
to attain more than such straightforward information by calibrating the spectral
features to variations between sets of samples. These results open the possibility
of making a quantitative grain size estimation in ZnS thin films and nanostructures,
as well as in other material systems where ZnS may be expected as a secondary
phase, such as Cu2ZnSnS4. Additionally, more commonly used excitation wavelengths
for Raman scattering, such as 514 and 532 nm, are shown to be of limited use in
characterizing ZnS thin films due to the extremely low Raman scattering efficiency
of ZnS in films with sub-micron thicknesses. '
acknowledgement: "This research was supported by the People Programme\r\n(Marie Curie
Actions) of the European Union's Seventh Framework\r\nProgramme under REA grant
agreement number 269167\r\n(PVICOKEST) and the Spanish Ministerio de Economía y\r\nCompetividad
(MINECO) under KEST-PV (ref. ENE2010-\r\n121541-C03-01/02). Authors from IREC belong
to the M-2E\r\n(Electronic Materials for Energy) Consolidated Research\r\nGroup
and the XaRMAE Network of Excellence on Materials\r\nfor Energy of the “Generalitat
de Catalunya”. A. Fairbrother\r\nthanks the MINECO for support via the FPU program\r\n(FPU12/05508),
V. Izquierdo for the Juan de la Cierva program\r\n(JCI-2011-10782), and E. Saucedo
for the Ramón y Cajal\r\nprogram (RYC-2011-09212)."
article_processing_charge: No
article_type: original
author:
- first_name: Andrew
full_name: Fairbrother, Andrew
last_name: Fairbrother
- first_name: Victor
full_name: Izquierdo Roca, Victor
last_name: Izquierdo Roca
- first_name: Xavier
full_name: Fontané, Xavier
last_name: Fontané
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
- first_name: Edgardo
full_name: Saucedo, Edgardo
last_name: Saucedo
- first_name: Alejandro
full_name: Pérez Rodríguez, Alejandro
last_name: Pérez Rodríguez
citation:
ama: 'Fairbrother A, Izquierdo Roca V, Fontané X, et al. ZnS grain size effects
on near-resonant Raman scattering: Optical non-destructive grain size estimation.
CrystEngComm. 2014;16(20):4120-4125. doi:10.1039/c3ce42578a'
apa: 'Fairbrother, A., Izquierdo Roca, V., Fontané, X., Ibáñez, M., Cabot, A., Saucedo,
E., & Pérez Rodríguez, A. (2014). ZnS grain size effects on near-resonant
Raman scattering: Optical non-destructive grain size estimation. CrystEngComm.
Royal Society of Chemistry. https://doi.org/10.1039/c3ce42578a'
chicago: 'Fairbrother, Andrew, Victor Izquierdo Roca, Xavier Fontané, Maria Ibáñez,
Andreu Cabot, Edgardo Saucedo, and Alejandro Pérez Rodríguez. “ZnS Grain Size
Effects on Near-Resonant Raman Scattering: Optical Non-Destructive Grain Size
Estimation.” CrystEngComm. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c3ce42578a.'
ieee: 'A. Fairbrother et al., “ZnS grain size effects on near-resonant Raman
scattering: Optical non-destructive grain size estimation,” CrystEngComm,
vol. 16, no. 20. Royal Society of Chemistry, pp. 4120–4125, 2014.'
ista: 'Fairbrother A, Izquierdo Roca V, Fontané X, Ibáñez M, Cabot A, Saucedo E,
Pérez Rodríguez A. 2014. ZnS grain size effects on near-resonant Raman scattering:
Optical non-destructive grain size estimation. CrystEngComm. 16(20), 4120–4125.'
mla: 'Fairbrother, Andrew, et al. “ZnS Grain Size Effects on Near-Resonant Raman
Scattering: Optical Non-Destructive Grain Size Estimation.” CrystEngComm,
vol. 16, no. 20, Royal Society of Chemistry, 2014, pp. 4120–25, doi:10.1039/c3ce42578a.'
short: A. Fairbrother, V. Izquierdo Roca, X. Fontané, M. Ibáñez, A. Cabot, E. Saucedo,
A. Pérez Rodríguez, CrystEngComm 16 (2014) 4120–4125.
date_created: 2018-12-11T11:46:00Z
date_published: 2014-05-28T00:00:00Z
date_updated: 2021-01-12T07:44:22Z
day: '28'
doi: 10.1039/c3ce42578a
extern: '1'
intvolume: ' 16'
issue: '20'
language:
- iso: eng
month: '05'
oa_version: None
page: 4120 - 4125
publication: CrystEngComm
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7473'
quality_controlled: '1'
status: public
title: 'ZnS grain size effects on near-resonant Raman scattering: Optical non-destructive
grain size estimation'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2014'
...
---
_id: '359'
abstract:
- lang: eng
text: An appropriate way of realizing property nanoengineering in complex quaternary
chalcogenide nanocrystals is presented for Cu2Cd xSnSey(CCTSe) polypods. The pivotal
role of the polarity in determining morphology, growth, and the polytypic branching
mechanism is demonstrated. Polarity is considered to be responsible for the formation
of an initial seed that takes the form of a tetrahedron with four cation-polar
facets. Size and shape confinement of the intermediate pentatetrahedral seed is
also attributed to polarity, as their external facets are anion-polar. The final
polypod extensions also branch out as a result of a cation-polarity-driven mechanism.
Aberration-corrected scanning transmission electron microscopy is used to identify
stannite cation ordering, while ab initio studies are used to show the influence
of cation ordering/distortion, stoichiometry, and polytypic structural change
on the electronic band structure.
acknowledgement: The research leading to these results has received funding from the
European Union Seventh Framework Programme under grant agreement 312483-ESTEEM2
(Integrated Infrastructure InitiativeI3) for using advance electron microscopes
at ER-C Jülich. J.A. acknowledges the funding from the Spanish MICINN project MAT2010-15138
(COPEON) and Generalitat de Catalunya 2009 SGR 770. R.R.Z. acknowledges the former.
The authors would also like to thank the TEM facilities in Serveis Cientificotecnics
from Universitat de Barcelona. N.G.-C. acknowledges the Spanish MECD for her Ph.D.
grant in the FPU program. JR and RZ acknowledge funding from MULTICAT and NANOENESTO
projects.
article_processing_charge: No
article_type: original
author:
- first_name: Reza
full_name: Zamani, Reza
last_name: Zamani
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Martina
full_name: Luysberg, Martina
last_name: Luysberg
- first_name: Nuria
full_name: García Castelló, Nuria
last_name: García Castelló
- first_name: Lothar
full_name: Houben, Lothar
last_name: Houben
- first_name: Joan
full_name: Prades, Joan
last_name: Prades
- first_name: Vincenzo
full_name: Grillo, Vincenzo
last_name: Grillo
- first_name: Rafal
full_name: Dunin Borkowski, Rafal
last_name: Dunin Borkowski
- first_name: Joan
full_name: Morante, Joan
last_name: Morante
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
citation:
ama: Zamani R, Ibáñez M, Luysberg M, et al. Polarity-driven polytypic branching
in Cu-based quaternary chalcogenide nanostructures. ACS Nano. 2014;8(3):2290-2301.
doi:10.1021/nn405747h
apa: Zamani, R., Ibáñez, M., Luysberg, M., García Castelló, N., Houben, L., Prades,
J., … Arbiol, J. (2014). Polarity-driven polytypic branching in Cu-based quaternary
chalcogenide nanostructures. ACS Nano. American Chemical Society. https://doi.org/10.1021/nn405747h
chicago: Zamani, Reza, Maria Ibáñez, Martina Luysberg, Nuria García Castelló, Lothar
Houben, Joan Prades, Vincenzo Grillo, et al. “Polarity-Driven Polytypic Branching
in Cu-Based Quaternary Chalcogenide Nanostructures.” ACS Nano. American
Chemical Society, 2014. https://doi.org/10.1021/nn405747h.
ieee: R. Zamani et al., “Polarity-driven polytypic branching in Cu-based
quaternary chalcogenide nanostructures,” ACS Nano, vol. 8, no. 3. American
Chemical Society, pp. 2290–2301, 2014.
ista: Zamani R, Ibáñez M, Luysberg M, García Castelló N, Houben L, Prades J, Grillo
V, Dunin Borkowski R, Morante J, Cabot A, Arbiol J. 2014. Polarity-driven polytypic
branching in Cu-based quaternary chalcogenide nanostructures. ACS Nano. 8(3),
2290–2301.
mla: Zamani, Reza, et al. “Polarity-Driven Polytypic Branching in Cu-Based Quaternary
Chalcogenide Nanostructures.” ACS Nano, vol. 8, no. 3, American Chemical
Society, 2014, pp. 2290–301, doi:10.1021/nn405747h.
short: R. Zamani, M. Ibáñez, M. Luysberg, N. García Castelló, L. Houben, J. Prades,
V. Grillo, R. Dunin Borkowski, J. Morante, A. Cabot, J. Arbiol, ACS Nano 8 (2014)
2290–2301.
date_created: 2018-12-11T11:46:01Z
date_published: 2014-03-25T00:00:00Z
date_updated: 2021-01-12T07:44:30Z
day: '25'
doi: 10.1021/nn405747h
extern: '1'
intvolume: ' 8'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 2290 - 2301
publication: ACS Nano
publication_status: published
publisher: American Chemical Society
publist_id: '7475'
quality_controlled: '1'
status: public
title: Polarity-driven polytypic branching in Cu-based quaternary chalcogenide nanostructures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2014'
...
---
_id: '2852'
abstract:
- lang: eng
text: A robust combiner for hash functions takes two candidate implementations and
constructs a hash function which is secure as long as at least one of the candidates
is secure. So far, hash function combiners only aim at preserving a single property
such as collision-resistance or pseudorandomness. However, when hash functions
are used in protocols like TLS they are often required to provide several properties
simultaneously. We therefore put forward the notion of robust multi-property combiners
and elaborate on different definitions for such combiners. We then propose a combiner
that provably preserves (target) collision-resistance, pseudorandomness, and being
a secure message authentication code. This combiner satisfies the strongest notion
we propose, which requires that the combined function satisfies every security
property which is satisfied by at least one of the underlying hash function. If
the underlying hash functions have output length n, the combiner has output length
2 n. This basically matches a known lower bound for black-box combiners for collision-resistance
only, thus the other properties can be achieved without penalizing the length
of the hash values. We then propose a combiner which also preserves the property
of being indifferentiable from a random oracle, slightly increasing the output
length to 2 n+ω(log n). Moreover, we show how to augment our constructions in
order to make them also robust for the one-wayness property, but in this case
require an a priory upper bound on the input length.
author:
- first_name: Marc
full_name: Fischlin, Marc
last_name: Fischlin
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash
functions. Journal of Cryptology. 2014;27(3):397-428. doi:10.1007/s00145-013-9148-7
apa: Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2014). Robust multi-property
combiners for hash functions. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-013-9148-7
chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property
Combiners for Hash Functions.” Journal of Cryptology. Springer, 2014. https://doi.org/10.1007/s00145-013-9148-7.
ieee: M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners
for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp.
397–428, 2014.
ista: Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners
for hash functions. Journal of Cryptology. 27(3), 397–428.
mla: Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.”
Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.
short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.
date_created: 2018-12-11T11:59:56Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2023-02-23T11:17:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00145-013-9148-7
intvolume: ' 27'
issue: '3'
language:
- iso: eng
month: '07'
oa_version: None
page: 397 - 428
publication: Journal of Cryptology
publication_status: published
publisher: Springer
publist_id: '3940'
quality_controlled: '1'
related_material:
record:
- id: '3225'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Robust multi-property combiners for hash functions
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2014'
...
---
_id: '348'
abstract:
- lang: eng
text: "Bi2S3-xTex bulk nanocomposites with crystal domain sizes in the range from
50 nm to 100 nm were obtained from the reaction of Bi2S3 nanorods with Te powder.
The thermoelectric properties of the obtained nanocomposites were analysed in
the temperature range from 0°C to 300°C. We observed how the thermoelectric properties
of the material improved with the annealing temperature, being a spark plasma
sintering process needed to maintain the material nanostructuration while maximising
its electrical properties. Finally thermoelectric dimensionless figures of merit
ZT up to 0.42 were obtained before any charge carrier concentration optimisation.
Copyright © 2014 Inderscience Enterprises Ltd.\r\n\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Umberto
full_name: Anselmi Tamburini, Umberto
last_name: Anselmi Tamburini
- first_name: Oscar
full_name: Durá, Oscar
last_name: Durá
- first_name: Marco
full_name: De La Torre, Marco
last_name: De La Torre
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A. Thermoelectric
properties of bottom up assembled Bi2S 3-xTex nanocomposites. International
Journal of Nanotechnology. 2014;11(9-11):773-784. doi:10.1504/IJNT.2014.063787
apa: Cadavid, D., Ibáñez, M., Anselmi Tamburini, U., Durá, O., De La Torre, M.,
& Cabot, A. (2014). Thermoelectric properties of bottom up assembled Bi2S
3-xTex nanocomposites. International Journal of Nanotechnology. Inderscience
Enterprises Limited . https://doi.org/10.1504/IJNT.2014.063787
chicago: Cadavid, Doris, Maria Ibáñez, Umberto Anselmi Tamburini, Oscar Durá, Marco
De La Torre, and Andreu Cabot. “Thermoelectric Properties of Bottom up Assembled
Bi2S 3-XTex Nanocomposites.” International Journal of Nanotechnology. Inderscience
Enterprises Limited , 2014. https://doi.org/10.1504/IJNT.2014.063787.
ieee: D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, and
A. Cabot, “Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites,”
International Journal of Nanotechnology, vol. 11, no. 9–11. Inderscience
Enterprises Limited , pp. 773–784, 2014.
ista: Cadavid D, Ibáñez M, Anselmi Tamburini U, Durá O, De La Torre M, Cabot A.
2014. Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites.
International Journal of Nanotechnology. 11(9–11), 773–784.
mla: Cadavid, Doris, et al. “Thermoelectric Properties of Bottom up Assembled Bi2S
3-XTex Nanocomposites.” International Journal of Nanotechnology, vol. 11,
no. 9–11, Inderscience Enterprises Limited , 2014, pp. 773–84, doi:10.1504/IJNT.2014.063787.
short: D. Cadavid, M. Ibáñez, U. Anselmi Tamburini, O. Durá, M. De La Torre, A.
Cabot, International Journal of Nanotechnology 11 (2014) 773–784.
date_created: 2018-12-11T11:45:57Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T07:43:44Z
day: '01'
doi: 10.1504/IJNT.2014.063787
extern: '1'
intvolume: ' 11'
issue: 9-11
language:
- iso: eng
month: '01'
oa_version: None
page: 773 - 784
publication: International Journal of Nanotechnology
publication_status: published
publisher: 'Inderscience Enterprises Limited '
publist_id: '7476'
quality_controlled: '1'
status: public
title: Thermoelectric properties of bottom up assembled Bi2S 3-xTex nanocomposites
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2014'
...
---
_id: '350'
abstract:
- lang: eng
text: Herein, a colloidal synthetic route to produce highly monodisperse Cu2HgGeSe4
(CHGSe) nanoparticles (NPs) is presented in detail. The high yield of the developed
procedure allowed the production of CHGSe NPs at the gram scale. A thorough analysis
of their structural and optical properties is shown. CHGSe NPs displayed poly-tetrahedral
morphology and narrow size distributions with average size in the range of 10–40
nm and size dispersions below 10 %. A 1.6 eV optical band gap was measured by
mean of UV–Vis. By adjusting the cation ratio, an effective control of their electrical
conductivity is achieved. The prepared NPs are used as building blocks for the
production of CHGSe bulk nanostructured materials. The thermoelectric properties
of CHGSe nanomaterials are studied in the temperature range from 300 to 730 K.
CHGSe nanomaterials reached electrical conductivities up to 5 × 104 S m−1, Seebeck
coefficients above 100 μV K−1, and thermal conductivities below 1.0 W m−1 K−1
which translated into thermoelectric figures of merit up to 0.34 at 730 K.
acknowledgement: The research was supported by the European Regional Development Funds
(ERDF, ‘‘FEDER Programa Competitivitat de Catalunya 2007–2013’’).
article_processing_charge: No
article_type: original
author:
- first_name: Wenhua
full_name: Li, Wenhua
last_name: Li
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Reza
full_name: Zamani, Reza
last_name: Zamani
- first_name: Javier
full_name: Rubio Garcia, Javier
last_name: Rubio Garcia
- first_name: Stéphane
full_name: Gorsse, Stéphane
last_name: Gorsse
- first_name: Joan
full_name: Morante, Joan
last_name: Morante
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: 'Li W, Ibáñez M, Cadavid D, et al. Colloidal synthesis and functional properties
of quaternary Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle
Research. 2014;16(3). doi:10.1007/s11051-014-2297-2'
apa: 'Li, W., Ibáñez, M., Cadavid, D., Zamani, R., Rubio Garcia, J., Gorsse, S.,
… Cabot, A. (2014). Colloidal synthesis and functional properties of quaternary
Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research.
Kluwer. https://doi.org/10.1007/s11051-014-2297-2'
chicago: 'Li, Wenhua, Maria Ibáñez, Doris Cadavid, Reza Zamani, Javier Rubio Garcia,
Stéphane Gorsse, Joan Morante, Jordi Arbiol, and Andreu Cabot. “Colloidal Synthesis
and Functional Properties of Quaternary Cu Based Semiconductors: Cu2HgGeSe4.”
Journal of Nanoparticle Research. Kluwer, 2014. https://doi.org/10.1007/s11051-014-2297-2.'
ieee: 'W. Li et al., “Colloidal synthesis and functional properties of quaternary
Cu based semiconductors: Cu2HgGeSe4,” Journal of Nanoparticle Research,
vol. 16, no. 3. Kluwer, 2014.'
ista: 'Li W, Ibáñez M, Cadavid D, Zamani R, Rubio Garcia J, Gorsse S, Morante J,
Arbiol J, Cabot A. 2014. Colloidal synthesis and functional properties of quaternary
Cu based semiconductors: Cu2HgGeSe4. Journal of Nanoparticle Research. 16(3).'
mla: 'Li, Wenhua, et al. “Colloidal Synthesis and Functional Properties of Quaternary
Cu Based Semiconductors: Cu2HgGeSe4.” Journal of Nanoparticle Research,
vol. 16, no. 3, Kluwer, 2014, doi:10.1007/s11051-014-2297-2.'
short: W. Li, M. Ibáñez, D. Cadavid, R. Zamani, J. Rubio Garcia, S. Gorsse, J. Morante,
J. Arbiol, A. Cabot, Journal of Nanoparticle Research 16 (2014).
date_created: 2018-12-11T11:45:58Z
date_published: 2014-02-18T00:00:00Z
date_updated: 2021-01-12T07:43:53Z
day: '18'
doi: 10.1007/s11051-014-2297-2
extern: '1'
intvolume: ' 16'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-00959322/
month: '02'
oa: 1
oa_version: Submitted Version
publication: Journal of Nanoparticle Research
publication_status: published
publisher: Kluwer
publist_id: '7478'
quality_controlled: '1'
status: public
title: 'Colloidal synthesis and functional properties of quaternary Cu based semiconductors:
Cu2HgGeSe4'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2014'
...
---
_id: '356'
abstract:
- lang: eng
text: Cu2ZnSnS4, based on abundant and environmental friendly elements and with
a direct band gap of 1.5 eV, is a main candidate material for solar energy conversion
through both photovoltaics and photocatalysis. We detail here the synthesis of
quasi-spherical Cu 2ZnSnS4 nanoparticles with unprecedented narrow size distributions.
We further detail their use as seeds to produce CZTS-Au and CZTS-Pt heterostructured
nanoparticles. Such heterostructured nanoparticles are shown to have excellent
photocatalytic properties toward degradation of Rhodamine B and hydrogen generation
by water splitting.
acknowledgement: This work was supported by the European Regional Development Funds
and the Framework 7 program under project SCALENANO (FP7-NMP-ENERGY-2011-284486).
article_processing_charge: No
article_type: original
author:
- first_name: Xuelian
full_name: Yu, Xuelian
last_name: Yu
- first_name: Alexey
full_name: Shavel, Alexey
last_name: Shavel
- first_name: Xiaoqiang
full_name: An, Xiaoqiang
last_name: An
- first_name: Zhishan
full_name: Luo, Zhishan
last_name: Luo
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au
heterostructured nanoparticles for photocatalytic water splitting and pollutant
degradation. Journal of the American Chemical Society. 2014;136(26):9236-9239.
doi:10.1021/ja502076b
apa: Yu, X., Shavel, A., An, X., Luo, Z., Ibáñez, M., & Cabot, A. (2014). Cu2ZnSnS4-Pt
and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting
and pollutant degradation. Journal of the American Chemical Society. American
Chemical Society. https://doi.org/10.1021/ja502076b
chicago: Yu, Xuelian, Alexey Shavel, Xiaoqiang An, Zhishan Luo, Maria Ibáñez, and
Andreu Cabot. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles for
Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the American
Chemical Society. American Chemical Society, 2014. https://doi.org/10.1021/ja502076b.
ieee: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, and A. Cabot, “Cu2ZnSnS4-Pt and
Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic water splitting
and pollutant degradation,” Journal of the American Chemical Society, vol.
136, no. 26. American Chemical Society, pp. 9236–9239, 2014.
ista: Yu X, Shavel A, An X, Luo Z, Ibáñez M, Cabot A. 2014. Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au
heterostructured nanoparticles for photocatalytic water splitting and pollutant
degradation. Journal of the American Chemical Society. 136(26), 9236–9239.
mla: Yu, Xuelian, et al. “Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au Heterostructured Nanoparticles
for Photocatalytic Water Splitting and Pollutant Degradation.” Journal of the
American Chemical Society, vol. 136, no. 26, American Chemical Society, 2014,
pp. 9236–39, doi:10.1021/ja502076b.
short: X. Yu, A. Shavel, X. An, Z. Luo, M. Ibáñez, A. Cabot, Journal of the American
Chemical Society 136 (2014) 9236–9239.
date_created: 2018-12-11T11:46:00Z
date_published: 2014-07-02T00:00:00Z
date_updated: 2021-01-12T07:44:18Z
day: '02'
doi: 10.1021/ja502076b
extern: '1'
intvolume: ' 136'
issue: '26'
language:
- iso: eng
month: '07'
oa_version: None
page: 9236 - 9239
publication: Journal of the American Chemical Society
publication_status: published
publisher: American Chemical Society
publist_id: '7472'
quality_controlled: '1'
status: public
title: Cu2ZnSnS4-Pt and Cu2ZnSnS4-Au heterostructured nanoparticles for photocatalytic
water splitting and pollutant degradation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 136
year: '2014'
...
---
_id: '358'
abstract:
- lang: eng
text: Monodispersed Pt3Sn nanoparticles were prepared through a mild thermal synthesis
in the presence of surfactants. The performance of Pt3Sn for the electrooxidation
of ethanol and adsorbed carbon monoxide (COad) in acid medium was studied by a
combination of electrochemical and insitu spectroscopic methods, namely, infrared
reflection absorption spectroscopy and differential electrochemical mass spectrometry
(DEMS), and the results were compared to those obtained with the use of Pt black.
The formation of the Pt3Sn solid solution promoted the oxidation of COad at less-positive
potentials than those required for Pt black. Also, the electrooxidation of ethanol,
especially at lower potentials, was more favorable with Pt3Sn, as deduced from
the higher faradaic currents recorded during the ethanol oxidation reaction (EOR).
However, the distribution of products as deduced by DEMS analysis suggested that
the formation of C1 products, CO2 inclusive, is less significant on Pt3Sn than
on Pt. In fact, the higher faradaic current recorded with the former catalyst
can be attributed to the greater amounts of acetaldehyde and acetic acid formed.
After the EOR, the surface of both Pt and Pt3Sn remained covered by ethanol adsorbates.
Whereas C2 fragments were the main adsorbates at the surface of Pt3Sn after the
EOR, both C1 and C2 species remained adsorbed at Pt black.
acknowledgement: The Spanish Ministry of Science and Innovation (Project ENE2010–15381)
and the CSIC (Project 201080E116) are acknowledged for financial support.
article_processing_charge: No
article_type: original
author:
- first_name: Tirma
full_name: Herranz, Tirma
last_name: Herranz
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: José
full_name: Gómez De La Fuente, José
last_name: Gómez De La Fuente
- first_name: Francisco
full_name: Pérez Alonso, Francisco
last_name: Pérez Alonso
- first_name: Miguel
full_name: Peña, Miguel
last_name: Peña
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
- first_name: Sergio
full_name: Rojas, Sergio
last_name: Rojas
citation:
ama: Herranz T, Ibáñez M, Gómez De La Fuente J, et al. In situ study of ethanol
electrooxidation on monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem.
2014;1(5):885-895. doi:10.1002/celc.201300254
apa: Herranz, T., Ibáñez, M., Gómez De La Fuente, J., Pérez Alonso, F., Peña, M.,
Cabot, A., & Rojas, S. (2014). In situ study of ethanol electrooxidation on
monodispersed Pt inf 3 inf Sn nanoparticles. ChemElectroChem. Wiley-Blackwell.
https://doi.org/10.1002/celc.201300254
chicago: Herranz, Tirma, Maria Ibáñez, José Gómez De La Fuente, Francisco Pérez
Alonso, Miguel Peña, Andreu Cabot, and Sergio Rojas. “In Situ Study of Ethanol
Electrooxidation on Monodispersed Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem.
Wiley-Blackwell, 2014. https://doi.org/10.1002/celc.201300254.
ieee: T. Herranz et al., “In situ study of ethanol electrooxidation on monodispersed
Pt inf 3 inf Sn nanoparticles,” ChemElectroChem, vol. 1, no. 5. Wiley-Blackwell,
pp. 885–895, 2014.
ista: Herranz T, Ibáñez M, Gómez De La Fuente J, Pérez Alonso F, Peña M, Cabot A,
Rojas S. 2014. In situ study of ethanol electrooxidation on monodispersed Pt inf
3 inf Sn nanoparticles. ChemElectroChem. 1(5), 885–895.
mla: Herranz, Tirma, et al. “In Situ Study of Ethanol Electrooxidation on Monodispersed
Pt Inf 3 Inf Sn Nanoparticles.” ChemElectroChem, vol. 1, no. 5, Wiley-Blackwell,
2014, pp. 885–95, doi:10.1002/celc.201300254.
short: T. Herranz, M. Ibáñez, J. Gómez De La Fuente, F. Pérez Alonso, M. Peña, A.
Cabot, S. Rojas, ChemElectroChem 1 (2014) 885–895.
date_created: 2018-12-11T11:46:00Z
date_published: 2014-03-03T00:00:00Z
date_updated: 2021-01-12T07:44:26Z
day: '03'
doi: 10.1002/celc.201300254
extern: '1'
intvolume: ' 1'
issue: '5'
language:
- iso: eng
month: '03'
oa_version: None
page: 885 - 895
publication: ChemElectroChem
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7474'
quality_controlled: '1'
status: public
title: In situ study of ethanol electrooxidation on monodispersed Pt inf 3 inf Sn
nanoparticles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '451'
abstract:
- lang: eng
text: We introduce algorithms for the computation of homology, cohomology, and related
operations on cubical cell complexes, using the technique based on a chain contraction
from the original chain complex to a reduced one that represents its homology.
This work is based on previous results for simplicial complexes, and uses Serre’s
diagonalization for cubical cells. An implementation in C++ of the introduced
algorithms is available at http://www.pawelpilarczyk.com/chaincon/ together with
some examples. The paper is self-contained as much as possible, and is written
at a very elementary level, so that basic knowledge of algebraic topology should
be sufficient to follow it.
acknowledgement: 'This research was partially supported from Fundo Europeu de Desenvolvimento
Regional (FEDER) through COMPETE – Programa Operacional Factores de Compe titividade
(POFC) and from the Portuguese national funds through Fundacaoparaa Ciencia e a
Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645(ref.
FCT PTDC/MAT/098871/2008), as well as from the funds distributed through the European
Science Foundation (ESF) Research Networking Programme on “Applied and Computational
Algebraic Topology” (ACAT). P.Real was additionally supported by the Spanish Ministry
of Science and Innovation, project no. MTM2009-12716. '
author:
- first_name: Pawel
full_name: Pawel Pilarczyk
id: 3768D56A-F248-11E8-B48F-1D18A9856A87
last_name: Pilarczyk
- first_name: Pedro
full_name: Real, Pedro
last_name: Real
citation:
ama: Pilarczyk P, Real P. Computation of cubical homology, cohomology, and (co)homological
operations via chain contraction. Advances in Computational Mathematics.
2014;41(1):253-275. doi:10.1007/s10444-014-9356-1
apa: Pilarczyk, P., & Real, P. (2014). Computation of cubical homology, cohomology,
and (co)homological operations via chain contraction. Advances in Computational
Mathematics. Kluwer. https://doi.org/10.1007/s10444-014-9356-1
chicago: Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology,
and (Co)Homological Operations via Chain Contraction.” Advances in Computational
Mathematics. Kluwer, 2014. https://doi.org/10.1007/s10444-014-9356-1.
ieee: P. Pilarczyk and P. Real, “Computation of cubical homology, cohomology, and
(co)homological operations via chain contraction,” Advances in Computational
Mathematics, vol. 41, no. 1. Kluwer, pp. 253–275, 2014.
ista: Pilarczyk P, Real P. 2014. Computation of cubical homology, cohomology, and
(co)homological operations via chain contraction. Advances in Computational Mathematics.
41(1), 253–275.
mla: Pilarczyk, Pawel, and Pedro Real. “Computation of Cubical Homology, Cohomology,
and (Co)Homological Operations via Chain Contraction.” Advances in Computational
Mathematics, vol. 41, no. 1, Kluwer, 2014, pp. 253–75, doi:10.1007/s10444-014-9356-1.
short: P. Pilarczyk, P. Real, Advances in Computational Mathematics 41 (2014) 253–275.
date_created: 2018-12-11T11:46:33Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T07:59:20Z
day: '01'
doi: 10.1007/s10444-014-9356-1
extern: 1
intvolume: ' 41'
issue: '1'
main_file_link:
- open_access: '1'
url: https://idus.us.es/xmlui/handle/11441/38719
month: '01'
oa: 1
page: 253 - 275
publication: Advances in Computational Mathematics
publication_status: published
publisher: Kluwer
publist_id: '7371'
quality_controlled: 0
status: public
title: Computation of cubical homology, cohomology, and (co)homological operations
via chain contraction
type: journal_article
volume: 41
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'
...
---
_id: '475'
abstract:
- lang: eng
text: 'First cycle games (FCG) are played on a finite graph by two players who push
a token along the edges until a vertex is repeated, and a simple cycle is formed.
The winner is determined by some fixed property Y of the sequence of labels of
the edges (or nodes) forming this cycle. These games are traditionally of interest
because of their connection with infinite-duration games such as parity and mean-payoff
games. We study the memory requirements for winning strategies of FCGs and certain
associated infinite duration games. We exhibit a simple FCG that is not memoryless
determined (this corrects a mistake in Memoryless determinacy of parity and mean
payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims
that FCGs for which Y is closed under cyclic permutations are memoryless determined).
We show that θ (n)! memory (where n is the number of nodes in the graph), which
is always sufficient, may be necessary to win some FCGs. On the other hand, we
identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations,
and both Y and its complement are closed under concatenation) that are sufficient
to ensure that the corresponding FCGs and their associated infinite duration games
are memoryless determined. We demonstrate that many games considered in the literature,
such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity
side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE,
solving some families of FCGs is PSPACE-hard. '
alternative_title:
- EPTCS
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical
Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90.
doi:10.4204/EPTCS.146.11'
apa: 'Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings
in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France:
Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11'
chicago: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic
Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing
Association, 2014. https://doi.org/10.4204/EPTCS.146.11.
ieee: B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings
in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146,
pp. 83–90.
ista: 'Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical
Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.'
mla: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings
in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association,
2014, pp. 83–90, doi:10.4204/EPTCS.146.11.
short: B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer
Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
conference:
end_date: 2014-04-06
location: Grenoble, France
name: 'SR: Strategic Reasoning'
start_date: 2014-04-05
date_created: 2018-12-11T11:46:41Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T08:00:53Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.146.11
ec_funded: 1
file:
- access_level: open_access
checksum: 4d7b4ab82980cca2b96ac7703992a8c8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:08Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5260'
file_name: IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf
file_size: 100115
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 146'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 83 - 90
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing Association
publist_id: '7345'
pubrep_id: '952'
quality_controlled: '1'
scopus_import: 1
status: public
title: First cycle games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2014'
...
---
_id: '10892'
abstract:
- lang: eng
text: "In this paper, we introduce planar matchings on directed pseudo-line arrangements,
which yield a planar set of pseudo-line segments such that only matching-partners
are adjacent. By translating the planar matching problem into a corresponding
stable roommates problem we show that such matchings always exist.\r\nUsing our
new framework, we establish, for the first time, a complete, rigorous definition
of weighted straight skeletons, which are based on a so-called wavefront propagation
process. We present a generalized and unified approach to treat structural changes
in the wavefront that focuses on the restoration of weak planarity by finding
planar matchings."
acknowledgement: 'T. Biedl was supported by NSERC and the Ross and Muriel Cheriton
Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: 'Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons.
In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature;
2014:117-127. doi:10.1007/978-3-319-13075-0_10'
apa: 'Biedl, T., Huber, S., & Palfrader, P. (2014). Planar matchings for weighted
straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889,
pp. 117–127). Jeonju, Korea: Springer Nature. https://doi.org/10.1007/978-3-319-13075-0_10'
chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for
Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014,
8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10.
ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight
skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea,
2014, vol. 8889, pp. 117–127.
ista: 'Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight
skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium
on Algorithms and Computation, LNCS, vol. 8889, 117–127.'
mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”
25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014,
pp. 117–27, doi:10.1007/978-3-319-13075-0_10.
short: T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC
2014, Springer Nature, 2014, pp. 117–127.
conference:
end_date: 2014-12-17
location: Jeonju, Korea
name: 'ISAAC: International Symposium on Algorithms and Computation'
start_date: 2014-12-15
date_created: 2022-03-21T07:09:03Z
date_published: 2014-11-08T00:00:00Z
date_updated: 2023-02-23T12:20:55Z
day: '08'
department:
- _id: HeEd
doi: 10.1007/978-3-319-13075-0_10
intvolume: ' 8889'
language:
- iso: eng
month: '11'
oa_version: None
page: 117-127
publication: 25th International Symposium, ISAAC 2014
publication_identifier:
eisbn:
- '9783319130750'
eissn:
- 1611-3349
isbn:
- '9783319130743'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '481'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Planar matchings for weighted straight skeletons
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8889
year: '2014'
...
---
_id: '537'
abstract:
- lang: eng
text: Transgenerational effects are broader than only parental relationships. Despite
mounting evidence that multigenerational effects alter phenotypic and life-history
traits, our understanding of how they combine to determine fitness is not well
developed because of the added complexity necessary to study them. Here, we derive
a quantitative genetic model of adaptation to an extraordinary new environment
by an additive genetic component, phenotypic plasticity, maternal and grandmaternal
effects. We show how, at equilibrium, negative maternal and negative grandmaternal
effects maximize expected population mean fitness. We define negative transgenerational
effects as those that have a negative effect on trait expression in the subsequent
generation, that is, they slow, or potentially reverse, the expected evolutionary
dynamic. When maternal effects are positive, negative grandmaternal effects are
preferred. As expected under Mendelian inheritance, the grandmaternal effects
have a lower impact on fitness than the maternal effects, but this dual inheritance
model predicts a more complex relationship between maternal and grandmaternal
effects to constrain phenotypic variance and so maximize expected population mean
fitness in the offspring.
author:
- first_name: Roshan
full_name: Prizak, Roshan
id: 4456104E-F248-11E8-B48F-1D18A9856A87
last_name: Prizak
- first_name: Thomas
full_name: Ezard, Thomas
last_name: Ezard
- first_name: Rebecca
full_name: Hoyle, Rebecca
last_name: Hoyle
citation:
ama: Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal
effects. Ecology and Evolution. 2014;4(15):3139-3145. doi:10.1002/ece3.1150
apa: Prizak, R., Ezard, T., & Hoyle, R. (2014). Fitness consequences of maternal
and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1150
chicago: Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences
of Maternal and Grandmaternal Effects.” Ecology and Evolution. Wiley-Blackwell,
2014. https://doi.org/10.1002/ece3.1150.
ieee: R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal
effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145,
2014.
ista: Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal
effects. Ecology and Evolution. 4(15), 3139–3145.
mla: Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal
Effects.” Ecology and Evolution, vol. 4, no. 15, Wiley-Blackwell, 2014,
pp. 3139–45, doi:10.1002/ece3.1150.
short: R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.
date_created: 2018-12-11T11:47:02Z
date_published: 2014-07-19T00:00:00Z
date_updated: 2021-01-12T08:01:30Z
day: '19'
ddc:
- '530'
- '571'
department:
- _id: NiBa
- _id: GaTk
doi: 10.1002/ece3.1150
file:
- access_level: open_access
checksum: e32abf75a248e7a11811fd7f60858769
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:31Z
date_updated: 2020-07-14T12:46:38Z
file_id: '4886'
file_name: IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf
file_size: 621582
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '15'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 3139 - 3145
publication: Ecology and Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7280'
pubrep_id: '934'
scopus_import: 1
status: public
title: Fitness consequences of maternal and grandmaternal effects
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2014'
...
---
_id: '1903'
abstract:
- lang: eng
text: 'We consider two-player zero-sum partial-observation stochastic games on graphs.
Based on the information available to the players these games can be classified
as follows: (a) general partial-observation (both players have partial view of
the game); (b) one-sided partial-observation (one player has partial-observation
and the other player has complete-observation); and (c) perfect-observation (both
players have complete view of the game). The one-sided partial-observation games
subsumes the important special case of one-player partial-observation stochastic
games (or partial-observation Markov decision processes (POMDPs)). Based on the
randomization available for the strategies, (a) the players may not be allowed
to use randomization (pure strategies), or (b) they may choose a probability distribution
over actions but the actual random choice is external and not visible to the player
(actions invisible), or (c) they may use full randomization. We consider all these
classes of games with reachability, and parity objectives that can express all
ω-regular objectives. The analysis problems are classified into the qualitative
analysis that asks for the existence of a strategy that ensures the objective
with probability 1; and the quantitative analysis that asks for the existence
of a strategy that ensures the objective with probability at least λ (0,1). In
this talk we will cover a wide range of results: for perfect-observation games;
for POMDPs; for one-sided partial-observation games; and for general partial-observation
games.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Chatterjee K. Partial-observation stochastic reachability and parity games.
In: Vol 8634. Springer; 2014:1-4. doi:10.1007/978-3-662-44522-8_1'
apa: 'Chatterjee, K. (2014). Partial-observation stochastic reachability and parity
games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of
Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1'
chicago: Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and
Parity Games,” 8634:1–4. Springer, 2014. https://doi.org/10.1007/978-3-662-44522-8_1.
ieee: 'K. Chatterjee, “Partial-observation stochastic reachability and parity games,”
presented at the MFCS: Mathematical Foundations of Computer Science, Budapest,
Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.'
ista: 'Chatterjee K. 2014. Partial-observation stochastic reachability and parity
games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.'
mla: Chatterjee, Krishnendu. Partial-Observation Stochastic Reachability and
Parity Games. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:10.1007/978-3-662-44522-8_1.
short: K. Chatterjee, in:, Springer, 2014, pp. 1–4.
conference:
end_date: 2014-08-29
location: Budapest, Hungary
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2014-08-25
date_created: 2018-12-11T11:54:38Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-44522-8_1
ec_funded: 1
intvolume: ' 8634'
issue: PART 1
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 4
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '5192'
pubrep_id: '141'
quality_controlled: '1'
related_material:
record:
- id: '2211'
relation: later_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Partial-observation stochastic reachability and parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8634
year: '2014'
...
---
_id: '2211'
abstract:
- lang: eng
text: 'In two-player finite-state stochastic games of partial observation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distribution over the successor states.
The game is played for infinitely many rounds and thus the players construct an
infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or positively (i.e., with positive probability), no matter the
strategy of the second player. We classify such games according to the information
and to the power of randomization available to the players. On the basis of information,
the game can be one-sided with either (a) player 1, or (b) player 2 having partial
observation (and the other player has perfect observation), or two-sided with
(c) both players having partial observation. On the basis of randomization, (a)
the players may not be allowed to use randomization (pure strategies), or (b)
they may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) they
may use full randomization. Our main results for pure strategies are as follows:
(1) For one-sided games with player 2 having perfect observation we show that
(in contrast to full randomized strategies) belief-based (subset-construction
based) strategies are not sufficient, and we present an exponential upper bound
on memory both for almost-sure and positive winning strategies; we show that the
problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the
explicit exponential construction. (2) For one-sided games with player 1 having
perfect observation we show that nonelementarymemory is both necessary and sufficient
for both almost-sure and positive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least nonelementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence result exhibit serious
flaws in previous results of the literature: we show a nonelementary memory lower
bound for almost-sure winning whereas an exponential upper bound was previously
claimed.'
article_number: '16'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when
belief fails. ACM Transactions on Computational Logic (TOCL). 2014;15(2).
doi:10.1145/2579821'
apa: 'Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games:
How to win when belief fails. ACM Transactions on Computational Logic (TOCL).
ACM. https://doi.org/10.1145/2579821'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic
(TOCL). ACM, 2014. https://doi.org/10.1145/2579821.'
ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to
win when belief fails,” ACM Transactions on Computational Logic (TOCL),
vol. 15, no. 2. ACM, 2014.'
ista: 'Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to
win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2),
16.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” ACM Transactions on Computational Logic
(TOCL), vol. 15, no. 2, 16, ACM, 2014, doi:10.1145/2579821.'
short: K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15
(2014).
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2579821
external_id:
arxiv:
- '1107.2141'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2141
month: '04'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '4759'
quality_controlled: '1'
related_material:
record:
- id: '1903'
relation: earlier_version
status: public
- id: '2955'
relation: earlier_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2014'
...
---
_id: '2038'
abstract:
- lang: eng
text: Recently, there has been an effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions. At the heart of quantitative objectives
lies the accumulation of values along a computation. It is often the accumulated
sum, as with energy objectives, or the accumulated average, as with mean-payoff
objectives. We investigate the extension of temporal logics with the prefix-accumulation
assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable
of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the
accumulated sum and average of the values of v from the beginning of the computation
up to the current point in time. We also allow the path-accumulation assertions
LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an
entire infinite computation. We study the border of decidability for such quantitative
extensions of various temporal logics. In particular, we show that extending the
fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with
both prefix-accumulation assertions, or extending LTL with both path-accumulation
assertions, results in temporal logics whose model-checking problem is decidable.
Moreover, the prefix-accumulation assertions may be generalized with "controlled
accumulation," allowing, for example, to specify constraints on the average
waiting time between a request and a grant. On the negative side, we show that
this branching-time logic is, in a sense, the maximal logic with one or both of
the prefix-accumulation assertions that permits a decidable model-checking procedure.
Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL,
makes the problem undecidable.
acknowledgement: The research was supported in part by ERC Starting grant 278410 (QUALITY).
article_number: '27'
article_processing_charge: No
article_type: original
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with
accumulative values. ACM Transactions on Computational Logic (TOCL). 2014;15(4).
doi:10.1145/2629686
apa: Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal
specifications with accumulative values. ACM Transactions on Computational
Logic (TOCL). ACM. https://doi.org/10.1145/2629686
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
“Temporal Specifications with Accumulative Values.” ACM Transactions on Computational
Logic (TOCL). ACM, 2014. https://doi.org/10.1145/2629686.
ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications
with accumulative values,” ACM Transactions on Computational Logic (TOCL),
vol. 15, no. 4. ACM, 2014.
ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications
with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4),
27.
mla: Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM
Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014,
doi:10.1145/2629686.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on
Computational Logic (TOCL) 15 (2014).
date_created: 2018-12-11T11:55:21Z
date_published: 2014-09-16T00:00:00Z
date_updated: 2023-02-23T12:23:54Z
day: '16'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1145/2629686
ec_funded: 1
file:
- access_level: open_access
checksum: 354c41d37500b56320afce94cf9a99c2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:59Z
date_updated: 2020-07-14T12:45:26Z
file_id: '4851'
file_name: IST-2014-192-v1+1_AccumulativeValues.pdf
file_size: 346184
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '4'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '5013'
pubrep_id: '192'
quality_controlled: '1'
related_material:
record:
- id: '3356'
relation: earlier_version
status: public
- id: '5385'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Temporal specifications with accumulative values
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2014'
...
---
_id: '2162'
abstract:
- lang: eng
text: 'We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state
graph. We focus on the important sub-class of ergodic games where all states are
visited infinitely often with probability 1. The algorithmic study of ergodic
games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic
complexity questions have remained unresolved. Our main results for ergodic games
are as follows: We establish (1) an optimal exponential bound on the patience
of stationary strategies (where patience of a distribution is the inverse of the
smallest positive probability and represents a complexity measure of a stationary
strategy); (2) the approximation problem lies in FNP; (3) the approximation problem
is at least as hard as the decision problem for simple stochastic games (for which
NP ∩ coNP is the long-standing best known bound). We present a variant of the
strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm
and the classical value-iteration algorithm can approximate the value in exponential
time; and identify a subclass where the value-iteration algorithm is a FPTAS.
We also show that the exact value can be expressed in the existential theory of
the reals, and establish square-root sum hardness for a related class of games.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games.
In: Vol 8573. Springer; 2014:122-133. doi:10.1007/978-3-662-43951-7_11'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean
payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference
on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer.
https://doi.org/10.1007/978-3-662-43951-7_11'
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic
Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff
games,” presented at the ICST: International Conference on Software Testing, Verification
and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.'
ista: 'Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff
games. ICST: International Conference on Software Testing, Verification and Validation,
LNCS, vol. 8573, 122–133.'
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic
Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.
short: K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
conference:
end_date: 2014-07-11
location: Copenhagen, Denmark
name: 'ICST: International Conference on Software Testing, Verification and Validation'
start_date: 2014-07-08
date_created: 2018-12-11T11:56:04Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:24:48Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-43951-7_11
ec_funded: 1
external_id:
arxiv:
- '1404.5734'
intvolume: ' 8573'
issue: Part 2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.5734
month: '01'
oa: 1
oa_version: Preprint
page: 122 - 133
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '4822'
quality_controlled: '1'
related_material:
record:
- id: '5404'
relation: earlier_version
status: public
status: public
title: The complexity of ergodic mean payoff games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8573
year: '2014'
...
---
_id: '2213'
abstract:
- lang: eng
text: We consider two-player partial-observation stochastic games on finitestate
graphs where player 1 has partial observation and player 2 has perfect observation.
The winning condition we study are ε-regular conditions specified as parity objectives.
The qualitative-analysis problem given a partial-observation stochastic game and
a parity objective asks whether there is a strategy to ensure that the objective
is satisfied with probability 1 (resp. positive probability). These qualitative-analysis
problems are known to be undecidable. However in many applications the relevant
question is the existence of finite-memory strategies, and the qualitative-analysis
problems under finite-memory strategies was recently shown to be decidable in
2EXPTIME.We improve the complexity and show that the qualitative-analysis problems
for partial-observation stochastic parity games under finite-memory strategies
are EXPTIME-complete; and also establish optimal (exponential) memory bounds for
finite-memory strategies required for qualitative analysis.
acknowledgement: 'This research was supported by European project Cassting (FP7-601148),
NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project
“ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096,
and by gift from Intel.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Sumit
full_name: Nain, Sumit
last_name: Nain
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: 'Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation
stochastic parity games with finite-memory strategies. In: Vol 8412. Springer;
2014:242-257. doi:10.1007/978-3-642-54830-7_16'
apa: 'Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity
of partial-observation stochastic parity games with finite-memory strategies (Vol.
8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science
and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The
Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,”
8412:242–57. Springer, 2014. https://doi.org/10.1007/978-3-642-54830-7_16.
ieee: 'K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation
stochastic parity games with finite-memory strategies,” presented at the FoSSaCS:
Foundations of Software Science and Computation Structures, Grenoble, France,
2014, vol. 8412, pp. 242–257.'
ista: 'Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation
stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of
Software Science and Computation Structures, LNCS, vol. 8412, 242–257.'
mla: Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic
Parity Games with Finite-Memory Strategies. Vol. 8412, Springer, 2014, pp.
242–57, doi:10.1007/978-3-642-54830-7_16.
short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
conference:
end_date: 2014-04-13
location: Grenoble, France
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2014-04-05
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:24:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54830-7_16
ec_funded: 1
external_id:
arxiv:
- '1401.3289'
intvolume: ' 8412'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1401.3289
month: '04'
oa: 1
oa_version: Preprint
page: 242 - 257
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '4757'
quality_controlled: '1'
related_material:
record:
- id: '5408'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: The complexity of partial-observation stochastic parity games with finite-memory
strategies
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8412
year: '2014'
...
---
_id: '2212'
abstract:
- lang: eng
text: 'The theory of graph games is the foundation for modeling and synthesizing
reactive processes. In the synthesis of stochastic processes, we use 2 1/2-player
games where some transitions of the game graph are controlled by two adversarial
players, the System and the Environment, and the other transitions are determined
probabilistically. We consider 2 1/2-player games where the objective of the System
is the conjunction of a qualitative objective (specified as a parity condition)
and a quantitative objective (specified as a mean-payoff condition). We establish
that the problem of deciding whether the System can ensure that the probability
to satisfy the mean-payoff parity objective is at least a given threshold is in
NP ∩ coNP, matching the best known bound in the special case of 2-player games
(where all transitions are deterministic). We present an algorithm running in
time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which
the objective can be ensured with probability 1, where n is the number of states
of the game, d the number of priorities of the parity objective, and MeanGame
is the complexity to compute the set of almost-sure winning states in 2 1/2-player
mean-payoff games. Our results are useful in the synthesis of stochastic reactive
systems with both functional requirement (given as a qualitative objective) and
performance requirement (given as a quantitative objective). '
acknowledgement: "This research was supported by European project Cassting (FP7-601148).\r\nA
Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128."
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- first_name: Youssouf
full_name: Oualhadj, Youssouf
last_name: Oualhadj
citation:
ama: 'Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic
mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:10.1007/978-3-642-54830-7_14'
apa: 'Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information
stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the
FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble,
France: Springer. https://doi.org/10.1007/978-3-642-54830-7_14'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj.
“Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer,
2014. https://doi.org/10.1007/978-3-642-54830-7_14.
ieee: 'K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information
stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of
Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412,
pp. 210–225.'
ista: 'Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic
mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation
Structures, LNCS, vol. 8412, 210–225.'
mla: Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff
Parity Games. Vol. 8412, Springer, 2014, pp. 210–25, doi:10.1007/978-3-642-54830-7_14.
short: K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp.
210–225.
conference:
end_date: 2014-04-13
location: Grenoble, France
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2014-04-05
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:24:50Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54830-7_14
ec_funded: 1
intvolume: ' 8412'
language:
- iso: eng
month: '04'
oa_version: None
page: 210 - 225
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '4758'
quality_controlled: '1'
related_material:
record:
- id: '5405'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Perfect-information stochastic mean-payoff parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8412
year: '2014'
...
---
_id: '2216'
abstract:
- lang: eng
text: The edit distance between two (untimed) traces is the minimum cost of a sequence
of edit operations (insertion, deletion, or substitution) needed to transform
one trace to the other. Edit distances have been extensively studied in the untimed
setting, and form the basis for approximate matching of sequences in different
domains such as coding theory, parsing, and speech recognition. In this paper,
we lift the study of edit distances from untimed languages to the timed setting.
We define an edit distance between timed words which incorporates both the edit
distance between the untimed words and the absolute difference in time stamps.
Our edit distance between two timed words is computable in polynomial time. Further,
we show that the edit distance between a timed word and a timed language generated
by a timed automaton, defined as the edit distance between the word and the closest
word in the language, is PSPACE-complete. While computing the edit distance between
two timed automata is undecidable, we show that the approximate version, where
we decide if the edit distance between two timed automata is either less than
a given parameter or more than δ away from the parameter, for δ > 0, can be
solved in exponential space and is EXPSPACE-hard. Our definitions and techniques
can be generalized to the setting of hybrid systems, and analogous decidability
results hold for rectangular automata.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit distance for timed automata.
In: Springer; 2014:303-312. doi:10.1145/2562059.2562141'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2014). Edit distance
for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation
and Control, Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562141'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit
Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed
automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin,
Germany, 2014, pp. 303–312.'
ista: 'Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata.
HSCC: Hybrid Systems - Computation and Control, 303–312.'
mla: Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. Springer,
2014, pp. 303–12, doi:10.1145/2562059.2562141.
short: K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
conference:
end_date: 2017-04-17
location: Berlin, Germany
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2017-04-15
date_created: 2018-12-11T11:56:22Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:01Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2562059.2562141
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/citation.cfm?doid=2562059.2562141
month: '01'
oa: 1
oa_version: Submitted Version
page: 303 - 312
publication_status: published
publisher: Springer
publist_id: '4752'
quality_controlled: '1'
related_material:
record:
- id: '5409'
relation: earlier_version
status: public
status: public
title: Edit distance for timed automata
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5411'
abstract:
- lang: eng
text: "Model-based testing is a promising technology for black-box software and
hardware testing, in which test cases are generated automatically from high-level
specifications. Nowadays, systems typically consist of multiple interacting components
and, due to their complexity, testing presents a considerable portion of the effort
and cost in the design process. Exploiting the compositional structure of system
specifications can considerably reduce the effort in model-based testing. Moreover,
inferring properties about the system from testing its individual components allows
the designer to reduce the amount of integration testing.\r\nIn this paper, we
study compositional properties of the IOCO-testing theory. We propose a new approach
to composition and hiding operations, inspired by contract-based design and interface
theories. These operations preserve behaviors that are compatible under composition
and hiding, and prune away incompatible ones. The resulting specification characterizes
the input sequences for which the unit testing of components is sufficient to
infer the correctness of component integration without the need for further tests.
We provide a methodology that uses these results to minimize integration testing
effort, but also to detect potential weaknesses in specifications. While we focus
on asynchronous models and the IOCO conformance relation, the resulting methodology
can be applied to a broader class of systems."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Willibald
full_name: Krenn, Willibald
last_name: Krenn
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional Specifications
for IOCO Testing. IST Austria; 2014. doi:10.15479/AT:IST-2014-148-v2-1
apa: Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional
specifications for IOCO testing. IST Austria. https://doi.org/10.15479/AT:IST-2014-148-v2-1
chicago: Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic.
Compositional Specifications for IOCO Testing. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-148-v2-1.
ieee: P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, Compositional specifications
for IOCO testing. IST Austria, 2014.
ista: Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications
for IOCO testing, IST Austria, 20p.
mla: Daca, Przemyslaw, et al. Compositional Specifications for IOCO Testing.
IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1.
short: P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications
for IOCO Testing, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-01-28T00:00:00Z
date_updated: 2023-02-23T10:31:07Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-148-v2-1
file:
- access_level: open_access
checksum: 0e03aba625cc334141a3148432aa5760
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:21Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5543'
file_name: IST-2014-148-v2+1_main_tr.pdf
file_size: 534732
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '152'
related_material:
record:
- id: '2167'
relation: later_version
status: public
status: public
title: Compositional specifications for IOCO testing
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5413'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability.\r\nWe introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph theoretic algorithms with quadratic complexity to compute the simulation
relation.\r\nWe present an automated technique for assume-guarantee style reasoning
for compositional analysis of MDPs with qualitative properties by giving a counter-example
guided abstraction-refinement approach to compute our new simulation relation.
We have implemented our algorithms and show that the compositional analysis leads
to significant improvements. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
citation:
ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v2-2
apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative
analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2
chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for
Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.
ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis
of probabilistic systems. IST Austria, 2014.
ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
systems, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v2-2.
short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-02-06T00:00:00Z
date_updated: 2023-02-23T12:25:18Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v2-2
file:
- access_level: open_access
checksum: ce4967a184d84863eec76c66cbac1614
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:17Z
date_updated: 2020-07-14T12:46:47Z
file_id: '5539'
file_name: IST-2014-153-v2+2_main.pdf
file_size: 606049
relation: main_file
file_date_updated: 2020-07-14T12:46:47Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '164'
related_material:
record:
- id: '2063'
relation: later_version
status: public
- id: '5412'
relation: earlier_version
status: public
- id: '5414'
relation: later_version
status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5414'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability.\r\nWe introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph theoretic algorithms with quadratic complexity to compute the simulation
relation.\r\nWe present an automated technique for assume-guarantee style reasoning
for compositional analysis of MDPs with qualitative properties by giving a counter-example
guided abstraction-refinement approach to compute our new simulation relation.
\r\nWe have implemented our algorithms and show that the compositional analysis
leads to significant improvements. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
citation:
ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v3-1
apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative
analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1
chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for
Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.
ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis
of probabilistic systems. IST Austria, 2014.
ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
systems, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v3-1.
short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-07T00:00:00Z
date_updated: 2023-02-23T12:25:15Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v3-1
file:
- access_level: open_access
checksum: 87b93fe9af71fc5c94b0eb6151537e11
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:03Z
date_updated: 2020-07-14T12:46:48Z
file_id: '5464'
file_name: IST-2014-153-v3+1_main.pdf
file_size: 606227
relation: main_file
file_date_updated: 2020-07-14T12:46:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '165'
related_material:
record:
- id: '2063'
relation: later_version
status: public
- id: '5412'
relation: earlier_version
status: public
- id: '5413'
relation: earlier_version
status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5412'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability.\r\nWe introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph theoretic algorithms with quadratic complexity to compute the simulation
relation.\r\nWe present an automated technique for assume-guarantee style reasoning
for compositional analysis of MDPs with qualitative properties by giving a counter-example
guided abstraction-refinement approach to compute our new simulation relation.
We have implemented our algorithms and show that the compositional analysis leads
to significant improvements. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
citation:
ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v1-1
apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative
analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1
chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for
Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.
ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis
of probabilistic systems. IST Austria, 2014.
ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
systems, IST Austria, 31p.
mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1.
short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-01-29T00:00:00Z
date_updated: 2023-02-23T12:25:18Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v1-1
file:
- access_level: open_access
checksum: 4d6cda4bebed970926403ad6ad8c745f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:39Z
date_updated: 2020-07-14T12:46:47Z
file_id: '5500'
file_name: IST-2014-153-v1+1_main.pdf
file_size: 423322
relation: main_file
file_date_updated: 2020-07-14T12:46:47Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '153'
related_material:
record:
- id: '2063'
relation: later_version
status: public
- id: '5413'
relation: later_version
status: public
- id: '5414'
relation: later_version
status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2163'
abstract:
- lang: eng
text: We consider multi-player graph games with partial-observation and parity objective.
While the decision problem for three-player games with a coalition of the first
and second players against the third player is undecidable in general, we present
a decidability result for partial-observation games where the first and third
player are in a coalition against the second player, thus where the second player
is adversarial but weaker due to partial-observation. We establish tight complexity
bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness
for parity objectives. The symmetric case of player 1 more informed than player
2 is much more complicated, and we show that already in the case where player
1 has perfect observation, memory of size non-elementary is necessary in general
for reachability objectives, and the problem is decidable for safety and reachability
objectives. From our results we derive new complexity results for partial-observation
stochastic games.
acknowledgement: "This research was partly supported by European project Cassting
(FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n"
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Games with a weak adversary. In: Lecture Notes in
Computer Science. Vol 8573. Springer; 2014:110-121. doi:10.1007/978-3-662-43951-7_10'
apa: 'Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture
Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer.
https://doi.org/10.1007/978-3-662-43951-7_10'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.”
In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10.
ieee: K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes
in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp.
110–121.
ista: 'Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in
Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573,
110–121.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture
Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21,
doi:10.1007/978-3-662-43951-7_10.
short: K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer,
2014, pp. 110–121.
conference:
end_date: 2014-07-11
location: Copenhagen, Denmark
name: 'ICALP: Automata, Languages and Programming'
start_date: 2014-07-08
date_created: 2018-12-11T11:56:04Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:29Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-43951-7_10
ec_funded: 1
external_id:
arxiv:
- '1404.5453'
intvolume: ' 8573'
issue: Part 2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1404.5453
month: '01'
oa: 1
oa_version: Preprint
page: 110 - 121
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Lecture Notes in Computer Science
publication_status: published
publisher: Springer
publist_id: '4821'
quality_controlled: '1'
related_material:
record:
- id: '5418'
relation: earlier_version
status: public
status: public
title: Games with a weak adversary
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8573
year: '2014'
...
---
_id: '5419'
abstract:
- lang: eng
text: "We consider the reachability and shortest path problems on low tree-width
graphs, with n nodes, m edges, and tree-width t, on a standard RAM with wordsize
W. We use O to hide polynomial factors of the inverse of the Ackermann function.
Our main contributions are three fold:\r\n1. For reachability, we present an algorithm
that requires O(n·t2·log(n/t)) preprocessing time, O(n·(t·log(n/t))/W) space,
and O(t/W) time for pair queries and O((n·t)/W) time for single-source queries.
Note that for constant t our algorithm uses O(n·logn) time for preprocessing;
and O(n/W) time for single-source queries, which is faster than depth first search/breath
first search (after the preprocessing).\r\n2. We present an algorithm for shortest
path that requires O(n·t2) preprocessing time, O(n·t) space, and O(t2) time for
pair queries and O(n·t) time single-source queries.\r\n3. We give a space versus
query time trade-off algorithm for shortest path that, given any constant >0,
requires O(n·t2) preprocessing time, O(n·t2) space, and O(n1−·t2) time for pair
queries.\r\nOur algorithms improve all existing results, and use very simple data
structures."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Improved Algorithms for Reachability
and Shortest Path on Low Tree-Width Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-187-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved
algorithms for reachability and shortest path on low tree-width graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms
for reachability and shortest path on low tree-width graphs. IST Austria,
2014.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for
reachability and shortest path on low tree-width graphs, IST Austria, 34p.
mla: Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and
Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for
Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-04-14T00:00:00Z
date_updated: 2021-01-12T08:02:03Z
day: '14'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-187-v1-1
file:
- access_level: open_access
checksum: c608e66030a4bf51d2d99b451f539b99
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:25Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5548'
file_name: IST-2014-187-v1+1_main_full_tech.pdf
file_size: 670031
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '187'
status: public
title: Improved algorithms for reachability and shortest path on low tree-width graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2217'
abstract:
- lang: eng
text: "As hybrid systems involve continuous behaviors, they should be evaluated
by quantitative methods, rather than qualitative methods. In this paper we adapt
a quantitative framework, called model measuring, to the hybrid systems domain.
The model-measuring problem asks, given a model M and a specification, what is
the maximal distance such that all models within that distance from M satisfy
(or violate) the specification. A distance function on models is given as part
of the input of the problem. Distances, especially related to continuous behaviors
are more natural in the hybrid case than the discrete case. We are interested
in distances represented by monotonic hybrid automata, a hybrid counterpart of
(discrete) weighted automata, whose recognized timed languages are monotone (w.r.t.
inclusion) in the values of parameters.\r\n\r\nThe contributions of this paper
are twofold. First, we give sufficient conditions under which the model-measuring
problem can be solved. Second, we discuss the modeling of distances and applications
of the model-measuring problem."
acknowledgement: "This work was supported in part by the Austrian Science
Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant
QUAREM (Quantitative Reactive Modeling).\r\nA Technical Report of this paper is
available at: \r\nhttps://repository.ist.ac.at/id/eprint/171"
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Henzinger TA, Otop J. Model measuring for hybrid systems. In: Proceedings
of the 17th International Conference on Hybrid Systems: Computation and Control.
Springer; 2014:213-222. doi:10.1145/2562059.2562130'
apa: 'Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems.
In Proceedings of the 17th international conference on Hybrid systems: computation
and control (pp. 213–222). Berlin, Germany: Springer. https://doi.org/10.1145/2562059.2562130'
chicago: 'Henzinger, Thomas A, and Jan Otop. “Model Measuring for Hybrid Systems.”
In Proceedings of the 17th International Conference on Hybrid Systems: Computation
and Control, 213–22. Springer, 2014. https://doi.org/10.1145/2562059.2562130.'
ieee: 'T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings
of the 17th international conference on Hybrid systems: computation and control,
Berlin, Germany, 2014, pp. 213–222.'
ista: 'Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings
of the 17th international conference on Hybrid systems: computation and control.
HSCC: Hybrid Systems - Computation and Control, 213–222.'
mla: 'Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.”
Proceedings of the 17th International Conference on Hybrid Systems: Computation
and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.'
short: 'T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference
on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.'
conference:
end_date: 2014-04-17
location: Berlin, Germany
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2014-04-15
date_created: 2018-12-11T11:56:23Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:25:23Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2562059.2562130
ec_funded: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 213 - 222
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 'Proceedings of the 17th international conference on Hybrid systems:
computation and control'
publication_status: published
publisher: Springer
publist_id: '4751'
quality_controlled: '1'
related_material:
record:
- id: '5416'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Model measuring for hybrid systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5417'
abstract:
- lang: eng
text: "We define the model-measuring problem: given a model M and specification
φ, what is the maximal distance ρ such that all models M'within distance ρ from
M satisfy (or violate)φ. The model measuring problem presupposes a distance function
on models. We concentrate on automatic distance functions, which are defined by
weighted automata.\r\nThe model-measuring problem subsumes several generalizations
of the classical model-checking problem, in particular, quantitative model-checking
problems that measure the degree of satisfaction of a specification, and robustness
problems that measure how much a model can be perturbed without violating the
specification.\r\nWe show that for automatic distance functions, and ω-regular
linear-time and branching-time specifications, the model-measuring problem can
be solved.\r\nWe use automata-theoretic model-checking methods for model measuring,
replacing the emptiness question for standard word and tree automata by the optimal-weight
question for the weighted versions of these automata. We consider weighted automata
that accumulate weights by maximizing, summing, discounting, and limit averaging.
\r\nWe give several examples of using the model-measuring problem to compute various
notions of robustness and quantitative satisfaction for temporal specifications."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Henzinger TA, Otop J. From Model Checking to Model Measuring. IST Austria;
2014. doi:10.15479/AT:IST-2014-172-v1-1
apa: Henzinger, T. A., & Otop, J. (2014). From model checking to model measuring.
IST Austria. https://doi.org/10.15479/AT:IST-2014-172-v1-1
chicago: Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-172-v1-1.
ieee: T. A. Henzinger and J. Otop, From model checking to model measuring.
IST Austria, 2014.
ista: Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria,
14p.
mla: Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring.
IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.
short: T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria,
2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2023-02-23T10:38:10Z
day: '19'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-172-v1-1
file:
- access_level: open_access
checksum: fcc3eab903cfcd3778b338d2d0d44d18
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:20Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5481'
file_name: IST-2014-172-v1+1_report.pdf
file_size: 383052
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '14'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '175'
related_material:
record:
- id: '2327'
relation: later_version
status: public
status: public
title: From model checking to model measuring
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5416'
abstract:
- lang: eng
text: As hybrid systems involve continuous behaviors, they should be evaluated by
quantitative methods, rather than qualitative methods. In this paper we adapt
a quantitative framework, called model measuring, to the hybrid systems domain.
The model-measuring problem asks, given a model M and a specification, what is
the maximal distance such that all models within that distance from M satisfy
(or violate) the specification. A distance function on models is given as part
of the input of the problem. Distances, especially related to continuous behaviors
are more natural in the hybrid case than the discrete case. We are interested
in distances represented by monotonic hybrid automata, a hybrid counterpart of
(discrete) weighted automata, whose recognized timed languages are monotone (w.r.t.
inclusion) in the values of parameters.The contributions of this paper are twofold.
First, we give sufficient conditions under which the model-measuring problem can
be solved. Second, we discuss the modeling of distances and applications of the
model-measuring problem.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Henzinger TA, Otop J. Model Measuring for Hybrid Systems. IST Austria;
2014. doi:10.15479/AT:IST-2014-171-v1-1
apa: Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems.
IST Austria. https://doi.org/10.15479/AT:IST-2014-171-v1-1
chicago: Henzinger, Thomas A, and Jan Otop. Model Measuring for Hybrid Systems.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-171-v1-1.
ieee: T. A. Henzinger and J. Otop, Model measuring for hybrid systems. IST
Austria, 2014.
ista: Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria,
22p.
mla: Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems.
IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1.
short: T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria,
2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2023-02-23T10:33:21Z
day: '19'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-171-v1-1
file:
- access_level: open_access
checksum: 445456d22371e4e49aad2b9a0c13bf80
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:32Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5492'
file_name: IST-2014-171-v1+1_report.pdf
file_size: 712077
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '171'
related_material:
record:
- id: '2217'
relation: later_version
status: public
status: public
title: Model measuring for hybrid systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5418'
abstract:
- lang: eng
text: We consider multi-player graph games with partial-observation and parity objective.
While the decision problem for three-player games with a coalition of the first
and second players against the third player is undecidable, we present a decidability
result for partial-observation games where the first and third player are in a
coalition against the second player, thus where the second player is adversarial
but weaker due to partial-observation. We establish tight complexity bounds in
the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness
for parity objectives. The symmetric case of player 1 more informed than player
2 is much more complicated, and we show that already in the case where player
1 has perfect observation, memory of size non-elementary is necessary in general
for reachability objectives, and the problem is decidable for safety and reachability
objectives. Our results have tight connections with partial-observation stochastic
games for which we derive new complexity results.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: Chatterjee K, Doyen L. Games with a Weak Adversary. IST Austria; 2014.
doi:10.15479/AT:IST-2014-176-v1-1
apa: Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary.
IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1
chicago: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1.
ieee: K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria,
2014.
ista: Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
mla: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary.
IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1.
short: K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-03-22T00:00:00Z
date_updated: 2023-02-23T10:30:58Z
day: '22'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-176-v1-1
file:
- access_level: open_access
checksum: 1d6958aa60050e1c3e932c6e5f34c39f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:07Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5468'
file_name: IST-2014-176-v1+1_icalp_14.pdf
file_size: 328253
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '176'
related_material:
record:
- id: '2163'
relation: later_version
status: public
status: public
title: Games with a weak adversary
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5420'
abstract:
- lang: eng
text: 'We consider concurrent mean-payoff games, a very well-studied class of two-player
(player 1 vs player 2) zero-sum games on finite-state graphs where every transition
is assigned a reward between 0 and 1, and the payoff function is the long-run
average of the rewards. The value is the maximal expected payoff that player 1
can guarantee against all strategies of player 2. We consider the computation
of the set of states with value 1 under finite-memory strategies for player 1,
and our main results for the problem are as follows: (1) we present a polynomial-time
algorithm; (2) we show that whenever there is a finite-memory strategy, there
is a stationary strategy that does not need memory at all; and (3) we present
an optimal bound (which is double exponential) on the patience of stationary strategies
(where patience of a distribution is the inverse of the smallest positive probability
and represents a complexity measure of a stationary strategy).'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: Chatterjee K, Ibsen-Jensen R. The Value 1 Problem for Concurrent Mean-Payoff
Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-191-v1-1
apa: Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent
mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem
for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
ieee: K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff
games. IST Austria, 2014.
ista: Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff
games, IST Austria, 49p.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for
Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff
Games, IST Austria, 2014.
date_created: 2018-12-12T11:39:14Z
date_published: 2014-04-14T00:00:00Z
date_updated: 2021-01-12T08:02:05Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-191-v1-1
file:
- access_level: open_access
checksum: 49e0fd3e62650346daf7dc04604f7a0a
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:58Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5520'
file_name: IST-2014-191-v1+1_main_full.pdf
file_size: 584368
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '49'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '191'
status: public
title: The value 1 problem for concurrent mean-payoff games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5422'
abstract:
- lang: eng
text: Notes from the Third Plenary for the Research Data Alliance in Dublin, Ireland
on March 26 to 28, 2014 with focus on starting an institutional research data
repository.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland. none; 2014.
apa: Porsche, J. (2014). Notes from Research Data Alliance Plenary Meeting in
Dublin, Ireland. none.
chicago: Porsche, Jana. Notes from Research Data Alliance Plenary Meeting in
Dublin, Ireland. none, 2014.
ieee: J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland. none, 2014.
ista: Porsche J. 2014. Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland, none,p.
mla: Porsche, Jana. Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland. none, 2014.
short: J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland, none, 2014.
date_created: 2018-12-12T11:39:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2020-07-14T23:04:56Z
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: 3954896648ce8afa8f7c4425e71cff08
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:40Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5501'
file_name: IST-2014-254-v1+1_Dublin_Day_3.pdf
file_size: 648585
relation: main_file
- access_level: open_access
checksum: 9a0d42b0b832dfe7e4b22fb6816bcbba
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:41Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5502'
file_name: IST-2014-254-v1+2_Dublin_Day_1.pdf
file_size: 221339
relation: main_file
- access_level: open_access
checksum: 498b8d629fb1bd17bff1dc43700a93e6
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:42Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5503'
file_name: IST-2014-254-v1+3_Dublin_Day_2.pdf
file_size: 187778
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: 1
oa_version: None
publisher: none
pubrep_id: '254'
status: public
title: Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5424'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs), that
are a standard framework for robotics applications to model uncertainties present
in the real world, with temporal logic specifications. All temporal logic specifications
in linear-time temporal logic (LTL) can be expressed as parity objectives. We
study the qualitative analysis problem for POMDPs with parity objectives that
asks whether there is a controller (policy) to ensure that the objective holds
with probability 1 (almost-surely). While the qualitative analysis of POMDPs with
parity objectives is undecidable, recent results show that when restricted to
finite-memory policies the problem is EXPTIME-complete. While the problem is intractable
in theory, we present a practical approach to solve the qualitative analysis problem.
We designed several heuristics to deal with the exponential complexity, and have
used our implementation on a number of well-known POMDP examples for robotics
applications. Our results provide the first practical approach to solve the qualitative
analysis of robot motion planning with LTL properties in the presence of uncertainty.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs
with Temporal Logic Specifications for Robotics Applications. IST Austria;
2014. doi:10.15479/AT:IST-2014-305-v1-1
apa: Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative
analysis of POMDPs with temporal logic specifications for robotics applications.
IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics
Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.
ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis
of POMDPs with temporal logic specifications for robotics applications. IST
Austria, 2014.
ista: Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of
POMDPs with temporal logic specifications for robotics applications, IST Austria,
12p.
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal
Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v1-1.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of
POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria,
2014.
date_created: 2018-12-12T11:39:15Z
date_published: 2014-09-09T00:00:00Z
date_updated: 2023-02-23T12:25:52Z
day: '09'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-305-v1-1
file:
- access_level: open_access
checksum: 35009d5fad01198341e6c1a3353481b7
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:51Z
date_updated: 2020-07-14T12:46:51Z
file_id: '5512'
file_name: IST-2014-305-v1+1_main.pdf
file_size: 655774
relation: main_file
file_date_updated: 2020-07-14T12:46:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '12'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '305'
related_material:
record:
- id: '1732'
relation: later_version
status: public
- id: '5426'
relation: later_version
status: public
status: public
title: Qualitative analysis of POMDPs with temporal logic specifications for robotics
applications
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5426'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs), that
are a standard framework for robotics applications to model uncertainties present
in the real world, with temporal logic specifications. All temporal logic specifications
in linear-time temporal logic (LTL) can be expressed as parity objectives. We
study the qualitative analysis problem for POMDPs with parity objectives that
asks whether there is a controller (policy) to ensure that the objective holds
with probability 1 (almost-surely). While the qualitative analysis of POMDPs with
parity objectives is undecidable, recent results show that when restricted to
finite-memory policies the problem is EXPTIME-complete. While the problem is intractable
in theory, we present a practical approach to solve the qualitative analysis problem.
We designed several heuristics to deal with the exponential complexity, and have
used our implementation on a number of well-known POMDP examples for robotics
applications. Our results provide the first practical approach to solve the qualitative
analysis of robot motion planning with LTL properties in the presence of uncertainty.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs
with Temporal Logic Specifications for Robotics Applications. IST Austria;
2014. doi:10.15479/AT:IST-2014-305-v2-1
apa: Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative
analysis of POMDPs with temporal logic specifications for robotics applications.
IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v2-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics
Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.
ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis
of POMDPs with temporal logic specifications for robotics applications. IST
Austria, 2014.
ista: Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of
POMDPs with temporal logic specifications for robotics applications, IST Austria,
10p.
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal
Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v2-1.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of
POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria,
2014.
date_created: 2018-12-12T11:39:16Z
date_published: 2014-09-29T00:00:00Z
date_updated: 2023-02-23T12:25:47Z
day: '29'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-305-v2-1
file:
- access_level: open_access
checksum: 730c0a8e97cf2712a884b2cc423f3919
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:15Z
date_updated: 2020-07-14T12:46:51Z
file_id: '5537'
file_name: IST-2014-305-v2+1_main2.pdf
file_size: 656019
relation: main_file
file_date_updated: 2020-07-14T12:46:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '10'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '311'
related_material:
record:
- id: '1732'
relation: later_version
status: public
- id: '5424'
relation: earlier_version
status: public
status: public
title: Qualitative analysis of POMDPs with temporal logic specifications for robotics
applications
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5423'
abstract:
- lang: eng
text: 'We present a flexible framework for the automated competitive analysis of
on-line scheduling algorithms for firm- deadline real-time tasks based on multi-objective
graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled
transition system, along with some optional safety, liveness, and/or limit-average
constraints for the adversary, we automatically compute the competitive ratio
of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility
and power of our approach by comparing the competitive ratio of several on-line
algorithms, including D(over), that have been proposed in the past, for various
tasksets. Our experimental results reveal that none of these algorithms is universally
optimal, in the sense that there are tasksets where other schedulers provide better
performance. Our framework is hence a very useful design tool for selecting optimal
algorithms for a given application. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Alexander
full_name: Kössler, Alexander
last_name: Kössler
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. A Framework for Automated
Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria;
2014. doi:10.15479/AT:IST-2014-300-v1-1
apa: Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A
framework for automated competitive analysis of on-line scheduling of firm-deadline
tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1
chicago: Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich
Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling
of Firm-Deadline Tasks. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-300-v1-1.
ieee: K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework
for automated competitive analysis of on-line scheduling of firm-deadline tasks.
IST Austria, 2014.
ista: Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated
competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria,
14p.
mla: Chatterjee, Krishnendu, et al. A Framework for Automated Competitive Analysis
of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014, doi:10.15479/AT:IST-2014-300-v1-1.
short: K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated
Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria,
2014.
date_created: 2018-12-12T11:39:15Z
date_published: 2014-07-29T00:00:00Z
date_updated: 2023-02-23T10:11:15Z
day: '29'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-300-v1-1
file:
- access_level: open_access
checksum: 4b8fde4d9ef6653837f6803921d83032
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:53Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5514'
file_name: IST-2014-300-v1+1_main.pdf
file_size: 1270021
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '14'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '300'
related_material:
record:
- id: '1714'
relation: later_version
status: public
status: public
title: A framework for automated competitive analysis of on-line scheduling of firm-deadline
tasks
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5427'
abstract:
- lang: eng
text: 'We consider graphs with n nodes together with their tree-decomposition that
has b = O ( n ) bags and width t , on the standard RAM computational model with
wordsize W = Θ (log n ) . Our contributions are two-fold: Our first contribution
is an algorithm that given a graph and its tree-decomposition as input, computes
a binary and balanced tree-decomposition of width at most 4 · t + 3 of the graph
in O ( b ) time and space, improving a long-standing (from 1992) bound of O (
n · log n ) time for constant treewidth graphs. Our second contribution is on
reachability queries for low treewidth graphs. We build on our tree-balancing
algorithm and present a data-structure for graph reachability that requires O
( n · t 2 ) preprocessing time, O ( n · t ) space, and O ( d t/ log n e ) time
for pair queries, and O ( n · t · log t/ log n ) time for single-source queries.
For constant t our data-structure uses O ( n ) time for preprocessing, O (1) time
for pair queries, and O ( n/ log n ) time for single-source queries. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal Tree-Decomposition
Balancing and Reachability on Low Treewidth Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-314-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal
tree-decomposition balancing and reachability on low treewidth graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition
balancing and reachability on low treewidth graphs. IST Austria, 2014.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition
balancing and reachability on low treewidth graphs, IST Austria, 24p.
mla: Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and
Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition
Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
date_created: 2018-12-12T11:39:16Z
date_published: 2014-11-05T00:00:00Z
date_updated: 2021-01-12T08:02:09Z
day: '05'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-314-v1-1
file:
- access_level: open_access
checksum: 9d3b90bf4fff74664f182f2d95ef727a
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:10Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5471'
file_name: IST-2014-314-v1+1_long.pdf
file_size: 405561
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '24'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '314'
status: public
title: Optimal tree-decomposition balancing and reachability on low treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5425'
abstract:
- lang: eng
text: ' We consider partially observable Markov decision processes (POMDPs) with
a set of target states and every transition is associated with an integer cost.
The optimization objective we study asks to minimize the expected total cost till
the target set is reached, while ensuring that the target set is reached almost-surely
(with probability 1). We show that for integer costs approximating the optimal
cost is undecidable. For positive costs, our results are as follows: (i) we establish
matching lower and upper bounds for the optimal cost and the bound is double exponential;
(ii) we show that the problem of approximating the optimal cost is decidable and
present approximation algorithms developing on the existing algorithms for POMDPs
with finite-horizon objectives. While the worst-case running time of our algorithm
is double exponential, we also present efficient stopping criteria for the algorithm
and show experimentally that it performs well in many examples of interest.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Optimal Cost Almost-Sure
Reachability in POMDPs. IST Austria; 2014.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2014). Optimal
cost almost-sure reachability in POMDPs. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Optimal Cost
Almost-Sure Reachability in POMDPs. IST Austria, 2014.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Optimal cost almost-sure
reachability in POMDPs. IST Austria, 2014.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2014. Optimal cost almost-sure
reachability in POMDPs, IST Austria, 22p.
mla: Anonymous, 1, et al. Optimal Cost Almost-Sure Reachability in POMDPs.
IST Austria, 2014.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure
Reachability in POMDPs, IST Austria, 2014.
date_created: 2018-12-12T11:39:15Z
date_published: 2014-09-09T00:00:00Z
date_updated: 2023-02-23T10:02:57Z
day: '09'
ddc:
- '000'
file:
- access_level: open_access
checksum: b9668a70d53c550b3cd64f0c77451c3d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:17Z
date_updated: 2020-07-14T12:46:51Z
file_id: '5478'
file_name: IST-2014-307-v1+1_main.pdf
file_size: 2725429
relation: main_file
- access_level: closed
checksum: 808ada1dddecc48ca041526fcc6a9efd
content_type: text/plain
creator: dernst
date_created: 2019-04-16T14:16:12Z
date_updated: 2020-07-14T12:46:51Z
file_id: '6322'
file_name: IST-2014-307-v1+2_authors.txt
file_size: 117
relation: main_file
file_date_updated: 2020-07-14T12:46:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '307'
related_material:
record:
- id: '1529'
relation: later_version
status: public
scopus_import: 1
status: public
title: Optimal cost almost-sure reachability in POMDPs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5415'
abstract:
- lang: eng
text: 'Recently there has been a significant effort to add quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, several basic system properties such as average
response time cannot be expressed with weighted automata. In this work, we introduce
nested weighted automata as a new formalism for expressing important quantitative
properties such as average response time. We establish an almost complete decidability
picture for the basic decision problems for nested weighted automata, and illustrate
its applicability in several domains. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria;
2014. doi:10.15479/AT:IST-2014-170-v1-1
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted
automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted
Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata.
IST Austria, 2014.
ista: Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria,
27p.
mla: Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria,
2014, doi:10.15479/AT:IST-2014-170-v1-1.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria,
2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2023-02-23T12:26:19Z
day: '19'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2014-170-v1-1
file:
- access_level: open_access
checksum: 31f90dcf2cf899c3f8c6427cfcc2b3c7
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:36Z
date_updated: 2020-07-14T12:46:48Z
file_id: '5497'
file_name: IST-2014-170-v1+1_main.pdf
file_size: 573457
relation: main_file
file_date_updated: 2020-07-14T12:46:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '170'
related_material:
record:
- id: '1656'
relation: later_version
status: public
- id: '467'
relation: later_version
status: public
- id: '5436'
relation: later_version
status: public
status: public
title: Nested weighted automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5421'
abstract:
- lang: eng
text: 'Evolution occurs in populations of reproducing individuals. The structure
of the population affects the outcome of the evolutionary process. Evolutionary
graph theory is a powerful approach to study this phenomenon. There are two graphs.
The interaction graph specifies who interacts with whom in the context of evolution.
The replacement graph specifies who competes with whom for reproduction. The vertices
of the two graphs are the same, and each vertex corresponds to an individual.
A key quantity is the fixation probability of a new mutant. It is defined as the
probability that a newly introduced mutant (on a single vertex) generates a lineage
of offspring which eventually takes over the entire population of resident individuals.
The basic computational questions are as follows: (i) the qualitative question
asks whether the fixation probability is positive; and (ii) the quantitative approximation
question asks for an approximation of the fixation probability. Our main results
are: (1) We show that the qualitative question is NP-complete and the quantitative
approximation question is #P-hard in the special case when the interaction and
the replacement graphs coincide and even with the restriction that the resident
individuals do not reproduce (which corresponds to an invading population taking
over an empty structure). (2) We show that in general the qualitative question
is PSPACE-complete and the quantitative approximation question is PSPACE-hard
and can be solved in exponential time.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolution on Graphs.
IST Austria; 2014. doi:10.15479/AT:IST-2014-190-v2-2
apa: Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity
of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity
of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution
on graphs. IST Austria, 2014.
ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on
graphs, IST Austria, 27p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs.
IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on
Graphs, IST Austria, 2014.
date_created: 2018-12-12T11:39:14Z
date_published: 2014-04-18T00:00:00Z
date_updated: 2023-02-23T12:26:33Z
day: '18'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-190-v2-2
file:
- access_level: open_access
checksum: 42f3d8b563286eb0d903832bd9a848d3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:16Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5538'
file_name: IST-2014-190-v2+2_main_full.pdf
file_size: 443529
relation: main_file
- access_level: open_access
checksum: 0c9a2fd822309719634495a35957e34d
content_type: application/pdf
creator: kschuh
date_created: 2019-09-06T07:30:20Z
date_updated: 2020-07-14T12:46:50Z
file_id: '6852'
file_name: IST-2014-190-v1+1_main_full.pdf
file_size: 440911
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '190'
related_material:
record:
- id: '5432'
relation: later_version
status: public
- id: '5440'
relation: later_version
status: public
status: public
title: The complexity of evolution on graphs
type: technical_report
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5813'
abstract:
- lang: eng
text: We consider homogeneous Bose gas in a large cubic box with periodic boundary
conditions, at zero temperature. We analyze its excitation spectrum in a certain
kind of a mean-field infinite-volume limit. We prove that under appropriate conditions
the excitation spectrum has the form predicted by the Bogoliubov approximation.
Our result can be viewed as an extension of the result of Seiringer (Commun. Math.
Phys.306:565–578, 2011) to large volumes.
article_processing_charge: No
author:
- first_name: Jan
full_name: Dereziński, Jan
last_name: Dereziński
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
citation:
ama: Dereziński J, Napiórkowski MM. Excitation spectrum of interacting bosons in
the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. 2014;15(12):2409-2439.
doi:10.1007/s00023-013-0302-4
apa: Dereziński, J., & Napiórkowski, M. M. (2014). Excitation spectrum of interacting
bosons in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré.
Springer Nature. https://doi.org/10.1007/s00023-013-0302-4
chicago: Dereziński, Jan, and Marcin M Napiórkowski. “Excitation Spectrum of Interacting
Bosons in the Mean-Field Infinite-Volume Limit.” Annales Henri Poincaré.
Springer Nature, 2014. https://doi.org/10.1007/s00023-013-0302-4.
ieee: J. Dereziński and M. M. Napiórkowski, “Excitation spectrum of interacting
bosons in the Mean-Field Infinite-Volume limit,” Annales Henri Poincaré,
vol. 15, no. 12. Springer Nature, pp. 2409–2439, 2014.
ista: Dereziński J, Napiórkowski MM. 2014. Excitation spectrum of interacting bosons
in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. 15(12), 2409–2439.
mla: Dereziński, Jan, and Marcin M. Napiórkowski. “Excitation Spectrum of Interacting
Bosons in the Mean-Field Infinite-Volume Limit.” Annales Henri Poincaré,
vol. 15, no. 12, Springer Nature, 2014, pp. 2409–39, doi:10.1007/s00023-013-0302-4.
short: J. Dereziński, M.M. Napiórkowski, Annales Henri Poincaré 15 (2014) 2409–2439.
date_created: 2019-01-10T09:02:58Z
date_published: 2014-01-10T00:00:00Z
date_updated: 2021-11-16T08:13:24Z
day: '10'
ddc:
- '530'
doi: 10.1007/s00023-013-0302-4
extern: '1'
file:
- access_level: open_access
checksum: 1f6c32c5d6ec90cdb0718c7f0103342e
content_type: application/pdf
creator: dernst
date_created: 2019-01-10T09:04:45Z
date_updated: 2020-07-14T12:47:11Z
file_id: '5814'
file_name: 2014_Annales_Derezinski.pdf
file_size: 865230
relation: main_file
file_date_updated: 2020-07-14T12:47:11Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '12'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 2409-2439
publication: Annales Henri Poincaré
publication_identifier:
issn:
- 1424-0637
- 1424-0661
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s00023-014-0390-9
status: public
title: Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume
limit
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 15
year: '2014'
...
---
_id: '5810'
abstract:
- lang: eng
text: A discrete spherical geodesic path between two voxels s and t lying on a discrete
sphere is a/the 1-connected shortest path from s to t, comprising voxels of the
discrete sphere intersected by the real plane passing through s, t, and the center
of the sphere. We show that the set of sphere voxels intersected by the aforesaid
real plane always contains a 1-connected cycle passing through s and t, and each
voxel in this set lies within an isothetic distance of 32 from the concerned plane.
Hence, to compute the path, the algorithm starts from s, and iteratively computes
each voxel p of the path from the predecessor of p. A novel number-theoretic property
and the 48-symmetry of discrete sphere are used for searching the 1-connected
voxels comprising the path. The algorithm is output-sensitive, having its time
and space complexities both linear in the length of the path. It can be extended
for constructing 1-connected discrete 3D circles of arbitrary orientations, specified
by a few appropriate input parameters. Experimental results and related analysis
demonstrate its efficiency and versatility.
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: Biswas R, Bhowmick P. On Finding Spherical Geodesic Paths and Circles in ℤ3.
2014;8668:396-409. doi:10.1007/978-3-319-09955-2_33
apa: 'Biswas, R., & Bhowmick, P. (2014). On Finding Spherical Geodesic Paths
and Circles in ℤ3. Presented at the DGCI: International Conference on Discrete
Geometry for Computer Imagery, Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-319-09955-2_33'
chicago: 'Biswas, Ranita, and Partha Bhowmick. “On Finding Spherical Geodesic Paths
and Circles in ℤ3.” Lecture Notes in Computer Science. Berlin, Heidelberg: Springer,
2014. https://doi.org/10.1007/978-3-319-09955-2_33.'
ieee: R. Biswas and P. Bhowmick, “On Finding Spherical Geodesic Paths and Circles
in ℤ3,” vol. 8668. Springer, Berlin, Heidelberg, pp. 396–409, 2014.
ista: Biswas R, Bhowmick P. 2014. On Finding Spherical Geodesic Paths and Circles
in ℤ3. 8668, 396–409.
mla: Biswas, Ranita, and Partha Bhowmick. On Finding Spherical Geodesic Paths
and Circles in ℤ3. Vol. 8668, Springer, 2014, pp. 396–409, doi:10.1007/978-3-319-09955-2_33.
short: R. Biswas, P. Bhowmick, 8668 (2014) 396–409.
conference:
end_date: 2014-09-12
location: Siena, Italy
name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
start_date: 2014-09-10
date_created: 2019-01-08T20:45:32Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2019-01-24T13:22:49Z
doi: 10.1007/978-3-319-09955-2_33
extern: '1'
intvolume: ' 8668'
language:
- iso: eng
oa_version: None
page: 396-409
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642387081'
- '9783642387098'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: On Finding Spherical Geodesic Paths and Circles in ℤ3
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8668
year: '2014'
...
---
_id: '589'
abstract:
- lang: eng
text: We demonstrate a many-atom-cavity system with a high-finesse dual-wavelength
standing wave cavity in which all participating rubidium atoms are nearly identically
coupled to a 780-nm cavity mode. This homogeneous coupling is enforced by a one-dimensional
optical lattice formed by the field of a 1560-nm cavity mode.
author:
- first_name: Jongmin
full_name: Lee, Jongmin
last_name: Lee
- first_name: Geert
full_name: Vrijsen, Geert
last_name: Vrijsen
- first_name: Igor
full_name: Teper, Igor
last_name: Teper
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Mark
full_name: Kasevich, Mark A
last_name: Kasevich
citation:
ama: Lee J, Vrijsen G, Teper I, Hosten O, Kasevich M. Many-atom-cavity QED system
with homogeneous atom-cavity coupling. Optics Letters. 2014;39(13):4005-4008.
doi:10.1364/OL.39.004005
apa: Lee, J., Vrijsen, G., Teper, I., Hosten, O., & Kasevich, M. (2014). Many-atom-cavity
QED system with homogeneous atom-cavity coupling. Optics Letters. OSA.
https://doi.org/10.1364/OL.39.004005
chicago: Lee, Jongmin, Geert Vrijsen, Igor Teper, Onur Hosten, and Mark Kasevich.
“Many-Atom-Cavity QED System with Homogeneous Atom-Cavity Coupling.” Optics
Letters. OSA, 2014. https://doi.org/10.1364/OL.39.004005.
ieee: J. Lee, G. Vrijsen, I. Teper, O. Hosten, and M. Kasevich, “Many-atom-cavity
QED system with homogeneous atom-cavity coupling,” Optics Letters, vol.
39, no. 13. OSA, pp. 4005–4008, 2014.
ista: Lee J, Vrijsen G, Teper I, Hosten O, Kasevich M. 2014. Many-atom-cavity QED
system with homogeneous atom-cavity coupling. Optics Letters. 39(13), 4005–4008.
mla: Lee, Jongmin, et al. “Many-Atom-Cavity QED System with Homogeneous Atom-Cavity
Coupling.” Optics Letters, vol. 39, no. 13, OSA, 2014, pp. 4005–08, doi:10.1364/OL.39.004005.
short: J. Lee, G. Vrijsen, I. Teper, O. Hosten, M. Kasevich, Optics Letters 39 (2014)
4005–4008.
date_created: 2018-12-11T11:47:21Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T08:05:09Z
day: '01'
doi: 10.1364/OL.39.004005
extern: 1
intvolume: ' 39'
issue: '13'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.1805
month: '07'
oa: 1
page: 4005 - 4008
publication: Optics Letters
publication_status: published
publisher: OSA
publist_id: '7216'
quality_controlled: 0
status: public
title: Many-atom-cavity QED system with homogeneous atom-cavity coupling
type: journal_article
volume: 39
year: '2014'
...
---
_id: '6126'
abstract:
- lang: eng
text: Aerobic animals constantly monitor and adapt to changes in O2 levels. The
molecular mechanisms involved in sensing O2 are, however, incompletely understood.
Previous studies showed that a hexacoordinated globin called GLB-5 tunes the dynamic
range of O2-sensing neurons in natural C. elegans isolates, but is defective in
the N2 lab reference strain (McGrath et al., 2009; Persson et al., 2009). GLB-5
enables a sharp behavioral switch when O2 changes between 21 and 17%. Here, we
show that GLB-5 also confers rapid behavioral and cellular recovery from exposure
to hypoxia. Hypoxia reconfigures O2-evoked Ca2+ responses in the URX O2 sensors,
and GLB-5 enables rapid recovery of these responses upon re-oxygenation. Forward
genetic screens indicate that GLB-5's effects on O2 sensing require PDL-1, the
C. elegans ortholog of mammalian PrBP/PDE6δ protein. In mammals, PDE6δ regulates
the traffic and activity of prenylated proteins (Zhang et al., 2004; Norton et
al., 2005). PDL-1 promotes localization of GCY-33 and GCY-35, atypical soluble
guanylate cyclases that act as O2 sensors, to the dendritic endings of URX and
BAG neurons, where they colocalize with GLB-5. Both GCY-33 and GCY-35 are predicted
to be prenylated. Dendritic localization is not essential for GCY-35 to function
as an O2 sensor, but disrupting pdl-1 alters the URX neuron's O2 response properties.
Functional GLB-5 can restore dendritic localization of GCY-33 in pdl-1 mutants,
suggesting GCY-33 and GLB-5 are in a complex. Our data suggest GLB-5 and the soluble
guanylate cyclases operate in close proximity to sculpt O2 responses.
author:
- first_name: E.
full_name: Gross, E.
last_name: Gross
- first_name: Z.
full_name: Soltesz, Z.
last_name: Soltesz
- first_name: S.
full_name: Oda, S.
last_name: Oda
- first_name: V.
full_name: Zelmanovich, V.
last_name: Zelmanovich
- first_name: Z.
full_name: Abergel, Z.
last_name: Abergel
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Gross E, Soltesz Z, Oda S, Zelmanovich V, Abergel Z, de Bono M. GLOBIN-5-dependent
O2 responses are regulated by PDL-1/PrBP that targets prenylated soluble guanylate
cyclases to dendritic endings. Journal of Neuroscience. 2014;34(50):16726-16738.
doi:10.1523/jneurosci.5368-13.2014
apa: Gross, E., Soltesz, Z., Oda, S., Zelmanovich, V., Abergel, Z., & de Bono,
M. (2014). GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets
prenylated soluble guanylate cyclases to dendritic endings. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/jneurosci.5368-13.2014
chicago: Gross, E., Z. Soltesz, S. Oda, V. Zelmanovich, Z. Abergel, and Mario de
Bono. “GLOBIN-5-Dependent O2 Responses Are Regulated by PDL-1/PrBP That Targets
Prenylated Soluble Guanylate Cyclases to Dendritic Endings.” Journal of Neuroscience.
Society for Neuroscience, 2014. https://doi.org/10.1523/jneurosci.5368-13.2014.
ieee: E. Gross, Z. Soltesz, S. Oda, V. Zelmanovich, Z. Abergel, and M. de Bono,
“GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets prenylated
soluble guanylate cyclases to dendritic endings,” Journal of Neuroscience,
vol. 34, no. 50. Society for Neuroscience, pp. 16726–16738, 2014.
ista: Gross E, Soltesz Z, Oda S, Zelmanovich V, Abergel Z, de Bono M. 2014. GLOBIN-5-dependent
O2 responses are regulated by PDL-1/PrBP that targets prenylated soluble guanylate
cyclases to dendritic endings. Journal of Neuroscience. 34(50), 16726–16738.
mla: Gross, E., et al. “GLOBIN-5-Dependent O2 Responses Are Regulated by PDL-1/PrBP
That Targets Prenylated Soluble Guanylate Cyclases to Dendritic Endings.” Journal
of Neuroscience, vol. 34, no. 50, Society for Neuroscience, 2014, pp. 16726–38,
doi:10.1523/jneurosci.5368-13.2014.
short: E. Gross, Z. Soltesz, S. Oda, V. Zelmanovich, Z. Abergel, M. de Bono, Journal
of Neuroscience 34 (2014) 16726–16738.
date_created: 2019-03-19T14:52:26Z
date_published: 2014-12-10T00:00:00Z
date_updated: 2021-01-12T08:06:14Z
day: '10'
ddc:
- '570'
doi: 10.1523/jneurosci.5368-13.2014
extern: '1'
external_id:
pmid:
- '25505325'
file:
- access_level: open_access
checksum: a3dd71969f94c43909327cd083283d4b
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:55:58Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6127'
file_name: 2014_SFN_Gross.pdf
file_size: 3263422
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '50'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 16726-16738
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
- 1529-2401
publication_status: published
publisher: Society for Neuroscience
quality_controlled: '1'
status: public
title: GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets prenylated
soluble guanylate cyclases to dendritic endings
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2014'
...
---
_id: '6124'
abstract:
- lang: eng
text: Despite the importance of G-protein coupled receptors (GPCRs) their biogenesis
is poorly understood. Like vertebrates, C. elegans uses a large family of GPCRs
as chemoreceptors. A subset of these receptors, such as ODR-10, requires the odr-4
and odr-8 genes to be appropriately localized to sensory cilia. The odr-4 gene
encodes a conserved tail-anchored transmembrane protein; the molecular identity
of odr-8 is unknown. Here, we show that odr-8 encodes the C. elegans ortholog
of Ufm1-specific protease 2 (UfSP2). UfSPs are cysteine proteases identified biochemically
by their ability to liberate the ubiquitin-like modifier Ufm1 from its pro-form
and protein conjugates. ODR-8/UfSP2 and ODR-4 are expressed in the same set of
twelve chemosensory neurons, and physically interact at the ER membrane. ODR-4
also binds ODR-10, suggesting that an ODR-4/ODR-8 complex promotes GPCR folding,
maturation, or export from the ER. The physical interaction between human ODR4
and UfSP2 suggests that this complex's role in GPCR biogenesis may be evolutionarily
conserved. Unexpectedly, mutant versions of ODR-8/UfSP2 lacking catalytic residues
required for protease activity can rescue all odr-8 mutant phenotypes tested.
Moreover, deleting C. elegans ufm-1 does not alter chemoreceptor traffic to cilia,
either in wild type or in odr-8 mutants. Thus, UfSP2 proteins have protease- and
Ufm1-independent functions in GPCR biogenesis.
article_number: e1004082
author:
- first_name: Changchun
full_name: Chen, Changchun
last_name: Chen
- first_name: Eisuke
full_name: Itakura, Eisuke
last_name: Itakura
- first_name: Katherine P.
full_name: Weber, Katherine P.
last_name: Weber
- first_name: Ramanujan S.
full_name: Hegde, Ramanujan S.
last_name: Hegde
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Chen C, Itakura E, Weber KP, Hegde RS, de Bono M. An ER complex of ODR-4 and
ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent
mechanism. PLoS Genetics. 2014;10(3). doi:10.1371/journal.pgen.1004082
apa: Chen, C., Itakura, E., Weber, K. P., Hegde, R. S., & de Bono, M. (2014).
An ER complex of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation
by a Ufm1-independent mechanism. PLoS Genetics. Public Library of Science
(PLoS). https://doi.org/10.1371/journal.pgen.1004082
chicago: Chen, Changchun, Eisuke Itakura, Katherine P. Weber, Ramanujan S. Hegde,
and Mario de Bono. “An ER Complex of ODR-4 and ODR-8/Ufm1 Specific Protease 2
Promotes GPCR Maturation by a Ufm1-Independent Mechanism.” PLoS Genetics.
Public Library of Science (PLoS), 2014. https://doi.org/10.1371/journal.pgen.1004082.
ieee: C. Chen, E. Itakura, K. P. Weber, R. S. Hegde, and M. de Bono, “An ER complex
of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent
mechanism,” PLoS Genetics, vol. 10, no. 3. Public Library of Science (PLoS),
2014.
ista: Chen C, Itakura E, Weber KP, Hegde RS, de Bono M. 2014. An ER complex of ODR-4
and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent
mechanism. PLoS Genetics. 10(3), e1004082.
mla: Chen, Changchun, et al. “An ER Complex of ODR-4 and ODR-8/Ufm1 Specific Protease
2 Promotes GPCR Maturation by a Ufm1-Independent Mechanism.” PLoS Genetics,
vol. 10, no. 3, e1004082, Public Library of Science (PLoS), 2014, doi:10.1371/journal.pgen.1004082.
short: C. Chen, E. Itakura, K.P. Weber, R.S. Hegde, M. de Bono, PLoS Genetics 10
(2014).
date_created: 2019-03-19T14:45:56Z
date_published: 2014-03-06T00:00:00Z
date_updated: 2021-01-12T08:06:14Z
day: '06'
ddc:
- '570'
doi: 10.1371/journal.pgen.1004082
extern: '1'
external_id:
pmid:
- '24603482'
file:
- access_level: open_access
checksum: ac19941089a4262bb5bd74434a08b003
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:50:07Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6125'
file_name: 2014_PLOS_Chen.PDF
file_size: 8286819
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Genetics
publication_identifier:
issn:
- 1553-7404
publication_status: published
publisher: Public Library of Science (PLoS)
quality_controlled: '1'
status: public
title: An ER complex of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation
by a Ufm1-independent mechanism
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: 10
year: '2014'
...
---
_id: '6122'
author:
- first_name: Gerit A.
full_name: Linneweber, Gerit A.
last_name: Linneweber
- first_name: Jake
full_name: Jacobson, Jake
last_name: Jacobson
- first_name: Karl Emanuel
full_name: Busch, Karl Emanuel
last_name: Busch
- first_name: Bruno
full_name: Hudry, Bruno
last_name: Hudry
- first_name: Christo P.
full_name: Christov, Christo P.
last_name: Christov
- first_name: Dirk
full_name: Dormann, Dirk
last_name: Dormann
- first_name: Michaela
full_name: Yuan, Michaela
last_name: Yuan
- first_name: Tomoki
full_name: Otani, Tomoki
last_name: Otani
- first_name: Elisabeth
full_name: Knust, Elisabeth
last_name: Knust
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: Irene
full_name: Miguel-Aliaga, Irene
last_name: Miguel-Aliaga
citation:
ama: Linneweber GA, Jacobson J, Busch KE, et al. Neuronal control of metabolism
through nutrient-dependent modulation of tracheal branching. Cell. 2014;156(1-2):69-83.
doi:10.1016/j.cell.2013.12.008
apa: Linneweber, G. A., Jacobson, J., Busch, K. E., Hudry, B., Christov, C. P.,
Dormann, D., … Miguel-Aliaga, I. (2014). Neuronal control of metabolism through
nutrient-dependent modulation of tracheal branching. Cell. Elsevier. https://doi.org/10.1016/j.cell.2013.12.008
chicago: Linneweber, Gerit A., Jake Jacobson, Karl Emanuel Busch, Bruno Hudry, Christo P.
Christov, Dirk Dormann, Michaela Yuan, et al. “Neuronal Control of Metabolism
through Nutrient-Dependent Modulation of Tracheal Branching.” Cell. Elsevier,
2014. https://doi.org/10.1016/j.cell.2013.12.008.
ieee: G. A. Linneweber et al., “Neuronal control of metabolism through nutrient-dependent
modulation of tracheal branching,” Cell, vol. 156, no. 1–2. Elsevier, pp.
69–83, 2014.
ista: Linneweber GA, Jacobson J, Busch KE, Hudry B, Christov CP, Dormann D, Yuan
M, Otani T, Knust E, de Bono M, Miguel-Aliaga I. 2014. Neuronal control of metabolism
through nutrient-dependent modulation of tracheal branching. Cell. 156(1–2), 69–83.
mla: Linneweber, Gerit A., et al. “Neuronal Control of Metabolism through Nutrient-Dependent
Modulation of Tracheal Branching.” Cell, vol. 156, no. 1–2, Elsevier, 2014,
pp. 69–83, doi:10.1016/j.cell.2013.12.008.
short: G.A. Linneweber, J. Jacobson, K.E. Busch, B. Hudry, C.P. Christov, D. Dormann,
M. Yuan, T. Otani, E. Knust, M. de Bono, I. Miguel-Aliaga, Cell 156 (2014) 69–83.
date_created: 2019-03-19T14:35:30Z
date_published: 2014-01-16T00:00:00Z
date_updated: 2021-01-12T08:06:13Z
day: '16'
ddc:
- '570'
doi: 10.1016/j.cell.2013.12.008
extern: '1'
external_id:
pmid:
- '24439370'
file:
- access_level: open_access
checksum: ad6ef68f37fb711d9abcd97fc06ad316
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:40:38Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6123'
file_name: 2014_Elsevier_Linneweber.pdf
file_size: 5020084
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 156'
issue: 1-2
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 69-83
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Neuronal control of metabolism through nutrient-dependent modulation of tracheal
branching
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: 156
year: '2014'
...
---
_id: '6319'
abstract:
- lang: fre
text: Nous étudions le comportement asymptotique du nombre de variétés dans une
certaine classe ne satisfaisant pas le principe de Hasse. Cette étude repose sur
des résultats récemmentobtenus par Colliot-Thélène.
author:
- first_name: Régis de la
full_name: Bretèche, Régis de la
last_name: 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: Bretèche R de la, Browning TD. Contre-exemples au principe de Hasse pour certains
tores coflasques. Journal de Théorie des Nombres de Bordeaux. 2014;26(1):25-44.
doi:10.5802/jtnb.857
apa: Bretèche, R. de la, & Browning, T. D. (2014). Contre-exemples au principe
de Hasse pour certains tores coflasques. Journal de Théorie Des Nombres de
Bordeaux. Cellule MathDoc/CEDRAM. https://doi.org/10.5802/jtnb.857
chicago: Bretèche, Régis de la, and Timothy D Browning. “Contre-Exemples Au Principe
de Hasse Pour Certains Tores Coflasques.” Journal de Théorie Des Nombres de
Bordeaux. Cellule MathDoc/CEDRAM, 2014. https://doi.org/10.5802/jtnb.857.
ieee: R. de la Bretèche and T. D. Browning, “Contre-exemples au principe de Hasse
pour certains tores coflasques,” Journal de Théorie des Nombres de Bordeaux,
vol. 26, no. 1. Cellule MathDoc/CEDRAM, pp. 25–44, 2014.
ista: Bretèche R de la, Browning TD. 2014. Contre-exemples au principe de Hasse
pour certains tores coflasques. Journal de Théorie des Nombres de Bordeaux. 26(1),
25–44.
mla: Bretèche, Régis de la, and Timothy D. Browning. “Contre-Exemples Au Principe
de Hasse Pour Certains Tores Coflasques.” Journal de Théorie Des Nombres de
Bordeaux, vol. 26, no. 1, Cellule MathDoc/CEDRAM, 2014, pp. 25–44, doi:10.5802/jtnb.857.
short: R. de la Bretèche, T.D. Browning, Journal de Théorie Des Nombres de Bordeaux
26 (2014) 25–44.
date_created: 2019-04-16T13:40:13Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:03Z
doi: 10.5802/jtnb.857
extern: '1'
external_id:
arxiv:
- '1210.4236'
intvolume: ' 26'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1210.4236
oa: 1
oa_version: Preprint
page: 25-44
publication: Journal de Théorie des Nombres de Bordeaux
publication_identifier:
issn:
- 1246-7405
- 2118-8572
publication_status: published
publisher: Cellule MathDoc/CEDRAM
quality_controlled: '1'
status: public
title: Contre-exemples au principe de Hasse pour certains tores coflasques
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2014'
...
---
_id: '6740'
abstract:
- lang: eng
text: We describe coding techniques that achieve the capacity of a discrete memoryless
asymmetric channel. To do so, we discuss how recent advances in coding for symmetric
channels yield more efficient solutions also for the asymmetric case. In more
detail, we consider three basic approaches. The first one is Gallager's scheme
that concatenates a linear code with a non-linear mapper, in order to bias the
input distribution. We explicitly show that both polar codes and spatially coupled
codes can be employed in this scenario. Further, we derive a scaling law between
the gap to capacity, the cardinality of channel input and output alphabets, and
the required size of the mapper. The second one is an integrated approach in which
the coding scheme is used both for source coding, in order to create codewords
with the capacity-achieving distribution, and for channel coding, in order to
provide error protection. Such a technique has been recently introduced by Honda
and Yamamoto in the context of polar codes, and we show how to apply it also to
the design of sparse graph codes. The third approach is based on an idea due to
Böcherer and Mathar and separates completely the two tasks of source coding and
channel coding by “chaining” together several codewords. We prove that we can
combine any suitable source code with any suitable channel code in order to provide
optimal schemes for asymmetric channels. In particular, polar codes and spatially
coupled codes fulfill the required conditions.
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
citation:
ama: 'Mondelli M, Urbanke R, Hassani H. How to achieve the capacity of asymmetric
channels. In: 52nd Annual Allerton Conference on Communication, Control, and
Computing. IEEE; 2014:789-796. doi:10.1109/allerton.2014.7028535'
apa: 'Mondelli, M., Urbanke, R., & Hassani, H. (2014). How to achieve the capacity
of asymmetric channels. In 52nd Annual Allerton Conference on Communication,
Control, and Computing (pp. 789–796). Monticello, IL, United States: IEEE.
https://doi.org/10.1109/allerton.2014.7028535'
chicago: Mondelli, Marco, Rudiger Urbanke, and Hamed Hassani. “How to Achieve the
Capacity of Asymmetric Channels.” In 52nd Annual Allerton Conference on Communication,
Control, and Computing, 789–96. IEEE, 2014. https://doi.org/10.1109/allerton.2014.7028535.
ieee: M. Mondelli, R. Urbanke, and H. Hassani, “How to achieve the capacity of asymmetric
channels,” in 52nd Annual Allerton Conference on Communication, Control, and
Computing, Monticello, IL, United States, 2014, pp. 789–796.
ista: Mondelli M, Urbanke R, Hassani H. 2014. How to achieve the capacity of asymmetric
channels. 52nd Annual Allerton Conference on Communication, Control, and Computing.
Allerton Conference on Communication, Control, and Computing, 789–796.
mla: Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.”
52nd Annual Allerton Conference on Communication, Control, and Computing,
IEEE, 2014, pp. 789–96, doi:10.1109/allerton.2014.7028535.
short: M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference
on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.
conference:
end_date: 2014-10-03
location: Monticello, IL, United States
name: Allerton Conference on Communication, Control, and Computing
start_date: 2014-09-30
date_created: 2019-07-31T07:24:23Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2023-02-23T12:49:36Z
day: '01'
doi: 10.1109/allerton.2014.7028535
extern: '1'
external_id:
arxiv:
- '1406.7373'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.7373
month: '10'
oa: 1
oa_version: Preprint
page: 789-796
publication: 52nd Annual Allerton Conference on Communication, Control, and Computing
publication_identifier:
eisbn:
- 978-1-4799-8009-3
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6678'
relation: later_version
status: public
status: public
title: How to achieve the capacity of asymmetric channels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '6739'
abstract:
- lang: eng
text: 'We explore the relationship between polar and RM codes and we describe a
coding scheme which improves upon the performance of the standard polar code at
practical block lengths. Our starting point is the experimental observation that
RM codes have a smaller error probability than polar codes under MAP decoding.
This motivates us to introduce a family of codes that “interpolates” between RM
and polar codes, call this family C inter = {C α : α ∈ [0, 1j}, where C α|α=1
is the original polar code, and C α|α=0 is an RM code. Based on numerical observations,
we remark that the error probability under MAP decoding is an increasing function
of α. MAP decoding has in general exponential complexity, but empirically the
performance of polar codes at finite block lengths is boosted by moving along
the family Cinter even under low-complexity decoding schemes such as, for instance,
belief propagation or successive cancellation list decoder. We demonstrate the
performance gain via numerical simulations for transmission over the erasure channel
as well as the Gaussian channel.'
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
ama: 'Mondelli M, Hassani H, Urbanke R. From polar to Reed-Muller codes: A technique
to improve the finite-length performance. IEEE Transactions on Communications.
2014;62(9):3084-3091. doi:10.1109/tcomm.2014.2345069'
apa: 'Mondelli, M., Hassani, H., & Urbanke, R. (2014). From polar to Reed-Muller
codes: A technique to improve the finite-length performance. IEEE Transactions
on Communications. IEEE. https://doi.org/10.1109/tcomm.2014.2345069'
chicago: 'Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “From Polar to Reed-Muller
Codes: A Technique to Improve the Finite-Length Performance.” IEEE Transactions
on Communications. IEEE, 2014. https://doi.org/10.1109/tcomm.2014.2345069.'
ieee: 'M. Mondelli, H. Hassani, and R. Urbanke, “From polar to Reed-Muller codes:
A technique to improve the finite-length performance,” IEEE Transactions on
Communications, vol. 62, no. 9. IEEE, pp. 3084–3091, 2014.'
ista: 'Mondelli M, Hassani H, Urbanke R. 2014. From polar to Reed-Muller codes:
A technique to improve the finite-length performance. IEEE Transactions on Communications.
62(9), 3084–3091.'
mla: 'Mondelli, Marco, et al. “From Polar to Reed-Muller Codes: A Technique to Improve
the Finite-Length Performance.” IEEE Transactions on Communications, vol.
62, no. 9, IEEE, 2014, pp. 3084–91, doi:10.1109/tcomm.2014.2345069.'
short: M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Communications
62 (2014) 3084–3091.
date_created: 2019-07-31T07:20:21Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T08:08:46Z
day: '01'
doi: 10.1109/tcomm.2014.2345069
extern: '1'
external_id:
arxiv:
- '1401.3127'
intvolume: ' 62'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1401.3127
month: '09'
oa: 1
oa_version: Preprint
page: 3084-3091
publication: IEEE Transactions on Communications
publication_identifier:
issn:
- 0090-6778
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'From polar to Reed-Muller codes: A technique to improve the finite-length
performance'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2014'
...
---
_id: '6744'
abstract:
- lang: eng
text: With the aim of extending the coverage and improving the performance of impulse
radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single
differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR).
To favor simple receiver structures, differential noncoherent detection is employed
which enables effective energy capture without any channel estimation. Putting
emphasis on the general case of multi-hop relaying, we illustrate an original
algorithm for the joint power allocation and path selection (JPAPS), minimizing
an approximate expression of the overall bit error rate (BER). In particular,
after deriving a closed-form power allocation strategy, the optimal path selection
is reduced to a shortest path problem on a connected graph, which can be solved
without any topology information with complexity O(N 3 ), N being the number of
available relays of the network. An approximate scheme is also presented, which
reduces the complexity to O(N 2 ) while showing a negligible performance loss,
and for benchmarking purposes, an exhaustive-search based multi-hop DF cooperative
strategy is derived. Simulation results for various network setups corroborate
the effectiveness of the proposed low-complexity JPAPS algorithm, which favorably
compares to existing AF and DF relaying methods.
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Qi
full_name: Zhou, Qi
last_name: Zhou
- first_name: Vincenzo
full_name: Lottici, Vincenzo
last_name: Lottici
- first_name: Xiaoli
full_name: Ma, Xiaoli
last_name: Ma
citation:
ama: Mondelli M, Zhou Q, Lottici V, Ma X. Joint power allocation and path selection
for multi-hop noncoherent decode and forward UWB communications. IEEE Transactions
on Wireless Communications. 2014;13(3):1397-1409. doi:10.1109/twc.2014.020914.130669
apa: Mondelli, M., Zhou, Q., Lottici, V., & Ma, X. (2014). Joint power allocation
and path selection for multi-hop noncoherent decode and forward UWB communications.
IEEE Transactions on Wireless Communications. IEEE. https://doi.org/10.1109/twc.2014.020914.130669
chicago: Mondelli, Marco, Qi Zhou, Vincenzo Lottici, and Xiaoli Ma. “Joint Power
Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB
Communications.” IEEE Transactions on Wireless Communications. IEEE, 2014.
https://doi.org/10.1109/twc.2014.020914.130669.
ieee: M. Mondelli, Q. Zhou, V. Lottici, and X. Ma, “Joint power allocation and path
selection for multi-hop noncoherent decode and forward UWB communications,” IEEE
Transactions on Wireless Communications, vol. 13, no. 3. IEEE, pp. 1397–1409,
2014.
ista: Mondelli M, Zhou Q, Lottici V, Ma X. 2014. Joint power allocation and path
selection for multi-hop noncoherent decode and forward UWB communications. IEEE
Transactions on Wireless Communications. 13(3), 1397–1409.
mla: Mondelli, Marco, et al. “Joint Power Allocation and Path Selection for Multi-Hop
Noncoherent Decode and Forward UWB Communications.” IEEE Transactions on Wireless
Communications, vol. 13, no. 3, IEEE, 2014, pp. 1397–409, doi:10.1109/twc.2014.020914.130669.
short: M. Mondelli, Q. Zhou, V. Lottici, X. Ma, IEEE Transactions on Wireless Communications
13 (2014) 1397–1409.
date_created: 2019-07-31T09:05:07Z
date_published: 2014-03-20T00:00:00Z
date_updated: 2021-01-12T08:08:48Z
day: '20'
doi: 10.1109/twc.2014.020914.130669
extern: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 1397-1409
publication: IEEE Transactions on Wireless Communications
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Joint power allocation and path selection for multi-hop noncoherent decode
and forward UWB communications
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2014'
...
---
_id: '10885'
abstract:
- lang: eng
text: "Two-player games on graphs provide the theoretical framework for many important
problems such as reactive synthesis. While the traditional study of two-player
zero-sum games has been extended to multi-player games with several notions of
equilibria, they are decidable only for perfect-information games, whereas several
applications require imperfect-information games.\r\nIn this paper we propose
a new notion of equilibria, called doomsday equilibria, which is a strategy profile
such that all players satisfy their own objective, and if any coalition of players
deviates and violates even one of the players objective, then the objective of
every player is violated.\r\nWe present algorithms and complexity results for
deciding the existence of doomsday equilibria for various classes of ω-regular
objectives, both for imperfect-information games, and for perfect-information
games.We provide optimal complexity bounds for imperfect-information games, and
in most cases for perfect-information games."
acknowledgement: " Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF
NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Emmanuel
full_name: Filiot, Emmanuel
last_name: Filiot
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
citation:
ama: 'Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular
games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation.
Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5'
apa: 'Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday
equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking,
and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United
States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_5'
chicago: 'Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François
Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification,
Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature,
2014. https://doi.org/10.1007/978-3-642-54013-4_5.'
ieee: 'K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria
for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and
Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp.
78–97.'
ista: 'Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for
omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
78–97.'
mla: 'Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”
VMCAI 2014: Verification, Model Checking, and Abstract Interpretation,
vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.'
short: 'K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification,
Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.'
conference:
end_date: 2014-01-21
location: San Diego, CA, United States
name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2022-03-18T13:03:15Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2023-02-23T12:52:24Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_5
ec_funded: 1
external_id:
arxiv:
- '1311.3238'
intvolume: ' 8318'
language:
- iso: eng
month: '01'
oa_version: Preprint
page: 78-97
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 'VMCAI 2014: Verification, Model Checking, and Abstract Interpretation'
publication_identifier:
eisbn:
- '9783642540134'
eissn:
- 1611-3349
isbn:
- '9783642540127'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '681'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Doomsday equilibria for omega-regular games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '6853'
abstract:
- lang: eng
text: This monograph presents a short course in computational geometry and topology.
In the first part the book covers Voronoi diagrams and Delaunay triangulations,
then it presents the theory of alpha complexes which play a crucial role in biology.
The central part of the book is the homology theory and their computation, including
the theory of persistence which is indispensable for applications, e.g. shape
reconstruction. The target audience comprises researchers and practitioners in
mathematics, biology, neuroscience and computer science, but the book may also
be beneficial to graduate students of these fields.
alternative_title:
- SpringerBriefs in Applied Sciences and Technology
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. A Short Course in Computational Geometry and Topology.
1st ed. Cham: Springer Nature; 2014. doi:10.1007/978-3-319-05957-0'
apa: 'Edelsbrunner, H. (2014). A Short Course in Computational Geometry and Topology
(1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-05957-0'
chicago: 'Edelsbrunner, Herbert. A Short Course in Computational Geometry and
Topology. 1st ed. SpringerBriefs in Applied Sciences and Technology. Cham:
Springer Nature, 2014. https://doi.org/10.1007/978-3-319-05957-0.'
ieee: 'H. Edelsbrunner, A Short Course in Computational Geometry and Topology,
1st ed. Cham: Springer Nature, 2014.'
ista: 'Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology
1st ed., Cham: Springer Nature, IX, 110p.'
mla: Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology.
1st ed., Springer Nature, 2014, doi:10.1007/978-3-319-05957-0.
short: H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st
ed., Springer Nature, Cham, 2014.
date_created: 2019-09-06T09:22:33Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2022-03-04T07:47:54Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-319-05957-0
edition: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: IX, 110
place: Cham
publication_identifier:
eisbn:
- 9-783-3190-5957-0
eissn:
- 2191-5318
isbn:
- 9-783-3190-5956-3
issn:
- 2191-530X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: available as eBook via catalog IST BookList
relation: other
url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=356106
- description: available via catalog IST BookList
relation: other
url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=373842
scopus_import: '1'
series_title: SpringerBriefs in Applied Sciences and Technology
status: public
title: A Short Course in Computational Geometry and Topology
type: book
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7038'
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Huszár K, Rolinek M. Playful Math - An Introduction to Mathematical Games.
IST Austria
apa: Huszár, K., & Rolinek, M. (n.d.). Playful Math - An introduction to
mathematical games. IST Austria.
chicago: Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction
to Mathematical Games. IST Austria, n.d.
ieee: K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical
games. IST Austria.
ista: Huszár K, Rolinek M. Playful Math - An introduction to mathematical games,
IST Austria, 5p.
mla: Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical
Games. IST Austria.
short: K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games,
IST Austria, n.d.
date_created: 2019-11-18T15:57:05Z
date_published: 2014-06-30T00:00:00Z
date_updated: 2020-07-14T23:11:45Z
day: '30'
ddc:
- '510'
department:
- _id: VlKo
- _id: UlWa
file:
- access_level: open_access
checksum: 2b94e5e1f4c3fe8ab89b12806276fb09
content_type: application/pdf
creator: dernst
date_created: 2019-11-18T15:57:51Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7039'
file_name: 2014_Playful_Math_Huszar.pdf
file_size: 511233
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '5'
publication_status: draft
publisher: IST Austria
status: public
title: Playful Math - An introduction to mathematical games
type: working_paper
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '7071'
abstract:
- lang: eng
text: Spin and orbital quantum numbers play a key role in the physics of Mott insulators,
but in most systems they are connected only indirectly—via the Pauli exclusion
principle and the Coulomb interaction. Iridium-based oxides (iridates) introduce
strong spin–orbit coupling directly, such that these numbers become entwined together
and the Mott physics attains a strong orbital character. In the layered honeycomb
iridates this is thought to generate highly spin–anisotropic magnetic interactions,
coupling the spin to a given spatial direction of exchange and leading to strongly
frustrated magnetism. Here we report a new iridate structure that has the same
local connectivity as the layered honeycomb and exhibits striking evidence for
highly spin–anisotropic exchange. The basic structural units of this material
suggest that a new family of three-dimensional structures could exist, the ‘harmonic
honeycomb’ iridates, of which the present compound is the first example.
article_number: '4203'
article_processing_charge: No
article_type: original
author:
- 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: Tess E.
full_name: Smidt, Tess E.
last_name: Smidt
- first_name: Itamar
full_name: Kimchi, Itamar
last_name: Kimchi
- first_name: Nicholas P.
full_name: Breznay, Nicholas P.
last_name: Breznay
- first_name: Alun
full_name: Biffin, Alun
last_name: Biffin
- first_name: Sungkyun
full_name: Choi, Sungkyun
last_name: Choi
- first_name: Roger D.
full_name: Johnson, Roger D.
last_name: Johnson
- first_name: Radu
full_name: Coldea, Radu
last_name: Coldea
- first_name: Pilanda
full_name: Watkins-Curry, Pilanda
last_name: Watkins-Curry
- first_name: Gregory T.
full_name: McCandless, Gregory T.
last_name: McCandless
- first_name: Julia Y.
full_name: Chan, Julia Y.
last_name: Chan
- first_name: Felipe
full_name: Gandara, Felipe
last_name: Gandara
- first_name: Z.
full_name: Islam, Z.
last_name: Islam
- first_name: Ashvin
full_name: Vishwanath, Ashvin
last_name: Vishwanath
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
- first_name: Ross D.
full_name: McDonald, Ross D.
last_name: McDonald
- first_name: James G.
full_name: Analytis, James G.
last_name: Analytis
citation:
ama: Modic KA, Smidt TE, Kimchi I, et al. Realization of a three-dimensional spin–anisotropic
harmonic honeycomb iridate. Nature Communications. 2014;5. doi:10.1038/ncomms5203
apa: Modic, K. A., Smidt, T. E., Kimchi, I., Breznay, N. P., Biffin, A., Choi, S.,
… Analytis, J. G. (2014). Realization of a three-dimensional spin–anisotropic
harmonic honeycomb iridate. Nature Communications. Springer Science and
Business Media LLC. https://doi.org/10.1038/ncomms5203
chicago: Modic, Kimberly A, Tess E. Smidt, Itamar Kimchi, Nicholas P. Breznay, Alun
Biffin, Sungkyun Choi, Roger D. Johnson, et al. “Realization of a Three-Dimensional
Spin–Anisotropic Harmonic Honeycomb Iridate.” Nature Communications. Springer
Science and Business Media LLC, 2014. https://doi.org/10.1038/ncomms5203.
ieee: K. A. Modic et al., “Realization of a three-dimensional spin–anisotropic
harmonic honeycomb iridate,” Nature Communications, vol. 5. Springer Science
and Business Media LLC, 2014.
ista: Modic KA, Smidt TE, Kimchi I, Breznay NP, Biffin A, Choi S, Johnson RD, Coldea
R, Watkins-Curry P, McCandless GT, Chan JY, Gandara F, Islam Z, Vishwanath A,
Shekhter A, McDonald RD, Analytis JG. 2014. Realization of a three-dimensional
spin–anisotropic harmonic honeycomb iridate. Nature Communications. 5, 4203.
mla: Modic, Kimberly A., et al. “Realization of a Three-Dimensional Spin–Anisotropic
Harmonic Honeycomb Iridate.” Nature Communications, vol. 5, 4203, Springer
Science and Business Media LLC, 2014, doi:10.1038/ncomms5203.
short: K.A. Modic, T.E. Smidt, I. Kimchi, N.P. Breznay, A. Biffin, S. Choi, R.D.
Johnson, R. Coldea, P. Watkins-Curry, G.T. McCandless, J.Y. Chan, F. Gandara,
Z. Islam, A. Vishwanath, A. Shekhter, R.D. McDonald, J.G. Analytis, Nature Communications
5 (2014).
date_created: 2019-11-19T13:22:39Z
date_published: 2014-06-27T00:00:00Z
date_updated: 2021-01-12T08:11:42Z
day: '27'
ddc:
- '530'
doi: 10.1038/ncomms5203
extern: '1'
file:
- access_level: open_access
checksum: d290f0bfa93c5169cc6c8086874c5a78
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T12:44:23Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7113'
file_name: 2014_NatureComm_Modic.pdf
file_size: 4832820
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Science and Business Media LLC
quality_controlled: '1'
status: public
title: Realization of a three-dimensional spin–anisotropic harmonic honeycomb iridate
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2014'
...
---
_id: '7072'
abstract:
- lang: eng
text: We investigate the structural and magnetic properties of two molecule-based
magnets synthesized from the same starting components. Their different structural
motifs promote contrasting exchange pathways and consequently lead to markedly
different magnetic ground states. Through examination of their structural and
magnetic properties we show that [Cu(pyz)(H2O)(gly)2](ClO4)2 may be considered
a quasi-one-dimensional quantum Heisenberg antiferromagnet whereas the related
compound [Cu(pyz)(gly)](ClO4), which is formed from dimers of antiferromagnetically
interacting Cu2+ spins, remains disordered down to at least 0.03 K in zero field
but shows a field-temperature phase diagram reminiscent of that seen in materials
showing a Bose-Einstein condensation of magnons.
article_number: '207201'
article_processing_charge: No
article_type: original
author:
- first_name: T.
full_name: Lancaster, T.
last_name: Lancaster
- first_name: P. A.
full_name: Goddard, P. A.
last_name: Goddard
- first_name: S. J.
full_name: Blundell, S. J.
last_name: Blundell
- first_name: F. R.
full_name: Foronda, F. R.
last_name: Foronda
- first_name: S.
full_name: Ghannadzadeh, S.
last_name: Ghannadzadeh
- first_name: J. S.
full_name: Möller, J. S.
last_name: Möller
- first_name: P. J.
full_name: Baker, P. J.
last_name: Baker
- first_name: F. L.
full_name: Pratt, F. L.
last_name: Pratt
- first_name: C.
full_name: Baines, C.
last_name: Baines
- first_name: L.
full_name: Huang, L.
last_name: Huang
- first_name: J.
full_name: Wosnitza, J.
last_name: Wosnitza
- first_name: R. D.
full_name: McDonald, R. D.
last_name: McDonald
- 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.
full_name: Singleton, J.
last_name: Singleton
- first_name: C. V.
full_name: Topping, C. V.
last_name: Topping
- first_name: T. A. W.
full_name: Beale, T. A. W.
last_name: Beale
- first_name: F.
full_name: Xiao, F.
last_name: Xiao
- first_name: J. A.
full_name: Schlueter, J. A.
last_name: Schlueter
- first_name: A. M.
full_name: Barton, A. M.
last_name: Barton
- first_name: R. D.
full_name: Cabrera, R. D.
last_name: Cabrera
- first_name: K. E.
full_name: Carreiro, K. E.
last_name: Carreiro
- first_name: H. E.
full_name: Tran, H. E.
last_name: Tran
- first_name: J. L.
full_name: Manson, J. L.
last_name: Manson
citation:
ama: Lancaster T, Goddard PA, Blundell SJ, et al. Controlling magnetic order and
quantum disorder in molecule-based magnets. Physical Review Letters. 2014;112(20).
doi:10.1103/physrevlett.112.207201
apa: Lancaster, T., Goddard, P. A., Blundell, S. J., Foronda, F. R., Ghannadzadeh,
S., Möller, J. S., … Manson, J. L. (2014). Controlling magnetic order and quantum
disorder in molecule-based magnets. Physical Review Letters. APS. https://doi.org/10.1103/physrevlett.112.207201
chicago: Lancaster, T., P. A. Goddard, S. J. Blundell, F. R. Foronda, S. Ghannadzadeh,
J. S. Möller, P. J. Baker, et al. “Controlling Magnetic Order and Quantum Disorder
in Molecule-Based Magnets.” Physical Review Letters. APS, 2014. https://doi.org/10.1103/physrevlett.112.207201.
ieee: T. Lancaster et al., “Controlling magnetic order and quantum disorder
in molecule-based magnets,” Physical Review Letters, vol. 112, no. 20.
APS, 2014.
ista: Lancaster T, Goddard PA, Blundell SJ, Foronda FR, Ghannadzadeh S, Möller JS,
Baker PJ, Pratt FL, Baines C, Huang L, Wosnitza J, McDonald RD, Modic KA, Singleton
J, Topping CV, Beale TAW, Xiao F, Schlueter JA, Barton AM, Cabrera RD, Carreiro
KE, Tran HE, Manson JL. 2014. Controlling magnetic order and quantum disorder
in molecule-based magnets. Physical Review Letters. 112(20), 207201.
mla: Lancaster, T., et al. “Controlling Magnetic Order and Quantum Disorder in Molecule-Based
Magnets.” Physical Review Letters, vol. 112, no. 20, 207201, APS, 2014,
doi:10.1103/physrevlett.112.207201.
short: T. Lancaster, P.A. Goddard, S.J. Blundell, F.R. Foronda, S. Ghannadzadeh,
J.S. Möller, P.J. Baker, F.L. Pratt, C. Baines, L. Huang, J. Wosnitza, R.D. McDonald,
K.A. Modic, J. Singleton, C.V. Topping, T.A.W. Beale, F. Xiao, J.A. Schlueter,
A.M. Barton, R.D. Cabrera, K.E. Carreiro, H.E. Tran, J.L. Manson, Physical Review
Letters 112 (2014).
date_created: 2019-11-19T13:23:13Z
date_published: 2014-05-19T00:00:00Z
date_updated: 2021-01-12T08:11:42Z
day: '19'
doi: 10.1103/physrevlett.112.207201
extern: '1'
intvolume: ' 112'
issue: '20'
language:
- iso: eng
month: '05'
oa_version: None
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: APS
quality_controlled: '1'
status: public
title: Controlling magnetic order and quantum disorder in molecule-based magnets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
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: '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: '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: '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: '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: '7300'
abstract:
- lang: eng
text: Photoinduced electron transfer (PET), which causes pH-dependent quenching
of fluorescent dyes, is more effectively introduced by phenolic groups than by
amino groups which have been much more commonly used so far. That is demonstrated
by fluorescence measurements involving several classes of fluorophores. Electrochemical
measurements show that PET in several amino-modified dyes is thermodynamically
favorable, even though it was not experimentally found, underlining the importance
of kinetic aspects to the process. Consequently, the attachment of phenolic groups
allows for fast and simple preparation of a wide selection of fluorescent pH-probes
with tailor-made spectral properties, sensitive ranges, and individual advantages,
so that a large number of applications can be realized. Fluorophores carrying
phenolic groups may also be used for sensing analytes other than pH or molecular
switching and signaling.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Aigner, Daniel
last_name: Aigner
- 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: Martin
full_name: Wilkening, Martin
last_name: Wilkening
- first_name: Robert
full_name: Saf, Robert
last_name: Saf
- first_name: Sergey M.
full_name: Borisov, Sergey M.
last_name: Borisov
- first_name: Ingo
full_name: Klimant, Ingo
last_name: Klimant
citation:
ama: Aigner D, Freunberger SA, Wilkening M, Saf R, Borisov SM, Klimant I. Enhancing
photoinduced electron transfer efficiency of fluorescent pH-probes with halogenated
phenols. Analytical Chemistry. 2014;86(18):9293-9300. doi:10.1021/ac502513g
apa: Aigner, D., Freunberger, S. A., Wilkening, M., Saf, R., Borisov, S. M., &
Klimant, I. (2014). Enhancing photoinduced electron transfer efficiency of fluorescent
pH-probes with halogenated phenols. Analytical Chemistry. ACS. https://doi.org/10.1021/ac502513g
chicago: Aigner, Daniel, Stefan Alexander Freunberger, Martin Wilkening, Robert
Saf, Sergey M. Borisov, and Ingo Klimant. “Enhancing Photoinduced Electron Transfer
Efficiency of Fluorescent PH-Probes with Halogenated Phenols.” Analytical Chemistry.
ACS, 2014. https://doi.org/10.1021/ac502513g.
ieee: D. Aigner, S. A. Freunberger, M. Wilkening, R. Saf, S. M. Borisov, and I.
Klimant, “Enhancing photoinduced electron transfer efficiency of fluorescent pH-probes
with halogenated phenols,” Analytical Chemistry, vol. 86, no. 18. ACS,
pp. 9293–9300, 2014.
ista: Aigner D, Freunberger SA, Wilkening M, Saf R, Borisov SM, Klimant I. 2014.
Enhancing photoinduced electron transfer efficiency of fluorescent pH-probes with
halogenated phenols. Analytical Chemistry. 86(18), 9293–9300.
mla: Aigner, Daniel, et al. “Enhancing Photoinduced Electron Transfer Efficiency
of Fluorescent PH-Probes with Halogenated Phenols.” Analytical Chemistry,
vol. 86, no. 18, ACS, 2014, pp. 9293–300, doi:10.1021/ac502513g.
short: D. Aigner, S.A. Freunberger, M. Wilkening, R. Saf, S.M. Borisov, I. Klimant,
Analytical Chemistry 86 (2014) 9293–9300.
date_created: 2020-01-15T12:17:17Z
date_published: 2014-08-14T00:00:00Z
date_updated: 2021-01-12T08:12:53Z
day: '14'
doi: 10.1021/ac502513g
extern: '1'
intvolume: ' 86'
issue: '18'
language:
- iso: eng
month: '08'
oa_version: None
page: 9293-9300
publication: Analytical Chemistry
publication_identifier:
issn:
- 0003-2700
- 1520-6882
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: Enhancing photoinduced electron transfer efficiency of fluorescent pH-probes
with halogenated phenols
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 86
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
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
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: '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
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: '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
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: '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: '7768'
abstract:
- lang: eng
text: We investigate the vibrational modes of quasi-two-dimensional disordered colloidal
packings of hard colloidal spheres with short-range attractions as a function
of packing fraction. Certain properties of the vibrational density of states (vDOS)
are shown to correlate with the density and structure of the samples (i.e., in
sparsely versus densely packed samples). Specifically, a crossover from dense
glassy to sparse gel-like states is suggested by an excess of phonon modes at
low frequency and by a variation in the slope of the vDOS with frequency at low
frequency. This change in phonon mode distribution is demonstrated to arise largely
from localized vibrations that involve individual and/or small clusters of particles
with few local bonds. Conventional order parameters and void statistics did not
exhibit obvious gel-glass signatures as a function of volume fraction. These mode
behaviors and accompanying structural insights offer a potentially new set of
indicators for identification of glass-gel transitions and for assignment of gel-like
versus glass-like character to a disordered solid material.
article_number: '062305'
article_processing_charge: No
article_type: original
author:
- first_name: Matthew A.
full_name: Lohr, Matthew A.
last_name: Lohr
- first_name: Tim
full_name: Still, Tim
last_name: Still
- first_name: Raman
full_name: Ganti, Raman
last_name: Ganti
- first_name: Matthew D.
full_name: Gratale, Matthew D.
last_name: Gratale
- first_name: Zoey S.
full_name: Davidson, Zoey S.
last_name: Davidson
- first_name: Kevin B.
full_name: Aptowicz, Kevin B.
last_name: Aptowicz
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Daniel M.
full_name: Sussman, Daniel M.
last_name: Sussman
- first_name: A. G.
full_name: Yodh, A. G.
last_name: Yodh
citation:
ama: Lohr MA, Still T, Ganti R, et al. Vibrational and structural signatures of
the crossover between dense glassy and sparse gel-like attractive colloidal packings.
Physical Review E. 2014;90(6). doi:10.1103/physreve.90.062305
apa: Lohr, M. A., Still, T., Ganti, R., Gratale, M. D., Davidson, Z. S., Aptowicz,
K. B., … Yodh, A. G. (2014). Vibrational and structural signatures of the crossover
between dense glassy and sparse gel-like attractive colloidal packings. Physical
Review E. American Physical Society. https://doi.org/10.1103/physreve.90.062305
chicago: Lohr, Matthew A., Tim Still, Raman Ganti, Matthew D. Gratale, Zoey S. Davidson,
Kevin B. Aptowicz, Carl Peter Goodrich, Daniel M. Sussman, and A. G. Yodh. “Vibrational
and Structural Signatures of the Crossover between Dense Glassy and Sparse Gel-like
Attractive Colloidal Packings.” Physical Review E. American Physical Society,
2014. https://doi.org/10.1103/physreve.90.062305.
ieee: M. A. Lohr et al., “Vibrational and structural signatures of the crossover
between dense glassy and sparse gel-like attractive colloidal packings,” Physical
Review E, vol. 90, no. 6. American Physical Society, 2014.
ista: Lohr MA, Still T, Ganti R, Gratale MD, Davidson ZS, Aptowicz KB, Goodrich
CP, Sussman DM, Yodh AG. 2014. Vibrational and structural signatures of the crossover
between dense glassy and sparse gel-like attractive colloidal packings. Physical
Review E. 90(6), 062305.
mla: Lohr, Matthew A., et al. “Vibrational and Structural Signatures of the Crossover
between Dense Glassy and Sparse Gel-like Attractive Colloidal Packings.” Physical
Review E, vol. 90, no. 6, 062305, American Physical Society, 2014, doi:10.1103/physreve.90.062305.
short: M.A. Lohr, T. Still, R. Ganti, M.D. Gratale, Z.S. Davidson, K.B. Aptowicz,
C.P. Goodrich, D.M. Sussman, A.G. Yodh, Physical Review E 90 (2014).
date_created: 2020-04-30T11:41:54Z
date_published: 2014-12-05T00:00:00Z
date_updated: 2021-01-12T08:15:24Z
day: '05'
doi: 10.1103/physreve.90.062305
extern: '1'
intvolume: ' 90'
issue: '6'
language:
- iso: eng
month: '12'
oa_version: None
publication: Physical Review E
publication_identifier:
issn:
- 1539-3755
- 1550-2376
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Vibrational and structural signatures of the crossover between dense glassy
and sparse gel-like attractive colloidal packings
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 90
year: '2014'
...
---
_id: '7771'
abstract:
- lang: eng
text: 'In their Letter, Schreck, Bertrand, O''Hern and Shattuck [Phys. Rev. Lett.
107, 078301 (2011)] study nonlinearities in jammed particulate systems that arise
when contacts are altered. They conclude that there is "no harmonic regime in
the large system limit for all compressions" and "at jamming onset for any system
size." Their argument rests on the claim that for finite-range repulsive potentials,
of the form used in studies of jamming, the breaking or forming of a single contact
is sufficient to destroy the linear regime. We dispute these conclusions and argue
that linear response is both justified and essential for understanding the nature
of the jammed solid. '
article_number: '049801 '
article_processing_charge: No
article_type: letter_note
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: Goodrich CP, Liu AJ, Nagel SR. Comment on “Repulsive contact interactions make
jammed particulate systems inherently nonharmonic.” Physical Review Letters.
2014;112(4). doi:10.1103/physrevlett.112.049801
apa: Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2014). Comment on “Repulsive
contact interactions make jammed particulate systems inherently nonharmonic.”
Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.112.049801
chicago: Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Comment on ‘Repulsive
Contact Interactions Make Jammed Particulate Systems Inherently Nonharmonic.’”
Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/physrevlett.112.049801.
ieee: C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Comment on ‘Repulsive contact
interactions make jammed particulate systems inherently nonharmonic,’” Physical
Review Letters, vol. 112, no. 4. American Physical Society, 2014.
ista: Goodrich CP, Liu AJ, Nagel SR. 2014. Comment on “Repulsive contact interactions
make jammed particulate systems inherently nonharmonic”. Physical Review Letters.
112(4), 049801.
mla: Goodrich, Carl Peter, et al. “Comment on ‘Repulsive Contact Interactions Make
Jammed Particulate Systems Inherently Nonharmonic.’” Physical Review Letters,
vol. 112, no. 4, 049801, American Physical Society, 2014, doi:10.1103/physrevlett.112.049801.
short: C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 112 (2014).
date_created: 2020-04-30T11:42:39Z
date_published: 2014-04-20T00:00:00Z
date_updated: 2021-01-12T08:15:26Z
day: '20'
doi: 10.1103/physrevlett.112.049801
extern: '1'
external_id:
arxiv:
- '1306.1285'
intvolume: ' 112'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1306.1285
month: '04'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
issn:
- 0031-9007
- 1079-7114
publication_status: published
publisher: American Physical Society
status: public
title: Comment on “Repulsive contact interactions make jammed particulate systems
inherently nonharmonic”
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2014'
...
---
_id: '7772'
abstract:
- lang: eng
text: Particle tracking and displacement covariance matrix techniques are employed
to investigate the phonon dispersion relations of two-dimensional colloidal glasses
composed of soft, thermoresponsive microgel particles whose temperature-sensitive
size permits in situ variation of particle packing fraction. Bulk, B, and shear,
G, moduli of the colloidal glasses are extracted from the dispersion relations
as a function of packing fraction, and variation of the ratio G/B with packing
fraction is found to agree quantitatively with predictions for jammed packings
of frictional soft particles. In addition, G and B individually agree with numerical
predictions for frictional particles. This remarkable level of agreement enabled
us to extract an energy scale for the interparticle interaction from the individual
elastic constants and to derive an approximate estimate for the interparticle
friction coefficient.
article_number: '012301'
article_processing_charge: No
article_type: original
author:
- first_name: Tim
full_name: Still, Tim
last_name: Still
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Ke
full_name: Chen, Ke
last_name: Chen
- first_name: Peter J.
full_name: Yunker, Peter J.
last_name: Yunker
- first_name: Samuel
full_name: Schoenholz, Samuel
last_name: Schoenholz
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: A. G.
full_name: Yodh, A. G.
last_name: Yodh
citation:
ama: Still T, Goodrich CP, Chen K, et al. Phonon dispersion and elastic moduli of
two-dimensional disordered colloidal packings of soft particles with frictional
interactions. Physical Review E. 2014;89(1). doi:10.1103/physreve.89.012301
apa: Still, T., Goodrich, C. P., Chen, K., Yunker, P. J., Schoenholz, S., Liu, A.
J., & Yodh, A. G. (2014). Phonon dispersion and elastic moduli of two-dimensional
disordered colloidal packings of soft particles with frictional interactions.
Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.89.012301
chicago: Still, Tim, Carl Peter Goodrich, Ke Chen, Peter J. Yunker, Samuel Schoenholz,
Andrea J. Liu, and A. G. Yodh. “Phonon Dispersion and Elastic Moduli of Two-Dimensional
Disordered Colloidal Packings of Soft Particles with Frictional Interactions.”
Physical Review E. American Physical Society, 2014. https://doi.org/10.1103/physreve.89.012301.
ieee: T. Still et al., “Phonon dispersion and elastic moduli of two-dimensional
disordered colloidal packings of soft particles with frictional interactions,”
Physical Review E, vol. 89, no. 1. American Physical Society, 2014.
ista: Still T, Goodrich CP, Chen K, Yunker PJ, Schoenholz S, Liu AJ, Yodh AG. 2014.
Phonon dispersion and elastic moduli of two-dimensional disordered colloidal packings
of soft particles with frictional interactions. Physical Review E. 89(1), 012301.
mla: Still, Tim, et al. “Phonon Dispersion and Elastic Moduli of Two-Dimensional
Disordered Colloidal Packings of Soft Particles with Frictional Interactions.”
Physical Review E, vol. 89, no. 1, 012301, American Physical Society, 2014,
doi:10.1103/physreve.89.012301.
short: T. Still, C.P. Goodrich, K. Chen, P.J. Yunker, S. Schoenholz, A.J. Liu, A.G.
Yodh, Physical Review E 89 (2014).
date_created: 2020-04-30T11:43:02Z
date_published: 2014-01-03T00:00:00Z
date_updated: 2021-01-12T08:15:26Z
day: '03'
doi: 10.1103/physreve.89.012301
extern: '1'
intvolume: ' 89'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
publication: Physical Review E
publication_identifier:
issn:
- 1539-3755
- 1550-2376
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Phonon dispersion and elastic moduli of two-dimensional disordered colloidal
packings of soft particles with frictional interactions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2014'
...
---
_id: '7773'
abstract:
- lang: eng
text: 'For more than a century, physicists have described real solids in terms of
perturbations about perfect crystalline order1. Such an approach takes us only
so far: a glass, another ubiquitous form of rigid matter, cannot be described
in any meaningful sense as a defected crystal2. Is there an opposite extreme to
a crystal—a solid with complete disorder—that forms an alternative starting point
for understanding real materials? Here, we argue that the solid comprising particles
with finite-ranged interactions at the jamming transition3,4,5 constitutes such
a limit. It has been shown that the physics associated with this transition can
be extended to interactions that are long ranged6. We demonstrate that jamming
physics is not restricted to amorphous systems, but dominates the behaviour of
solids with surprisingly high order. Just as the free-electron and tight-binding
models represent two idealized cases from which to understand electronic structure1,
we identify two extreme limits of mechanical behaviour. Thus, the physics of jamming
can be set side by side with the physics of crystals to provide an organizing
structure for understanding the mechanical properties of solids over the entire
spectrum of disorder.'
article_processing_charge: No
article_type: original
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: Goodrich CP, Liu AJ, Nagel SR. Solids between the mechanical extremes of order
and disorder. Nature Physics. 2014;10(8):578-581. doi:10.1038/nphys3006
apa: Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2014). Solids between the
mechanical extremes of order and disorder. Nature Physics. Springer Nature.
https://doi.org/10.1038/nphys3006
chicago: Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Solids between
the Mechanical Extremes of Order and Disorder.” Nature Physics. Springer
Nature, 2014. https://doi.org/10.1038/nphys3006.
ieee: C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Solids between the mechanical
extremes of order and disorder,” Nature Physics, vol. 10, no. 8. Springer
Nature, pp. 578–581, 2014.
ista: Goodrich CP, Liu AJ, Nagel SR. 2014. Solids between the mechanical extremes
of order and disorder. Nature Physics. 10(8), 578–581.
mla: Goodrich, Carl Peter, et al. “Solids between the Mechanical Extremes of Order
and Disorder.” Nature Physics, vol. 10, no. 8, Springer Nature, 2014, pp.
578–81, doi:10.1038/nphys3006.
short: C.P. Goodrich, A.J. Liu, S.R. Nagel, Nature Physics 10 (2014) 578–581.
date_created: 2020-04-30T11:43:29Z
date_published: 2014-07-06T00:00:00Z
date_updated: 2021-01-12T08:15:26Z
day: '06'
doi: 10.1038/nphys3006
extern: '1'
intvolume: ' 10'
issue: '8'
language:
- iso: eng
month: '07'
oa_version: None
page: 578-581
publication: Nature Physics
publication_identifier:
issn:
- 1745-2473
- 1745-2481
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Solids between the mechanical extremes of order and disorder
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2014'
...
---
_id: '7769'
abstract:
- lang: eng
text: 'Athermal packings of soft repulsive spheres exhibit a sharp jamming transition
in the thermodynamic limit. Upon further compression, various structural and mechanical
properties display clean power-law behavior over many decades in pressure. As
with any phase transition, the rounding of such behavior in finite systems close
to the transition plays an important role in understanding the nature of the transition
itself. The situation for jamming is surprisingly rich: the assumption that jammed
packings are isotropic is only strictly true in the large-size limit, and finite-size
has a profound effect on the very meaning of jamming. Here, we provide a comprehensive
numerical study of finite-size effects in sphere packings above the jamming transition,
focusing on stability as well as the scaling of the contact number and the elastic
response.'
article_number: '022138'
article_processing_charge: No
article_type: original
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Simon
full_name: Dagois-Bohy, Simon
last_name: Dagois-Bohy
- first_name: Brian P.
full_name: Tighe, Brian P.
last_name: Tighe
- first_name: Martin
full_name: van Hecke, Martin
last_name: van Hecke
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: 'Goodrich CP, Dagois-Bohy S, Tighe BP, van Hecke M, Liu AJ, Nagel SR. Jamming
in finite systems: Stability, anisotropy, fluctuations, and scaling. Physical
Review E. 2014;90(2). doi:10.1103/physreve.90.022138'
apa: 'Goodrich, C. P., Dagois-Bohy, S., Tighe, B. P., van Hecke, M., Liu, A. J.,
& Nagel, S. R. (2014). Jamming in finite systems: Stability, anisotropy, fluctuations,
and scaling. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.90.022138'
chicago: 'Goodrich, Carl Peter, Simon Dagois-Bohy, Brian P. Tighe, Martin van Hecke,
Andrea J. Liu, and Sidney R. Nagel. “Jamming in Finite Systems: Stability, Anisotropy,
Fluctuations, and Scaling.” Physical Review E. American Physical Society,
2014. https://doi.org/10.1103/physreve.90.022138.'
ieee: 'C. P. Goodrich, S. Dagois-Bohy, B. P. Tighe, M. van Hecke, A. J. Liu, and
S. R. Nagel, “Jamming in finite systems: Stability, anisotropy, fluctuations,
and scaling,” Physical Review E, vol. 90, no. 2. American Physical Society,
2014.'
ista: 'Goodrich CP, Dagois-Bohy S, Tighe BP, van Hecke M, Liu AJ, Nagel SR. 2014.
Jamming in finite systems: Stability, anisotropy, fluctuations, and scaling. Physical
Review E. 90(2), 022138.'
mla: 'Goodrich, Carl Peter, et al. “Jamming in Finite Systems: Stability, Anisotropy,
Fluctuations, and Scaling.” Physical Review E, vol. 90, no. 2, 022138,
American Physical Society, 2014, doi:10.1103/physreve.90.022138.'
short: C.P. Goodrich, S. Dagois-Bohy, B.P. Tighe, M. van Hecke, A.J. Liu, S.R. Nagel,
Physical Review E 90 (2014).
date_created: 2020-04-30T11:42:09Z
date_published: 2014-08-27T00:00:00Z
date_updated: 2021-01-12T08:15:24Z
day: '27'
doi: 10.1103/physreve.90.022138
extern: '1'
intvolume: ' 90'
issue: '2'
language:
- iso: eng
month: '08'
oa_version: None
publication: Physical Review E
publication_identifier:
issn:
- 1539-3755
- 1550-2376
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: 'Jamming in finite systems: Stability, anisotropy, fluctuations, and scaling'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 90
year: '2014'
...
---
_id: '7770'
abstract:
- lang: eng
text: Packings of frictionless athermal particles that interact only when they overlap
experience a jamming transition as a function of packing density. Such packings
provide the foundation for the theory of jamming. This theory rests on the observation
that, despite the multitude of disordered configurations, the mechanical response
to linear order depends only on the distance to the transition. We investigate
the validity and utility of such measurements that invoke the harmonic approximation
and show that, despite particles coming in and out of contact, there is a well-defined
linear regime in the thermodynamic limit.
article_number: '022201'
article_processing_charge: No
article_type: original
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Andrea J.
full_name: Liu, Andrea J.
last_name: Liu
- first_name: Sidney R.
full_name: Nagel, Sidney R.
last_name: Nagel
citation:
ama: Goodrich CP, Liu AJ, Nagel SR. Contact nonlinearities and linear response in
jammed particulate packings. Physical Review E. 2014;90(2). doi:10.1103/physreve.90.022201
apa: Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2014). Contact nonlinearities
and linear response in jammed particulate packings. Physical Review E.
American Physical Society. https://doi.org/10.1103/physreve.90.022201
chicago: Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Contact Nonlinearities
and Linear Response in Jammed Particulate Packings.” Physical Review E.
American Physical Society, 2014. https://doi.org/10.1103/physreve.90.022201.
ieee: C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Contact nonlinearities and linear
response in jammed particulate packings,” Physical Review E, vol. 90, no.
2. American Physical Society, 2014.
ista: Goodrich CP, Liu AJ, Nagel SR. 2014. Contact nonlinearities and linear response
in jammed particulate packings. Physical Review E. 90(2), 022201.
mla: Goodrich, Carl Peter, et al. “Contact Nonlinearities and Linear Response in
Jammed Particulate Packings.” Physical Review E, vol. 90, no. 2, 022201,
American Physical Society, 2014, doi:10.1103/physreve.90.022201.
short: C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review E 90 (2014).
date_created: 2020-04-30T11:42:24Z
date_published: 2014-08-04T00:00:00Z
date_updated: 2021-01-12T08:15:25Z
day: '04'
doi: 10.1103/physreve.90.022201
extern: '1'
intvolume: ' 90'
issue: '2'
language:
- iso: eng
month: '08'
oa_version: None
publication: Physical Review E
publication_identifier:
issn:
- 1539-3755
- 1550-2376
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Contact nonlinearities and linear response in jammed particulate packings
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 90
year: '2014'
...
---
_id: '8021'
abstract:
- lang: eng
text: 'Most excitatory inputs in the mammalian brain are made on dendritic spines,
rather than on dendritic shafts. Spines compartmentalize calcium, and this biochemical
isolation can underlie input-specific synaptic plasticity, providing a raison
d''etre for spines. However, recent results indicate that the spine can experience
a membrane potential different from that in the parent dendrite, as though the
spine neck electrically isolated the spine. Here we use two-photon calcium imaging
of mouse neocortical pyramidal neurons to analyze the correlation between the
morphologies of spines activated under minimal synaptic stimulation and the excitatory
postsynaptic potentials they generate. We find that excitatory postsynaptic potential
amplitudes are inversely correlated with spine neck lengths. Furthermore, a spike
timing-dependent plasticity protocol, in which two-photon glutamate uncaging over
a spine is paired with postsynaptic spikes, produces rapid shrinkage of the spine
neck and concomitant increases in the amplitude of the evoked spine potentials.
Using numerical simulations, we explore the parameter regimes for the spine neck
resistance and synaptic conductance changes necessary to explain our observations.
Our data, directly correlating synaptic and morphological plasticity, imply that
long-necked spines have small or negligible somatic voltage contributions, but
that, upon synaptic stimulation paired with postsynaptic activity, they can shorten
their necks and increase synaptic efficacy, thus changing the input/output gain
of pyramidal neurons. '
article_processing_charge: No
article_type: original
author:
- first_name: R.
full_name: Araya, R.
last_name: Araya
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
- first_name: R.
full_name: Yuste, R.
last_name: Yuste
citation:
ama: Araya R, Vogels TP, Yuste R. Activity-dependent dendritic spine neck changes
are correlated with synaptic strength. Proceedings of the National Academy
of Sciences. 2014;111(28):E2895-E2904. doi:10.1073/pnas.1321869111
apa: Araya, R., Vogels, T. P., & Yuste, R. (2014). Activity-dependent dendritic
spine neck changes are correlated with synaptic strength. Proceedings of the
National Academy of Sciences. Proceedings of the National Academy of Sciences.
https://doi.org/10.1073/pnas.1321869111
chicago: Araya, R., Tim P Vogels, and R. Yuste. “Activity-Dependent Dendritic Spine
Neck Changes Are Correlated with Synaptic Strength.” Proceedings of the National
Academy of Sciences. Proceedings of the National Academy of Sciences, 2014.
https://doi.org/10.1073/pnas.1321869111.
ieee: R. Araya, T. P. Vogels, and R. Yuste, “Activity-dependent dendritic spine
neck changes are correlated with synaptic strength,” Proceedings of the National
Academy of Sciences, vol. 111, no. 28. Proceedings of the National Academy
of Sciences, pp. E2895–E2904, 2014.
ista: Araya R, Vogels TP, Yuste R. 2014. Activity-dependent dendritic spine neck
changes are correlated with synaptic strength. Proceedings of the National Academy
of Sciences. 111(28), E2895–E2904.
mla: Araya, R., et al. “Activity-Dependent Dendritic Spine Neck Changes Are Correlated
with Synaptic Strength.” Proceedings of the National Academy of Sciences,
vol. 111, no. 28, Proceedings of the National Academy of Sciences, 2014, pp. E2895–904,
doi:10.1073/pnas.1321869111.
short: R. Araya, T.P. Vogels, R. Yuste, Proceedings of the National Academy of Sciences
111 (2014) E2895–E2904.
date_created: 2020-06-25T13:06:24Z
date_published: 2014-07-15T00:00:00Z
date_updated: 2021-01-12T08:16:34Z
day: '15'
doi: 10.1073/pnas.1321869111
extern: '1'
external_id:
pmid:
- '24982196'
intvolume: ' 111'
issue: '28'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4104910/
month: '07'
oa: 1
oa_version: Published Version
page: E2895-E2904
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
status: public
title: Activity-dependent dendritic spine neck changes are correlated with synaptic
strength
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 111
year: '2014'
...
---
_id: '8023'
abstract:
- lang: eng
text: Uniform random sparse network architectures are ubiquitous in computational
neuroscience, but the implicit hypothesis that they are a good representation
of real neuronal networks has been met with skepticism. Here we used two experimental
data sets, a study of triplet connectivity statistics and a data set measuring
neuronal responses to channelrhodopsin stimuli, to evaluate the fidelity of thousands
of model networks. Network architectures comprised three neuron types (excitatory,
fast spiking, and nonfast spiking inhibitory) and were created from a set of rules
that govern the statistics of the resulting connection types. In a high-dimensional
parameter scan, we varied the degree distributions (i.e., how many cells each
neuron connects with) and the synaptic weight correlations of synapses from or
onto the same neuron. These variations converted initially uniform random and
homogeneously connected networks, in which every neuron sent and received equal
numbers of synapses with equal synaptic strength distributions, to highly heterogeneous
networks in which the number of synapses per neuron, as well as average synaptic
strength of synapses from or to a neuron were variable. By evaluating the impact
of each variable on the network structure and dynamics, and their similarity to
the experimental data, we could falsify the uniform random sparse connectivity
hypothesis for 7 of 36 connectivity parameters, but we also confirmed the hypothesis
in 8 cases. Twenty-one parameters had no substantial impact on the results of
the test protocols we used.
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Tomm, Christian
last_name: Tomm
- first_name: Michael
full_name: Avermann, Michael
last_name: Avermann
- first_name: Carl
full_name: Petersen, Carl
last_name: Petersen
- first_name: Wulfram
full_name: Gerstner, Wulfram
last_name: Gerstner
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: Tomm C, Avermann M, Petersen C, Gerstner W, Vogels TP. Connection-type-specific
biases make uniform random network models consistent with cortical recordings.
Journal of Neurophysiology. 2014;112(8):1801-1814. doi:10.1152/jn.00629.2013
apa: Tomm, C., Avermann, M., Petersen, C., Gerstner, W., & Vogels, T. P. (2014).
Connection-type-specific biases make uniform random network models consistent
with cortical recordings. Journal of Neurophysiology. American Physiological
Society. https://doi.org/10.1152/jn.00629.2013
chicago: Tomm, Christian, Michael Avermann, Carl Petersen, Wulfram Gerstner, and
Tim P Vogels. “Connection-Type-Specific Biases Make Uniform Random Network Models
Consistent with Cortical Recordings.” Journal of Neurophysiology. American
Physiological Society, 2014. https://doi.org/10.1152/jn.00629.2013.
ieee: C. Tomm, M. Avermann, C. Petersen, W. Gerstner, and T. P. Vogels, “Connection-type-specific
biases make uniform random network models consistent with cortical recordings,”
Journal of Neurophysiology, vol. 112, no. 8. American Physiological Society,
pp. 1801–1814, 2014.
ista: Tomm C, Avermann M, Petersen C, Gerstner W, Vogels TP. 2014. Connection-type-specific
biases make uniform random network models consistent with cortical recordings.
Journal of Neurophysiology. 112(8), 1801–1814.
mla: Tomm, Christian, et al. “Connection-Type-Specific Biases Make Uniform Random
Network Models Consistent with Cortical Recordings.” Journal of Neurophysiology,
vol. 112, no. 8, American Physiological Society, 2014, pp. 1801–14, doi:10.1152/jn.00629.2013.
short: C. Tomm, M. Avermann, C. Petersen, W. Gerstner, T.P. Vogels, Journal of Neurophysiology
112 (2014) 1801–1814.
date_created: 2020-06-25T13:08:30Z
date_published: 2014-10-15T00:00:00Z
date_updated: 2021-01-12T08:16:35Z
day: '15'
ddc:
- '570'
doi: 10.1152/jn.00629.2013
extern: '1'
external_id:
pmid:
- '24944218'
file:
- access_level: open_access
checksum: 7c06a086da6f924342650de6dc555c3f
content_type: application/pdf
creator: cziletti
date_created: 2020-07-16T10:12:13Z
date_updated: 2020-07-16T10:12:13Z
file_id: '8122'
file_name: 2014_JNeurophysiol_Tomm.pdf
file_size: 1632295
relation: main_file
success: 1
file_date_updated: 2020-07-16T10:12:13Z
has_accepted_license: '1'
intvolume: ' 112'
issue: '8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '10'
oa: 1
oa_version: Published Version
page: 1801-1814
pmid: 1
publication: Journal of Neurophysiology
publication_identifier:
eissn:
- 1522-1598
issn:
- 0022-3077
publication_status: published
publisher: American Physiological Society
quality_controlled: '1'
status: public
title: Connection-type-specific biases make uniform random network models consistent
with cortical recordings
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 112
year: '2014'
...