---
_id: '1132'
abstract:
- lang: eng
text: The hippocampus is thought to initiate systems-wide mnemonic processes through
the reactivation of previously acquired spatial and episodic memory traces, which
can recruit the entorhinal cortex as a first stage of memory redistribution to
other brain areas. Hippocampal reactivation occurs during sharp wave-ripples,
in which synchronous network firing encodes sequences of places.We investigated
the coordination of this replay by recording assembly activity simultaneously
in the CA1 region of the hippocampus and superficial layers of the medial entorhinal
cortex. We found that entorhinal cell assemblies can replay trajectories independently
of the hippocampus and sharp wave-ripples. This suggests that the hippocampus
is not the sole initiator of spatial and episodic memory trace reactivation. Memory
systems involved in these processes may include nonhierarchical, parallel components.
article_processing_charge: No
author:
- first_name: Joseph
full_name: O'Neill, Joseph
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Charlotte
full_name: Boccara, Charlotte
id: 3FC06552-F248-11E8-B48F-1D18A9856A87
last_name: Boccara
orcid: 0000-0001-7237-5109
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Philipp
full_name: Schönenberger, Philipp
id: 3B9D816C-F248-11E8-B48F-1D18A9856A87
last_name: Schönenberger
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: O’Neill J, Boccara CN, Stella F, Schönenberger P, Csicsvari JL. Superficial
layers of the medial entorhinal cortex replay independently of the hippocampus.
Science. 2017;355(6321):184-188. doi:10.1126/science.aag2787
apa: O’Neill, J., Boccara, C. N., Stella, F., Schönenberger, P., & Csicsvari,
J. L. (2017). Superficial layers of the medial entorhinal cortex replay independently
of the hippocampus. Science. American Association for the Advancement of
Science. https://doi.org/10.1126/science.aag2787
chicago: O’Neill, Joseph, Charlotte N. Boccara, Federico Stella, Philipp Schönenberger,
and Jozsef L Csicsvari. “Superficial Layers of the Medial Entorhinal Cortex Replay
Independently of the Hippocampus.” Science. American Association for the
Advancement of Science, 2017. https://doi.org/10.1126/science.aag2787.
ieee: J. O’Neill, C. N. Boccara, F. Stella, P. Schönenberger, and J. L. Csicsvari,
“Superficial layers of the medial entorhinal cortex replay independently of the
hippocampus,” Science, vol. 355, no. 6321. American Association for the
Advancement of Science, pp. 184–188, 2017.
ista: O’Neill J, Boccara CN, Stella F, Schönenberger P, Csicsvari JL. 2017. Superficial
layers of the medial entorhinal cortex replay independently of the hippocampus.
Science. 355(6321), 184–188.
mla: O’Neill, Joseph, et al. “Superficial Layers of the Medial Entorhinal Cortex
Replay Independently of the Hippocampus.” Science, vol. 355, no. 6321,
American Association for the Advancement of Science, 2017, pp. 184–88, doi:10.1126/science.aag2787.
short: J. O’Neill, C.N. Boccara, F. Stella, P. Schönenberger, J.L. Csicsvari, Science
355 (2017) 184–188.
date_created: 2018-12-11T11:50:19Z
date_published: 2017-01-13T00:00:00Z
date_updated: 2025-07-10T11:50:09Z
day: '13'
ddc:
- '571'
department:
- _id: JoCs
doi: 10.1126/science.aag2787
ec_funded: 1
external_id:
isi:
- '000391743700044'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:22Z
date_updated: 2018-12-12T10:10:22Z
file_id: '4809'
file_name: IST-2018-976-v1+1_2017Preprint_ONeill_Superficial_layers.pdf
file_size: 3761201
relation: main_file
file_date_updated: 2018-12-12T10:10:22Z
has_accepted_license: '1'
intvolume: ' 355'
isi: 1
issue: '6321'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 184 - 188
project:
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
publication: Science
publication_identifier:
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '6226'
pubrep_id: '976'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Superficial layers of the medial entorhinal cortex replay independently of
the hippocampus
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 355
year: '2017'
...
---
_id: '1133'
abstract:
- lang: eng
text: 'It is a common knowledge that an effective interaction of a quantum impurity
with an electromagnetic field can be screened by surrounding charge carriers,
whether mobile or static. Here we demonstrate that very strong, "anomalous" screening
can take place in the presence of a neutral, weakly polarizable environment, due
to an exchange of orbital angular momentum between the impurity and the bath.
Furthermore, we show that it is possible to generalize all phenomena related to
isolated impurities in an external field to the case when a many-body environment
is present, by casting the problem in terms of the angulon quasiparticle. As a
result, the relevant observables such as the effective Rabi frequency, geometric
phase, and impurity spatial alignment are straightforward to evaluate in terms
of a single parameter: the angular-momentum-dependent screening factor.'
article_number: '085302'
article_processing_charge: No
arxiv: 1
author:
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Yakaboylu E, Lemeshko M. Anomalous screening of quantum impurities by a neutral
environment. Physical Review Letters. 2017;118(8). doi:10.1103/PhysRevLett.118.085302
apa: Yakaboylu, E., & Lemeshko, M. (2017). Anomalous screening of quantum impurities
by a neutral environment. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/PhysRevLett.118.085302
chicago: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anomalous Screening of Quantum
Impurities by a Neutral Environment.” Physical Review Letters. American
Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.118.085302.
ieee: E. Yakaboylu and M. Lemeshko, “Anomalous screening of quantum impurities by
a neutral environment,” Physical Review Letters, vol. 118, no. 8. American
Physical Society, 2017.
ista: Yakaboylu E, Lemeshko M. 2017. Anomalous screening of quantum impurities by
a neutral environment. Physical Review Letters. 118(8), 085302.
mla: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anomalous Screening of Quantum
Impurities by a Neutral Environment.” Physical Review Letters, vol. 118,
no. 8, 085302, American Physical Society, 2017, doi:10.1103/PhysRevLett.118.085302.
short: E. Yakaboylu, M. Lemeshko, Physical Review Letters 118 (2017).
date_created: 2018-12-11T11:50:19Z
date_published: 2017-02-22T00:00:00Z
date_updated: 2025-06-04T08:38:44Z
day: '22'
department:
- _id: MiLe
doi: 10.1103/PhysRevLett.118.085302
ec_funded: 1
external_id:
arxiv:
- '1612.02820'
isi:
- '000394667600003'
intvolume: ' 118'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.02820
month: '02'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review Letters
publication_identifier:
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
publist_id: '6225'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anomalous screening of quantum impurities by a neutral environment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2017'
...
---
_id: '1000'
abstract:
- lang: eng
text: 'We study probabilistic models of natural images and extend the autoregressive
family of PixelCNN models by incorporating latent variables. Subsequently, we
describe two new generative image models that exploit different image transformations
as latent variables: a quantized grayscale view of the image or a multi-resolution
image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN
models: 1) their tendency to focus on low-level image details, while largely ignoring
high-level image information, such as object shapes, and 2) their computationally
costly procedure for image sampling. We experimentally demonstrate benefits of
our LatentPixelCNN models, in particular showing that they produce much more realistically
looking image samples than previous state-of-the-art probabilistic models. '
acknowledgement: We thank Tim Salimans for spotting a mistake in our preliminary arXiv
manuscript. This work was funded by the European Research Council under the European
Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural
image modeling. In: 34th International Conference on Machine Learning.
Vol 70. JMLR; 2017:1905-1914.'
apa: 'Kolesnikov, A., & Lampert, C. (2017). PixelCNN models with auxiliary variables
for natural image modeling. In 34th International Conference on Machine Learning
(Vol. 70, pp. 1905–1914). Sydney, Australia: JMLR.'
chicago: Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary
Variables for Natural Image Modeling.” In 34th International Conference on
Machine Learning, 70:1905–14. JMLR, 2017.
ieee: A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for
natural image modeling,” in 34th International Conference on Machine Learning,
Sydney, Australia, 2017, vol. 70, pp. 1905–1914.
ista: 'Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for
natural image modeling. 34th International Conference on Machine Learning. ICML:
International Conference on Machine Learning vol. 70, 1905–1914.'
mla: Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary
Variables for Natural Image Modeling.” 34th International Conference on Machine
Learning, vol. 70, JMLR, 2017, pp. 1905–14.
short: A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine
Learning, JMLR, 2017, pp. 1905–1914.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
date_created: 2018-12-11T11:49:37Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2025-04-15T07:10:22Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1612.08185'
isi:
- '000683309501102'
has_accepted_license: '1'
intvolume: ' 70'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.08185
month: '08'
oa: 1
oa_version: Submitted Version
page: 1905 - 1914
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: 34th International Conference on Machine Learning
publication_identifier:
isbn:
- 978-151085514-4
publication_status: published
publisher: JMLR
publist_id: '6398'
quality_controlled: '1'
scopus_import: '1'
status: public
title: PixelCNN models with auxiliary variables for natural image modeling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2017'
...
---
_id: '1003'
abstract:
- lang: eng
text: Network games (NGs) are played on directed graphs and are extensively used
in network design and analysis. Search problems for NGs include finding special
strategy profiles such as a Nash equilibrium and a globally optimal solution.
The networks modeled by NGs may be huge. In formal verification, abstraction has
proven to be an extremely effective technique for reasoning about systems with
big and even infinite state spaces. We describe an abstraction-refinement methodology
for reasoning about NGs. Our methodology is based on an abstraction function that
maps the state space of an NG to a much smaller state space. We search for a global
optimum and a Nash equilibrium by reasoning on an under- and an overapproximation
defined on top of this smaller state space. When the approximations are too coarse
to find such profiles, we refine the abstraction function. Our experimental results
demonstrate the efficiency of the methodology.
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning
about network games. In: AAAI Press; 2017:70-76. doi:10.24963/ijcai.2017/11'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2017). An abstraction-refinement
methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI:
International Joint Conference on Artificial Intelligence , Melbourne, Australia:
AAAI Press. https://doi.org/10.24963/ijcai.2017/11'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement
Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. https://doi.org/10.24963/ijcai.2017/11.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology
for reasoning about network games,” presented at the IJCAI: International Joint
Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.'
ista: 'Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology
for reasoning about network games. IJCAI: International Joint Conference on Artificial
Intelligence , 70–76.'
mla: Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about
Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.
short: G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.
conference:
end_date: 2017-08-25
location: Melbourne, Australia
name: 'IJCAI: International Joint Conference on Artificial Intelligence '
start_date: 2017-08-19
date_created: 2018-12-11T11:49:38Z
date_published: 2017-05-30T00:00:00Z
date_updated: 2025-07-10T11:49:38Z
day: '30'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.24963/ijcai.2017/11
external_id:
isi:
- '000764137500011'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:58Z
date_updated: 2018-12-12T10:16:58Z
file_id: '5249'
file_name: IST-2017-818-v1+1_allIJCAI_CR.pdf
file_size: 365172
relation: main_file
file_date_updated: 2018-12-12T10:16:58Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 70 - 76
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
issn:
- 1045-0823
publication_status: published
publisher: AAAI Press
publist_id: '6395'
pubrep_id: '818'
quality_controlled: '1'
related_material:
record:
- id: '6006'
relation: later_version
status: public
scopus_import: '1'
status: public
title: An abstraction-refinement methodology for reasoning about network games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '1006'
abstract:
- lang: eng
text: 'Background: The phenomenon of immune priming, i.e. enhanced protection following
a secondary exposure to a pathogen, has now been demonstrated in a wide range
of invertebrate species. Despite accumulating phenotypic evidence, knowledge of
its mechanistic underpinnings is currently very limited. Here we used the system
of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus
thuringiensis (Bt) to further our molecular understanding of the oral immune priming
phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants)
of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon
later challenge exposure, using a whole-transcriptome sequencing approach. Results:
Whereas gene expression of individuals primed with the orally non-pathogenic strain
showed minor changes to controls, we found that priming with the pathogenic strain
induced regulation of a large set of distinct genes, many of which are known immune
candidates. Intriguingly, the immune repertoire activated upon priming and subsequent
challenge qualitatively differed from the one mounted upon infection with Bt without
previous priming. Moreover, a large subset of priming-specific genes showed an
inverse regulation compared to their regulation upon challenge only. Conclusions:
Our data demonstrate that gene expression upon infection is strongly affected
by previous immune priming. We hypothesise that this shift in gene expression
indicates activation of a more targeted and efficient response towards a previously
encountered pathogen, in anticipation of potential secondary encounter.'
article_processing_charge: No
author:
- first_name: Jenny
full_name: Greenwood, Jenny
last_name: Greenwood
- first_name: Barbara
full_name: Milutinovic, Barbara
id: 2CDC32B8-F248-11E8-B48F-1D18A9856A87
last_name: Milutinovic
orcid: 0000-0002-8214-4758
- first_name: Robert
full_name: Peuß, Robert
last_name: Peuß
- first_name: Sarah
full_name: Behrens, Sarah
last_name: Behrens
- first_name: Daniela
full_name: Essar, Daniela
last_name: Essar
- first_name: Philip
full_name: Rosenstiel, Philip
last_name: Rosenstiel
- first_name: Hinrich
full_name: Schulenburg, Hinrich
last_name: Schulenburg
- first_name: Joachim
full_name: Kurtz, Joachim
last_name: Kurtz
citation:
ama: Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus
thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae.
BMC Genomics. 2017;18(1):329. doi:10.1186/s12864-017-3705-7
apa: Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel,
P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces
a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics.
BioMed Central. https://doi.org/10.1186/s12864-017-3705-7
chicago: Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela
Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune
Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of
Tribolium Castaneum Larvae.” BMC Genomics. BioMed Central, 2017. https://doi.org/10.1186/s12864-017-3705-7.
ieee: J. Greenwood et al., “Oral immune priming with Bacillus thuringiensis
induces a shift in the gene expression of Tribolium castaneum larvae,” BMC
Genomics, vol. 18, no. 1. BioMed Central, p. 329, 2017.
ista: Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg
H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift
in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.
mla: Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces
a Shift in the Gene Expression of Tribolium Castaneum Larvae.” BMC Genomics,
vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:10.1186/s12864-017-3705-7.
short: J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel,
H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.
date_created: 2018-12-11T11:49:39Z
date_published: 2017-04-26T00:00:00Z
date_updated: 2025-07-10T11:49:40Z
day: '26'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1186/s12864-017-3705-7
external_id:
isi:
- '000400625200004'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:46Z
date_updated: 2018-12-12T10:16:46Z
file_id: '5236'
file_name: IST-2017-814-v1+1_s12864-017-3705-7.pdf
file_size: 2379672
relation: main_file
file_date_updated: 2018-12-12T10:16:46Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '329'
publication: BMC Genomics
publication_identifier:
issn:
- 1471-2164
publication_status: published
publisher: BioMed Central
publist_id: '6392'
pubrep_id: '814'
quality_controlled: '1'
related_material:
record:
- id: '9859'
relation: research_data
status: public
- id: '9860'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Oral immune priming with Bacillus thuringiensis induces a shift in the gene
expression of Tribolium castaneum larvae
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: 18
year: '2017'
...
---
_id: '1007'
abstract:
- lang: eng
text: 'A nonlinear system possesses an invariance with respect to a set of transformations
if its output dynamics remain invariant when transforming the input, and adjusting
the initial condition accordingly. Most research has focused on invariances with
respect to time-independent pointwise transformations like translational-invariance
(u(t) -> u(t) + p, p in R) or scale-invariance (u(t) -> pu(t), p in R>0).
In this article, we introduce the concept of s0-invariances with respect to continuous
input transformations exponentially growing/decaying over time. We show that s0-invariant
systems not only encompass linear time-invariant (LTI) systems with transfer functions
having an irreducible zero at s0 in R, but also that the input/output relationship
of nonlinear s0-invariant systems possesses properties well known from their linear
counterparts. Furthermore, we extend the concept of s0-invariances to second-
and higher-order s0-invariances, corresponding to invariances with respect to
transformations of the time-derivatives of the input, and encompassing LTI systems
with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant
systems realize – under mild conditions – nth-order nonlinear differential operators:
when excited by an input of a characteristic functional form, the system’s output
converges to a constant value only depending on the nth (nonlinear) derivative
of the input.'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Eduardo
full_name: Sontag, Eduardo
last_name: Sontag
citation:
ama: Lang M, Sontag E. Zeros of nonlinear systems with input invariances. Automatica.
2017;81C:46-55. doi:10.1016/j.automatica.2017.03.030
apa: Lang, M., & Sontag, E. (2017). Zeros of nonlinear systems with input invariances.
Automatica. International Federation of Automatic Control. https://doi.org/10.1016/j.automatica.2017.03.030
chicago: Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input
Invariances.” Automatica. International Federation of Automatic Control,
2017. https://doi.org/10.1016/j.automatica.2017.03.030.
ieee: M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,”
Automatica, vol. 81C. International Federation of Automatic Control, pp.
46–55, 2017.
ista: Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances.
Automatica. 81C, 46–55.
mla: Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.”
Automatica, vol. 81C, International Federation of Automatic Control, 2017,
pp. 46–55, doi:10.1016/j.automatica.2017.03.030.
short: M. Lang, E. Sontag, Automatica 81C (2017) 46–55.
date_created: 2018-12-11T11:49:39Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-04-15T06:50:01Z
day: '01'
ddc:
- '000'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1016/j.automatica.2017.03.030
ec_funded: 1
external_id:
isi:
- '000403513900006'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:29Z
date_updated: 2018-12-12T10:11:29Z
file_id: '4884'
file_name: IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf
file_size: 1401954
relation: main_file
file_date_updated: 2018-12-12T10:11:29Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 46 - 55
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Automatica
publication_identifier:
issn:
- 0005-1098
publication_status: published
publisher: International Federation of Automatic Control
publist_id: '6391'
pubrep_id: '813'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zeros of nonlinear systems with input invariances
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: 81C
year: '2017'
...
---
_id: '1009'
abstract:
- lang: eng
text: A standard objective in partially-observable Markov decision processes (POMDPs)
is to find a policy that maximizes the expected discounted-sum payoff. However,
such policies may still permit unlikely but highly undesirable outcomes, which
is problematic especially in safety-critical applications. Recently, there has
been a surge of interest in POMDPs where the goal is to maximize the probability
to ensure that the payoff is at least a given threshold, but these approaches
do not consider any optimization beyond satisfying this threshold constraint.
In this work we go beyond both the “expectation” and “threshold” approaches and
consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we
are given a threshold t and the objective is to find a policy σ such that a) each
possible outcome of σ yields a discounted-sum payoff of at least t, and b) the
expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies
satisfying a). We present a practical approach to tackle the GPO problem and evaluate
it on standard POMDP benchmarks.
acknowledgement: 'he research leading to these results was supported by the Austrian
Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants
(279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund
(WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions)
of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant
agreement no. [291734].'
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: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Guillermo
full_name: Pérez, Guillermo
last_name: Pérez
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
- first_name: Djordje
full_name: Zikelic, Djordje
last_name: Zikelic
citation:
ama: 'Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation
with guarantees in POMDPs. In: Proceedings of the 31st AAAI Conference on Artificial
Intelligence. Vol 5. AAAI Press; 2017:3725-3732.'
apa: 'Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., & Zikelic, D. (2017).
Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st
AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco,
CA, United States: AAAI Press.'
chicago: Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and
Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings
of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press,
2017.
ieee: K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing
expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference
on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5,
pp. 3725–3732.
ista: 'Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation
with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial
Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.'
mla: Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.”
Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol.
5, AAAI Press, 2017, pp. 3725–32.
short: K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings
of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp.
3725–3732.
conference:
end_date: 2017-02-10
location: San Francisco, CA, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2017-02-04
date_created: 2018-12-11T11:49:40Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-04-14T13:51:03Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
isi:
- '000485630703107'
intvolume: ' 5'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092
month: '01'
oa: 1
oa_version: Submitted Version
page: 3725 - 3732
project:
- _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: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the 31st AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '6387'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimizing expectation with guarantees in POMDPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 5
year: '2017'
...
---
_id: '1011'
abstract:
- lang: eng
text: Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly
equivalent, are standard models for interprocedural analysis. Yet RSMs are more
convenient as they (a) explicitly model function calls and returns, and (b) specify
many natural parameters for algorithmic analysis, e.g., the number of entries
and exits. We consider a general framework where RSM transitions are labeled from
a semiring and path properties are algebraic with semiring operations, which can
model, e.g., interprocedural reachability and dataflow analysis problems. Our
main contributions are new algorithms for several fundamental problems. As compared
to a direct translation of RSMs to PDSs and the best-known existing bounds of
PDSs, our analysis algorithm improves the complexity for finite-height semirings
(that subsumes reachability and standard dataflow properties). We further consider
the problem of extracting distance values from the representation structures computed
by our algorithm, and give efficient algorithms that distinguish the complexity
of a one-time preprocessing from the complexity of each individual query. Another
advantage of our algorithm is that our improvements carry over to the concurrent
setting, where we improve the bestknown complexity for the context-bounded analysis
of concurrent RSMs. Finally, we provide a prototype implementation that gives
a significant speed-up on several benchmarks from the SLAM/SDV project.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Samarth
full_name: Mishra, Samarth
last_name: Mishra
- 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, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted
recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:10.1007/978-3-662-54434-1_11'
apa: 'Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster
algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201,
pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala,
Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11'
chicago: Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis.
“Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok
Yang, 10201:287–313. Springer, 2017. https://doi.org/10.1007/978-3-662-54434-1_11.
ieee: 'K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms
for weighted recursive state machines,” presented at the ESOP: European Symposium
on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.'
ista: 'Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms
for weighted recursive state machines. ESOP: European Symposium on Programming,
LNCS, vol. 10201, 287–313.'
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive
State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313,
doi:10.1007/978-3-662-54434-1_11.
short: K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.),
Springer, 2017, pp. 287–313.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'ESOP: European Symposium on Programming'
start_date: 2017-04-22
date_created: 2018-12-11T11:49:41Z
date_published: 2017-03-19T00:00:00Z
date_updated: 2025-06-04T08:09:18Z
day: '19'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-662-54434-1_11
ec_funded: 1
editor:
- first_name: Hongseok
full_name: Yang, Hongseok
last_name: Yang
external_id:
arxiv:
- '1701.04914'
isi:
- '000681702400011'
intvolume: ' 10201'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.04914
month: '03'
oa: 1
oa_version: Submitted Version
page: 287 - 313
project:
- _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: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '6384'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for weighted recursive state machines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10201
year: '2017'
...
---
_id: '1013'
abstract:
- lang: eng
text: From microwave ovens to satellite television to the GPS and data services
on our mobile phones, microwave technology is everywhere today. But one technology
that has so far failed to prove its worth in this wavelength regime is quantum
communication that uses the states of single photons as information carriers.
This is because single microwave photons, as opposed to classical microwave signals,
are extremely vulnerable to noise from thermal excitations in the channels through
which they travel. Two new independent studies, one by Ze-Liang Xiang at Technische
Universität Wien (Vienna), Austria, and colleagues [1] and another by Benoît Vermersch
at the University of Innsbruck, also in Austria, and colleagues [2] now describe
a theoretical protocol for microwave quantum communication that is resilient to
thermal and other types of noise. Their approach could become a powerful technique
to establish fast links between superconducting data processors in a future all-microwave
quantum network.
article_processing_charge: No
article_type: review
author:
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Fink JM. Viewpoint: Microwave quantum states beat the heat. Physics.
2017;10(32). doi:10.1103/Physics.10.32'
apa: 'Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. Physics.
American Physical Society. https://doi.org/10.1103/Physics.10.32'
chicago: 'Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.”
Physics. American Physical Society, 2017. https://doi.org/10.1103/Physics.10.32.'
ieee: 'J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” Physics,
vol. 10, no. 32. American Physical Society, 2017.'
ista: 'Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics.
10(32).'
mla: 'Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” Physics,
vol. 10, no. 32, American Physical Society, 2017, doi:10.1103/Physics.10.32.'
short: J.M. Fink, Physics 10 (2017).
corr_author: '1'
date_created: 2018-12-11T11:49:41Z
date_published: 2017-03-27T00:00:00Z
date_updated: 2024-10-09T20:57:21Z
day: '27'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.1103/Physics.10.32
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T11:38:14Z
date_updated: 2019-10-24T11:38:14Z
file_id: '6968'
file_name: 2017_Physics_Fink.pdf
file_size: 193622
relation: main_file
success: 1
file_date_updated: 2019-10-24T11:38:14Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '32'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Physics
publication_status: published
publisher: American Physical Society
publist_id: '6382'
quality_controlled: '1'
status: public
title: 'Viewpoint: Microwave quantum states beat the heat'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2017'
...
---
_id: '1015'
abstract:
- lang: eng
text: 'Vortices are commonly observed in the context of classical hydrodynamics:
from whirlpools after stirring the coffee in a cup to a violent atmospheric phenomenon
such as a tornado, all classical vortices are characterized by an arbitrary circulation
value of the local velocity field. On the other hand the appearance of vortices
with quantized circulation represents one of the fundamental signatures of macroscopic
quantum phenomena. In two-dimensional superfluids quantized vortices play a key
role in determining finite-temperature properties, as the superfluid phase and
the normal state are separated by a vortex unbinding transition, the Berezinskii-Kosterlitz-Thouless
transition. Very recent experiments with two-dimensional superfluid fermions motivate
the present work: we present theoretical results based on the renormalization
group showing that the universal jump of the superfluid density and the critical
temperature crucially depend on the interaction strength, providing a strong benchmark
for forthcoming investigations.'
article_number: '45702'
article_processing_charge: No
author:
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Luca
full_name: Salasnich, Luca
last_name: Salasnich
citation:
ama: Bighin G, Salasnich L. Vortices and antivortices in two-dimensional ultracold
Fermi gases. Scientific Reports. 2017;7. doi:10.1038/srep45702
apa: Bighin, G., & Salasnich, L. (2017). Vortices and antivortices in two-dimensional
ultracold Fermi gases. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep45702
chicago: Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional
Ultracold Fermi Gases.” Scientific Reports. Nature Publishing Group, 2017.
https://doi.org/10.1038/srep45702.
ieee: G. Bighin and L. Salasnich, “Vortices and antivortices in two-dimensional
ultracold Fermi gases,” Scientific Reports, vol. 7. Nature Publishing Group,
2017.
ista: Bighin G, Salasnich L. 2017. Vortices and antivortices in two-dimensional
ultracold Fermi gases. Scientific Reports. 7, 45702.
mla: Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional
Ultracold Fermi Gases.” Scientific Reports, vol. 7, 45702, Nature Publishing
Group, 2017, doi:10.1038/srep45702.
short: G. Bighin, L. Salasnich, Scientific Reports 7 (2017).
date_created: 2018-12-11T11:49:42Z
date_published: 2017-04-04T00:00:00Z
date_updated: 2025-07-10T11:49:43Z
day: '04'
ddc:
- '539'
department:
- _id: MiLe
doi: 10.1038/srep45702
external_id:
isi:
- '000398148100001'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:32Z
date_updated: 2018-12-12T10:12:32Z
file_id: '4950'
file_name: IST-2017-809-v1+1_srep45702.pdf
file_size: 478289
relation: main_file
file_date_updated: 2018-12-12T10:12:32Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Nature Publishing Group
publist_id: '6380'
pubrep_id: '809'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Vortices and antivortices in two-dimensional ultracold Fermi gases
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: 7
year: '2017'
...
---
_id: '1017'
abstract:
- lang: eng
text: The development of the vertebrate central nervous system is reliant on a complex
cascade of biological processes that include mitotic division, relocation of migrating
neurons, and the extension of dendritic and axonal processes. Each of these cellular
events requires the diverse functional repertoire of the microtubule cytoskeleton
for the generation of forces, assembly of macromolecular complexes and transport
of molecules and organelles. The tubulins are a multi-gene family that encode
for the constituents of microtubules, and have been implicated in a spectrum of
neurological disorders. Evidence is building that different tubulins tune the
functional properties of the microtubule cytoskeleton dependent on the cell type,
developmental profile and subcellular localisation. Here we review of the origins
of the functional specification of the tubulin gene family in the developing brain
at a transcriptional, translational, and post-transcriptional level. We remind
the reader that tubulins are not just loading controls for your average Western
blot.
article_processing_charge: No
author:
- first_name: Martin
full_name: Breuss, Martin
last_name: Breuss
- first_name: Ines
full_name: Leca, Ines
last_name: Leca
- first_name: Thomas
full_name: Gstrein, Thomas
last_name: Gstrein
- first_name: Andi H
full_name: Hansen, Andi H
id: 38853E16-F248-11E8-B48F-1D18A9856A87
last_name: Hansen
- first_name: David
full_name: Keays, David
last_name: Keays
citation:
ama: 'Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. Tubulins and brain development:
The origins of functional specification. Molecular and Cellular Neuroscience.
2017;84:58-67. doi:10.1016/j.mcn.2017.03.002'
apa: 'Breuss, M., Leca, I., Gstrein, T., Hansen, A. H., & Keays, D. (2017).
Tubulins and brain development: The origins of functional specification. Molecular
and Cellular Neuroscience. Academic Press. https://doi.org/10.1016/j.mcn.2017.03.002'
chicago: 'Breuss, Martin, Ines Leca, Thomas Gstrein, Andi H Hansen, and David Keays.
“Tubulins and Brain Development: The Origins of Functional Specification.” Molecular
and Cellular Neuroscience. Academic Press, 2017. https://doi.org/10.1016/j.mcn.2017.03.002.'
ieee: 'M. Breuss, I. Leca, T. Gstrein, A. H. Hansen, and D. Keays, “Tubulins and
brain development: The origins of functional specification,” Molecular and
Cellular Neuroscience, vol. 84. Academic Press, pp. 58–67, 2017.'
ista: 'Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. 2017. Tubulins and brain
development: The origins of functional specification. Molecular and Cellular Neuroscience.
84, 58–67.'
mla: 'Breuss, Martin, et al. “Tubulins and Brain Development: The Origins of Functional
Specification.” Molecular and Cellular Neuroscience, vol. 84, Academic
Press, 2017, pp. 58–67, doi:10.1016/j.mcn.2017.03.002.'
short: M. Breuss, I. Leca, T. Gstrein, A.H. Hansen, D. Keays, Molecular and Cellular
Neuroscience 84 (2017) 58–67.
date_created: 2018-12-11T11:49:42Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2025-07-10T11:49:44Z
day: '01'
ddc:
- '571'
department:
- _id: SiHi
doi: 10.1016/j.mcn.2017.03.002
external_id:
isi:
- '000415140700007'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:19Z
date_updated: 2018-12-12T10:09:19Z
file_id: '4742'
file_name: IST-2017-806-v1+2_1-s2.0-S1044743116302500-main_1_.pdf
file_size: 1436377
relation: main_file
file_date_updated: 2018-12-12T10:09:19Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 58 - 67
publication: Molecular and Cellular Neuroscience
publication_identifier:
issn:
- 1044-7431
publication_status: published
publisher: Academic Press
publist_id: '6377'
pubrep_id: '806'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Tubulins and brain development: The origins of functional specification'
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: 84
year: '2017'
...
---
_id: '1018'
abstract:
- lang: eng
text: In plants, the multistep phosphorelay (MSP) pathway mediates a range of regulatory
processes, including those activated by cytokinins. The crosstalk between cytokinin
response and light is known for a long time. However, the molecular mechanism
underlying the interactionbetween light and cytokinin signaling remains elusive.
In the screen for upstream regulators we identified a LONG PALE HYPOCOTYL (LPH)
gene whose activity is indispensable for spatiotemporally correct expression of
CYTOKININ INDEPENDENT-1 (CKI1), encoding the constitutively active sensor histidine
kinase that activates MSP signaling. lph is a new allele of HEME OXYGENASE 1 (HY1)
which encodes the key protein in the biosynthesis of phytochromobilin, a cofactor
of photoconvertiblephytochromes. Our analysis confirmed the light-dependent regulation
oftheCKI1 expression pattern. We show that CKI1 expression is under the control
of phytochrome A (phyA), functioning as a dual (both positive and negative) regulator
of CKI1 expression, presumably via the phyA-regulated transcription factors PHYTOCHROME
INTERACTING FACTOR 3 (PIF3) and CIRCADIAN CLOCK ASSOCIATED 1 (CCA1). Changes in
CKI1 expression observed in lph/hy1-7 and phy mutants correlatewithmisregulation
of MSP signaling, changedcytokinin sensitivity and developmental aberrations,previously
shown to be associated with cytokinin and/or CKI1 action. Besides that, we demonstrate
novel role of phyA-dependent CKI1 expression in the hypocotyl elongation and hook
development during skotomorphogenesis. Based on these results, we propose that
the light-dependent regulation of CKI1 provides a plausible mechanistic link underlying
the well-known interaction between light- and cytokinin-controlled plant development.
article_processing_charge: No
author:
- first_name: Tereza
full_name: Dobisova, Tereza
last_name: Dobisova
- first_name: Vendula
full_name: Hrdinova, Vendula
last_name: Hrdinova
- first_name: Candela
full_name: Cuesta, Candela
id: 33A3C818-F248-11E8-B48F-1D18A9856A87
last_name: Cuesta
orcid: 0000-0003-1923-2410
- first_name: Sarka
full_name: Michlickova, Sarka
last_name: Michlickova
- first_name: Ivana
full_name: Urbankova, Ivana
last_name: Urbankova
- first_name: Romana
full_name: Hejatkova, Romana
last_name: Hejatkova
- first_name: Petra
full_name: Zadnikova, Petra
last_name: Zadnikova
- first_name: Markéta
full_name: Pernisová, Markéta
last_name: Pernisová
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Jan
full_name: Hejátko, Jan
last_name: Hejátko
citation:
ama: Dobisova T, Hrdinova V, Cuesta C, et al. Light regulated expression of sensor
histidine kinase CKI1 controls cytokinin related development. Plant Physiology.
2017;174(1):387-404. doi:10.1104/pp.16.01964
apa: Dobisova, T., Hrdinova, V., Cuesta, C., Michlickova, S., Urbankova, I., Hejatkova,
R., … Hejátko, J. (2017). Light regulated expression of sensor histidine kinase
CKI1 controls cytokinin related development. Plant Physiology. American
Society of Plant Biologists. https://doi.org/10.1104/pp.16.01964
chicago: Dobisova, Tereza, Vendula Hrdinova, Candela Cuesta, Sarka Michlickova,
Ivana Urbankova, Romana Hejatkova, Petra Zadnikova, Markéta Pernisová, Eva Benková,
and Jan Hejátko. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls
Cytokinin Related Development.” Plant Physiology. American Society of Plant
Biologists, 2017. https://doi.org/10.1104/pp.16.01964.
ieee: T. Dobisova et al., “Light regulated expression of sensor histidine
kinase CKI1 controls cytokinin related development,” Plant Physiology,
vol. 174, no. 1. American Society of Plant Biologists, pp. 387–404, 2017.
ista: Dobisova T, Hrdinova V, Cuesta C, Michlickova S, Urbankova I, Hejatkova R,
Zadnikova P, Pernisová M, Benková E, Hejátko J. 2017. Light regulated expression
of sensor histidine kinase CKI1 controls cytokinin related development. Plant
Physiology. 174(1), 387–404.
mla: Dobisova, Tereza, et al. “Light Regulated Expression of Sensor Histidine Kinase
CKI1 Controls Cytokinin Related Development.” Plant Physiology, vol. 174,
no. 1, American Society of Plant Biologists, 2017, pp. 387–404, doi:10.1104/pp.16.01964.
short: T. Dobisova, V. Hrdinova, C. Cuesta, S. Michlickova, I. Urbankova, R. Hejatkova,
P. Zadnikova, M. Pernisová, E. Benková, J. Hejátko, Plant Physiology 174 (2017)
387–404.
date_created: 2018-12-11T11:49:43Z
date_published: 2017-05-17T00:00:00Z
date_updated: 2023-09-22T09:41:48Z
day: '17'
department:
- _id: EvBe
doi: 10.1104/pp.16.01964
external_id:
isi:
- '000402057200028'
intvolume: ' 174'
isi: 1
issue: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 387 - 404
publication: Plant Physiology
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '6375'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Light regulated expression of sensor histidine kinase CKI1 controls cytokinin
related development
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 174
year: '2017'
...
---
_id: '1019'
abstract:
- lang: eng
text: As a consequence of its difference in copy number between males and females,
the X chromosome is subject to unique evolutionary forces and gene regulatory
mechanisms. Previous studies of Drosophila melanogaster have shown that the expression
of X-linked, testis-specific reporter genes is suppressed in the male germline.
However, it is not known whether this phenomenon is restricted to testis-expressed
genes or if it is a more general property of genes with tissue-specific expression,
which are also underrepresented on the X chromosome. To test this, we compared
the expression of three tissue-specific reporter genes (ovary, accessory gland
and Malpighian tubule) inserted at various autosomal and X-chromosomal locations.
In contrast to testis-specific reporter genes, we found no reduction of X-linked
expression in any of the other tissues. In accessory gland and Malpighian tubule,
we detected higher expression of the X-linked reporter genes, which suggests that
they are at least partially dosage compensated. We found no difference in the
tissue-specificity of X-linked and autosomal reporter genes. These findings indicate
that, in general, the X chromosome is not a detrimental environment for tissue-specific
gene expression and that the suppression of X-linked expression is limited to
the male germline.
article_processing_charge: No
author:
- first_name: Eliza
full_name: Argyridou, Eliza
last_name: Argyridou
- first_name: Ann K
full_name: Huylmans, Ann K
id: 4C0A3874-F248-11E8-B48F-1D18A9856A87
last_name: Huylmans
orcid: 0000-0001-8871-4961
- first_name: Annabella
full_name: Königer, Annabella
last_name: Königer
- first_name: John
full_name: Parsch, John
last_name: Parsch
citation:
ama: Argyridou E, Huylmans AK, Königer A, Parsch J. X-linkage is not a general inhibitor
of tissue-specific gene expression in Drosophila melanogaster. Heredity.
2017;119(1):27-34. doi:10.1038/hdy.2017.12
apa: Argyridou, E., Huylmans, A. K., Königer, A., & Parsch, J. (2017). X-linkage
is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster.
Heredity. Nature Publishing Group. https://doi.org/10.1038/hdy.2017.12
chicago: Argyridou, Eliza, Ann K Huylmans, Annabella Königer, and John Parsch. “X-Linkage
Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.”
Heredity. Nature Publishing Group, 2017. https://doi.org/10.1038/hdy.2017.12.
ieee: E. Argyridou, A. K. Huylmans, A. Königer, and J. Parsch, “X-linkage is not
a general inhibitor of tissue-specific gene expression in Drosophila melanogaster,”
Heredity, vol. 119, no. 1. Nature Publishing Group, pp. 27–34, 2017.
ista: Argyridou E, Huylmans AK, Königer A, Parsch J. 2017. X-linkage is not a general
inhibitor of tissue-specific gene expression in Drosophila melanogaster. Heredity.
119(1), 27–34.
mla: Argyridou, Eliza, et al. “X-Linkage Is Not a General Inhibitor of Tissue-Specific
Gene Expression in Drosophila Melanogaster.” Heredity, vol. 119, no. 1,
Nature Publishing Group, 2017, pp. 27–34, doi:10.1038/hdy.2017.12.
short: E. Argyridou, A.K. Huylmans, A. Königer, J. Parsch, Heredity 119 (2017) 27–34.
date_created: 2018-12-11T11:49:43Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2025-07-10T11:49:45Z
day: '01'
department:
- _id: BeVi
doi: 10.1038/hdy.2017.12
external_id:
isi:
- '000405397800004'
intvolume: ' 119'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 27 - 34
publication: Heredity
publication_identifier:
issn:
- 0018-067X
publication_status: published
publisher: Nature Publishing Group
publist_id: '6374'
quality_controlled: '1'
related_material:
record:
- id: '9861'
relation: research_data
status: public
scopus_import: '1'
status: public
title: X-linkage is not a general inhibitor of tissue-specific gene expression in
Drosophila melanogaster
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2017'
...
---
_id: '1020'
abstract:
- lang: eng
text: Cellulose is the most abundant biopolymer on Earth. Cellulose fibers, such
as the one extracted form cotton or woodpulp, have been used by humankind for
hundreds of years to make textiles and paper. Here we show how, by engineering
light-matter interaction, we can optimize light scattering using exclusively cellulose
nanocrystals. The produced material is sustainable, biocompatible, and when compared
to ordinary microfiber-based paper, it shows enhanced scattering strength (×4),
yielding a transport mean free path as low as 3.5 μm in the visible light range.
The experimental results are in a good agreement with the theoretical predictions
obtained with a diffusive model for light propagation.
acknowledgement: This research was funded by the EPSRC (EP/M027961/1), the Leverhulme
Trust (RPG-2014-238), Royal Society (RG140457), the BBSRC David Phillips fellowship
(BB/K014617/1), and the European Research Council (ERC-2014-STG H2020 639088). All
data created during this research are provided in full in the results section and
Supporting Information. They are openly available from figshare and can be accessed
at ref 30.
article_processing_charge: No
arxiv: 1
author:
- first_name: Soraya
full_name: Caixeiro, Soraya
last_name: Caixeiro
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Olimpia
full_name: Onelli, Olimpia
last_name: Onelli
- first_name: Silvia
full_name: Vignolini, Silvia
last_name: Vignolini
- first_name: Riccardo
full_name: Sapienza, Riccardo
last_name: Sapienza
citation:
ama: Caixeiro S, Peruzzo M, Onelli O, Vignolini S, Sapienza R. Disordered cellulose
based nanostructures for enhanced light scattering. ACS Applied Materials and
Interfaces. 2017;9(9):7885-7890. doi:10.1021/acsami.6b15986
apa: Caixeiro, S., Peruzzo, M., Onelli, O., Vignolini, S., & Sapienza, R. (2017).
Disordered cellulose based nanostructures for enhanced light scattering. ACS
Applied Materials and Interfaces. American Chemical Society. https://doi.org/10.1021/acsami.6b15986
chicago: Caixeiro, Soraya, Matilda Peruzzo, Olimpia Onelli, Silvia Vignolini, and
Riccardo Sapienza. “Disordered Cellulose Based Nanostructures for Enhanced Light
Scattering.” ACS Applied Materials and Interfaces. American Chemical Society,
2017. https://doi.org/10.1021/acsami.6b15986.
ieee: S. Caixeiro, M. Peruzzo, O. Onelli, S. Vignolini, and R. Sapienza, “Disordered
cellulose based nanostructures for enhanced light scattering,” ACS Applied
Materials and Interfaces, vol. 9, no. 9. American Chemical Society, pp. 7885–7890,
2017.
ista: Caixeiro S, Peruzzo M, Onelli O, Vignolini S, Sapienza R. 2017. Disordered
cellulose based nanostructures for enhanced light scattering. ACS Applied Materials
and Interfaces. 9(9), 7885–7890.
mla: Caixeiro, Soraya, et al. “Disordered Cellulose Based Nanostructures for Enhanced
Light Scattering.” ACS Applied Materials and Interfaces, vol. 9, no. 9,
American Chemical Society, 2017, pp. 7885–90, doi:10.1021/acsami.6b15986.
short: S. Caixeiro, M. Peruzzo, O. Onelli, S. Vignolini, R. Sapienza, ACS Applied
Materials and Interfaces 9 (2017) 7885–7890.
date_created: 2018-12-11T11:49:44Z
date_published: 2017-03-08T00:00:00Z
date_updated: 2025-06-04T08:09:49Z
day: '08'
department:
- _id: JoFi
doi: 10.1021/acsami.6b15986
external_id:
arxiv:
- '1702.01415'
isi:
- '000396186000002'
intvolume: ' 9'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.01415
month: '03'
oa: 1
oa_version: Submitted Version
page: 7885 - 7890
publication: ACS Applied Materials and Interfaces
publication_identifier:
issn:
- 1944-8244
publication_status: published
publisher: American Chemical Society
publist_id: '6372'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Disordered cellulose based nanostructures for enhanced light scattering
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2017'
...
---
_id: '1021'
abstract:
- lang: eng
text: Most flows in nature and engineering are turbulent because of their large
velocities and spatial scales. Laboratory experiments on rotating quasi-Keplerian
flows, for which the angular velocity decreases radially but the angular momentum
increases, are however laminar at Reynolds numbers exceeding one million. This
is in apparent contradiction to direct numerical simulations showing that in these
experiments turbulence transition is triggered by the axial boundaries. We here
show numerically that as the Reynolds number increases, turbulence becomes progressively
confined to the boundary layers and the flow in the bulk fully relaminarizes.
Our findings support that turbulence is unlikely to occur in isothermal constant-density
quasi-Keplerian flows.
article_processing_charge: No
arxiv: 1
author:
- first_name: Jose M
full_name: Lopez Alonso, Jose M
id: 40770848-F248-11E8-B48F-1D18A9856A87
last_name: Lopez Alonso
orcid: 0000-0002-0384-2022
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
citation:
ama: Lopez Alonso JM, Avila M. Boundary layer turbulence in experiments on quasi
Keplerian flows. Journal of Fluid Mechanics. 2017;817:21-34. doi:10.1017/jfm.2017.109
apa: Lopez Alonso, J. M., & Avila, M. (2017). Boundary layer turbulence in experiments
on quasi Keplerian flows. Journal of Fluid Mechanics. Cambridge University
Press. https://doi.org/10.1017/jfm.2017.109
chicago: Lopez Alonso, Jose M, and Marc Avila. “Boundary Layer Turbulence in Experiments
on Quasi Keplerian Flows.” Journal of Fluid Mechanics. Cambridge University
Press, 2017. https://doi.org/10.1017/jfm.2017.109.
ieee: J. M. Lopez Alonso and M. Avila, “Boundary layer turbulence in experiments
on quasi Keplerian flows,” Journal of Fluid Mechanics, vol. 817. Cambridge
University Press, pp. 21–34, 2017.
ista: Lopez Alonso JM, Avila M. 2017. Boundary layer turbulence in experiments on
quasi Keplerian flows. Journal of Fluid Mechanics. 817, 21–34.
mla: Lopez Alonso, Jose M., and Marc Avila. “Boundary Layer Turbulence in Experiments
on Quasi Keplerian Flows.” Journal of Fluid Mechanics, vol. 817, Cambridge
University Press, 2017, pp. 21–34, doi:10.1017/jfm.2017.109.
short: J.M. Lopez Alonso, M. Avila, Journal of Fluid Mechanics 817 (2017) 21–34.
date_created: 2018-12-11T11:49:44Z
date_published: 2017-04-25T00:00:00Z
date_updated: 2025-06-04T08:10:13Z
day: '25'
department:
- _id: BjHo
doi: 10.1017/jfm.2017.109
external_id:
arxiv:
- '1608.05527'
isi:
- '000398179100006'
intvolume: ' 817'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.05527
month: '04'
oa: 1
oa_version: Submitted Version
page: 21 - 34
project:
- _id: 255008E4-B435-11E9-9278-68D0E5697425
grant_number: RGP0065/2012
name: Information processing and computation in fish groups
publication: Journal of Fluid Mechanics
publication_identifier:
issn:
- 0022-1120
publication_status: published
publisher: Cambridge University Press
publist_id: '6371'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Boundary layer turbulence in experiments on quasi Keplerian flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 817
year: '2017'
...
---
_id: '1022'
abstract:
- lang: eng
text: We introduce a multiscale topological description of the Megaparsec web-like
cosmic matter distribution. Betti numbers and topological persistence offer a
powerful means of describing the rich connectivity structure of the cosmic web
and of its multiscale arrangement of matter and galaxies. Emanating from algebraic
topology and Morse theory, Betti numbers and persistence diagrams represent an
extension and deepening of the cosmologically familiar topological genus measure
and the related geometric Minkowski functionals. In addition to a description
of the mathematical background, this study presents the computational procedure
for computing Betti numbers and persistence diagrams for density field filtrations.
The field may be computed starting from a discrete spatial distribution of galaxies
or simulation particles. The main emphasis of this study concerns an extensive
and systematic exploration of the imprint of different web-like morphologies and
different levels of multiscale clustering in the corresponding computed Betti
numbers and persistence diagrams. To this end, we use Voronoi clustering models
as templates for a rich variety of web-like configurations and the fractal-like
Soneira-Peebles models exemplify a range of multiscale configurations. We have
identified the clear imprint of cluster nodes, filaments, walls, and voids in
persistence diagrams, along with that of the nested hierarchy of structures in
multiscale point distributions. We conclude by outlining the potential of persistent
topology for understanding the connectivity structure of the cosmic web, in large
simulations of cosmic structure formation and in the challenging context of the
observed galaxy distribution in large galaxy surveys.
acknowledgement: Part of this work has been supported by the 7th Framework Programme
for Research of the European Commission, under FETOpen grant number 255827 (CGL
Computational Geometry Learning) and ERC advanced grant, URSAT (Understanding Random
Systems via Algebraic Topology) number 320422.
article_processing_charge: No
arxiv: 1
author:
- first_name: Pratyush
full_name: Pranav, Pratyush
last_name: Pranav
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Rien
full_name: Van De Weygaert, Rien
last_name: Van De Weygaert
- first_name: Gert
full_name: Vegter, Gert
last_name: Vegter
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
- first_name: Bernard
full_name: Jones, Bernard
last_name: Jones
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Pranav P, Edelsbrunner H, Van De Weygaert R, et al. The topology of the cosmic
web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical
Society. 2017;465(4):4281-4310. doi:10.1093/mnras/stw2862
apa: Pranav, P., Edelsbrunner, H., Van De Weygaert, R., Vegter, G., Kerber, M.,
Jones, B., & Wintraecken, M. (2017). The topology of the cosmic web in terms
of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society.
Oxford University Press. https://doi.org/10.1093/mnras/stw2862
chicago: Pranav, Pratyush, Herbert Edelsbrunner, Rien Van De Weygaert, Gert Vegter,
Michael Kerber, Bernard Jones, and Mathijs Wintraecken. “The Topology of the Cosmic
Web in Terms of Persistent Betti Numbers.” Monthly Notices of the Royal Astronomical
Society. Oxford University Press, 2017. https://doi.org/10.1093/mnras/stw2862.
ieee: P. Pranav et al., “The topology of the cosmic web in terms of persistent
Betti numbers,” Monthly Notices of the Royal Astronomical Society, vol.
465, no. 4. Oxford University Press, pp. 4281–4310, 2017.
ista: Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B,
Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti
numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.
mla: Pranav, Pratyush, et al. “The Topology of the Cosmic Web in Terms of Persistent
Betti Numbers.” Monthly Notices of the Royal Astronomical Society, vol.
465, no. 4, Oxford University Press, 2017, pp. 4281–310, doi:10.1093/mnras/stw2862.
short: P. Pranav, H. Edelsbrunner, R. Van De Weygaert, G. Vegter, M. Kerber, B.
Jones, M. Wintraecken, Monthly Notices of the Royal Astronomical Society 465 (2017)
4281–4310.
date_created: 2018-12-11T11:49:44Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-06-04T08:10:31Z
day: '01'
department:
- _id: HeEd
doi: 10.1093/mnras/stw2862
external_id:
arxiv:
- '1608.04519'
isi:
- '000395170200039'
intvolume: ' 465'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.04519
month: '01'
oa: 1
oa_version: Submitted Version
page: 4281 - 4310
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
publist_id: '6373'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The topology of the cosmic web in terms of persistent Betti numbers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 465
year: '2017'
...
---
_id: '1023'
abstract:
- lang: eng
text: We consider products of independent square non-Hermitian random matrices.
More precisely, let X1,…, Xn be independent N × N random matrices with independent
entries (real or complex with independent real and imaginary parts) with zero
mean and variance 1/N. Soshnikov-O’Rourke [19] and Götze-Tikhomirov [15] showed
that the empirical spectral distribution of the product of n random matrices with
iid entries converges to (equation found). We prove that if the entries of the
matrices X1,…, Xn are independent (but not necessarily identically distributed)
and satisfy uniform subexponential decay condition, then in the bulk the convergence
of the ESD of X1,…, Xn to (0.1) holds up to the scale N–1/2+ε.
article_number: '22'
article_processing_charge: No
author:
- first_name: Yuriy
full_name: Nemish, Yuriy
id: 4D902E6A-F248-11E8-B48F-1D18A9856A87
last_name: Nemish
orcid: 0000-0002-7327-856X
citation:
ama: Nemish Y. Local law for the product of independent non-Hermitian random matrices
with independent entries. Electronic Journal of Probability. 2017;22. doi:10.1214/17-EJP38
apa: Nemish, Y. (2017). Local law for the product of independent non-Hermitian random
matrices with independent entries. Electronic Journal of Probability. Institute
of Mathematical Statistics. https://doi.org/10.1214/17-EJP38
chicago: Nemish, Yuriy. “Local Law for the Product of Independent Non-Hermitian
Random Matrices with Independent Entries.” Electronic Journal of Probability.
Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/17-EJP38.
ieee: Y. Nemish, “Local law for the product of independent non-Hermitian random
matrices with independent entries,” Electronic Journal of Probability,
vol. 22. Institute of Mathematical Statistics, 2017.
ista: Nemish Y. 2017. Local law for the product of independent non-Hermitian random
matrices with independent entries. Electronic Journal of Probability. 22, 22.
mla: Nemish, Yuriy. “Local Law for the Product of Independent Non-Hermitian Random
Matrices with Independent Entries.” Electronic Journal of Probability,
vol. 22, 22, Institute of Mathematical Statistics, 2017, doi:10.1214/17-EJP38.
short: Y. Nemish, Electronic Journal of Probability 22 (2017).
date_created: 2018-12-11T11:49:44Z
date_published: 2017-02-06T00:00:00Z
date_updated: 2025-07-10T11:49:47Z
day: '06'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/17-EJP38
external_id:
isi:
- '000396611900022'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:29Z
date_updated: 2018-12-12T10:15:29Z
file_id: '5149'
file_name: IST-2017-802-v1+1_euclid.ejp.1487991681.pdf
file_size: 742275
relation: main_file
file_date_updated: 2018-12-12T10:15:29Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
publication: Electronic Journal of Probability
publication_identifier:
issn:
- 1083-6489
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '6370'
pubrep_id: '802'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local law for the product of independent non-Hermitian random matrices with
independent entries
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: 22
year: '2017'
...
---
_id: '1025'
abstract:
- lang: eng
text: Many organ surfaces are covered by a protective epithelial-cell layer. It
emerges that such layers are maintained by cell stretching that triggers cell
division mediated by the force-sensitive ion-channel protein Piezo1. See Letter
p.118
article_processing_charge: No
author:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Heisenberg C-PJ. Cell biology: Stretched divisions. Nature. 2017;543(7643):43-44.
doi:10.1038/nature21502'
apa: 'Heisenberg, C.-P. J. (2017). Cell biology: Stretched divisions. Nature.
Nature Publishing Group. https://doi.org/10.1038/nature21502'
chicago: 'Heisenberg, Carl-Philipp J. “Cell Biology: Stretched Divisions.” Nature.
Nature Publishing Group, 2017. https://doi.org/10.1038/nature21502.'
ieee: 'C.-P. J. Heisenberg, “Cell biology: Stretched divisions,” Nature,
vol. 543, no. 7643. Nature Publishing Group, pp. 43–44, 2017.'
ista: 'Heisenberg C-PJ. 2017. Cell biology: Stretched divisions. Nature. 543(7643),
43–44.'
mla: 'Heisenberg, Carl-Philipp J. “Cell Biology: Stretched Divisions.” Nature,
vol. 543, no. 7643, Nature Publishing Group, 2017, pp. 43–44, doi:10.1038/nature21502.'
short: C.-P.J. Heisenberg, Nature 543 (2017) 43–44.
corr_author: '1'
date_created: 2018-12-11T11:49:45Z
date_published: 2017-03-02T00:00:00Z
date_updated: 2025-07-10T11:49:49Z
day: '02'
department:
- _id: CaHe
doi: 10.1038/nature21502
external_id:
isi:
- '000395671500025'
intvolume: ' 543'
isi: 1
issue: '7643'
language:
- iso: eng
month: '03'
oa_version: None
page: 43 - 44
publication: Nature
publication_identifier:
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '6367'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Cell biology: Stretched divisions'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 543
year: '2017'
...
---
_id: '10416'
abstract:
- lang: eng
text: 'A fundamental algorithmic problem at the heart of static analysis is Dyck
reachability. The input is a graph where the edges are labeled with different
types of opening and closing parentheses, and the reachability information is
computed via paths whose parentheses are properly matched. We present new results
for Dyck reachability problems with applications to alias analysis and data-dependence
analysis. Our main contributions, that include improved upper bounds as well as
lower bounds that establish optimality guarantees, are as follows: First, we consider
Dyck reachability on bidirected graphs, which is the standard way of performing
field-sensitive points-to analysis. Given a bidirected graph with n nodes and
m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)),
where α(n) is the inverse Ackermann function, improving the previously known O(n2)
time bound; (ii) a matching lower bound that shows that our algorithm is optimal
wrt to worst-case complexity; and (iii) an optimal average-case upper bound of
O(m) time, improving the previously known O(m · logn) bound. Second, we consider
the problem of context-sensitive data-dependence analysis, where the task is to
obtain analysis summaries of library code in the presence of callbacks. Our algorithm
preprocesses libraries in almost linear time, after which the contribution of
the library in the complexity of the client analysis is only linear, and only
wrt the number of call sites. Third, we prove that combinatorial algorithms for
Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained
without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication,
which is a long-standing open problem. Thus we establish that the existing combinatorial
algorithms for Dyck reachability are (conditionally) optimal for general graphs.
We also show that the same hardness holds for graphs of constant treewidth. Finally,
we provide a prototype implementation of our algorithms for both alias analysis
and data-dependence analysis. Our experimental evaluation demonstrates that the
new algorithms significantly outperform all existing methods on the two problems,
over real-world benchmarks.'
acknowledgement: "The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant
(279307: Graph Games).\r\n"
article_number: '30'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Bhavya
full_name: Choudhary, Bhavya
last_name: Choudhary
- 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, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence
and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL).
doi:10.1145/3158118
apa: 'Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck
reachability for data-dependence and Alias analysis. Proceedings of the ACM
on Programming Languages. Los Angeles, CA, United States: Association for
Computing Machinery. https://doi.org/10.1145/3158118'
chicago: Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal
Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the
ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.
ieee: K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability
for data-dependence and Alias analysis,” Proceedings of the ACM on Programming
Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.
ista: Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability
for data-dependence and Alias analysis. Proceedings of the ACM on Programming
Languages. 2(POPL), 30.
mla: Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence
and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol.
2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.
short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming
Languages 2 (2017).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
corr_author: '1'
date_created: 2021-12-05T23:01:48Z
date_published: 2017-12-27T00:00:00Z
date_updated: 2025-04-15T07:26:20Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3158118
ec_funded: 1
external_id:
arxiv:
- '1910.00241'
file:
- access_level: open_access
checksum: faa3f7b3fe8aab84b50ed805c26a0ee5
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-07T08:06:28Z
date_updated: 2021-12-07T08:06:28Z
file_id: '10421'
file_name: 2017_ACMProgLang_Chatterjee.pdf
file_size: 460188
relation: main_file
success: 1
file_date_updated: 2021-12-07T08:06:28Z
has_accepted_license: '1'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5455'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Optimal Dyck reachability for data-dependence and Alias analysis
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: 2
year: '2017'
...
---
_id: '10418'
abstract:
- lang: eng
text: We present a new proof rule for proving almost-sure termination of probabilistic
programs, including those that contain demonic non-determinism. An important question
for a probabilistic program is whether the probability mass of all its diverging
runs is zero, that is that it terminates "almost surely". Proving that can be
hard, and this paper presents a new method for doing so. It applies directly to
the program's source code, even if the program contains demonic choice. Like others,
we use variant functions (a.k.a. "super-martingales") that are real-valued and
decrease randomly on each loop iteration; but our key innovation is that the amount
as well as the probability of the decrease are parametric. We prove the soundness
of the new rule, indicate where its applicability goes beyond existing rules,
and explain its connection to classical results on denumerable (non-demonic) Markov
chains.
acknowledgement: "McIver and Morgan are grateful to David Basin and the Information
Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during
part of which this work began. And thanks particularly to Andreas Lochbihler, who
shared with us the probabilistic termination problem that led to it. They acknowledge
the support of ARC grant DP140101119. Part of this work was carried out during the
Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs
Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden.
Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4."
article_number: '33'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Annabelle
full_name: Mciver, Annabelle
last_name: Mciver
- first_name: Carroll
full_name: Morgan, Carroll
last_name: Morgan
- first_name: Benjamin Lucien
full_name: Kaminski, Benjamin Lucien
last_name: Kaminski
- first_name: Joost P
full_name: Katoen, Joost P
id: 4524F760-F248-11E8-B48F-1D18A9856A87
last_name: Katoen
citation:
ama: Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure
termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL).
doi:10.1145/3158121
apa: 'Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new
proof rule for almost-sure termination. Proceedings of the ACM on Programming
Languages. Los Angeles, CA, United States: Association for Computing Machinery.
https://doi.org/10.1145/3158121'
chicago: Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost
P Katoen. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the
ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158121.
ieee: A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule
for almost-sure termination,” Proceedings of the ACM on Programming Languages,
vol. 2, no. POPL. Association for Computing Machinery, 2017.
ista: Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure
termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.
mla: Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings
of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for
Computing Machinery, 2017, doi:10.1145/3158121.
short: A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM
on Programming Languages 2 (2017).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
corr_author: '1'
date_created: 2021-12-05T23:01:49Z
date_published: 2017-12-07T00:00:00Z
date_updated: 2024-10-09T21:01:14Z
day: '07'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3158121
external_id:
arxiv:
- '1711.03588'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3158121
month: '12'
oa: 1
oa_version: Published Version
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new proof rule for almost-sure termination
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2017'
...