---
_id: '715'
abstract:
- lang: eng
text: D-cycloserine ameliorates breathing abnormalities and survival rate in a mouse
model of Rett syndrome.
article_number: aao4218
author:
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Novarino G. More excitation for Rett syndrome. Science Translational Medicine.
2017;9(405). doi:10.1126/scitranslmed.aao4218
apa: Novarino, G. (2017). More excitation for Rett syndrome. Science Translational
Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aao4218
chicago: Novarino, Gaia. “More Excitation for Rett Syndrome.” Science Translational
Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aao4218.
ieee: G. Novarino, “More excitation for Rett syndrome,” Science Translational
Medicine, vol. 9, no. 405. American Association for the Advancement of Science,
2017.
ista: Novarino G. 2017. More excitation for Rett syndrome. Science Translational
Medicine. 9(405), aao4218.
mla: Novarino, Gaia. “More Excitation for Rett Syndrome.” Science Translational
Medicine, vol. 9, no. 405, aao4218, American Association for the Advancement
of Science, 2017, doi:10.1126/scitranslmed.aao4218.
short: G. Novarino, Science Translational Medicine 9 (2017).
date_created: 2018-12-11T11:48:06Z
date_published: 2017-08-30T00:00:00Z
date_updated: 2021-01-12T08:12:04Z
day: '30'
department:
- _id: GaNo
doi: 10.1126/scitranslmed.aao4218
intvolume: ' 9'
issue: '405'
language:
- iso: eng
month: '08'
oa_version: None
publication: Science Translational Medicine
publication_identifier:
issn:
- '19466234'
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '6968'
quality_controlled: '1'
scopus_import: 1
status: public
title: More excitation for Rett syndrome
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2017'
...
---
_id: '716'
abstract:
- lang: eng
text: 'Two-player games on graphs are central in many problems in formal verification
and program analysis, such as synthesis and verification of open systems. In this
work, we consider solving recursive game graphs (or pushdown game graphs) that
model the control flow of sequential programs with recursion.While pushdown games
have been studied before with qualitative objectives-such as reachability and
?-regular objectives- in this work, we study for the first time such games with
the most well-studied quantitative objective, the mean-payoff objective. In pushdown
games, two types of strategies are relevant: (1) global strategies, which depend
on the entire global history; and (2) modular strategies, which have only local
memory and thus do not depend on the context of invocation but rather only on
the history of the current invocation of the module. Our main results are as follows:
(1) One-player pushdown games with mean-payoff objectives under global strategies
are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff
objectives under global strategies are undecidable. (3) One-player pushdown games
with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player
pushdown games with mean-payoff objectives under modular strategies can be solved
in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives
under modular strategies are NP-complete). We also establish the optimal strategy
complexity by showing that global strategies for mean-payoff objectives require
infinite memory even in one-player pushdown games and memoryless modular strategies
are sufficient in two-player pushdown games. Finally, we also show that all the
problems have the same complexity if the stack boundedness condition is added,
where along with the mean-payoff objective the player must also ensure that the
stack height is bounded.'
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: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Velner Y. The complexity of mean-payoff pushdown games. Journal
of the ACM. 2017;64(5):34. doi:10.1145/3121408
apa: Chatterjee, K., & Velner, Y. (2017). The complexity of mean-payoff pushdown
games. Journal of the ACM. ACM. https://doi.org/10.1145/3121408
chicago: Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff
Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408.
ieee: K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,”
Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.
ista: Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games.
Journal of the ACM. 64(5), 34.
mla: Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown
Games.” Journal of the ACM, vol. 64, no. 5, ACM, 2017, p. 34, doi:10.1145/3121408.
short: K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.
date_created: 2018-12-11T11:48:06Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2021-01-12T08:12:08Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3121408
ec_funded: 1
external_id:
arxiv:
- '1201.2829'
intvolume: ' 64'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1201.2829
month: '09'
oa: 1
oa_version: Preprint
page: '34'
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'
publication: Journal of the ACM
publication_identifier:
issn:
- '00045411'
publication_status: published
publisher: ACM
publist_id: '6964'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of mean-payoff pushdown games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2017'
...
---
_id: '717'
abstract:
- lang: eng
text: 'We consider finite-state and recursive game graphs with multidimensional
mean-payoff objectives. In recursive games two types of strategies are relevant:
global strategies and modular strategies. Our contributions are: (1) We show that
finite-state multidimensional mean-payoff games can be solved in polynomial time
if the number of dimensions and the maximal absolute value of weights are fixed;
whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that
one-player recursive games with multidimensional mean-payoff objectives can be
solved in polynomial time. Both above algorithms are based on hyperplane separation
technique. (3) For recursive games we show that under modular strategies the multidimensional
problem is undecidable. We show that if the number of modules, exits, and the
maximal absolute value of the weights are fixed, then one-dimensional recursive
mean-payoff games under modular strategies can be solved in polynomial time, whereas
for unbounded number of exits or modules the problem is NP-hard.'
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), Microsoft faculty fellows award, the RICH Model Toolkit (ICT COST Action
IC0901), and was carried out in partial fulfillment of the requirements for the
Ph.D. degree of the second author.'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional
mean-payoff games. Journal of Computer and System Sciences. 2017;88:236-259.
doi:10.1016/j.jcss.2017.04.005
apa: Chatterjee, K., & Velner, Y. (2017). Hyperplane separation technique for
multidimensional mean-payoff games. Journal of Computer and System Sciences.
Academic Press. https://doi.org/10.1016/j.jcss.2017.04.005
chicago: Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique
for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences.
Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005.
ieee: K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional
mean-payoff games,” Journal of Computer and System Sciences, vol. 88. Academic
Press, pp. 236–259, 2017.
ista: Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional
mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.
mla: Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique
for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences,
vol. 88, Academic Press, 2017, pp. 236–59, doi:10.1016/j.jcss.2017.04.005.
short: K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017)
236–259.
date_created: 2018-12-11T11:48:07Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-02-23T10:38:15Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.jcss.2017.04.005
ec_funded: 1
intvolume: ' 88'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1210.3141
month: '09'
oa: 1
oa_version: Preprint
page: 236 - 259
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: Journal of Computer and System Sciences
publication_status: published
publisher: Academic Press
publist_id: '6963'
quality_controlled: '1'
related_material:
record:
- id: '2329'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Hyperplane separation technique for multidimensional mean-payoff games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 88
year: '2017'
...
---
_id: '719'
abstract:
- lang: eng
text: 'The ubiquity of computation in modern machines and devices imposes a need
to assert the correctness of their behavior. Especially in the case of safety-critical
systems, their designers need to take measures that enforce their safe operation.
Formal methods has emerged as a research field that addresses this challenge:
by rigorously proving that all system executions adhere to their specifications,
the correctness of an implementation under concern can be assured. To achieve
this goal, a plethora of techniques are nowadays available, all of which are optimized
for different system types and application domains.'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rüdiger
full_name: Ehlers, Rüdiger
last_name: Ehlers
citation:
ama: 'Chatterjee K, Ehlers R. Special issue: Synthesis and SYNT 2014. Acta Informatica.
2017;54(6):543-544. doi:10.1007/s00236-017-0299-0'
apa: 'Chatterjee, K., & Ehlers, R. (2017). Special issue: Synthesis and SYNT
2014. Acta Informatica. Springer. https://doi.org/10.1007/s00236-017-0299-0'
chicago: 'Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis
and SYNT 2014.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-017-0299-0.'
ieee: 'K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta
Informatica, vol. 54, no. 6. Springer, pp. 543–544, 2017.'
ista: 'Chatterjee K, Ehlers R. 2017. Special issue: Synthesis and SYNT 2014. Acta
Informatica. 54(6), 543–544.'
mla: 'Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and
SYNT 2014.” Acta Informatica, vol. 54, no. 6, Springer, 2017, pp. 543–44,
doi:10.1007/s00236-017-0299-0.'
short: K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.
date_created: 2018-12-11T11:48:07Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2021-01-12T08:12:18Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00236-017-0299-0
intvolume: ' 54'
issue: '6'
language:
- iso: eng
month: '09'
oa_version: None
page: 543 - 544
publication: Acta Informatica
publication_identifier:
issn:
- '00015903'
publication_status: published
publisher: Springer
publist_id: '6961'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Special issue: Synthesis and SYNT 2014'
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2017'
...
---
_id: '720'
abstract:
- lang: eng
text: 'Advances in multi-unit recordings pave the way for statistical modeling of
activity patterns in large neural populations. Recent studies have shown that
the summed activity of all neurons strongly shapes the population response. A
separate recent finding has been that neural populations also exhibit criticality,
an anomalously large dynamic range for the probabilities of different population
activity patterns. Motivated by these two observations, we introduce a class of
probabilistic models which takes into account the prior knowledge that the neural
population could be globally coupled and close to critical. These models consist
of an energy function which parametrizes interactions between small groups of
neurons, and an arbitrary positive, strictly increasing, and twice differentiable
function which maps the energy of a population pattern to its probability. We
show that: 1) augmenting a pairwise Ising model with a nonlinearity yields an
accurate description of the activity of retinal ganglion cells which outperforms
previous models based on the summed activity of neurons; 2) prior knowledge that
the population is critical translates to prior expectations about the shape of
the nonlinearity; 3) the nonlinearity admits an interpretation in terms of a continuous
latent variable globally coupling the system whose distribution we can infer from
data. Our method is independent of the underlying system’s state space; hence,
it can be applied to other systems such as natural scenes or amino acid sequences
of proteins which are also known to exhibit criticality.'
article_number: e1005763
article_processing_charge: Yes
author:
- first_name: Jan
full_name: Humplik, Jan
id: 2E9627A8-F248-11E8-B48F-1D18A9856A87
last_name: Humplik
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Humplik J, Tkačik G. Probabilistic models for neural populations that naturally
capture global coupling and criticality. PLoS Computational Biology. 2017;13(9).
doi:10.1371/journal.pcbi.1005763
apa: Humplik, J., & Tkačik, G. (2017). Probabilistic models for neural populations
that naturally capture global coupling and criticality. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005763
chicago: Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations
That Naturally Capture Global Coupling and Criticality.” PLoS Computational
Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005763.
ieee: J. Humplik and G. Tkačik, “Probabilistic models for neural populations that
naturally capture global coupling and criticality,” PLoS Computational Biology,
vol. 13, no. 9. Public Library of Science, 2017.
ista: Humplik J, Tkačik G. 2017. Probabilistic models for neural populations that
naturally capture global coupling and criticality. PLoS Computational Biology.
13(9), e1005763.
mla: Humplik, Jan, and Gašper Tkačik. “Probabilistic Models for Neural Populations
That Naturally Capture Global Coupling and Criticality.” PLoS Computational
Biology, vol. 13, no. 9, e1005763, Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005763.
short: J. Humplik, G. Tkačik, PLoS Computational Biology 13 (2017).
date_created: 2018-12-11T11:48:08Z
date_published: 2017-09-19T00:00:00Z
date_updated: 2021-01-12T08:12:21Z
day: '19'
ddc:
- '530'
- '571'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1005763
file:
- access_level: open_access
checksum: 81107096c19771c36ddbe6f0282a3acb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:30Z
date_updated: 2020-07-14T12:47:53Z
file_id: '5352'
file_name: IST-2017-884-v1+1_journal.pcbi.1005763.pdf
file_size: 14167050
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 255008E4-B435-11E9-9278-68D0E5697425
grant_number: RGP0065/2012
name: Information processing and computation in fish groups
- _id: 254D1A94-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 25651-N26
name: Sensitivity to higher-order statistics in natural scenes
publication: PLoS Computational Biology
publication_identifier:
issn:
- 1553734X
publication_status: published
publisher: Public Library of Science
publist_id: '6960'
pubrep_id: '884'
quality_controlled: '1'
scopus_import: 1
status: public
title: Probabilistic models for neural populations that naturally capture global coupling
and criticality
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: 13
year: '2017'
...
---
_id: '721'
abstract:
- lang: eng
text: 'Let S be a positivity-preserving symmetric linear operator acting on bounded
functions. The nonlinear equation -1/m=z+Sm with a parameter z in the complex
upper half-plane ℍ has a unique solution m with values in ℍ. We show that the
z-dependence of this solution can be represented as the Stieltjes transforms of
a family of probability measures v on ℝ. Under suitable conditions on S, we show
that v has a real analytic density apart from finitely many algebraic singularities
of degree at most 3. Our motivation comes from large random matrices. The solution
m determines the density of eigenvalues of two prominent matrix ensembles: (i)
matrices with centered independent entries whose variances are given by S and
(ii) matrices with correlated entries with a translation-invariant correlation
structure. Our analysis shows that the limiting eigenvalue density has only square
root singularities or cubic root cusps; no other singularities occur.'
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- 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
citation:
ama: Ajanki OH, Krüger TH, Erdös L. Singularities of solutions to quadratic vector
equations on the complex upper half plane. Communications on Pure and Applied
Mathematics. 2017;70(9):1672-1705. doi:10.1002/cpa.21639
apa: Ajanki, O. H., Krüger, T. H., & Erdös, L. (2017). Singularities of solutions
to quadratic vector equations on the complex upper half plane. Communications
on Pure and Applied Mathematics. Wiley-Blackwell. https://doi.org/10.1002/cpa.21639
chicago: Ajanki, Oskari H, Torben H Krüger, and László Erdös. “Singularities of
Solutions to Quadratic Vector Equations on the Complex Upper Half Plane.” Communications
on Pure and Applied Mathematics. Wiley-Blackwell, 2017. https://doi.org/10.1002/cpa.21639.
ieee: O. H. Ajanki, T. H. Krüger, and L. Erdös, “Singularities of solutions to quadratic
vector equations on the complex upper half plane,” Communications on Pure and
Applied Mathematics, vol. 70, no. 9. Wiley-Blackwell, pp. 1672–1705, 2017.
ista: Ajanki OH, Krüger TH, Erdös L. 2017. Singularities of solutions to quadratic
vector equations on the complex upper half plane. Communications on Pure and Applied
Mathematics. 70(9), 1672–1705.
mla: Ajanki, Oskari H., et al. “Singularities of Solutions to Quadratic Vector Equations
on the Complex Upper Half Plane.” Communications on Pure and Applied Mathematics,
vol. 70, no. 9, Wiley-Blackwell, 2017, pp. 1672–705, doi:10.1002/cpa.21639.
short: O.H. Ajanki, T.H. Krüger, L. Erdös, Communications on Pure and Applied Mathematics
70 (2017) 1672–1705.
date_created: 2018-12-11T11:48:08Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2021-01-12T08:12:24Z
day: '01'
department:
- _id: LaEr
doi: 10.1002/cpa.21639
ec_funded: 1
intvolume: ' 70'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1512.03703
month: '09'
oa: 1
oa_version: Submitted Version
page: 1672 - 1705
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Communications on Pure and Applied Mathematics
publication_identifier:
issn:
- '00103640'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6959'
quality_controlled: '1'
scopus_import: 1
status: public
title: Singularities of solutions to quadratic vector equations on the complex upper
half plane
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2017'
...
---
_id: '722'
abstract:
- lang: eng
text: Plants are sessile organisms rooted in one place. The soil resources that
plants require are often distributed in a highly heterogeneous pattern. To aid
foraging, plants have evolved roots whose growth and development are highly responsive
to soil signals. As a result, 3D root architecture is shaped by myriad environmental
signals to ensure resource capture is optimised and unfavourable environments
are avoided. The first signals sensed by newly germinating seeds — gravity and
light — direct root growth into the soil to aid seedling establishment. Heterogeneous
soil resources, such as water, nitrogen and phosphate, also act as signals that
shape 3D root growth to optimise uptake. Root architecture is also modified through
biotic interactions that include soil fungi and neighbouring plants. This developmental
plasticity results in a ‘custom-made’ 3D root system that is best adapted to forage
for resources in each soil environment that a plant colonises.
author:
- first_name: Emily
full_name: Morris, Emily
last_name: Morris
- first_name: Marcus
full_name: Griffiths, Marcus
last_name: Griffiths
- first_name: Agata
full_name: Golebiowska, Agata
last_name: Golebiowska
- first_name: Stefan
full_name: Mairhofer, Stefan
last_name: Mairhofer
- first_name: Jasmine
full_name: Burr Hersey, Jasmine
last_name: Burr Hersey
- first_name: Tatsuaki
full_name: Goh, Tatsuaki
last_name: Goh
- first_name: Daniel
full_name: Von Wangenheim, Daniel
id: 49E91952-F248-11E8-B48F-1D18A9856A87
last_name: Von Wangenheim
orcid: 0000-0002-6862-1247
- first_name: Brian
full_name: Atkinson, Brian
last_name: Atkinson
- first_name: Craig
full_name: Sturrock, Craig
last_name: Sturrock
- first_name: Jonathan
full_name: Lynch, Jonathan
last_name: Lynch
- first_name: Kris
full_name: Vissenberg, Kris
last_name: Vissenberg
- first_name: Karl
full_name: Ritz, Karl
last_name: Ritz
- first_name: Darren
full_name: Wells, Darren
last_name: Wells
- first_name: Sacha
full_name: Mooney, Sacha
last_name: Mooney
- first_name: Malcolm
full_name: Bennett, Malcolm
last_name: Bennett
citation:
ama: Morris E, Griffiths M, Golebiowska A, et al. Shaping 3D root system architecture.
Current Biology. 2017;27(17):R919-R930. doi:10.1016/j.cub.2017.06.043
apa: Morris, E., Griffiths, M., Golebiowska, A., Mairhofer, S., Burr Hersey, J.,
Goh, T., … Bennett, M. (2017). Shaping 3D root system architecture. Current
Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.06.043
chicago: Morris, Emily, Marcus Griffiths, Agata Golebiowska, Stefan Mairhofer, Jasmine
Burr Hersey, Tatsuaki Goh, Daniel von Wangenheim, et al. “Shaping 3D Root System
Architecture.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.06.043.
ieee: E. Morris et al., “Shaping 3D root system architecture,” Current
Biology, vol. 27, no. 17. Cell Press, pp. R919–R930, 2017.
ista: Morris E, Griffiths M, Golebiowska A, Mairhofer S, Burr Hersey J, Goh T, von
Wangenheim D, Atkinson B, Sturrock C, Lynch J, Vissenberg K, Ritz K, Wells D,
Mooney S, Bennett M. 2017. Shaping 3D root system architecture. Current Biology.
27(17), R919–R930.
mla: Morris, Emily, et al. “Shaping 3D Root System Architecture.” Current Biology,
vol. 27, no. 17, Cell Press, 2017, pp. R919–30, doi:10.1016/j.cub.2017.06.043.
short: E. Morris, M. Griffiths, A. Golebiowska, S. Mairhofer, J. Burr Hersey, T.
Goh, D. von Wangenheim, B. Atkinson, C. Sturrock, J. Lynch, K. Vissenberg, K.
Ritz, D. Wells, S. Mooney, M. Bennett, Current Biology 27 (2017) R919–R930.
date_created: 2018-12-11T11:48:08Z
date_published: 2017-09-11T00:00:00Z
date_updated: 2021-01-12T08:12:29Z
day: '11'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1016/j.cub.2017.06.043
ec_funded: 1
external_id:
pmid:
- '28898665'
file:
- access_level: open_access
checksum: e45588b21097b408da6276a3e5eedb2e
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T07:46:40Z
date_updated: 2020-07-14T12:47:54Z
file_id: '6332'
file_name: 2017_CurrentBiology_Morris.pdf
file_size: 1576593
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '17'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: R919 - R930
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Current Biology
publication_identifier:
issn:
- '09609822'
publication_status: published
publisher: Cell Press
publist_id: '6956'
pubrep_id: '982'
quality_controlled: '1'
scopus_import: 1
status: public
title: Shaping 3D root system architecture
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: 27
year: '2017'
...
---
_id: '725'
abstract:
- lang: eng
text: Individual computations and social interactions underlying collective behavior
in groups of animals are of great ethological, behavioral, and theoretical interest.
While complex individual behaviors have successfully been parsed into small dictionaries
of stereotyped behavioral modes, studies of collective behavior largely ignored
these findings; instead, their focus was on inferring single, mode-independent
social interaction rules that reproduced macroscopic and often qualitative features
of group behavior. Here, we bring these two approaches together to predict individual
swimming patterns of adult zebrafish in a group. We show that fish alternate between
an “active” mode, in which they are sensitive to the swimming patterns of conspecifics,
and a “passive” mode, where they ignore them. Using a model that accounts for
these two modes explicitly, we predict behaviors of individual fish with high
accuracy, outperforming previous approaches that assumed a single continuous computation
by individuals and simple metric or topological weighing of neighbors’ behavior.
At the group level, switching between active and passive modes is uncorrelated
among fish, but correlated directional swimming behavior still emerges. Our quantitative
approach for studying complex, multi-modal individual behavior jointly with emergent
group behavior is readily extensible to additional behavioral modes and their
neural correlates as well as to other species.
author:
- first_name: Roy
full_name: Harpaz, Roy
last_name: Harpaz
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
citation:
ama: Harpaz R, Tkačik G, Schneidman E. Discrete modes of social information processing
predict individual behavior of fish in a group. PNAS. 2017;114(38):10149-10154.
doi:10.1073/pnas.1703817114
apa: Harpaz, R., Tkačik, G., & Schneidman, E. (2017). Discrete modes of social
information processing predict individual behavior of fish in a group. PNAS.
National Academy of Sciences. https://doi.org/10.1073/pnas.1703817114
chicago: Harpaz, Roy, Gašper Tkačik, and Elad Schneidman. “Discrete Modes of Social
Information Processing Predict Individual Behavior of Fish in a Group.” PNAS.
National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1703817114.
ieee: R. Harpaz, G. Tkačik, and E. Schneidman, “Discrete modes of social information
processing predict individual behavior of fish in a group,” PNAS, vol.
114, no. 38. National Academy of Sciences, pp. 10149–10154, 2017.
ista: Harpaz R, Tkačik G, Schneidman E. 2017. Discrete modes of social information
processing predict individual behavior of fish in a group. PNAS. 114(38), 10149–10154.
mla: Harpaz, Roy, et al. “Discrete Modes of Social Information Processing Predict
Individual Behavior of Fish in a Group.” PNAS, vol. 114, no. 38, National
Academy of Sciences, 2017, pp. 10149–54, doi:10.1073/pnas.1703817114.
short: R. Harpaz, G. Tkačik, E. Schneidman, PNAS 114 (2017) 10149–10154.
date_created: 2018-12-11T11:48:10Z
date_published: 2017-09-19T00:00:00Z
date_updated: 2021-01-12T08:12:36Z
day: '19'
department:
- _id: GaTk
doi: 10.1073/pnas.1703817114
external_id:
pmid:
- '28874581'
intvolume: ' 114'
issue: '38'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5617265/
month: '09'
oa: 1
oa_version: Submitted Version
page: 10149 - 10154
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '6953'
quality_controlled: '1'
scopus_import: 1
status: public
title: Discrete modes of social information processing predict individual behavior
of fish in a group
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '724'
abstract:
- lang: eng
text: We investigate the stationary and dynamical behavior of an Anderson localized
chain coupled to a single central bound state. Although this coupling partially
dilutes the Anderson localized peaks towards nearly resonant sites, the most weight
of the original peaks remains unchanged. This leads to multifractal wave functions
with a frozen spectrum of fractal dimensions, which is characteristic for localized
phases in models with power-law hopping. Using a perturbative approach we identify
two different dynamical regimes. At weak couplings to the central site, the transport
of particles and information is logarithmic in time, a feature usually attributed
to many-body localization. We connect such transport to the persistence of the
Poisson statistics of level spacings in parts of the spectrum. In contrast, at
stronger couplings the level repulsion is established in the entire spectrum,
the problem can be mapped to the Fano resonance, and the transport is ballistic.
acknowledgement: "We would like to thank Dmitry Abanin, Christophe De\r\nBeule,
\ Joel Moore, Romain Vasseur, and Norman Yao for\r\nmany stimulating discussions.
\ Financial support has been\r\nprovided by the Deutsche Forschungsgemeinschaft
\ (DFG)\r\nvia Grant No. TR950/8-1, SFB 1170 “ToCoTronics” and the\r\nENB Graduate
\ School on Topological Insulators. M.S. was\r\nsupported by Gordon and Betty
Moore Foundation’s EPiQS\r\nInitiative through Grant No. GBMF4307. F.P. acknowledges\r\nsupport
from the DFG Research Unit FOR 1807 through Grant\r\nNo. PO 1370/2-1."
article_number: '104203'
author:
- first_name: Daniel
full_name: Hetterich, Daniel
last_name: Hetterich
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Fernando
full_name: Domínguez, Fernando
last_name: Domínguez
- first_name: Frank
full_name: Pollmann, Frank
last_name: Pollmann
- first_name: Björn
full_name: Trauzettel, Björn
last_name: Trauzettel
citation:
ama: Hetterich D, Serbyn M, Domínguez F, Pollmann F, Trauzettel B. Noninteracting
central site model localization and logarithmic entanglement growth. Physical
Review B. 2017;96(10). doi:10.1103/PhysRevB.96.104203
apa: Hetterich, D., Serbyn, M., Domínguez, F., Pollmann, F., & Trauzettel, B.
(2017). Noninteracting central site model localization and logarithmic entanglement
growth. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.96.104203
chicago: Hetterich, Daniel, Maksym Serbyn, Fernando Domínguez, Frank Pollmann, and
Björn Trauzettel. “Noninteracting Central Site Model Localization and Logarithmic
Entanglement Growth.” Physical Review B. American Physical Society, 2017.
https://doi.org/10.1103/PhysRevB.96.104203.
ieee: D. Hetterich, M. Serbyn, F. Domínguez, F. Pollmann, and B. Trauzettel, “Noninteracting
central site model localization and logarithmic entanglement growth,” Physical
Review B, vol. 96, no. 10. American Physical Society, 2017.
ista: Hetterich D, Serbyn M, Domínguez F, Pollmann F, Trauzettel B. 2017. Noninteracting
central site model localization and logarithmic entanglement growth. Physical
Review B. 96(10), 104203.
mla: Hetterich, Daniel, et al. “Noninteracting Central Site Model Localization and
Logarithmic Entanglement Growth.” Physical Review B, vol. 96, no. 10, 104203,
American Physical Society, 2017, doi:10.1103/PhysRevB.96.104203.
short: D. Hetterich, M. Serbyn, F. Domínguez, F. Pollmann, B. Trauzettel, Physical
Review B 96 (2017).
date_created: 2018-12-11T11:48:09Z
date_published: 2017-09-13T00:00:00Z
date_updated: 2021-01-12T08:12:35Z
day: '13'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.96.104203
intvolume: ' 96'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.02744
month: '09'
oa: 1
oa_version: Submitted Version
publication: Physical Review B
publication_identifier:
issn:
- '24699950'
publication_status: published
publisher: American Physical Society
publist_id: '6955'
quality_controlled: '1'
scopus_import: 1
status: public
title: Noninteracting central site model localization and logarithmic entanglement
growth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2017'
...
---
_id: '7289'
abstract:
- lang: eng
text: Aprotic sodium–O2 batteries require the reversible formation/dissolution of
sodium superoxide (NaO2) on cycling. Poor cycle life has been associated with
parasitic chemistry caused by the reactivity of electrolyte and electrode with
NaO2, a strong nucleophile and base. Its reactivity can, however, not consistently
explain the side reactions and irreversibility. Herein we show that singlet oxygen
(1O2) forms at all stages of cycling and that it is a main driver for parasitic
chemistry. It was detected in‐ and ex‐situ via a 1O2 trap that selectively and
rapidly forms a stable adduct with 1O2. The 1O2 formation mechanism involves proton‐mediated
superoxide disproportionation on discharge, rest, and charge below ca. 3.3 V,
and direct electrochemical 1O2 evolution above ca. 3.3 V. Trace water, which is
needed for high capacities also drives parasitic chemistry. Controlling the highly
reactive singlet oxygen is thus crucial for achieving highly reversible cell operation.
article_processing_charge: No
article_type: original
author:
- first_name: Lukas
full_name: Schafzahl, Lukas
last_name: Schafzahl
- first_name: Nika
full_name: Mahne, Nika
last_name: Mahne
- first_name: Bettina
full_name: Schafzahl, Bettina
last_name: Schafzahl
- first_name: Martin
full_name: Wilkening, Martin
last_name: Wilkening
- first_name: Christian
full_name: Slugovc, Christian
last_name: Slugovc
- first_name: Sergey M.
full_name: Borisov, Sergey M.
last_name: Borisov
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Schafzahl L, Mahne N, Schafzahl B, et al. Singlet oxygen during cycling of
the aprotic sodium-O2 battery. Angewandte Chemie International Edition.
2017;56(49):15728-15732. doi:10.1002/anie.201709351
apa: Schafzahl, L., Mahne, N., Schafzahl, B., Wilkening, M., Slugovc, C., Borisov,
S. M., & Freunberger, S. A. (2017). Singlet oxygen during cycling of the aprotic
sodium-O2 battery. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201709351
chicago: Schafzahl, Lukas, Nika Mahne, Bettina Schafzahl, Martin Wilkening, Christian
Slugovc, Sergey M. Borisov, and Stefan Alexander Freunberger. “Singlet Oxygen
during Cycling of the Aprotic Sodium-O2 Battery.” Angewandte Chemie International
Edition. Wiley, 2017. https://doi.org/10.1002/anie.201709351.
ieee: L. Schafzahl et al., “Singlet oxygen during cycling of the aprotic
sodium-O2 battery,” Angewandte Chemie International Edition, vol. 56, no.
49. Wiley, pp. 15728–15732, 2017.
ista: Schafzahl L, Mahne N, Schafzahl B, Wilkening M, Slugovc C, Borisov SM, Freunberger
SA. 2017. Singlet oxygen during cycling of the aprotic sodium-O2 battery. Angewandte
Chemie International Edition. 56(49), 15728–15732.
mla: Schafzahl, Lukas, et al. “Singlet Oxygen during Cycling of the Aprotic Sodium-O2
Battery.” Angewandte Chemie International Edition, vol. 56, no. 49, Wiley,
2017, pp. 15728–32, doi:10.1002/anie.201709351.
short: L. Schafzahl, N. Mahne, B. Schafzahl, M. Wilkening, C. Slugovc, S.M. Borisov,
S.A. Freunberger, Angewandte Chemie International Edition 56 (2017) 15728–15732.
date_created: 2020-01-15T12:15:05Z
date_published: 2017-12-04T00:00:00Z
date_updated: 2021-01-12T08:12:47Z
day: '04'
ddc:
- '540'
doi: 10.1002/anie.201709351
extern: '1'
file:
- access_level: open_access
checksum: 3c5b1e51954554dffb13c7d58f69836c
content_type: application/pdf
creator: dernst
date_created: 2020-01-26T14:58:07Z
date_updated: 2020-07-14T12:47:55Z
file_id: '7362'
file_name: 2017_AngChemieInternat_Schafzahl.pdf
file_size: 1013492
relation: main_file
file_date_updated: 2020-07-14T12:47:55Z
has_accepted_license: '1'
intvolume: ' 56'
issue: '49'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 15728-15732
publication: Angewandte Chemie International Edition
publication_identifier:
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Singlet oxygen during cycling of the aprotic sodium-O2 battery
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2017'
...