---
_id: '634'
abstract:
- lang: eng
text: As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental
condition, long-time consensus was that its hallmark features are irreversible.
However, several studies from recent years using defined mouse models of ASD have
provided clear evidence that in mice neurobiological and behavioural alterations
can be ameliorated or even reversed by genetic restoration or pharmacological
treatment either before or after symptom onset. Here, we review findings on genetic
and pharmacological reversibility of phenotypes in mouse models of ASD. Our review
should give a comprehensive overview on both aspects and encourage future studies
to better understand the underlying molecular mechanisms that might be translatable
from animals to humans.
alternative_title:
- ADVSANAT
article_processing_charge: No
author:
- first_name: Jan
full_name: Schroeder, Jan
last_name: Schroeder
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
citation:
ama: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser
M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum
Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer;
2017:189-211. doi:10.1007/978-3-319-52498-6_10'
apa: Schroeder, J., Deliu, E., Novarino, G., & Schmeisser, M. (2017). Genetic
and pharmacological reversibility of phenotypes in mouse models of autism spectrum
disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and
Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 189–211). Springer.
https://doi.org/10.1007/978-3-319-52498-6_10
chicago: Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic
and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum
Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy
Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_10.
ieee: J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder,” in Translational
Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser
and T. Boekers, Eds. Springer, 2017, pp. 189–211.
ista: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational
Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.'
mla: Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes
in Mouse Models of Autism Spectrum Disorder.” Translational Anatomy and Cell
Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias
Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:10.1007/978-3-319-52498-6_10.
short: J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T.
Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
Springer, 2017, pp. 189–211.
corr_author: '1'
date_created: 2018-12-11T11:47:37Z
date_published: 2017-05-28T00:00:00Z
date_updated: 2025-09-11T07:25:25Z
day: '28'
department:
- _id: GaNo
doi: 10.1007/978-3-319-52498-6_10
editor:
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
- first_name: Tobias
full_name: Boekers, Tobias
last_name: Boekers
external_id:
isi:
- '000443802500011'
intvolume: ' 224'
isi: 1
language:
- iso: eng
month: '05'
oa_version: None
page: 189 - 211
project:
- _id: 25473368-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F03523
name: Transmembrane Transporters in Health and Disease
publication: Translational Anatomy and Cell Biology of Autism Spectrum Disorder
publication_identifier:
eisbn:
- 978-3-319-52498-6
publication_status: published
publisher: Springer
publist_id: '7156'
quality_controlled: '1'
scopus_import: '1'
series_title: Advances in Anatomy Embryology and Cell Biology
status: public
title: Genetic and pharmacological reversibility of phenotypes in mouse models of
autism spectrum disorder
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 224
year: '2017'
...
---
_id: '636'
abstract:
- lang: eng
text: Signal regular expressions can specify sequential properties of real-valued
signals based on threshold conditions, regular operations, and duration constraints.
In this paper we endow them with a quantitative semantics which indicates how
robustly a signal matches or does not match a given expression. First, we show
that this semantics is a safe approximation of a distance between the signal and
the language defined by the expression. Then, we consider the robust matching
problem, that is, computing the quantitative semantics of every segment of a given
signal relative to an expression. We present an algorithm that solves this problem
for piecewise-constant and piecewise-linear signals and show that for such signals
the robustness map is a piecewise-linear function. The availability of an indicator
describing how robustly a signal segment matches some regular pattern provides
a general framework for quantitative monitoring of cyber-physical systems.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of
regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol
10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11'
apa: 'Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative
semantics of regular expressions over real-valued signals. In A. Abate & G.
Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling
and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11'
chicago: Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the
Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited
by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11.
ieee: 'A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics
of regular expressions over real-valued signals,” presented at the FORMATS: Formal
Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp.
189–206.'
ista: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics
of regular expressions over real-valued signals. FORMATS: Formal Modelling and
Analysis of Timed Systems, LNCS, vol. 10419, 189–206.'
mla: Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions
over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts,
vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.
short: A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts
(Eds.), Springer, 2017, pp. 189–206.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
start_date: 2017-09-05
date_created: 2018-12-11T11:47:38Z
date_published: 2017-08-03T00:00:00Z
date_updated: 2025-09-11T07:24:11Z
day: '03'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_11
editor:
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Gilles
full_name: Geeraerts, Gilles
last_name: Geeraerts
external_id:
isi:
- '000611678300011'
intvolume: ' 10419'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01552132
month: '08'
oa: 1
oa_version: Submitted Version
page: 189 - 206
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
isbn:
- 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7152'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the quantitative semantics of regular expressions over real-valued signals
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10419
year: '2017'
...
---
_id: '1073'
abstract:
- lang: eng
text: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes),
both equipped with a free simplicial action of a finite group G. Assuming that
Y is d-connected and dimX≤2d, for some d≥1, we provide an algorithm that computes
the set of all equivariant homotopy classes of equivariant continuous maps |X|→|Y|;
the existence of such a map can be decided even for dimX≤2d+1. This yields the
first algorithm for deciding topological embeddability of a k-dimensional finite
simplicial complex into Rn under the condition k≤23n−1. More generally, we present
an algorithm that, given a lifting-extension problem satisfying an appropriate
stability assumption, computes the set of all homotopy classes of solutions. This
result is new even in the non-equivariant situation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Čadek, Martin
last_name: Čadek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
- first_name: Lukáš
full_name: Vokřínek, Lukáš
last_name: Vokřínek
citation:
ama: Čadek M, Krcál M, Vokřínek L. Algorithmic solvability of the lifting extension
problem. Discrete & Computational Geometry. 2017;54(4):915-965. doi:10.1007/s00454-016-9855-6
apa: Čadek, M., Krcál, M., & Vokřínek, L. (2017). Algorithmic solvability of
the lifting extension problem. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-016-9855-6
chicago: Čadek, Martin, Marek Krcál, and Lukáš Vokřínek. “Algorithmic Solvability
of the Lifting Extension Problem.” Discrete & Computational Geometry.
Springer, 2017. https://doi.org/10.1007/s00454-016-9855-6.
ieee: M. Čadek, M. Krcál, and L. Vokřínek, “Algorithmic solvability of the lifting
extension problem,” Discrete & Computational Geometry, vol. 54, no.
4. Springer, pp. 915–965, 2017.
ista: Čadek M, Krcál M, Vokřínek L. 2017. Algorithmic solvability of the lifting
extension problem. Discrete & Computational Geometry. 54(4), 915–965.
mla: Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.”
Discrete & Computational Geometry, vol. 54, no. 4, Springer, 2017,
pp. 915–65, doi:10.1007/s00454-016-9855-6.
short: M. Čadek, M. Krcál, L. Vokřínek, Discrete & Computational Geometry 54
(2017) 915–965.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:11:10Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-016-9855-6
external_id:
arxiv:
- '1307.6444'
isi:
- '000400072700008'
intvolume: ' 54'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1307.6444
month: '06'
oa: 1
oa_version: Submitted Version
page: 915 - 965
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '6309'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic solvability of the lifting extension problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2017'
...
---
_id: '424'
abstract:
- lang: eng
text: 'We show that very weak topological assumptions are enough to ensure the existence
of a Helly-type theorem. More precisely, we show that for any non-negative integers
b and d there exists an integer h(b, d) such that the following holds. If F is
a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤
i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced
Z2-Betti numbers (with singular homology). These topological conditions are sharp:
not controlling any of these [d/2] first Betti numbers allow for families with
unbounded Helly number. Our proofs combine homological non-embeddability results
with a Ramsey-based approach to build, given an arbitrary simplicial complex K,
some well-behaved chain map C*(K)→C*(Rd).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via
betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. A Journey through Discrete
Mathematics: A Tribute to Jiri Matousek. A Journey Through Discrete Mathematics.
Springer; 2017:407-447. doi:10.1007/978-3-319-44479-6_17'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). Bounding
helly numbers via betti numbers. In M. Loebl, J. Nešetřil, & R. Thomas (Eds.),
A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp.
407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17'
chicago: 'Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Bounding Helly Numbers via Betti Numbers.” In A Journey through Discrete Mathematics:
A Tribute to Jiri Matousek, edited by Martin Loebl, Jaroslav Nešetřil, and
Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017.
https://doi.org/10.1007/978-3-319-44479-6_17.'
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly
numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017,
pp. 407–447.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers
via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri
Matousek. , 407–447.'
mla: 'Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” A Journey
through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin
Loebl et al., Springer, 2017, pp. 407–47, doi:10.1007/978-3-319-44479-6_17.'
short: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J.
Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, Springer, 2017, pp. 407–447.'
date_created: 2018-12-11T11:46:24Z
date_published: 2017-10-06T00:00:00Z
date_updated: 2026-06-18T18:48:49Z
day: '06'
ddc:
- '500'
department:
- _id: UlWa
doi: 10.1007/978-3-319-44479-6_17
editor:
- first_name: Martin
full_name: Loebl, Martin
last_name: Loebl
- first_name: Jaroslav
full_name: Nešetřil, Jaroslav
last_name: Nešetřil
- first_name: Robin
full_name: Thomas, Robin
last_name: Thomas
external_id:
arxiv:
- '1310.4613'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.4613
month: '10'
oa: 1
oa_version: Published Version
page: 407 - 447
publication: 'A Journey through Discrete Mathematics: A Tribute to Jiri Matousek'
publication_identifier:
isbn:
- 978-331944479-6
publication_status: published
publisher: Springer
publist_id: '7399'
quality_controlled: '1'
related_material:
record:
- id: '1512'
relation: earlier_version
status: public
scopus_import: '1'
series_title: A Journey Through Discrete Mathematics
status: public
title: Bounding helly numbers via betti numbers
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '17696'
abstract:
- lang: eng
text: We utilize cosmological hydrodynamic simulations to study the formation of
Population III (Pop III) stars in dark matter halos exposed to strong ionizing
radiation. We simulate the formation of three halos subjected to a wide range
of ionizing fluxes, and find that for high flux, ionization and photoheating can
delay gas collapse and star formation up to halo masses significantly larger than
the atomic cooling threshold. The threshold halo mass at which gas first collapses
and cools increases with ionizing flux for intermediate values, and saturates
at a value approximately an order of magnitude above the atomic cooling threshold
for extremely high flux (e.g. ≈5×108 M⊙ at z≈6). This behavior can be understood
in terms of photoheating, ionization/recombination, and Lyα cooling in the pressure-supported,
self-shielded gas core at the center of the growing dark matter halo. We examine
the spherically-averaged radial velocity profiles of collapsing gas and find that
a gas mass of up to ≈106 M⊙ can reach the central regions within 3 Myr, providing
an upper limit on the amount of massive Pop III stars that can form. The ionizing
radiation increases this limit by a factor of a few compared to strong Lyman-Werner
(LW) radiation alone. We conclude that the bright HeII 1640 Å emission recently
observed from the high-redshift galaxy CR7 cannot be explained by Pop III stars
alone. However, in some halos, a sufficient number of Pop III stars may form to
be detectable with future telescopes such as the James Webb Space Telescope (JWST).
article_processing_charge: No
article_type: original
author:
- first_name: Eli
full_name: Visbal, Eli
last_name: Visbal
- first_name: Greg L.
full_name: Bryan, Greg L.
last_name: Bryan
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
citation:
ama: Visbal E, Bryan GL, Haiman Z. What is the maximum mass of a Population III
galaxy? Monthly Notices of the Royal Astronomical Society. 2017;469(2):1456-1465.
doi:10.1093/mnras/stx909
apa: Visbal, E., Bryan, G. L., & Haiman, Z. (2017). What is the maximum mass
of a Population III galaxy? Monthly Notices of the Royal Astronomical Society.
Oxford University Press. https://doi.org/10.1093/mnras/stx909
chicago: Visbal, Eli, Greg L. Bryan, and Zoltán Haiman. “What Is the Maximum Mass
of a Population III Galaxy?” Monthly Notices of the Royal Astronomical Society.
Oxford University Press, 2017. https://doi.org/10.1093/mnras/stx909.
ieee: E. Visbal, G. L. Bryan, and Z. Haiman, “What is the maximum mass of a Population
III galaxy?,” Monthly Notices of the Royal Astronomical Society, vol. 469,
no. 2. Oxford University Press, pp. 1456–1465, 2017.
ista: Visbal E, Bryan GL, Haiman Z. 2017. What is the maximum mass of a Population
III galaxy? Monthly Notices of the Royal Astronomical Society. 469(2), 1456–1465.
mla: Visbal, Eli, et al. “What Is the Maximum Mass of a Population III Galaxy?”
Monthly Notices of the Royal Astronomical Society, vol. 469, no. 2, Oxford
University Press, 2017, pp. 1456–65, doi:10.1093/mnras/stx909.
short: E. Visbal, G.L. Bryan, Z. Haiman, Monthly Notices of the Royal Astronomical
Society 469 (2017) 1456–1465.
date_created: 2024-09-06T08:42:13Z
date_published: 2017-04-17T00:00:00Z
date_updated: 2024-09-25T10:12:10Z
day: '17'
doi: 10.1093/mnras/stx909
extern: '1'
intvolume: ' 469'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/mnras/stx909
month: '04'
oa: 1
oa_version: Published Version
page: 1456-1465
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
issn:
- 0035-8711
- 1365-2966
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: What is the maximum mass of a Population III galaxy?
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 469
year: '2017'
...
---
_id: '17698'
abstract:
- lang: eng
text: 'Gaseous circumbinary accretion discs provide a promising mechanism to facilitate
the mergers of supermassive black holes (SMBHs) in galactic nuclei. We measure
the torques exerted on accreting SMBH binaries, using 2D, isothermal, moving-mesh,
viscous hydrodynamical simulations of circumbinary accretion discs. Our computational
domain includes the entire inner region of the circumbinary disk with the individual
black holes (BHs) included as point masses on the grid and a sink prescription
to model accretion onto each BH. The BHs each acquire their own well-resolved
accretion discs ("minidiscs"). We explore a range of mass removal rates for the
sink prescription removing gas from the central regions of the minidiscs. We find
that the torque exerted on the binary is primarily gravitational, and dominated
by the gas orbiting close behind and ahead of the individual BHs. The torques
from the distorted circumbinary disc farther out and from the direct accretion
of angular momentum are subdominant. The torques are sensitive to the sink prescription:
slower sinks result in more gas accumulating near the BHs and more negative torques,
driving the binary to merger more rapidly. For faster sinks, the torques are less
negative and eventually turn positive (for unphysically fast sinks). When the
minidiscs are modeled as standard alpha discs, our results are insensitive to
the choice of sink radius. Scaling the simulations to a binary orbital period
tbin = 1yr and background disc accretion rate Mdot = 0.3MEdd in Eddington units,
the binary inspirals on a timescale of 3X10^6 years, irrespective of the SMBH
masses. For binaries with total mass <10^7Msun, this is shorter than the inspiral
time due to gravitational wave (GW) emission alone, implying that gas discs will
have a significant impact on the SMBH binary population and can affect the GW
signal for Pulsar Timing Arrays.'
article_processing_charge: No
article_type: original
author:
- first_name: Yike
full_name: Tang, Yike
last_name: Tang
- first_name: Andrew
full_name: MacFadyen, Andrew
last_name: MacFadyen
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
citation:
ama: Tang Y, MacFadyen A, Haiman Z. On the orbital evolution of supermassive black
hole binaries with circumbinary accretion discs. Monthly Notices of the Royal
Astronomical Society. 2017;469(4):4258-4267. doi:10.1093/mnras/stx1130
apa: Tang, Y., MacFadyen, A., & Haiman, Z. (2017). On the orbital evolution
of supermassive black hole binaries with circumbinary accretion discs. Monthly
Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stx1130
chicago: Tang, Yike, Andrew MacFadyen, and Zoltán Haiman. “On the Orbital Evolution
of Supermassive Black Hole Binaries with Circumbinary Accretion Discs.” Monthly
Notices of the Royal Astronomical Society. Oxford University Press, 2017.
https://doi.org/10.1093/mnras/stx1130.
ieee: Y. Tang, A. MacFadyen, and Z. Haiman, “On the orbital evolution of supermassive
black hole binaries with circumbinary accretion discs,” Monthly Notices of
the Royal Astronomical Society, vol. 469, no. 4. Oxford University Press,
pp. 4258–4267, 2017.
ista: Tang Y, MacFadyen A, Haiman Z. 2017. On the orbital evolution of supermassive
black hole binaries with circumbinary accretion discs. Monthly Notices of the
Royal Astronomical Society. 469(4), 4258–4267.
mla: Tang, Yike, et al. “On the Orbital Evolution of Supermassive Black Hole Binaries
with Circumbinary Accretion Discs.” Monthly Notices of the Royal Astronomical
Society, vol. 469, no. 4, Oxford University Press, 2017, pp. 4258–67, doi:10.1093/mnras/stx1130.
short: Y. Tang, A. MacFadyen, Z. Haiman, Monthly Notices of the Royal Astronomical
Society 469 (2017) 4258–4267.
date_created: 2024-09-06T08:44:11Z
date_published: 2017-05-10T00:00:00Z
date_updated: 2024-09-25T11:16:50Z
day: '10'
doi: 10.1093/mnras/stx1130
extern: '1'
intvolume: ' 469'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/mnras/stx1130
month: '05'
oa: 1
oa_version: Published Version
page: 4258-4267
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
issn:
- 0035-8711
- 1365-2966
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the orbital evolution of supermassive black hole binaries with circumbinary
accretion discs
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 469
year: '2017'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '17949'
abstract:
- lang: eng
text: Single-molecule electronic devices provide researchers with an unprecedented
ability to relate novel physical phenomena to molecular chemical structures. Typically,
conjugated aromatic molecular backbones are relied upon to create electronic devices,
where the aromaticity of the building blocks is used to enhance conductivity.
We capitalize on the classical physical organic chemistry concept of Hückel antiaromaticity
by demonstrating a single-molecule switch that exhibits low conductance in the
neutral state and, upon electrochemical oxidation, reversibly switches to an antiaromatic
high-conducting structure. We form single-molecule devices using the scanning
tunneling microscope–based break-junction technique and observe an on/off ratio
of ~70 for a thiophenylidene derivative that switches to an antiaromatic state
with 6-4-6-π electrons. Through supporting nuclear magnetic resonance measurements,
we show that the doubly oxidized core has antiaromatic character and we use density
functional theory calculations to rationalize the origin of the high-conductance
state for the oxidized single-molecule junction. Together, our work demonstrates
how the concept of antiaromaticity can be exploited to create single-molecule
devices that are highly conducting.
article_number: aao2615
article_processing_charge: Yes
article_type: original
author:
- first_name: Xiaodong
full_name: Yin, Xiaodong
last_name: Yin
- first_name: Yaping
full_name: Zang, Yaping
last_name: Zang
- first_name: Liangliang
full_name: Zhu, Liangliang
last_name: Zhu
- first_name: Jonathan Z.
full_name: Low, Jonathan Z.
last_name: Low
- first_name: Zhen-Fei
full_name: Liu, Zhen-Fei
last_name: Liu
- first_name: Jing
full_name: Cui, Jing
last_name: Cui
- first_name: Jeffrey B.
full_name: Neaton, Jeffrey B.
last_name: Neaton
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Luis M.
full_name: Campos, Luis M.
last_name: Campos
citation:
ama: Yin X, Zang Y, Zhu L, et al. A reversible single-molecule switch based on activated
antiaromaticity. Science Advances. 2017;3(10). doi:10.1126/sciadv.aao2615
apa: Yin, X., Zang, Y., Zhu, L., Low, J. Z., Liu, Z.-F., Cui, J., … Campos, L. M.
(2017). A reversible single-molecule switch based on activated antiaromaticity.
Science Advances. American Association for the Advancement of Science.
https://doi.org/10.1126/sciadv.aao2615
chicago: Yin, Xiaodong, Yaping Zang, Liangliang Zhu, Jonathan Z. Low, Zhen-Fei Liu,
Jing Cui, Jeffrey B. Neaton, Latha Venkataraman, and Luis M. Campos. “A Reversible
Single-Molecule Switch Based on Activated Antiaromaticity.” Science Advances.
American Association for the Advancement of Science, 2017. https://doi.org/10.1126/sciadv.aao2615.
ieee: X. Yin et al., “A reversible single-molecule switch based on activated
antiaromaticity,” Science Advances, vol. 3, no. 10. American Association
for the Advancement of Science, 2017.
ista: Yin X, Zang Y, Zhu L, Low JZ, Liu Z-F, Cui J, Neaton JB, Venkataraman L, Campos
LM. 2017. A reversible single-molecule switch based on activated antiaromaticity.
Science Advances. 3(10), aao2615.
mla: Yin, Xiaodong, et al. “A Reversible Single-Molecule Switch Based on Activated
Antiaromaticity.” Science Advances, vol. 3, no. 10, aao2615, American Association
for the Advancement of Science, 2017, doi:10.1126/sciadv.aao2615.
short: X. Yin, Y. Zang, L. Zhu, J.Z. Low, Z.-F. Liu, J. Cui, J.B. Neaton, L. Venkataraman,
L.M. Campos, Science Advances 3 (2017).
date_created: 2024-09-09T09:12:08Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2024-12-18T07:54:32Z
day: '01'
doi: 10.1126/sciadv.aao2615
extern: '1'
intvolume: ' 3'
issue: '10'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.1126/sciadv.aao2615
month: '10'
oa: 1
oa_version: Published Version
publication: Science Advances
publication_identifier:
eissn:
- 2375-2548
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1126/sciadv.abq0115
scopus_import: '1'
status: public
title: A reversible single-molecule switch based on activated antiaromaticity
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: 3
year: '2017'
...
---
_id: '7725'
abstract:
- lang: eng
text: Phenotypic plasticity is the ability of an individual genotype to alter aspects
of its phenotype depending on the current environment. It is central to the persistence,
resistance and resilience of populations facing variation in physical or biological
factors. Genetic variation in plasticity is pervasive, which suggests its local
adaptation is plausible. Existing studies on the adaptation of plasticity typically
focus on single traits and a few populations, while theory about interactions
among genes (for example, pleiotropy) suggests that a multi-trait, landscape scale
(for example, multiple populations) perspective is required. We present data from
a landscape scale, replicated, multi-trait experiment using a classic predator–prey
system centred on the water flea Daphnia pulex. We find predator regime-driven
differences in genetic variation of multivariate plasticity. These differences
are associated with strong divergent selection linked to a predation regime. Our
findings are evidence for local adaptation of plasticity, suggesting that responses
of populations to environmental variation depend on the conditions in which they
evolved in the past.
article_processing_charge: No
article_type: original
author:
- first_name: Julia
full_name: Reger, Julia
last_name: Reger
- first_name: Martin I.
full_name: Lind, Martin I.
last_name: Lind
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Andrew P.
full_name: Beckerman, Andrew P.
last_name: Beckerman
citation:
ama: Reger J, Lind MI, Robinson MR, Beckerman AP. Predation drives local adaptation
of phenotypic plasticity. Nature Ecology & Evolution. 2017;2:100-107.
doi:10.1038/s41559-017-0373-6
apa: Reger, J., Lind, M. I., Robinson, M. R., & Beckerman, A. P. (2017). Predation
drives local adaptation of phenotypic plasticity. Nature Ecology & Evolution.
Springer Nature. https://doi.org/10.1038/s41559-017-0373-6
chicago: Reger, Julia, Martin I. Lind, Matthew Richard Robinson, and Andrew P. Beckerman.
“Predation Drives Local Adaptation of Phenotypic Plasticity.” Nature Ecology
& Evolution. Springer Nature, 2017. https://doi.org/10.1038/s41559-017-0373-6.
ieee: J. Reger, M. I. Lind, M. R. Robinson, and A. P. Beckerman, “Predation drives
local adaptation of phenotypic plasticity,” Nature Ecology & Evolution,
vol. 2. Springer Nature, pp. 100–107, 2017.
ista: Reger J, Lind MI, Robinson MR, Beckerman AP. 2017. Predation drives local
adaptation of phenotypic plasticity. Nature Ecology & Evolution. 2, 100–107.
mla: Reger, Julia, et al. “Predation Drives Local Adaptation of Phenotypic Plasticity.”
Nature Ecology & Evolution, vol. 2, Springer Nature, 2017, pp. 100–07,
doi:10.1038/s41559-017-0373-6.
short: J. Reger, M.I. Lind, M.R. Robinson, A.P. Beckerman, Nature Ecology &
Evolution 2 (2017) 100–107.
date_created: 2020-04-30T10:46:02Z
date_published: 2017-11-27T00:00:00Z
date_updated: 2021-01-12T08:15:07Z
day: '27'
doi: 10.1038/s41559-017-0373-6
extern: '1'
intvolume: ' 2'
language:
- iso: eng
month: '11'
oa_version: None
page: 100-107
publication: Nature Ecology & Evolution
publication_identifier:
issn:
- 2397-334X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Predation drives local adaptation of phenotypic plasticity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '8306'
abstract:
- lang: eng
text: Bias-resistant public randomness is a critical component in many (distributed)
protocols. Generating public randomness is hard, however, because active adversaries
may behave dishonestly to bias public random choices toward their advantage. Existing
solutions do not scale to hundreds or thousands of participants, as is needed
in many decentralized systems. We propose two large-scale distributed protocols,
RandHound and RandHerd, which provide publicly-verifiable, unpredictable, and
unbiasable randomness against Byzantine adversaries. RandHound relies on an untrusted
client to divide a set of randomness servers into groups for scalability, and
it depends on the pigeonhole principle to ensure output integrity, even for non-random,
adversarial group choices. RandHerd implements an efficient, decentralized randomness
beacon. RandHerd is structurally similar to a BFT protocol, but uses RandHound
in a one-time setup to arrange participants into verifiably unbiased random secret-sharing
groups, which then repeatedly produce random output at predefined intervals. Our
prototype demonstrates that RandHound and RandHerd achieve good performance across
hundreds of participants while retaining a low failure probability by properly
selecting protocol parameters, such as a group size and secret-sharing threshold.
For example, when sharding 512 nodes into groups of 32, our experiments show that
RandHound can produce fresh random output after 240 seconds. RandHerd, after a
setup phase of 260 seconds, is able to generate fresh random output in intervals
of approximately 6 seconds. For this configuration, both protocols operate at
a failure probability of at most 0.08% against a Byzantine adversary.
article_processing_charge: No
author:
- first_name: E.
full_name: Syta, E.
last_name: Syta
- first_name: P.
full_name: Jovanovic, P.
last_name: Jovanovic
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: N.
full_name: Gailly, N.
last_name: Gailly
- first_name: L.
full_name: Gasser, L.
last_name: Gasser
- first_name: I.
full_name: Khoffi, I.
last_name: Khoffi
- first_name: M. J.
full_name: Fischer, M. J.
last_name: Fischer
- first_name: B.
full_name: Ford, B.
last_name: Ford
citation:
ama: 'Syta E, Jovanovic P, Kokoris Kogias E, et al. Scalable bias-resistant distributed
randomness. In: 2017 IEEE Symposium on Security and Privacy. IEEE; 2017:444-460.
doi:10.1109/SP.2017.45'
apa: 'Syta, E., Jovanovic, P., Kokoris Kogias, E., Gailly, N., Gasser, L., Khoffi,
I., … Ford, B. (2017). Scalable bias-resistant distributed randomness. In 2017
IEEE Symposium on Security and Privacy (pp. 444–460). San Jose, CA, United
States: IEEE. https://doi.org/10.1109/SP.2017.45'
chicago: Syta, E., P. Jovanovic, Eleftherios Kokoris Kogias, N. Gailly, L. Gasser,
I. Khoffi, M. J. Fischer, and B. Ford. “Scalable Bias-Resistant Distributed Randomness.”
In 2017 IEEE Symposium on Security and Privacy, 444–60. IEEE, 2017. https://doi.org/10.1109/SP.2017.45.
ieee: E. Syta et al., “Scalable bias-resistant distributed randomness,” in
2017 IEEE Symposium on Security and Privacy, San Jose, CA, United States,
2017, pp. 444–460.
ista: 'Syta E, Jovanovic P, Kokoris Kogias E, Gailly N, Gasser L, Khoffi I, Fischer
MJ, Ford B. 2017. Scalable bias-resistant distributed randomness. 2017 IEEE Symposium
on Security and Privacy. SP: Symposium on Security and Privacy, 444–460.'
mla: Syta, E., et al. “Scalable Bias-Resistant Distributed Randomness.” 2017
IEEE Symposium on Security and Privacy, IEEE, 2017, pp. 444–60, doi:10.1109/SP.2017.45.
short: E. Syta, P. Jovanovic, E. Kokoris Kogias, N. Gailly, L. Gasser, I. Khoffi,
M.J. Fischer, B. Ford, in:, 2017 IEEE Symposium on Security and Privacy, IEEE,
2017, pp. 444–460.
conference:
end_date: 2017-05-26
location: San Jose, CA, United States
name: 'SP: Symposium on Security and Privacy'
start_date: 2017-05-22
date_created: 2020-08-26T12:26:08Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:18:02Z
day: '01'
doi: 10.1109/SP.2017.45
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/1067
month: '06'
oa: 1
oa_version: Preprint
page: 444-460
publication: 2017 IEEE Symposium on Security and Privacy
publication_identifier:
isbn:
- '9781509055340'
issn:
- 2375-1207
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Scalable bias-resistant distributed randomness
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '644'
abstract:
- lang: eng
text: An instance of the valued constraint satisfaction problem (VCSP) is given
by a finite set of variables, a finite domain of labels, and a sum of functions,
each function depending on a subset of the variables. Each function can take finite
values specifying costs of assignments of labels to its variables or the infinite
value, which indicates an infeasible assignment. The goal is to find an assignment
of labels to the variables that minimizes the sum. We study, assuming that P 6=
NP, how the complexity of this very general problem depends on the set of functions
allowed in the instances, the so-called constraint language. The case when all
allowed functions take values in f0;1g corresponds to ordinary CSPs, where one
deals only with the feasibility issue, and there is no optimization. This case
is the subject of the algebraic CSP dichotomy conjecture predicting for which
constraint languages CSPs are tractable (i.e., solvable in polynomial time) and
for which they are NP-hard. The case when all allowed functions take only finite
values corresponds to a finitevalued CSP, where the feasibility aspect is trivial
and one deals only with the optimization issue. The complexity of finite-valued
CSPs was fully classified by Thapper and Živný. An algebraic necessary condition
for tractability of a general-valued CSP with a fixed constraint language was
recently given by Kozik and Ochremiak. As our main result, we prove that if a
constraint language satisfies this algebraic necessary condition, and the feasibility
CSP (i.e., the problem of deciding whether a given instance has a feasible solution)
corresponding to the VCSP with this language is tractable, then the VCSP is tractable.
The algorithm is a simple combination of the assumed algorithm for the feasibility
CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy
for ordinary CSPs would imply a dichotomy for general-valued CSPs.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Andrei
full_name: Krokhin, Andrei
last_name: Krokhin
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs.
SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
apa: Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued
CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836
chicago: Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity
of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.
ieee: V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued
CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110,
2017.
ista: Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued
CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
mla: Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM
Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
short: V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017)
1087–1110.
date_created: 2018-12-11T11:47:40Z
date_published: 2017-06-29T00:00:00Z
date_updated: 2025-09-23T13:45:56Z
day: '29'
department:
- _id: VlKo
doi: 10.1137/16M1091836
ec_funded: 1
external_id:
arxiv:
- '1502.07327'
isi:
- '000404774300010'
intvolume: ' 46'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.07327
month: '06'
oa: 1
oa_version: Preprint
page: 1087 - 1110
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_status: published
publisher: SIAM
publist_id: '7138'
quality_controlled: '1'
related_material:
record:
- id: '1637'
relation: other
status: public
scopus_import: '1'
status: public
title: The complexity of general-valued CSPs
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 46
year: '2017'
...
---
_id: '647'
abstract:
- lang: eng
text: Despite researchers’ efforts in the last couple of decades, reachability analysis
is still a challenging problem even for linear hybrid systems. Among the existing
approaches, the most practical ones are mainly based on bounded-time reachable
set over-approximations. For the purpose of unbounded-time analysis, one important
strategy is to abstract the original system and find an invariant for the abstraction.
In this paper, we propose an approach to constructing a new kind of abstraction
called conic abstraction for affine hybrid systems, and to computing reachable
sets based on this abstraction. The essential feature of a conic abstraction is
that it partitions the state space of a system into a set of convex polyhedral
cones which is derived from a uniform conic partition of the derivative space.
Such a set of polyhedral cones is able to cut all trajectories of the system into
almost straight segments so that every segment of a reach pipe in a polyhedral
cone tends to be straight as well, and hence can be over-approximated tightly
by polyhedra using similar techniques as HyTech or PHAVer. In particular, for
diagonalizable affine systems, our approach can guarantee to find an invariant
for unbounded reachable sets, which is beyond the capability of bounded-time reachability
analysis tools. We implemented the approach in a tool and experiments on benchmarks
show that our approach is more powerful than SpaceEx and PHAVer in dealing with
diagonalizable systems.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
citation:
ama: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid
systems. In: Vol 10419. Springer; 2017:116-132. doi:10.1007/978-3-319-65765-3_7'
apa: 'Bogomolov, S., Giacobbe, M., Henzinger, T. A., & Kong, H. (2017). Conic
abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS:
Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_7'
chicago: Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic
Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_7.
ieee: 'S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions
for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of
Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.'
ista: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for
hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS,
vol. 10419, 116–132.'
mla: Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol.
10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.
short: S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017,
pp. 116–132.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
start_date: 2017-09-05
corr_author: '1'
date_created: 2018-12-11T11:47:41Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2026-04-08T07:47:13Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_7
external_id:
isi:
- '000611678300007'
file:
- access_level: open_access
checksum: faf546914ba29bcf9974ee36b6b16750
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:38Z
date_updated: 2020-07-14T12:47:31Z
file_id: '4956'
file_name: IST-2017-831-v1+1_main.pdf
file_size: 3806864
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 116 - 132
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
isbn:
- 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7129'
pubrep_id: '831'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Conic abstractions for hybrid systems
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: '10419 '
year: '2017'
...
---
_id: '674'
abstract:
- lang: eng
text: Navigation of cells along gradients of guidance cues is a determining step
in many developmental and immunological processes. Gradients can either be soluble
or immobilized to tissues as demonstrated for the haptotactic migration of dendritic
cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate
how gradient characteristics govern cellular response patterns, we here introduce
an in vitro system allowing to track migratory responses of DCs to precisely controlled
immobilized gradients of CCL21. We find that haptotactic sensing depends on the
absolute CCL21 concentration and local steepness of the gradient, consistent with
a scenario where DC directionality is governed by the signal-to-noise ratio of
CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC
guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore,
we find that CCR7 signal termination by the G-protein-coupled receptor kinase
6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient
sensing in vitro and confirm those observations in vivo. These findings suggest
that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal
guidance in vivo.
article_processing_charge: No
author:
- first_name: Jan
full_name: Schwarz, Jan
id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
last_name: Schwarz
- first_name: Veronika
full_name: Bierbaum, Veronika
id: 3FD04378-F248-11E8-B48F-1D18A9856A87
last_name: Bierbaum
- first_name: Kari
full_name: Vaahtomeri, Kari
id: 368EE576-F248-11E8-B48F-1D18A9856A87
last_name: Vaahtomeri
orcid: 0000-0001-7829-3518
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Ingrid
full_name: De Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: De Vries
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
- first_name: Anne
full_name: Reversat, Anne
id: 35B76592-F248-11E8-B48F-1D18A9856A87
last_name: Reversat
orcid: 0000-0003-0666-8928
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Teresa
full_name: Tarrant, Teresa
last_name: Tarrant
- first_name: Tobias
full_name: Bollenbach, Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic
chemokine gradients in a manner governed by signal to noise ratio and dependent
on GRK6. Current Biology. 2017;27(9):1314-1325. doi:10.1016/j.cub.2017.04.004
apa: Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries,
I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients
in a manner governed by signal to noise ratio and dependent on GRK6. Current
Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.04.004
chicago: Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus
Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret
Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio
and Dependent on GRK6.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.04.004.
ieee: J. Schwarz et al., “Dendritic cells interpret haptotactic chemokine
gradients in a manner governed by signal to noise ratio and dependent on GRK6,”
Current Biology, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017.
ista: Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner
AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells
interpret haptotactic chemokine gradients in a manner governed by signal to noise
ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.
mla: Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients
in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current
Biology, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:10.1016/j.cub.2017.04.004.
short: J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries,
A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt,
Current Biology 27 (2017) 1314–1325.
corr_author: '1'
date_created: 2018-12-11T11:47:51Z
date_published: 2017-05-09T00:00:00Z
date_updated: 2025-09-10T14:26:47Z
day: '09'
department:
- _id: MiSi
- _id: Bio
- _id: NanoFab
doi: 10.1016/j.cub.2017.04.004
ec_funded: 1
external_id:
isi:
- '000400741700021'
intvolume: ' 27'
isi: 1
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 1314 - 1325
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 564-B12
name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Current Biology
publication_identifier:
issn:
- '09609822'
publication_status: published
publisher: Cell Press
publist_id: '7050'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dendritic cells interpret haptotactic chemokine gradients in a manner governed
by signal to noise ratio and dependent on GRK6
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2017'
...
---
_id: '7064'
abstract:
- lang: eng
text: 'The complex antiferromagnetic orders observed in the honeycomb iridates are
a double-edged sword in the search for a quantum spin-liquid: both attesting that
the magnetic interactions provide many of the necessary ingredients, while simultaneously
impeding access. Focus has naturally been drawn to the unusual magnetic orders
that hint at the underlying spin correlations. However, the study of any particular
broken symmetry state generally provides little clue about the possibility of
other nearby ground states. Here we use magnetic fields approaching 100 Tesla
to reveal the extent of the spin correlations in γ-lithium iridate. We find that
a small component of field along the magnetic easy-axis melts long-range order,
revealing a bistable, strongly correlated spin state. Far from the usual destruction
of antiferromagnetism via spin polarization, the high-field state possesses only
a small fraction of the total iridium moment, without evidence for long-range
order up to the highest attainable magnetic fields.'
article_number: '180'
article_processing_charge: No
article_type: original
author:
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: J. B.
full_name: Betts, J. B.
last_name: Betts
- first_name: Nicholas P.
full_name: Breznay, Nicholas P.
last_name: Breznay
- first_name: James G.
full_name: Analytis, James G.
last_name: Analytis
- first_name: Ross D.
full_name: McDonald, Ross D.
last_name: McDonald
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
citation:
ama: Modic KA, Ramshaw BJ, Betts JB, et al. Robust spin correlations at high magnetic
fields in the harmonic honeycomb iridates. Nature Communications. 2017;8(1).
doi:10.1038/s41467-017-00264-6
apa: Modic, K. A., Ramshaw, B. J., Betts, J. B., Breznay, N. P., Analytis, J. G.,
McDonald, R. D., & Shekhter, A. (2017). Robust spin correlations at high magnetic
fields in the harmonic honeycomb iridates. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-017-00264-6
chicago: Modic, Kimberly A, B. J. Ramshaw, J. B. Betts, Nicholas P. Breznay, James
G. Analytis, Ross D. McDonald, and Arkady Shekhter. “Robust Spin Correlations
at High Magnetic Fields in the Harmonic Honeycomb Iridates.” Nature Communications.
Springer Nature, 2017. https://doi.org/10.1038/s41467-017-00264-6.
ieee: K. A. Modic et al., “Robust spin correlations at high magnetic fields
in the harmonic honeycomb iridates,” Nature Communications, vol. 8, no.
1. Springer Nature, 2017.
ista: Modic KA, Ramshaw BJ, Betts JB, Breznay NP, Analytis JG, McDonald RD, Shekhter
A. 2017. Robust spin correlations at high magnetic fields in the harmonic honeycomb
iridates. Nature Communications. 8(1), 180.
mla: Modic, Kimberly A., et al. “Robust Spin Correlations at High Magnetic Fields
in the Harmonic Honeycomb Iridates.” Nature Communications, vol. 8, no.
1, 180, Springer Nature, 2017, doi:10.1038/s41467-017-00264-6.
short: K.A. Modic, B.J. Ramshaw, J.B. Betts, N.P. Breznay, J.G. Analytis, R.D. McDonald,
A. Shekhter, Nature Communications 8 (2017).
date_created: 2019-11-19T13:11:55Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:39Z
day: '01'
ddc:
- '530'
doi: 10.1038/s41467-017-00264-6
extern: '1'
file:
- access_level: open_access
checksum: 57fcd59d2f274b6b16cc89ea03cfd440
content_type: application/pdf
creator: cziletti
date_created: 2019-11-20T14:12:54Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7091'
file_name: 2017_NatureComm_Modic.pdf
file_size: 1242958
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Robust spin correlations at high magnetic fields in the harmonic honeycomb
iridates
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: 8
year: '2017'
...
---
_id: '743'
abstract:
- lang: eng
text: "This special issue of the Journal on Formal Methods in System Design is dedicated
to Prof. Helmut Veith, who unexpectedly passed away in March 2016. Helmut Veith
was a brilliant researcher, inspiring collaborator, passionate mentor, generous
friend, and valued member of the formal methods community. Helmut was not only
known for his numerous and influential contributions in the field of automated
verification (most prominently his work on Counterexample-Guided Abstraction Refinement
[1,2]), but also for his untiring and passionate efforts for the logic community:
he co-organized the Vienna Summer of Logic (an event comprising twelve conferences
and numerous workshops which attracted thousands of researchers from all over
the world), he initiated the Vienna Center for Logic and Algorithms (which promotes
international collaboration on logic and algorithms and organizes outreach events
such as the LogicLounge), and he coordinated the Doctoral Program on Logical Methods
in Computer Science at TU Wien (currently educating more than 40 doctoral students)
and a National Research Network on Rigorous Systems Engineering (uniting fifteen
researchers in Austria to address the challenge of building reliable and safe
computer\r\nsystems). With his enthusiasm and commitment, Helmut completely reshaped
the Austrian research landscape in the field of logic and verification in his
few years as a full professor at TU Wien."
article_processing_charge: No
author:
- first_name: Georg
full_name: Gottlob, Georg
last_name: Gottlob
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Georg
full_name: Weißenbacher, Georg
last_name: Weißenbacher
citation:
ama: Gottlob G, Henzinger TA, Weißenbacher G. Preface of the special issue in memoriam
Helmut Veith. Formal Methods in System Design. 2017;51(2):267-269. doi:10.1007/s10703-017-0307-6
apa: Gottlob, G., Henzinger, T. A., & Weißenbacher, G. (2017). Preface of the
special issue in memoriam Helmut Veith. Formal Methods in System Design.
Springer. https://doi.org/10.1007/s10703-017-0307-6
chicago: Gottlob, Georg, Thomas A Henzinger, and Georg Weißenbacher. “Preface of
the Special Issue in Memoriam Helmut Veith.” Formal Methods in System Design.
Springer, 2017. https://doi.org/10.1007/s10703-017-0307-6.
ieee: G. Gottlob, T. A. Henzinger, and G. Weißenbacher, “Preface of the special
issue in memoriam Helmut Veith,” Formal Methods in System Design, vol.
51, no. 2. Springer, pp. 267–269, 2017.
ista: Gottlob G, Henzinger TA, Weißenbacher G. 2017. Preface of the special issue
in memoriam Helmut Veith. Formal Methods in System Design. 51(2), 267–269.
mla: Gottlob, Georg, et al. “Preface of the Special Issue in Memoriam Helmut Veith.”
Formal Methods in System Design, vol. 51, no. 2, Springer, 2017, pp. 267–69,
doi:10.1007/s10703-017-0307-6.
short: G. Gottlob, T.A. Henzinger, G. Weißenbacher, Formal Methods in System Design
51 (2017) 267–269.
date_created: 2018-12-11T11:48:16Z
date_published: 2017-11-14T00:00:00Z
date_updated: 2023-09-27T12:29:29Z
day: '14'
department:
- _id: ToHe
doi: 10.1007/s10703-017-0307-6
external_id:
isi:
- '000415615600001'
intvolume: ' 51'
isi: 1
issue: '2'
language:
- iso: eng
month: '11'
oa_version: None
page: 267 - 269
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '6924'
quality_controlled: '1'
status: public
title: Preface of the special issue in memoriam Helmut Veith
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 51
year: '2017'
...
---
_id: '751'
abstract:
- lang: eng
text: The basement membrane (BM) is a thin layer of extracellular matrix (ECM) beneath
nearly all epithelial cell types that is critical for cellular and tissue function.
It is composed of numerous components conserved among all bilaterians [1]; however,
it is unknown how all of these components are generated and subsequently constructed
to form a fully mature BM in the living animal. Although BM formation is thought
to simply involve a process of self-assembly [2], this concept suffers from a
number of logistical issues when considering its construction in vivo. First,
incorporation of BM components appears to be hierarchical [3-5], yet it is unclear
whether their production during embryogenesis must also be regulated in a temporal
fashion. Second, many BM proteins are produced not only by the cells residing
on the BM but also by surrounding cell types [6-9], and it is unclear how large,
possibly insoluble protein complexes [10] are delivered into the matrix. Here
we exploit our ability to live image and genetically dissect de novo BM formation
during Drosophila development. This reveals that there is a temporal hierarchy
of BM protein production that is essential for proper component incorporation.
Furthermore, we show that BM components require secretion by migrating macrophages
(hemocytes) during their developmental dispersal, which is critical for embryogenesis.
Indeed, hemocyte migration is essential to deliver a subset of ECM components
evenly throughout the embryo. This reveals that de novo BM construction requires
a combination of both production and distribution logistics allowing for the timely
delivery of core components.
article_processing_charge: No
author:
- first_name: Yutaka
full_name: Matsubayashi, Yutaka
last_name: Matsubayashi
- first_name: Adam
full_name: Louani, Adam
last_name: Louani
- first_name: Anca
full_name: Dragu, Anca
last_name: Dragu
- first_name: Besaiz
full_name: Sanchez Sanchez, Besaiz
last_name: Sanchez Sanchez
- first_name: Eduardo
full_name: Serna Morales, Eduardo
last_name: Serna Morales
- first_name: Lawrence
full_name: Yolland, Lawrence
last_name: Yolland
- 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: Gema
full_name: Vizcay, Gema
last_name: Vizcay
- first_name: Roland
full_name: Fleck, Roland
last_name: Fleck
- first_name: John
full_name: Heddleston, John
last_name: Heddleston
- first_name: Teng
full_name: Chew, Teng
last_name: Chew
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Brian
full_name: Stramer, Brian
last_name: Stramer
citation:
ama: Matsubayashi Y, Louani A, Dragu A, et al. A moving source of matrix components
is essential for De Novo basement membrane formation. Current Biology.
2017;27(22):3526-3534e.4. doi:10.1016/j.cub.2017.10.001
apa: Matsubayashi, Y., Louani, A., Dragu, A., Sanchez Sanchez, B., Serna Morales,
E., Yolland, L., … Stramer, B. (2017). A moving source of matrix components is
essential for De Novo basement membrane formation. Current Biology. Cell
Press. https://doi.org/10.1016/j.cub.2017.10.001
chicago: Matsubayashi, Yutaka, Adam Louani, Anca Dragu, Besaiz Sanchez Sanchez,
Eduardo Serna Morales, Lawrence Yolland, Attila György, et al. “A Moving Source
of Matrix Components Is Essential for De Novo Basement Membrane Formation.” Current
Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.10.001.
ieee: Y. Matsubayashi et al., “A moving source of matrix components is essential
for De Novo basement membrane formation,” Current Biology, vol. 27, no.
22. Cell Press, p. 3526–3534e.4, 2017.
ista: Matsubayashi Y, Louani A, Dragu A, Sanchez Sanchez B, Serna Morales E, Yolland
L, György A, Vizcay G, Fleck R, Heddleston J, Chew T, Siekhaus DE, Stramer B.
2017. A moving source of matrix components is essential for De Novo basement membrane
formation. Current Biology. 27(22), 3526–3534e.4.
mla: Matsubayashi, Yutaka, et al. “A Moving Source of Matrix Components Is Essential
for De Novo Basement Membrane Formation.” Current Biology, vol. 27, no.
22, Cell Press, 2017, p. 3526–3534e.4, doi:10.1016/j.cub.2017.10.001.
short: Y. Matsubayashi, A. Louani, A. Dragu, B. Sanchez Sanchez, E. Serna Morales,
L. Yolland, A. György, G. Vizcay, R. Fleck, J. Heddleston, T. Chew, D.E. Siekhaus,
B. Stramer, Current Biology 27 (2017) 3526–3534e.4.
date_created: 2018-12-11T11:48:18Z
date_published: 2017-11-09T00:00:00Z
date_updated: 2023-09-27T12:25:31Z
day: '09'
ddc:
- '570'
- '576'
department:
- _id: DaSi
doi: 10.1016/j.cub.2017.10.001
external_id:
isi:
- '000415815800031'
file:
- access_level: open_access
checksum: 264cf6c6c3551486ba5ea786850e000a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:45Z
date_updated: 2020-07-14T12:47:59Z
file_id: '4770'
file_name: IST-2017-875-v1+1_1-s2.0-S0960982217312691-main.pdf
file_size: 4770657
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
intvolume: ' 27'
isi: 1
issue: '22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 3526 - 3534e.4
publication: Current Biology
publication_identifier:
issn:
- '09609822'
publication_status: published
publisher: Cell Press
publist_id: '6905'
pubrep_id: '875'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A moving source of matrix components is essential for De Novo basement membrane
formation
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: 27
year: '2017'
...
---
OA_place: publisher
_id: '992'
abstract:
- lang: eng
text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
set of\r\nvariables, a finite domain of labels, and a set of constraints, each
constraint acting on\r\na subset of the variables. The goal is to find an assignment
of labels to its variables\r\nthat satisfies all constraints (or decide whether
one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
infinite) costs of particular assignments,\r\nwe obtain instances from a richer
class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
(assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
complexity classification modulo (missing pieces of) complexity classification
for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
(again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
apa: Rolinek, M. (2017). Complexity of constraint satisfaction. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
and Technology Austria, 2017.
ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
and Technology Austria.
mla: Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.
short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2026-04-08T14:17:06Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
checksum: 81761fb939acb7585c36629f765b4373
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:55Z
date_updated: 2020-07-14T12:48:18Z
file_id: '4654'
file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
file_size: 786145
relation: main_file
- access_level: closed
checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:43:24Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6208'
file_name: 2017_Thesis_Rolinek_source.zip
file_size: 5936337
relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2017'
...
---
_id: '1177'
abstract:
- lang: eng
text: Boldyreva, Palacio and Warinschi introduced a multiple forking game as an
extension of general forking. The notion of (multiple) forking is a useful abstraction
from the actual simulation of cryptographic scheme to the adversary in a security
reduction, and is achieved through the intermediary of a so-called wrapper algorithm.
Multiple forking has turned out to be a useful tool in the security argument of
several cryptographic protocols. However, a reduction employing multiple forking
incurs a significant degradation of (Formula presented.) , where (Formula presented.)
denotes the upper bound on the underlying random oracle calls and (Formula presented.)
, the number of forkings. In this work we take a closer look at the reasons for
the degradation with a tighter security bound in mind. We nail down the exact
set of conditions for success in the multiple forking game. A careful analysis
of the cryptographic schemes and corresponding security reduction employing multiple
forking leads to the formulation of ‘dependence’ and ‘independence’ conditions
pertaining to the output of the wrapper in different rounds. Based on the (in)dependence
conditions we propose a general framework of multiple forking and a General Multiple
Forking Lemma. Leveraging (in)dependence to the full allows us to improve the
degradation factor in the multiple forking game by a factor of (Formula presented.).
By implication, the cost of a single forking involving two random oracles (augmented
forking) matches that involving a single random oracle (elementary forking). Finally,
we study the effect of these observations on the concrete security of existing
schemes employing multiple forking. We conclude that by careful design of the
protocol (and the wrapper in the security reduction) it is possible to harness
our observations to the full extent.
acknowledgement: "We are grateful to the anonymous reviewers for their insightful
comments. The\r\ndetailed reports helped us a lot to address the technical mistakes
as well as to improve the overall presentation of the paper."
article_processing_charge: No
author:
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
orcid: 0009-0006-6812-7317
- first_name: Sanjit
full_name: Chatterjee, Sanjit
last_name: Chatterjee
citation:
ama: 'Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging
(in)dependence for a tighter bound. Algorithmica. 2016;74(4):1321-1362.
doi:10.1007/s00453-015-9997-6'
apa: 'Kamath Hosdurg, C., & Chatterjee, S. (2016). A closer look at multiple-forking:
Leveraging (in)dependence for a tighter bound. Algorithmica. Springer.
https://doi.org/10.1007/s00453-015-9997-6'
chicago: 'Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking:
Leveraging (in)Dependence for a Tighter Bound.” Algorithmica. Springer,
2016. https://doi.org/10.1007/s00453-015-9997-6.'
ieee: 'C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking:
Leveraging (in)dependence for a tighter bound,” Algorithmica, vol. 74,
no. 4. Springer, pp. 1321–1362, 2016.'
ista: 'Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking:
Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.'
mla: 'Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking:
Leveraging (in)Dependence for a Tighter Bound.” Algorithmica, vol. 74,
no. 4, Springer, 2016, pp. 1321–62, doi:10.1007/s00453-015-9997-6.'
short: C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.
cryptoeprintid: 1
das_tickbox: '1'
date_created: 2018-12-11T11:50:33Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2026-06-22T14:07:33Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00453-015-9997-6
external_id:
cryptoeprintid:
- 2013/651
isi:
- '000373640000005'
intvolume: ' 74'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2013/651
month: '04'
oa: 1
oa_version: Submitted Version
page: 1321 - 1362
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '6177'
quality_controlled: '1'
status: public
title: 'A closer look at multiple-forking: Leveraging (in)dependence for a tighter
bound'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2016'
...
---
_id: '11834'
abstract:
- lang: eng
text: "We present a deterministic incremental algorithm for exactly maintaining
the size of a minimum cut with ~O(1) amortized time per edge insertion and O(1)
query time. This result partially answers an open question posed by Thorup [Combinatorica
2007]. It also stays in sharp contrast to a polynomial conditional lower-bound
for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained
by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC
2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997].\r\n\r\nWe
also study space-efficient incremental algorithms for the minimum cut problem.
Concretely, we show that there exists an O(n log n/epsilon^2) space Monte-Carlo
algorithm that can process a stream of edge insertions starting from an empty
graph, and with high probability, the algorithm maintains a (1+epsilon)-approximation
to the minimum cut. The algorithm has ~O(1) amortized update-time and constant
query-time."
alternative_title:
- LIPIcs
article_number: '46'
article_processing_charge: No
arxiv: 1
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Mikkel
full_name: Thorup, Mikkel
last_name: Thorup
citation:
ama: 'Goranci G, Henzinger M, Thorup M. Incremental exact min-cut in poly-logarithmic
amortized update time. In: 24th Annual European Symposium on Algorithms.
Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.46'
apa: 'Goranci, G., Henzinger, M., & Thorup, M. (2016). Incremental exact min-cut
in poly-logarithmic amortized update time. In 24th Annual European Symposium
on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.ESA.2016.46'
chicago: Goranci, Gramoz, Monika Henzinger, and Mikkel Thorup. “Incremental Exact
Min-Cut in Poly-Logarithmic Amortized Update Time.” In 24th Annual European
Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016. https://doi.org/10.4230/LIPICS.ESA.2016.46.
ieee: G. Goranci, M. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic
amortized update time,” in 24th Annual European Symposium on Algorithms,
Aarhus, Denmark, 2016, vol. 57.
ista: 'Goranci G, Henzinger M, Thorup M. 2016. Incremental exact min-cut in poly-logarithmic
amortized update time. 24th Annual European Symposium on Algorithms. ESA: Annual
European Symposium on Algorithms, LIPIcs, vol. 57, 46.'
mla: Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized
Update Time.” 24th Annual European Symposium on Algorithms, vol. 57, 46,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.46.
short: G. Goranci, M. Henzinger, M. Thorup, in:, 24th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2022-08-12T10:58:32Z
date_published: 2016-08-18T00:00:00Z
date_updated: 2024-11-06T11:58:55Z
day: '18'
doi: 10.4230/LIPICS.ESA.2016.46
extern: '1'
external_id:
arxiv:
- '1611.06500'
intvolume: ' 57'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2016.46
month: '08'
oa: 1
oa_version: Published Version
publication: 24th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-3-95977-015-6
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental exact min-cut in poly-logarithmic amortized update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '11835'
abstract:
- lang: eng
text: "During the last 10 years it has become popular to study dynamic graph problems
in a emergency planning or sensitivity setting: Instead of considering the general
fully dynamic problem, we only have to process a single batch update of size d;
after the update we have to answer queries.\r\n\r\nIn this paper, we consider
the dynamic subgraph connectivity problem with sensitivity d: We are given a graph
of which some vertices are activated and some are deactivated. After that we get
a single update in which the states of up to $d$ vertices are changed. Then we
get a sequence of connectivity queries in the subgraph of activated vertices.\r\n\r\nWe
present the first fully dynamic algorithm for this problem which has an update
and query time only slightly worse than the best decremental algorithm. In addition,
we present the first incremental algorithm which is tight with respect to the
best known conditional lower bound; moreover, the algorithm is simple and we believe
it is implementable and efficient in practice."
alternative_title:
- LIPIcs
article_number: '48'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Neumann, Stefan
last_name: Neumann
citation:
ama: 'Henzinger M, Neumann S. Incremental and fully dynamic subgraph connectivity
for emergency planning. In: 24th Annual European Symposium on Algorithms.
Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.48'
apa: 'Henzinger, M., & Neumann, S. (2016). Incremental and fully dynamic subgraph
connectivity for emergency planning. In 24th Annual European Symposium on Algorithms
(Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ESA.2016.48'
chicago: Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph
Connectivity for Emergency Planning.” In 24th Annual European Symposium on
Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
https://doi.org/10.4230/LIPICS.ESA.2016.48.
ieee: M. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity
for emergency planning,” in 24th Annual European Symposium on Algorithms,
Aarhus, Denmark, 2016, vol. 57.
ista: 'Henzinger M, Neumann S. 2016. Incremental and fully dynamic subgraph connectivity
for emergency planning. 24th Annual European Symposium on Algorithms. ESA: Annual
European Symposium on Algorithms, LIPIcs, vol. 57, 48.'
mla: Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph
Connectivity for Emergency Planning.” 24th Annual European Symposium on Algorithms,
vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.48.
short: M. Henzinger, S. Neumann, in:, 24th Annual European Symposium on Algorithms,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2022-08-12T11:05:41Z
date_published: 2016-08-18T00:00:00Z
date_updated: 2024-11-06T11:59:06Z
day: '18'
doi: 10.4230/LIPICS.ESA.2016.48
extern: '1'
external_id:
arxiv:
- '1611.05248'
intvolume: ' 57'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2016.48
month: '08'
oa: 1
oa_version: Published Version
publication: 24th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-3-95977-015-6
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental and fully dynamic subgraph connectivity for emergency planning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '11836'
abstract:
- lang: eng
text: "Given a graph where vertices are partitioned into k terminals and non-terminals,
the goal is to compress the graph (i.e., reduce the number of non-terminals) using
minor operations while preserving terminal distances approximately. The distortion
of a compressed graph is the maximum multiplicative blow-up of distances between
all pairs of terminals. We study the trade-off between the number of non-terminals
and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem,
in which all non-terminals must be removed.\r\n\r\nWe introduce a novel black-box
reduction to convert any lower bound on distortion for the SPR problem into a
super-linear lower bound on the number of non-terminals, with the same distortion,
for our problem. This allows us to show that there exist graphs such that every
minor with distortion less than 2 / 2.5 / 3 must have Omega(k^2) / Omega(k^{5/4})
/ Omega(k^{6/5}) non-terminals, plus more trade-offs in between. The black-box
reduction has an interesting consequence: if the tight lower bound on distortion
for the SPR problem is super-constant, then allowing any O(k) non-terminals will
not help improving the lower bound to a constant.\r\n\r\nWe also build on the
existing results on spanners, distance oracles and connected 0-extensions to show
a number of upper bounds for general graphs, planar graphs, graphs that exclude
a fixed minor and bounded treewidth graphs. Among others, we show that any graph
admits a minor with O(log k) distortion and O(k^2) non-terminals, and any planar
graph admits a minor with\r\n1 + epsilon distortion and ~O((k/epsilon)^2) non-terminals."
alternative_title:
- LIPIcs
article_number: '131'
article_processing_charge: No
arxiv: 1
author:
- first_name: Yun Kuen
full_name: Cheung, Yun Kuen
last_name: Cheung
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Cheung YK, Goranci G, Henzinger M. Graph minors for preserving terminal distances
approximately - lower and upper bounds. In: 43rd International Colloquium on
Automata, Languages, and Programming. Vol 55. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2016. doi:10.4230/LIPICS.ICALP.2016.131'
apa: 'Cheung, Y. K., Goranci, G., & Henzinger, M. (2016). Graph minors for preserving
terminal distances approximately - lower and upper bounds. In 43rd International
Colloquium on Automata, Languages, and Programming (Vol. 55). Rome, Italy:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2016.131'
chicago: Cheung, Yun Kuen, Gramoz Goranci, and Monika Henzinger. “Graph Minors for
Preserving Terminal Distances Approximately - Lower and Upper Bounds.” In 43rd
International Colloquium on Automata, Languages, and Programming, Vol. 55.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ICALP.2016.131.
ieee: Y. K. Cheung, G. Goranci, and M. Henzinger, “Graph minors for preserving terminal
distances approximately - lower and upper bounds,” in 43rd International Colloquium
on Automata, Languages, and Programming, Rome, Italy, 2016, vol. 55.
ista: 'Cheung YK, Goranci G, Henzinger M. 2016. Graph minors for preserving terminal
distances approximately - lower and upper bounds. 43rd International Colloquium
on Automata, Languages, and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LIPIcs, vol. 55, 131.'
mla: Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately
- Lower and Upper Bounds.” 43rd International Colloquium on Automata, Languages,
and Programming, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPICS.ICALP.2016.131.
short: Y.K. Cheung, G. Goranci, M. Henzinger, in:, 43rd International Colloquium
on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2016-07-12
date_created: 2022-08-12T11:16:01Z
date_published: 2016-08-23T00:00:00Z
date_updated: 2024-11-06T11:58:15Z
day: '23'
doi: 10.4230/LIPICS.ICALP.2016.131
extern: '1'
external_id:
arxiv:
- '1604.08342'
intvolume: ' 55'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPICS.ICALP.2016.131
month: '08'
oa: 1
oa_version: Published Version
publication: 43rd International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-013-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Graph minors for preserving terminal distances approximately - lower and upper
bounds
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...