---
_id: '291'
abstract:
- lang: eng
text: Over the past decade, the edge of chaos has proven to be a fruitful starting
point for investigations of shear flows when the laminar base flow is linearly
stable. Numerous computational studies of shear flows demonstrated the existence
of states that separate laminar and turbulent regions of the state space. In addition,
some studies determined invariant solutions that reside on this edge. In this
paper, we study the unstable manifold of one such solution with the aid of continuous
symmetry reduction, which we formulate here for the simultaneous quotiening of
axial and azimuthal symmetries. Upon our investigation of the unstable manifold,
we discover a previously unknown traveling-wave solution on the laminar-turbulent
boundary with a relatively complex structure. By means of low-dimensional projections,
we visualize different dynamical paths that connect these solutions to the turbulence.
Our numerical experiments demonstrate that the laminar-turbulent boundary exhibits
qualitatively different regions whose properties are influenced by the nearby
invariant solutions.
article_number: '054401'
article_processing_charge: No
arxiv: 1
author:
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Budanur NB, Hof B. Complexity of the laminar-turbulent boundary in pipe flow.
Physical Review Fluids. 2018;3(5). doi:10.1103/PhysRevFluids.3.054401
apa: Budanur, N. B., & Hof, B. (2018). Complexity of the laminar-turbulent boundary
in pipe flow. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.3.054401
chicago: Budanur, Nazmi B, and Björn Hof. “Complexity of the Laminar-Turbulent Boundary
in Pipe Flow.” Physical Review Fluids. American Physical Society, 2018.
https://doi.org/10.1103/PhysRevFluids.3.054401.
ieee: N. B. Budanur and B. Hof, “Complexity of the laminar-turbulent boundary in
pipe flow,” Physical Review Fluids, vol. 3, no. 5. American Physical Society,
2018.
ista: Budanur NB, Hof B. 2018. Complexity of the laminar-turbulent boundary in pipe
flow. Physical Review Fluids. 3(5), 054401.
mla: Budanur, Nazmi B., and Björn Hof. “Complexity of the Laminar-Turbulent Boundary
in Pipe Flow.” Physical Review Fluids, vol. 3, no. 5, 054401, American
Physical Society, 2018, doi:10.1103/PhysRevFluids.3.054401.
short: N.B. Budanur, B. Hof, Physical Review Fluids 3 (2018).
date_created: 2018-12-11T11:45:39Z
date_published: 2018-05-30T00:00:00Z
date_updated: 2023-09-11T12:45:44Z
day: '30'
department:
- _id: BjHo
doi: 10.1103/PhysRevFluids.3.054401
external_id:
arxiv:
- '1802.01918'
isi:
- '000433426200001'
intvolume: ' 3'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.01918
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review Fluids
publication_status: published
publisher: American Physical Society
publist_id: '7590'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Complexity of the laminar-turbulent boundary in pipe flow
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 3
year: '2018'
...
---
_id: '292'
abstract:
- lang: eng
text: 'Retina is a paradigmatic system for studying sensory encoding: the transformation
of light into spiking activity of ganglion cells. The inverse problem, where stimulus
is reconstructed from spikes, has received less attention, especially for complex
stimuli that should be reconstructed “pixel-by-pixel”. We recorded around a hundred
neurons from a dense patch in a rat retina and decoded movies of multiple small
randomly-moving discs. We constructed nonlinear (kernelized and neural network)
decoders that improved significantly over linear results. An important contribution
to this was the ability of nonlinear decoders to reliably separate between neural
responses driven by locally fluctuating light signals, and responses at locally
constant light driven by spontaneous-like activity. This improvement crucially
depended on the precise, non-Poisson temporal structure of individual spike trains,
which originated in the spike-history dependence of neural responses. We propose
a general principle by which downstream circuitry could discriminate between spontaneous
and stimulus-driven activity based solely on higher-order statistical structure
in the incoming spike trains.'
article_number: e1006057
article_processing_charge: Yes
article_type: original
author:
- first_name: Vicent
full_name: Botella Soler, Vicent
id: 421234E8-F248-11E8-B48F-1D18A9856A87
last_name: Botella Soler
orcid: 0000-0002-8790-1914
- first_name: Stephane
full_name: Deny, Stephane
last_name: Deny
- first_name: Georg S
full_name: Martius, Georg S
last_name: Martius
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Botella Soler V, Deny S, Martius GS, Marre O, Tkačik G. Nonlinear decoding
of a complex movie from the mammalian retina. PLoS Computational Biology.
2018;14(5). doi:10.1371/journal.pcbi.1006057
apa: Botella Soler, V., Deny, S., Martius, G. S., Marre, O., & Tkačik, G. (2018).
Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1006057
chicago: Botella Soler, Vicente, Stephane Deny, Georg S Martius, Olivier Marre,
and Gašper Tkačik. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.”
PLoS Computational Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pcbi.1006057.
ieee: V. Botella Soler, S. Deny, G. S. Martius, O. Marre, and G. Tkačik, “Nonlinear
decoding of a complex movie from the mammalian retina,” PLoS Computational
Biology, vol. 14, no. 5. Public Library of Science, 2018.
ista: Botella Soler V, Deny S, Martius GS, Marre O, Tkačik G. 2018. Nonlinear decoding
of a complex movie from the mammalian retina. PLoS Computational Biology. 14(5),
e1006057.
mla: Botella Soler, Vicente, et al. “Nonlinear Decoding of a Complex Movie from
the Mammalian Retina.” PLoS Computational Biology, vol. 14, no. 5, e1006057,
Public Library of Science, 2018, doi:10.1371/journal.pcbi.1006057.
short: V. Botella Soler, S. Deny, G.S. Martius, O. Marre, G. Tkačik, PLoS Computational
Biology 14 (2018).
date_created: 2018-12-11T11:45:39Z
date_published: 2018-05-10T00:00:00Z
date_updated: 2024-02-21T13:45:25Z
day: '10'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1006057
ec_funded: 1
external_id:
isi:
- '000434012100002'
file:
- access_level: open_access
checksum: 3026f94d235219e15514505fdbadf34e
content_type: application/pdf
creator: dernst
date_created: 2019-02-13T11:07:15Z
date_updated: 2020-07-14T12:45:53Z
file_id: '5974'
file_name: 2018_Plos_Botella_Soler.pdf
file_size: 3460786
relation: main_file
file_date_updated: 2020-07-14T12:45:53Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 25CBA828-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '720270'
name: Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)
- _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_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/video-of-moving-discs-reconstructed-from-rat-retinal-neuron-signals/
record:
- id: '5584'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Nonlinear decoding of a complex movie from the mammalian retina
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '293'
abstract:
- lang: eng
text: People sometimes make their admirable deeds and accomplishments hard to spot,
such as by giving anonymously or avoiding bragging. Such ‘buried’ signals are
hard to reconcile with standard models of signalling or indirect reciprocity,
which motivate costly pro-social behaviour by reputational gains. To explain these
phenomena, we design a simple game theory model, which we call the signal-burying
game. This game has the feature that senders can bury their signal by deliberately
reducing the probability of the signal being observed. If the signal is observed,
however, it is identified as having been buried. We show under which conditions
buried signals can be maintained, using static equilibrium concepts and calculations
of the evolutionary dynamics. We apply our analysis to shed light on a number
of otherwise puzzling social phenomena, including modesty, anonymous donations,
subtlety in art and fashion, and overeagerness.
acknowledgement: This work was supported by a grant from the John Templeton Foundation
and by the Office of Naval Research Grant N00014-16-1-2914 (M.A.N.). C.H. acknowledges
generous support from the ISTFELLOW programme and by the Schrödinger scholarship
of the Austrian Science Fund (FWF) J3475.
article_processing_charge: No
article_type: original
author:
- first_name: Moshe
full_name: Hoffman, Moshe
last_name: Hoffman
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Hoffman M, Hilbe C, Nowak M. The signal-burying game can explain why we obscure
positive traits and good deeds. Nature Human Behaviour. 2018;2:397-404.
doi:10.1038/s41562-018-0354-z
apa: Hoffman, M., Hilbe, C., & Nowak, M. (2018). The signal-burying game can
explain why we obscure positive traits and good deeds. Nature Human Behaviour.
Nature Publishing Group. https://doi.org/10.1038/s41562-018-0354-z
chicago: Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying
Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human
Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0354-z.
ieee: M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why
we obscure positive traits and good deeds,” Nature Human Behaviour, vol.
2. Nature Publishing Group, pp. 397–404, 2018.
ista: Hoffman M, Hilbe C, Nowak M. 2018. The signal-burying game can explain why
we obscure positive traits and good deeds. Nature Human Behaviour. 2, 397–404.
mla: Hoffman, Moshe, et al. “The Signal-Burying Game Can Explain Why We Obscure
Positive Traits and Good Deeds.” Nature Human Behaviour, vol. 2, Nature
Publishing Group, 2018, pp. 397–404, doi:10.1038/s41562-018-0354-z.
short: M. Hoffman, C. Hilbe, M. Nowak, Nature Human Behaviour 2 (2018) 397–404.
date_created: 2018-12-11T11:45:39Z
date_published: 2018-05-28T00:00:00Z
date_updated: 2023-09-19T10:12:03Z
day: '28'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1038/s41562-018-0354-z
ec_funded: 1
external_id:
isi:
- '000435551300009'
file:
- access_level: open_access
checksum: 32efaf06a597495c184df91b3fbb19c0
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:17:23Z
date_updated: 2020-07-14T12:45:54Z
file_id: '7051'
file_name: 2018_NatureHumanBeh_Hoffman.pdf
file_size: 194734
relation: main_file
file_date_updated: 2020-07-14T12:45:54Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 397 - 404
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Nature Human Behaviour
publication_status: published
publisher: Nature Publishing Group
publist_id: '7588'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/the-logic-of-modesty-why-it-pays-to-be-humble/
scopus_import: '1'
status: public
title: The signal-burying game can explain why we obscure positive traits and good
deeds
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '294'
abstract:
- lang: eng
text: We developed a method to calculate two-photon processes in quantum mechanics
that replaces the infinite summation over the intermediate states by a perturbation
expansion. This latter consists of a series of commutators that involve position,
momentum, and Hamiltonian quantum operators. We analyzed several single- and many-particle
cases for which a closed-form solution to the perturbation expansion exists, as
well as more complicated cases for which a solution is found by convergence. Throughout
the article, Rayleigh and Raman scattering are taken as examples of two-photon
processes. The present method provides a clear distinction between the Thomson
scattering, regarded as classical scattering, and quantum contributions. Such
a distinction lets us derive general results concerning light scattering. Finally,
possible extensions to the developed formalism are discussed.
article_processing_charge: No
arxiv: 1
author:
- first_name: Filippo
full_name: Fratini, Filippo
last_name: Fratini
- first_name: Laleh
full_name: Safari, Laleh
id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
last_name: Safari
- first_name: Pedro
full_name: Amaro, Pedro
last_name: Amaro
- first_name: José
full_name: Santos, José
last_name: Santos
citation:
ama: Fratini F, Safari L, Amaro P, Santos J. Two-photon processes based on quantum
commutators. Physical Review A - Atomic, Molecular, and Optical Physics.
2018;97(4). doi:10.1103/PhysRevA.97.043842
apa: Fratini, F., Safari, L., Amaro, P., & Santos, J. (2018). Two-photon processes
based on quantum commutators. Physical Review A - Atomic, Molecular, and Optical
Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.97.043842
chicago: Fratini, Filippo, Laleh Safari, Pedro Amaro, and José Santos. “Two-Photon
Processes Based on Quantum Commutators.” Physical Review A - Atomic, Molecular,
and Optical Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevA.97.043842.
ieee: F. Fratini, L. Safari, P. Amaro, and J. Santos, “Two-photon processes based
on quantum commutators,” Physical Review A - Atomic, Molecular, and Optical
Physics, vol. 97, no. 4. American Physical Society, 2018.
ista: Fratini F, Safari L, Amaro P, Santos J. 2018. Two-photon processes based on
quantum commutators. Physical Review A - Atomic, Molecular, and Optical Physics.
97(4).
mla: Fratini, Filippo, et al. “Two-Photon Processes Based on Quantum Commutators.”
Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no.
4, American Physical Society, 2018, doi:10.1103/PhysRevA.97.043842.
short: F. Fratini, L. Safari, P. Amaro, J. Santos, Physical Review A - Atomic, Molecular,
and Optical Physics 97 (2018).
date_created: 2018-12-11T11:45:40Z
date_published: 2018-04-18T00:00:00Z
date_updated: 2023-09-19T10:17:56Z
day: '18'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.97.043842
ec_funded: 1
external_id:
arxiv:
- '1801.06892'
isi:
- '000430296800008'
intvolume: ' 97'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.06892
month: '04'
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
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '7587'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Two-photon processes based on quantum commutators
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...
---
_id: '295'
abstract:
- lang: eng
text: We prove upper and lower bounds on the ground-state energy of the ideal two-dimensional
anyon gas. Our bounds are extensive in the particle number, as for fermions, and
linear in the statistics parameter (Formula presented.). The lower bounds extend
to Lieb–Thirring inequalities for all anyons except bosons.
acknowledgement: Financial support from the Swedish Research Council, grant no. 2013-4734
(D. L.), the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (grant agreement No 694227, R. S.), and by
the Austrian Science Fund (FWF), project Nr. P 27533-N27 (R. S.), is gratefully
acknowledged.
article_processing_charge: No
arxiv: 1
author:
- first_name: Douglas
full_name: Lundholm, Douglas
last_name: Lundholm
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Lundholm D, Seiringer R. Fermionic behavior of ideal anyons. Letters in
Mathematical Physics. 2018;108(11):2523-2541. doi:10.1007/s11005-018-1091-y
apa: Lundholm, D., & Seiringer, R. (2018). Fermionic behavior of ideal anyons.
Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-018-1091-y
chicago: Lundholm, Douglas, and Robert Seiringer. “Fermionic Behavior of Ideal Anyons.”
Letters in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s11005-018-1091-y.
ieee: D. Lundholm and R. Seiringer, “Fermionic behavior of ideal anyons,” Letters
in Mathematical Physics, vol. 108, no. 11. Springer, pp. 2523–2541, 2018.
ista: Lundholm D, Seiringer R. 2018. Fermionic behavior of ideal anyons. Letters
in Mathematical Physics. 108(11), 2523–2541.
mla: Lundholm, Douglas, and Robert Seiringer. “Fermionic Behavior of Ideal Anyons.”
Letters in Mathematical Physics, vol. 108, no. 11, Springer, 2018, pp.
2523–41, doi:10.1007/s11005-018-1091-y.
short: D. Lundholm, R. Seiringer, Letters in Mathematical Physics 108 (2018) 2523–2541.
date_created: 2018-12-11T11:45:40Z
date_published: 2018-05-11T00:00:00Z
date_updated: 2023-09-11T14:01:57Z
day: '11'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s11005-018-1091-y
ec_funded: 1
external_id:
arxiv:
- '1712.06218'
isi:
- '000446491500008'
file:
- access_level: open_access
checksum: 8beb9632fa41bbd19452f55f31286a31
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:14:17Z
date_updated: 2020-07-14T12:45:55Z
file_id: '5698'
file_name: 2018_LettMathPhys_Lundholm.pdf
file_size: 551996
relation: main_file
file_date_updated: 2020-07-14T12:45:55Z
has_accepted_license: '1'
intvolume: ' 108'
isi: 1
issue: '11'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 2523-2541
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '7586'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fermionic behavior of ideal anyons
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 108
year: '2018'
...
---
_id: '296'
abstract:
- lang: eng
text: The thermodynamic description of many-particle systems rests on the assumption
of ergodicity, the ability of a system to explore all allowed configurations in
the phase space. Recent studies on many-body localization have revealed the existence
of systems that strongly violate ergodicity in the presence of quenched disorder.
Here, we demonstrate that ergodicity can be weakly broken by a different mechanism,
arising from the presence of special eigenstates in the many-body spectrum that
are reminiscent of quantum scars in chaotic non-interacting systems. In the single-particle
case, quantum scars correspond to wavefunctions that concentrate in the vicinity
of unstable periodic classical trajectories. We show that many-body scars appear
in the Fibonacci chain, a model with a constrained local Hilbert space that has
recently been experimentally realized in a Rydberg-atom quantum simulator. The
quantum scarred eigenstates are embedded throughout the otherwise thermalizing
many-body spectrum but lead to direct experimental signatures, as we show for
periodic recurrences that reproduce those observed in the experiment. Our results
suggest that scarred many-body bands give rise to a new universality class of
quantum dynamics, opening up opportunities for the creation of novel states with
long-lived coherence in systems that are now experimentally realizable.
acknowledgement: C.J.T., A.M. and Z.P. acknowledge support from EPSRC grants EP/P009409/1
and EP/M50807X/1, and Royal Society Research Grant RG160635. D.A. acknowledges support
from the Swiss National Science Foundation.
article_processing_charge: No
article_type: original
author:
- first_name: Christopher
full_name: Turner, Christopher
last_name: Turner
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: Dmitry
full_name: Abanin, Dmitry
last_name: Abanin
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Zlatko
full_name: Papić, Zlatko
last_name: Papić
citation:
ama: Turner C, Michailidis A, Abanin D, Serbyn M, Papić Z. Weak ergodicity breaking
from quantum many-body scars. Nature Physics. 2018;14:745-749. doi:10.1038/s41567-018-0137-5
apa: Turner, C., Michailidis, A., Abanin, D., Serbyn, M., & Papić, Z. (2018).
Weak ergodicity breaking from quantum many-body scars. Nature Physics.
Nature Publishing Group. https://doi.org/10.1038/s41567-018-0137-5
chicago: Turner, Christopher, Alexios Michailidis, Dmitry Abanin, Maksym Serbyn,
and Zlatko Papić. “Weak Ergodicity Breaking from Quantum Many-Body Scars.” Nature
Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-018-0137-5.
ieee: C. Turner, A. Michailidis, D. Abanin, M. Serbyn, and Z. Papić, “Weak ergodicity
breaking from quantum many-body scars,” Nature Physics, vol. 14. Nature
Publishing Group, pp. 745–749, 2018.
ista: Turner C, Michailidis A, Abanin D, Serbyn M, Papić Z. 2018. Weak ergodicity
breaking from quantum many-body scars. Nature Physics. 14, 745–749.
mla: Turner, Christopher, et al. “Weak Ergodicity Breaking from Quantum Many-Body
Scars.” Nature Physics, vol. 14, Nature Publishing Group, 2018, pp. 745–49,
doi:10.1038/s41567-018-0137-5.
short: C. Turner, A. Michailidis, D. Abanin, M. Serbyn, Z. Papić, Nature Physics
14 (2018) 745–749.
date_created: 2018-12-11T11:45:40Z
date_published: 2018-05-14T00:00:00Z
date_updated: 2023-09-19T10:37:55Z
day: '14'
department:
- _id: MaSe
doi: 10.1038/s41567-018-0137-5
external_id:
isi:
- '000438253600028'
intvolume: ' 14'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprints.whiterose.ac.uk/130860/
month: '05'
oa: 1
oa_version: Submitted Version
page: 745 - 749
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '7585'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Weak ergodicity breaking from quantum many-body scars
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '297'
abstract:
- lang: eng
text: Graph games played by two players over finite-state graphs are central in
many problems in computer science. In particular, graph games with ω -regular
winning conditions, specified as parity objectives, which can express properties
such as safety, liveness, fairness, are the basic framework for verification and
synthesis of reactive systems. The decisions for a player at various states of
the graph game are represented as strategies. While the algorithmic problem for
solving graph games with parity objectives has been widely studied, the most prominent
data-structure for strategy representation in graph games has been binary decision
diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain
the inherent flavor of the decisions of strategies, and are notoriously hard to
minimize to obtain succinct representation. In this work we propose decision trees
for strategy representation in graph games. Decision trees retain the flavor of
decisions of strategies and allow entropy-based minimization to obtain succinct
trees. However, decision trees work in settings (e.g., probabilistic models) where
errors are allowed, and overfitting of data is typically avoided. In contrast,
for strategies in graph games no error is allowed, and the decision tree must
represent the entire strategy. We develop new techniques to extend decision trees
to overcome the above obstacles, while retaining the entropy-based techniques
to obtain succinct trees. We have implemented our techniques to extend the existing
decision tree solvers. We present experimental results for problems in reactive
synthesis to show that decision trees provide a much more efficient data-structure
for strategy representation as compared to BDDs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by
decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21'
apa: 'Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy
representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407).
Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis
of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman.
“Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407.
Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
ieee: 'T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation
by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and
Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece,
2018, vol. 10805, pp. 385–407.'
ista: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation
by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.'
mla: Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive
Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.
short: T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp.
385–407.
conference:
end_date: 2018-04-20
location: Thessaloniki, Greece
name: 'TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2018-04-14
date_created: 2018-12-11T11:45:41Z
date_published: 2018-04-12T00:00:00Z
date_updated: 2025-06-02T08:53:40Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-89960-2_21
ec_funded: 1
external_id:
isi:
- '000546326300021'
file:
- access_level: open_access
checksum: b13874ffb114932ad9cc2586b7469db4
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:29:08Z
date_updated: 2020-07-14T12:45:57Z
file_id: '5723'
file_name: 2018_LNCS_Brazdil.pdf
file_size: 1829940
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 10805'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 385 - 407
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7584'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategy representation by decision trees in reactive synthesis
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10805
year: '2018'
...
---
_id: '298'
abstract:
- lang: eng
text: "Memory-hard functions (MHF) are functions whose evaluation cost is dominated
by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated
hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware
(like x86 CPUs). MHFs have interesting cryptographic applications, most notably
to password hashing and securing blockchains.\r\n\r\nAlwen and Serbinenko [STOC’15]
define the cumulative memory complexity (cmc) of a function as the sum (over all
time-steps) of the amount of memory required to compute the function. They advocate
that a good MHF must have high cmc. Unlike previous notions, cmc takes into account
that dedicated hardware might exploit amortization and parallelism. Still, cmc
has been critizised as insufficient, as it fails to capture possible time-memory
trade-offs; as memory cost doesn’t scale linearly, functions with the same cmc
could still have very different actual hardware cost.\r\n\r\nIn this work we address
this problem, and introduce the notion of sustained-memory complexity, which requires
that any algorithm evaluating the function must use a large amount of memory for
many steps. We construct functions (in the parallel random oracle model) whose
sustained-memory complexity is almost optimal: our function can be evaluated using
n steps and O(n/log(n)) memory, in each step making one query to the (fixed-input
length) random oracle, while any algorithm that can make arbitrary many parallel
queries to the random oracle, still needs Ω(n/log(n)) memory for Ω(n) steps.\r\n\r\nAs
has been done for various notions (including cmc) before, we reduce the task of
constructing an MHFs with high sustained-memory complexity to proving pebbling
lower bounds on DAGs. Our main technical contribution is the construction is a
family of DAGs on n nodes with constant indegree with high “sustained-space complexity”,
meaning that any parallel black-pebbling strategy requires Ω(n/log(n)) pebbles
for at least Ω(n) steps.\r\n\r\nAlong the way we construct a family of maximally
“depth-robust” DAGs with maximum indegree O(logn) , improving upon the construction
of Mahmoody et al. [ITCS’13] which had maximum indegree O(log2n⋅"
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821.
Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4'
apa: 'Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity
(Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology,
Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4'
chicago: Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space
Complexity,” 10821:99–130. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_4.
ieee: 'J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,”
presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018,
vol. 10821, pp. 99–130.'
ista: 'Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt
2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.'
mla: Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer,
2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.
short: J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
conference:
end_date: 2018-05-03
location: Tel Aviv, Israel
name: 'Eurocrypt 2018: Advances in Cryptology'
start_date: 2018-04-29
date_created: 2018-12-11T11:45:41Z
date_published: 2018-03-31T00:00:00Z
date_updated: 2023-09-19T09:59:30Z
day: '31'
department:
- _id: KrPi
doi: 10.1007/978-3-319-78375-8_4
ec_funded: 1
external_id:
arxiv:
- '1705.05313'
isi:
- '000517098700004'
intvolume: ' 10821'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.05313
month: '03'
oa: 1
oa_version: Preprint
page: 99 - 130
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '7583'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sustained space complexity
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10821
year: '2018'
...
---
_id: '299'
abstract:
- lang: eng
text: We introduce in this paper AMT 2.0 , a tool for qualitative and quantitative
analysis of hybrid continuous and Boolean signals that combine numerical values
and discrete events. The evaluation of the signals is based on rich temporal specifications
expressed in extended Signal Temporal Logic (xSTL), which integrates Timed Regular
Expressions (TRE) within Signal Temporal Logic (STL). The tool features qualitative
monitoring (property satisfaction checking), trace diagnostics for explaining
and justifying property violations and specification-driven measurement of quantitative
features of the signal.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Olivier
full_name: Lebeltel, Olivier
last_name: Lebeltel
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and
quantitative trace analysis with extended signal temporal logic. In: Beyer D,
Huisman M, eds. Vol 10806. Springer; 2018:303-319. doi:10.1007/978-3-319-89963-3_18'
apa: 'Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., & Ulus, D. (2018).
AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal
logic. In D. Beyer & M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89963-3_18'
chicago: 'Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan
Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal
Temporal Logic.” edited by Dirk Beyer and Marieke Huisman, 10806:303–19. Springer,
2018. https://doi.org/10.1007/978-3-319-89963-3_18.'
ieee: 'D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Thessaloniki, Greece, 2018, vol. 10806, pp. 303–319.'
ista: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2018. AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10806,
303–319.'
mla: 'Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis
with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman,
vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.'
short: D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, in:, D. Beyer, M.
Huisman (Eds.), Springer, 2018, pp. 303–319.
conference:
end_date: 2018-04-20
location: Thessaloniki, Greece
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2018-04-14
date_created: 2018-12-11T11:45:41Z
date_published: 2018-04-14T00:00:00Z
date_updated: 2023-09-08T11:52:02Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-89963-3_18
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
external_id:
isi:
- '00445822600018'
file:
- access_level: open_access
checksum: e11db3b9c8e27a1c7d1c738cc5e4d25a
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T07:33:05Z
date_updated: 2020-07-14T12:45:58Z
file_id: '5928'
file_name: 2018_LNCS_Nickovic.pdf
file_size: 3267209
relation: main_file
file_date_updated: 2020-07-14T12:45:58Z
has_accepted_license: '1'
intvolume: ' 10806'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 303 - 319
publication_status: published
publisher: Springer
publist_id: '7582'
quality_controlled: '1'
related_material:
record:
- id: '10861'
relation: later_version
status: public
scopus_import: '1'
status: public
title: 'AMT 2.0: Qualitative and quantitative trace analysis with extended signal
temporal logic'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10806
year: '2018'
...
---
_id: '3'
abstract:
- lang: eng
text: SETD5 gene mutations have been identified as a frequent cause of idiopathic
intellectual disability. Here we show that Setd5-haploinsufficient mice present
developmental defects such as abnormal brain-to-body weight ratios and neural
crest defect-associated phenotypes. Furthermore, Setd5-mutant mice show impairments
in cognitive tasks, enhanced long-term potentiation, delayed ontogenetic profile
of ultrasonic vocalization, and behavioral inflexibility. Behavioral issues are
accompanied by abnormal expression of postsynaptic density proteins previously
associated with cognition. Our data additionally indicate that Setd5 regulates
RNA polymerase II dynamics and gene transcription via its interaction with the
Hdac3 and Paf1 complexes, findings potentially explaining the gene expression
defects observed in Setd5-haploinsufficient mice. Our results emphasize the decisive
role of Setd5 in a biological pathway found to be disrupted in humans with intellectual
disability and autism spectrum disorder.
acknowledged_ssus:
- _id: M-Shop
- _id: PreCl
acknowledgement: This work was supported by the Simons Foundation Autism Research
Initiative (grant 401299) to G.N. and the DFG (SPP1738 grant NO 1249) to K.-M.N.
article_processing_charge: No
article_type: original
author:
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Niccoló
full_name: Arecco, Niccoló
last_name: Arecco
- first_name: Jasmin
full_name: Morandell, Jasmin
id: 4739D480-F248-11E8-B48F-1D18A9856A87
last_name: Morandell
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
orcid: 0000-0002-9033-9096
- first_name: Ximena
full_name: Contreras, Ximena
id: 475990FE-F248-11E8-B48F-1D18A9856A87
last_name: Contreras
- first_name: Charles
full_name: Girardot, Charles
last_name: Girardot
- first_name: Eva
full_name: Käsper, Eva
last_name: Käsper
- first_name: Alena
full_name: Kozlova, Alena
id: C50A9596-02D0-11E9-976E-E38CFE5CBC1D
last_name: Kozlova
- first_name: Kasumi
full_name: Kishi, Kasumi
id: 3065DFC4-F248-11E8-B48F-1D18A9856A87
last_name: Kishi
- first_name: Ilaria
full_name: Chiaradia, Ilaria
id: B6467F20-02D0-11E9-BDA5-E960C241894A
last_name: Chiaradia
orcid: 0000-0002-9529-4464
- first_name: Kyung
full_name: Noh, Kyung
last_name: Noh
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Deliu E, Arecco N, Morandell J, et al. Haploinsufficiency of the intellectual
disability gene SETD5 disturbs developmental gene expression and cognition. Nature
Neuroscience. 2018;21(12):1717-1727. doi:10.1038/s41593-018-0266-2
apa: Deliu, E., Arecco, N., Morandell, J., Dotter, C., Contreras, X., Girardot,
C., … Novarino, G. (2018). Haploinsufficiency of the intellectual disability gene
SETD5 disturbs developmental gene expression and cognition. Nature Neuroscience.
Nature Publishing Group. https://doi.org/10.1038/s41593-018-0266-2
chicago: Deliu, Elena, Niccoló Arecco, Jasmin Morandell, Christoph Dotter, Ximena
Contreras, Charles Girardot, Eva Käsper, et al. “Haploinsufficiency of the Intellectual
Disability Gene SETD5 Disturbs Developmental Gene Expression and Cognition.” Nature
Neuroscience. Nature Publishing Group, 2018. https://doi.org/10.1038/s41593-018-0266-2.
ieee: E. Deliu et al., “Haploinsufficiency of the intellectual disability
gene SETD5 disturbs developmental gene expression and cognition,” Nature Neuroscience,
vol. 21, no. 12. Nature Publishing Group, pp. 1717–1727, 2018.
ista: Deliu E, Arecco N, Morandell J, Dotter C, Contreras X, Girardot C, Käsper
E, Kozlova A, Kishi K, Chiaradia I, Noh K, Novarino G. 2018. Haploinsufficiency
of the intellectual disability gene SETD5 disturbs developmental gene expression
and cognition. Nature Neuroscience. 21(12), 1717–1727.
mla: Deliu, Elena, et al. “Haploinsufficiency of the Intellectual Disability Gene
SETD5 Disturbs Developmental Gene Expression and Cognition.” Nature Neuroscience,
vol. 21, no. 12, Nature Publishing Group, 2018, pp. 1717–27, doi:10.1038/s41593-018-0266-2.
short: E. Deliu, N. Arecco, J. Morandell, C. Dotter, X. Contreras, C. Girardot,
E. Käsper, A. Kozlova, K. Kishi, I. Chiaradia, K. Noh, G. Novarino, Nature Neuroscience
21 (2018) 1717–1727.
date_created: 2018-12-11T11:44:05Z
date_published: 2018-11-19T00:00:00Z
date_updated: 2024-03-25T23:30:25Z
day: '19'
ddc:
- '570'
department:
- _id: GaNo
- _id: EdHa
doi: 10.1038/s41593-018-0266-2
external_id:
isi:
- '000451324700010'
file:
- access_level: open_access
checksum: 60abd0f05b7cdc08a6b0ec460884084f
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:41:57Z
date_updated: 2020-07-14T12:45:58Z
file_id: '6255'
file_name: 2017_NatureNeuroscience_Deliu.pdf
file_size: 8167169
relation: main_file
file_date_updated: 2020-07-14T12:45:58Z
has_accepted_license: '1'
intvolume: ' 21'
isi: 1
issue: '12'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 1717 - 1727
project:
- _id: 254BA948-B435-11E9-9278-68D0E5697425
grant_number: '401299'
name: Probing development and reversibility of autism spectrum disorders
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '8054'
pubrep_id: '1071'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/mutation-that-causes-autism-and-intellectual-disability-makes-brain-less-flexible/
record:
- id: '6074'
relation: popular_science
status: public
- id: '12364'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Haploinsufficiency of the intellectual disability gene SETD5 disturbs developmental
gene expression and cognition
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 21
year: '2018'
...
---
_id: '300'
abstract:
- lang: eng
text: We introduce a formal quantitative notion of “bit security” for a general
type of cryptographic games (capturing both decision and search problems), aimed
at capturing the intuition that a cryptographic primitive with k-bit security
is as hard to break as an ideal cryptographic function requiring a brute force
attack on a k-bit key space. Our new definition matches the notion of bit security
commonly used by cryptographers and cryptanalysts when studying search (e.g.,
key recovery) problems, where the use of the traditional definition is well established.
However, it produces a quantitatively different metric in the case of decision
(indistinguishability) problems, where the use of (a straightforward generalization
of) the traditional definition is more problematic and leads to a number of paradoxical
situations or mismatches between theoretical/provable security and practical/common
sense intuition. Key to our new definition is to consider adversaries that may
explicitly declare failure of the attack. We support and justify the new definition
by proving a number of technical results, including tight reductions between several
standard cryptographic problems, a new hybrid theorem that preserves bit security,
and an application to the security analysis of indistinguishability primitives
making use of (approximate) floating point numbers. This is the first result showing
that (standard precision) 53-bit floating point numbers can be used to achieve
100-bit security in the context of cryptographic primitives with general indistinguishability-based
security definitions. Previous results of this type applied only to search problems,
or special types of decision problems.
acknowledgement: Research supported in part by the Defense Advanced Research Projects
Agency (DARPA) and the U.S. Army Research Office under the SafeWare program. Opinions,
findings and conclusions or recommendations expressed in this material are those
of the author(s) and do not necessarily reflect the views, position or policy of
the Government. The second author was also supported by the European Research Council,
ERC consolidator grant (682815 - TOCNeT).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Daniele
full_name: Micciancio, Daniele
last_name: Micciancio
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Micciancio D, Walter M. On the bit security of cryptographic primitives. In:
Vol 10820. Springer; 2018:3-28. doi:10.1007/978-3-319-78381-9_1'
apa: 'Micciancio, D., & Walter, M. (2018). On the bit security of cryptographic
primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology,
Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78381-9_1'
chicago: Micciancio, Daniele, and Michael Walter. “On the Bit Security of Cryptographic
Primitives,” 10820:3–28. Springer, 2018. https://doi.org/10.1007/978-3-319-78381-9_1.
ieee: 'D. Micciancio and M. Walter, “On the bit security of cryptographic primitives,”
presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol.
10820, pp. 3–28.'
ista: 'Micciancio D, Walter M. 2018. On the bit security of cryptographic primitives.
Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.'
mla: Micciancio, Daniele, and Michael Walter. On the Bit Security of Cryptographic
Primitives. Vol. 10820, Springer, 2018, pp. 3–28, doi:10.1007/978-3-319-78381-9_1.
short: D. Micciancio, M. Walter, in:, Springer, 2018, pp. 3–28.
conference:
end_date: 2018-05-03
location: Tel Aviv, Israel
name: 'Eurocrypt: Advances in Cryptology'
start_date: 2018-04-29
date_created: 2018-12-11T11:45:42Z
date_published: 2018-03-31T00:00:00Z
date_updated: 2023-09-13T09:12:04Z
day: '31'
department:
- _id: KrPi
doi: 10.1007/978-3-319-78381-9_1
ec_funded: 1
external_id:
isi:
- '000517097500001'
intvolume: ' 10820'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/077
month: '03'
oa: 1
oa_version: Submitted Version
page: 3 - 28
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '7581'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the bit security of cryptographic primitives
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10820
year: '2018'
...
---
_id: '302'
abstract:
- lang: eng
text: At ITCS 2013, Mahmoody, Moran and Vadhan [MMV13] introduce and construct publicly
verifiable proofs of sequential work, which is a protocol for proving that one
spent sequential computational work related to some statement. The original motivation
for such proofs included non-interactive time-stamping and universally verifiable
CPU benchmarks. A more recent application, and our main motivation, are blockchain
designs, where proofs of sequential work can be used – in combination with proofs
of space – as a more ecological and economical substitute for proofs of work which
are currently used to secure Bitcoin and other cryptocurrencies. The construction
proposed by [MMV13] is based on a hash function and can be proven secure in the
random oracle model, or assuming inherently sequential hash-functions, which is
a new standard model assumption introduced in their work. In a proof of sequential
work, a prover gets a “statement” χ, a time parameter N and access to a hash-function
H, which for the security proof is modelled as a random oracle. Correctness requires
that an honest prover can make a verifier accept making only N queries to H, while
soundness requires that any prover who makes the verifier accept must have made
(almost) N sequential queries to H. Thus a solution constitutes a proof that N
time passed since χ was received. Solutions must be publicly verifiable in time
at most polylogarithmic in N. The construction of [MMV13] is based on “depth-robust”
graphs, and as a consequence has rather poor concrete parameters. But the major
drawback is that the prover needs not just N time, but also N space to compute
a proof. In this work we propose a proof of sequential work which is much simpler,
more efficient and achieves much better concrete bounds. Most importantly, the
space required can be as small as log (N) (but we get better soundness using slightly
more memory than that). An open problem stated by [MMV13] that our construction
does not solve either is achieving a “unique” proof, where even a cheating prover
can only generate a single accepting proof. This property would be extremely useful
for applications to blockchains.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bram
full_name: Cohen, Bram
last_name: Cohen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Cohen B, Pietrzak KZ. Simple proofs of sequential work. In: Vol 10821. Springer;
2018:451-467. doi:10.1007/978-3-319-78375-8_15'
apa: 'Cohen, B., & Pietrzak, K. Z. (2018). Simple proofs of sequential work
(Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology,
Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_15'
chicago: Cohen, Bram, and Krzysztof Z Pietrzak. “Simple Proofs of Sequential Work,”
10821:451–67. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_15.
ieee: 'B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented
at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821,
pp. 451–467.'
ista: 'Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt:
Advances in Cryptology, LNCS, vol. 10821, 451–467.'
mla: Cohen, Bram, and Krzysztof Z. Pietrzak. Simple Proofs of Sequential Work.
Vol. 10821, Springer, 2018, pp. 451–67, doi:10.1007/978-3-319-78375-8_15.
short: B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.
conference:
end_date: 2018-05-03
location: Tel Aviv, Israel
name: 'Eurocrypt: Advances in Cryptology'
start_date: 2018-04-29
date_created: 2018-12-11T11:45:42Z
date_published: 2018-05-29T00:00:00Z
date_updated: 2023-09-18T09:29:33Z
day: '29'
department:
- _id: KrPi
doi: 10.1007/978-3-319-78375-8_15
ec_funded: 1
external_id:
isi:
- '000517098700015'
intvolume: ' 10821'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/183.pdf
month: '05'
oa: 1
oa_version: Submitted Version
page: 451 - 467
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '7579'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple proofs of sequential work
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10821
year: '2018'
...
---
_id: '303'
abstract:
- lang: eng
text: The theory of tropical series, that we develop here, firstly appeared in the
study of the growth of pluriharmonic functions. Motivated by waves in sandpile
models we introduce a dynamic on the set of tropical series, and it is experimentally
observed that this dynamic obeys a power law. So, this paper serves as a compilation
of results we need for other articles and also introduces several objects interesting
by themselves.
acknowledgement: The first author, Nikita Kalinin, is funded by SNCF PostDoc.Mobility
grant 168647. Support from the Basic Research Program of the National Research University
Higher School of Economics is gratefully acknowledged. The second author, Mikhail
Shkolnikov, is supported in part by the grant 159240 of the Swiss National Science
Foundation as well as by the National Center of Competence in Research SwissMAP
of the Swiss National Science Foundation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikita
full_name: Kalinin, Nikita
last_name: Kalinin
- first_name: Mikhail
full_name: Shkolnikov, Mikhail
id: 35084A62-F248-11E8-B48F-1D18A9856A87
last_name: Shkolnikov
orcid: 0000-0002-4310-178X
citation:
ama: Kalinin N, Shkolnikov M. Introduction to tropical series and wave dynamic on
them. Discrete and Continuous Dynamical Systems- Series A. 2018;38(6):2827-2849.
doi:10.3934/dcds.2018120
apa: Kalinin, N., & Shkolnikov, M. (2018). Introduction to tropical series and
wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A.
AIMS. https://doi.org/10.3934/dcds.2018120
chicago: Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series
and Wave Dynamic on Them.” Discrete and Continuous Dynamical Systems- Series
A. AIMS, 2018. https://doi.org/10.3934/dcds.2018120.
ieee: N. Kalinin and M. Shkolnikov, “Introduction to tropical series and wave dynamic
on them,” Discrete and Continuous Dynamical Systems- Series A, vol. 38,
no. 6. AIMS, pp. 2827–2849, 2018.
ista: Kalinin N, Shkolnikov M. 2018. Introduction to tropical series and wave dynamic
on them. Discrete and Continuous Dynamical Systems- Series A. 38(6), 2827–2849.
mla: Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and
Wave Dynamic on Them.” Discrete and Continuous Dynamical Systems- Series A,
vol. 38, no. 6, AIMS, 2018, pp. 2827–49, doi:10.3934/dcds.2018120.
short: N. Kalinin, M. Shkolnikov, Discrete and Continuous Dynamical Systems- Series
A 38 (2018) 2827–2849.
date_created: 2018-12-11T11:45:43Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-12T07:45:37Z
day: '01'
department:
- _id: TaHa
doi: 10.3934/dcds.2018120
external_id:
arxiv:
- '1706.03062'
isi:
- '000438818400007'
intvolume: ' 38'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.03062
month: '06'
oa: 1
oa_version: Submitted Version
page: 2827 - 2849
publication: Discrete and Continuous Dynamical Systems- Series A
publication_status: published
publisher: AIMS
publist_id: '7576'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Introduction to tropical series and wave dynamic on them
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 38
year: '2018'
...
---
_id: '304'
abstract:
- lang: eng
text: "Additive manufacturing has recently seen drastic improvements in resolution,
making it now possible to fabricate features at scales of hundreds or even dozens
of nanometers, which previously required very expensive lithographic methods.\r\nAs
a result, additive manufacturing now seems poised for optical applications, including
those relevant to computer graphics, such as material design, as well as display
and imaging applications.\r\n \r\nIn this work, we explore the use of additive
manufacturing for generating structural colors, where the structures are designed
using a fabrication-aware optimization process.\r\nThis requires a combination
of full-wave simulation, a feasible parameterization of the design space, and
a tailored optimization procedure.\r\nMany of these components should be re-usable
for the design of other optical structures at this scale.\r\n \r\nWe show initial
results of material samples fabricated based on our designs.\r\nWhile these suffer
from the prototype character of state-of-the-art fabrication hardware, we believe
they clearly demonstrate the potential of additive nanofabrication for structural
colors and other graphics applications."
acknowledgement: This work was in part supported by King Abdullah University of Science
and Technology Baseline Funding.
alternative_title:
- ACM Transactions on Graphics
article_number: '159'
article_processing_charge: No
author:
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Wolfgang
full_name: Heidrich, Wolfgang
last_name: Heidrich
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: Auzinger T, Heidrich W, Bickel B. Computational design of nanostructural color
for additive manufacturing. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201376
apa: Auzinger, T., Heidrich, W., & Bickel, B. (2018). Computational design of
nanostructural color for additive manufacturing. ACM Transactions on Graphics.
ACM. https://doi.org/10.1145/3197517.3201376
chicago: Auzinger, Thomas, Wolfgang Heidrich, and Bernd Bickel. “Computational Design
of Nanostructural Color for Additive Manufacturing.” ACM Transactions on Graphics.
ACM, 2018. https://doi.org/10.1145/3197517.3201376.
ieee: T. Auzinger, W. Heidrich, and B. Bickel, “Computational design of nanostructural
color for additive manufacturing,” ACM Transactions on Graphics, vol. 37,
no. 4. ACM, 2018.
ista: Auzinger T, Heidrich W, Bickel B. 2018. Computational design of nanostructural
color for additive manufacturing. ACM Transactions on Graphics. 37(4), 159.
mla: Auzinger, Thomas, et al. “Computational Design of Nanostructural Color for
Additive Manufacturing.” ACM Transactions on Graphics, vol. 37, no. 4,
159, ACM, 2018, doi:10.1145/3197517.3201376.
short: T. Auzinger, W. Heidrich, B. Bickel, ACM Transactions on Graphics 37 (2018).
date_created: 2018-12-11T11:45:43Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-11T12:46:13Z
day: '01'
ddc:
- '000'
- '535'
- '680'
department:
- _id: BeBi
doi: 10.1145/3197517.3201376
ec_funded: 1
external_id:
isi:
- '000448185000120'
file:
- access_level: open_access
checksum: dcdcc955a4c1c6d2599aeebb97d2e7b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:14Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5334'
file_name: IST-2018-1024-v1+1_NanoStructColor-Auzinger-paper.pdf
file_size: 10751684
relation: main_file
- access_level: open_access
checksum: cae52b3a8d5e97be84771cd61ea2f75e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:15Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5335'
file_name: IST-2018-1024-v1+2_NanoStructColor-Auzinger-supplemental.pdf
file_size: 20755095
relation: main_file
- access_level: open_access
checksum: 76dd90648f75779d3f64e324b6daaffe
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:16Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5336'
file_name: IST-2018-1024-v1+3_NanoStructColor-Auzinger-image.jpg
file_size: 2186944
relation: main_file
- access_level: open_access
checksum: c3a5b775a0ecdb20ccefb8d9646ec140
content_type: application/x-7z-compressed
creator: system
date_created: 2018-12-12T10:18:17Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5337'
file_name: IST-2018-1024-v1+4_NanoStructColor-Auzinger-blueprint.7z
file_size: 2734352
relation: main_file
- access_level: open_access
checksum: dcdcc955a4c1c6d2599aeebb97d2e7b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:18Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5338'
file_name: IST-2018-1024-v2+1_NanoStructColor-Auzinger-paper.pdf
file_size: 10751684
relation: main_file
- access_level: open_access
checksum: 76dd90648f75779d3f64e324b6daaffe
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:19Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5339'
file_name: IST-2018-1024-v2+3_NanoStructColor-Auzinger-image.jpg
file_size: 2186944
relation: main_file
- access_level: open_access
checksum: c3a5b775a0ecdb20ccefb8d9646ec140
content_type: application/x-7z-compressed
creator: system
date_created: 2018-12-12T10:18:20Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5340'
file_name: IST-2018-1024-v2+4_NanoStructColor-Auzinger-blueprint.7z
file_size: 2734352
relation: main_file
- access_level: open_access
checksum: 667e91b686db41e44d855a4fb2137402
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:21Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5341'
file_name: IST-2018-1024-v2+5_NanoStructColor-Auzinger-supplemental.pdf
file_size: 20755762
relation: main_file
- access_level: open_access
checksum: dcdcc955a4c1c6d2599aeebb97d2e7b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:22Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5342'
file_name: IST-2018-1024-v3+1_NanoStructColor-Auzinger-paper.pdf
file_size: 10751684
relation: main_file
- access_level: open_access
checksum: 76dd90648f75779d3f64e324b6daaffe
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:22Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5343'
file_name: IST-2018-1024-v3+3_NanoStructColor-Auzinger-image.jpg
file_size: 2186944
relation: main_file
- access_level: open_access
checksum: c3a5b775a0ecdb20ccefb8d9646ec140
content_type: application/x-7z-compressed
creator: system
date_created: 2018-12-12T10:18:23Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5344'
file_name: IST-2018-1024-v3+4_NanoStructColor-Auzinger-blueprint.7z
file_size: 2734352
relation: main_file
- access_level: open_access
checksum: 667e91b686db41e44d855a4fb2137402
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:24Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5345'
file_name: IST-2018-1024-v3+5_NanoStructColor-Auzinger-supplemental.pdf
file_size: 20755762
relation: main_file
- access_level: open_access
checksum: 72dce35388fb1aa7953df4d9ae3d02f1
content_type: application/vnd.openxmlformats-officedocument.presentationml.presentation
creator: system
date_created: 2018-12-12T10:18:25Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5346'
file_name: IST-2018-1024-v3+6_NanoStructColor-Auzinger-presentation.pptx
file_size: 69698068
relation: main_file
file_date_updated: 2020-07-14T12:45:59Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
pubrep_id: '1028'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/color-effects-from-transparent-3d-printed-nanostructures/
scopus_import: '1'
status: public
title: Computational design of nanostructural color for additive manufacturing
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '305'
abstract:
- lang: eng
text: The hanging-drop network (HDN) is a technology platform based on a completely
open microfluidic network at the bottom of an inverted, surface-patterned substrate.
The platform is predominantly used for the formation, culturing, and interaction
of self-assembled spherical microtissues (spheroids) under precisely controlled
flow conditions. Here, we describe design, fabrication, and operation of microfluidic
hanging-drop networks.
acknowledgement: This work was financially supported by FP7 of the EU through the
project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS”
(contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss
National Science Foundation for Olivier Frey. The research leading to these results
also received funding from the People Programme (Marie Curie Actions) of the European
Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no.
[291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise
and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE,
ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members
of the Guet and Tkačik groups, IST Austria, for valuable comments and support.
alternative_title:
- MIMB
author:
- first_name: Patrick
full_name: Misun, Patrick
last_name: Misun
- first_name: Axel
full_name: Birchler, Axel
last_name: Birchler
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Andreas
full_name: Hierlemann, Andreas
last_name: Hierlemann
- first_name: Olivier
full_name: Frey, Olivier
last_name: Frey
citation:
ama: Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation
of microfluidic hanging drop networks. Methods in Molecular Biology. 2018;1771:183-202.
doi:10.1007/978-1-4939-7792-5_15
apa: Misun, P., Birchler, A., Lang, M., Hierlemann, A., & Frey, O. (2018). Fabrication
and operation of microfluidic hanging drop networks. Methods in Molecular Biology.
Springer. https://doi.org/10.1007/978-1-4939-7792-5_15
chicago: Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier
Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods
in Molecular Biology. Springer, 2018. https://doi.org/10.1007/978-1-4939-7792-5_15.
ieee: P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and
operation of microfluidic hanging drop networks,” Methods in Molecular Biology,
vol. 1771. Springer, pp. 183–202, 2018.
ista: Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation
of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.
mla: Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop
Networks.” Methods in Molecular Biology, vol. 1771, Springer, 2018, pp.
183–202, doi:10.1007/978-1-4939-7792-5_15.
short: P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular
Biology 1771 (2018) 183–202.
date_created: 2018-12-11T11:45:43Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T07:40:42Z
day: '01'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1007/978-1-4939-7792-5_15
ec_funded: 1
intvolume: ' 1771'
language:
- iso: eng
month: '01'
oa_version: None
page: 183 - 202
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Methods in Molecular Biology
publication_status: published
publisher: Springer
publist_id: '7574'
quality_controlled: '1'
scopus_import: 1
status: public
title: Fabrication and operation of microfluidic hanging drop networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1771
year: '2018'
...
---
_id: '306'
abstract:
- lang: eng
text: A cornerstone of statistical inference, the maximum entropy framework is being
increasingly applied to construct descriptive and predictive models of biological
systems, especially complex biological networks, from large experimental data
sets. Both its broad applicability and the success it obtained in different contexts
hinge upon its conceptual simplicity and mathematical soundness. Here we try to
concisely review the basic elements of the maximum entropy principle, starting
from the notion of ‘entropy’, and describe its usefulness for the analysis of
biological systems. As examples, we focus specifically on the problem of reconstructing
gene interaction networks from expression data and on recent work attempting to
expand our system-level understanding of bacterial metabolism. Finally, we highlight
some extensions and potential limitations of the maximum entropy approach, and
point to more recent developments that are likely to play a key role in the upcoming
challenges of extracting structures and information from increasingly rich, high-throughput
biological data.
article_number: e00596
author:
- first_name: Andrea
full_name: De Martino, Andrea
last_name: De Martino
- first_name: Daniele
full_name: De Martino, Daniele
id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
last_name: De Martino
orcid: 0000-0002-5214-4706
citation:
ama: De Martino A, De Martino D. An introduction to the maximum entropy approach
and its application to inference problems in biology. Heliyon. 2018;4(4).
doi:10.1016/j.heliyon.2018.e00596
apa: De Martino, A., & De Martino, D. (2018). An introduction to the maximum
entropy approach and its application to inference problems in biology. Heliyon.
Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596
chicago: De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum
Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon.
Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596.
ieee: A. De Martino and D. De Martino, “An introduction to the maximum entropy approach
and its application to inference problems in biology,” Heliyon, vol. 4,
no. 4. Elsevier, 2018.
ista: De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach
and its application to inference problems in biology. Heliyon. 4(4), e00596.
mla: De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum
Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon,
vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596.
short: A. De Martino, D. De Martino, Heliyon 4 (2018).
date_created: 2018-12-11T11:45:44Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2021-01-12T07:40:46Z
day: '01'
ddc:
- '530'
department:
- _id: GaTk
doi: 10.1016/j.heliyon.2018.e00596
ec_funded: 1
file:
- access_level: open_access
checksum: 67010cf5e3b3e0637c659371714a715a
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T07:36:24Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5929'
file_name: 2018_Heliyon_DeMartino.pdf
file_size: 994490
relation: main_file
file_date_updated: 2020-07-14T12:45:59Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Heliyon
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: 1
status: public
title: An introduction to the maximum entropy approach and its application to inference
problems in biology
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2018'
...
---
_id: '307'
abstract:
- lang: eng
text: 'Spontaneous emission spectra of two initially excited closely spaced identical
atoms are very sensitive to the strength and the direction of the applied magnetic
field. We consider the relevant schemes that ensure the determination of the mutual
spatial orientation of the atoms and the distance between them by entirely optical
means. A corresponding theoretical description is given accounting for the dipole-dipole
interaction between the two atoms in the presence of a magnetic field and for
polarizations of the quantum field interacting with magnetic sublevels of the
two-atom system. '
acknowledgement: The work was partially supported by Russian Foundation for Basic
Research (Grant No. 15-02-05657a) and by the Basic research program of Higher School
of Economics (HSE).
article_number: ' 043812 '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Elena
full_name: Redchenko, Elena
id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
last_name: Redchenko
- first_name: Alexander
full_name: Makarov, Alexander
last_name: Makarov
- first_name: Vladimir
full_name: Yudson, Vladimir
last_name: Yudson
citation:
ama: Redchenko E, Makarov A, Yudson V. Nanoscopy of pairs of atoms by fluorescence
in a magnetic field. Physical Review A - Atomic, Molecular, and Optical Physics.
2018;97(4). doi:10.1103/PhysRevA.97.043812
apa: Redchenko, E., Makarov, A., & Yudson, V. (2018). Nanoscopy of pairs of
atoms by fluorescence in a magnetic field. Physical Review A - Atomic, Molecular,
and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.97.043812
chicago: Redchenko, Elena, Alexander Makarov, and Vladimir Yudson. “Nanoscopy of
Pairs of Atoms by Fluorescence in a Magnetic Field.” Physical Review A - Atomic,
Molecular, and Optical Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevA.97.043812.
ieee: E. Redchenko, A. Makarov, and V. Yudson, “Nanoscopy of pairs of atoms by fluorescence
in a magnetic field,” Physical Review A - Atomic, Molecular, and Optical Physics,
vol. 97, no. 4. American Physical Society, 2018.
ista: Redchenko E, Makarov A, Yudson V. 2018. Nanoscopy of pairs of atoms by fluorescence
in a magnetic field. Physical Review A - Atomic, Molecular, and Optical Physics.
97(4), 043812.
mla: Redchenko, Elena, et al. “Nanoscopy of Pairs of Atoms by Fluorescence in a
Magnetic Field.” Physical Review A - Atomic, Molecular, and Optical Physics,
vol. 97, no. 4, 043812, American Physical Society, 2018, doi:10.1103/PhysRevA.97.043812.
short: E. Redchenko, A. Makarov, V. Yudson, Physical Review A - Atomic, Molecular,
and Optical Physics 97 (2018).
date_created: 2018-12-11T11:45:44Z
date_published: 2018-04-09T00:00:00Z
date_updated: 2023-09-13T09:00:41Z
day: '09'
department:
- _id: JoFi
doi: 10.1103/PhysRevA.97.043812
external_id:
arxiv:
- '1712.10127'
isi:
- '000429454000015'
intvolume: ' 97'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.10127
month: '04'
oa: 1
oa_version: Submitted Version
publication: ' Physical Review A - Atomic, Molecular, and Optical Physics'
publication_status: published
publisher: American Physical Society
publist_id: '7572'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanoscopy of pairs of atoms by fluorescence in a magnetic field
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...
---
_id: '308'
abstract:
- lang: eng
text: Migrating cells penetrate tissue barriers during development, inflammatory
responses, and tumor metastasis. We study if migration in vivo in such three-dimensionally
confined environments requires changes in the mechanical properties of the surrounding
cells using embryonic Drosophila melanogaster hemocytes, also called macrophages,
as a model. We find that macrophage invasion into the germband through transient
separation of the apposing ectoderm and mesoderm requires cell deformations and
reductions in apical tension in the ectoderm. Interestingly, the genetic pathway
governing these mechanical shifts acts downstream of the only known tumor necrosis
factor superfamily member in Drosophila, Eiger, and its receptor, Grindelwald.
Eiger-Grindelwald signaling reduces levels of active Myosin in the germband ectodermal
cortex through the localization of a Crumbs complex component, Patj (Pals-1-associated
tight junction protein). We therefore elucidate a distinct molecular pathway that
controls tissue tension and demonstrate the importance of such regulation for
invasive migration in vivo.
acknowledged_ssus:
- _id: SSU
article_processing_charge: No
article_type: original
author:
- first_name: Aparna
full_name: Ratheesh, Aparna
id: 2F064CFE-F248-11E8-B48F-1D18A9856A87
last_name: Ratheesh
orcid: 0000-0001-7190-0776
- first_name: Julia
full_name: Biebl, Julia
id: 3CCBB46E-F248-11E8-B48F-1D18A9856A87
last_name: Biebl
- first_name: Michael
full_name: Smutny, Michael
last_name: Smutny
- first_name: Jana
full_name: Veselá, Jana
id: 433253EE-F248-11E8-B48F-1D18A9856A87
last_name: Veselá
- first_name: Ekaterina
full_name: Papusheva, Ekaterina
id: 41DB591E-F248-11E8-B48F-1D18A9856A87
last_name: Papusheva
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Attila
full_name: György, Attila
id: 3BCEDBE0-F248-11E8-B48F-1D18A9856A87
last_name: György
orcid: 0000-0002-1819-198X
- first_name: Alessandra M
full_name: Casano, Alessandra M
id: 3DBA3F4E-F248-11E8-B48F-1D18A9856A87
last_name: Casano
orcid: 0000-0002-6009-6804
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
citation:
ama: Ratheesh A, Bicher J, Smutny M, et al. Drosophila TNF modulates tissue tension
in the embryo to facilitate macrophage invasive migration. Developmental Cell.
2018;45(3):331-346. doi:10.1016/j.devcel.2018.04.002
apa: Ratheesh, A., Bicher, J., Smutny, M., Veselá, J., Papusheva, E., Krens, G.,
… Siekhaus, D. E. (2018). Drosophila TNF modulates tissue tension in the embryo
to facilitate macrophage invasive migration. Developmental Cell. Elsevier.
https://doi.org/10.1016/j.devcel.2018.04.002
chicago: Ratheesh, Aparna, Julia Bicher, Michael Smutny, Jana Veselá, Ekaterina
Papusheva, Gabriel Krens, Walter Kaufmann, Attila György, Alessandra M Casano,
and Daria E Siekhaus. “Drosophila TNF Modulates Tissue Tension in the Embryo to
Facilitate Macrophage Invasive Migration.” Developmental Cell. Elsevier,
2018. https://doi.org/10.1016/j.devcel.2018.04.002.
ieee: A. Ratheesh et al., “Drosophila TNF modulates tissue tension in the
embryo to facilitate macrophage invasive migration,” Developmental Cell,
vol. 45, no. 3. Elsevier, pp. 331–346, 2018.
ista: Ratheesh A, Bicher J, Smutny M, Veselá J, Papusheva E, Krens G, Kaufmann W,
György A, Casano AM, Siekhaus DE. 2018. Drosophila TNF modulates tissue tension
in the embryo to facilitate macrophage invasive migration. Developmental Cell.
45(3), 331–346.
mla: Ratheesh, Aparna, et al. “Drosophila TNF Modulates Tissue Tension in the Embryo
to Facilitate Macrophage Invasive Migration.” Developmental Cell, vol.
45, no. 3, Elsevier, 2018, pp. 331–46, doi:10.1016/j.devcel.2018.04.002.
short: A. Ratheesh, J. Bicher, M. Smutny, J. Veselá, E. Papusheva, G. Krens, W.
Kaufmann, A. György, A.M. Casano, D.E. Siekhaus, Developmental Cell 45 (2018)
331–346.
date_created: 2018-12-11T11:45:44Z
date_published: 2018-05-07T00:00:00Z
date_updated: 2023-09-11T13:22:13Z
day: '07'
department:
- _id: DaSi
- _id: CaHe
- _id: Bio
- _id: EM-Fac
- _id: MiSi
doi: 10.1016/j.devcel.2018.04.002
ec_funded: 1
external_id:
isi:
- '000432461400009'
pmid:
- '29738712'
intvolume: ' 45'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.devcel.2018.04.002
month: '05'
oa: 1
oa_version: Published Version
page: 331 - 346
pmid: 1
project:
- _id: 253B6E48-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29638
name: Drosophila TNFa´s Funktion in Immunzellen
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: Developmental Cell
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/cells-change-tension-to-make-tissue-barriers-easier-to-get-through/
scopus_import: '1'
status: public
title: Drosophila TNF modulates tissue tension in the embryo to facilitate macrophage
invasive migration
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 45
year: '2018'
...
---
_id: '309'
abstract:
- lang: eng
text: 'We present an efficient algorithm for a problem in the interface between
clustering and graph embeddings. An embedding '' : G ! M of a graph G into a 2manifold
M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint
Jordan arcs between the corresponding vertices. In applications in clustering,
cartography, and visualization, nearby vertices and edges are often bundled to
a common node or arc, due to data compression or low resolution. This raises the
computational problem of deciding whether a given map '' : G ! M comes from an
embedding. A map '' : G ! M is a weak embedding if it can be perturbed into an
embedding ψ: G ! M with k'' "k < " for every " > 0. A polynomial-time
algorithm for recognizing weak embeddings was recently found by Fulek and Kyncl
[14], which reduces to solving a system of linear equations over Z2. It runs in
O(n2!) O(n4:75) time, where 2:373 is the matrix multiplication exponent and n
is the number of vertices and edges of G. We improve the running time to O(n log
n). Our algorithm is also conceptually simpler than [14]: We perform a sequence
of local operations that gradually "untangles" the image ''(G) into
an embedding (G), or reports that '' is not a weak embedding. It generalizes a
recent technique developed for the case that G is a cycle and the embedding is
a simple polygon [1], and combines local constraints on the orientation of subgraphs
directly, thereby eliminating the need for solving large systems of linear equations.'
acknowledgement: '∗Research supported in part by the NSF awards CCF-1422311 and CCF-1423615,
and the Science Without Borders program. The second author gratefully acknowledges
support from Austrian Science Fund (FWF): M2281-N35.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Hugo
full_name: Akitaya, Hugo
last_name: Akitaya
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Csaba
full_name: Tóth, Csaba
last_name: Tóth
citation:
ama: 'Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. In: ACM;
2018:274-292. doi:10.1137/1.9781611975031.20'
apa: 'Akitaya, H., Fulek, R., & Tóth, C. (2018). Recognizing weak embeddings
of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms,
New Orleans, LA, USA: ACM. https://doi.org/10.1137/1.9781611975031.20'
chicago: Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings
of Graphs,” 274–92. ACM, 2018. https://doi.org/10.1137/1.9781611975031.20.
ieee: 'H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,”
presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA,
2018, pp. 274–292.'
ista: 'Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs.
SODA: Symposium on Discrete Algorithms, 274–292.'
mla: Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018,
pp. 274–92, doi:10.1137/1.9781611975031.20.
short: H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.
conference:
end_date: 2018-01-10
location: New Orleans, LA, USA
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2018-12-11T11:45:45Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-09-15T12:19:32Z
day: '01'
department:
- _id: UlWa
doi: 10.1137/1.9781611975031.20
external_id:
arxiv:
- '1709.09209'
isi:
- '000483921200021'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1709.09209
month: '01'
oa: 1
oa_version: Preprint
page: 274 - 292
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: ACM
publist_id: '7556'
quality_controlled: '1'
related_material:
record:
- id: '6982'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Recognizing weak embeddings of graphs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '31'
abstract:
- lang: eng
text: Correlations in sensory neural networks have both extrinsic and intrinsic
origins. Extrinsic or stimulus correlations arise from shared inputs to the network
and, thus, depend strongly on the stimulus ensemble. Intrinsic or noise correlations
reflect biophysical mechanisms of interactions between neurons, which are expected
to be robust to changes in the stimulus ensemble. Despite the importance of this
distinction for understanding how sensory networks encode information collectively,
no method exists to reliably separate intrinsic interactions from extrinsic correlations
in neural activity data, limiting our ability to build predictive models of the
network response. In this paper we introduce a general strategy to infer population
models of interacting neurons that collectively encode stimulus information. The
key to disentangling intrinsic from extrinsic correlations is to infer the couplings
between neurons separately from the encoding model and to combine the two using
corrections calculated in a mean-field approximation. We demonstrate the effectiveness
of this approach in retinal recordings. The same coupling network is inferred
from responses to radically different stimulus ensembles, showing that these couplings
indeed reflect stimulus-independent interactions between neurons. The inferred
model predicts accurately the collective response of retinal ganglion cell populations
as a function of the stimulus.
acknowledgement: This work was supported by ANR Trajectory, the French State program
Investissements d’Avenir managed by the Agence Nationale de la Recherche (LIFESENSES;
ANR-10-LABX-65), EC Grant No. H2020-785907 from the Human Brain Project, NIH Grant
No. U01NS090501, and an AVIESAN-UNADEV grant to O.M. M.C. was supported by the Agence
Nationale de la Recherche Jeune Chercheur/Jeune Chercheuse grant (ANR-17-CE37-0013).
article_number: '042410'
article_processing_charge: No
article_type: original
author:
- first_name: Ulisse
full_name: Ferrari, Ulisse
last_name: Ferrari
- first_name: Stephane
full_name: Deny, Stephane
last_name: Deny
- first_name: Matthew J
full_name: Chalk, Matthew J
last_name: Chalk
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Thierry
full_name: Mora, Thierry
last_name: Mora
citation:
ama: Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. Separating intrinsic
interactions from extrinsic correlations in a network of sensory neurons. Physical
Review E. 2018;98(4). doi:10.1103/PhysRevE.98.042410
apa: Ferrari, U., Deny, S., Chalk, M. J., Tkačik, G., Marre, O., & Mora, T.
(2018). Separating intrinsic interactions from extrinsic correlations in a network
of sensory neurons. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.042410
chicago: Ferrari, Ulisse, Stephane Deny, Matthew J Chalk, Gašper Tkačik, Olivier
Marre, and Thierry Mora. “Separating Intrinsic Interactions from Extrinsic Correlations
in a Network of Sensory Neurons.” Physical Review E. American Physical
Society, 2018. https://doi.org/10.1103/PhysRevE.98.042410.
ieee: U. Ferrari, S. Deny, M. J. Chalk, G. Tkačik, O. Marre, and T. Mora, “Separating
intrinsic interactions from extrinsic correlations in a network of sensory neurons,”
Physical Review E, vol. 98, no. 4. American Physical Society, 2018.
ista: Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. 2018. Separating intrinsic
interactions from extrinsic correlations in a network of sensory neurons. Physical
Review E. 98(4), 042410.
mla: Ferrari, Ulisse, et al. “Separating Intrinsic Interactions from Extrinsic Correlations
in a Network of Sensory Neurons.” Physical Review E, vol. 98, no. 4, 042410,
American Physical Society, 2018, doi:10.1103/PhysRevE.98.042410.
short: U. Ferrari, S. Deny, M.J. Chalk, G. Tkačik, O. Marre, T. Mora, Physical Review
E 98 (2018).
date_created: 2018-12-11T11:44:15Z
date_published: 2018-10-17T00:00:00Z
date_updated: 2023-09-18T09:18:44Z
day: '17'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.98.042410
ec_funded: 1
external_id:
isi:
- '000447486100004'
intvolume: ' 98'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/243816v2.full
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 26436750-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '785907'
name: Human Brain Project Specific Grant Agreement 2 (HBP SGA 2)
publication: Physical Review E
publication_identifier:
issn:
- '24700045'
publication_status: published
publisher: American Physical Society
publist_id: '8024'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Separating intrinsic interactions from extrinsic correlations in a network
of sensory neurons
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 98
year: '2018'
...