---
_id: '683'
abstract:
- lang: eng
text: 'Given a triangulation of a point set in the plane, a flip deletes an edge
e whose removal leaves a convex quadrilateral, and replaces e by the opposite
diagonal of the quadrilateral. It is well known that any triangulation of a point
set can be reconfigured to any other triangulation by some sequence of flips.
We explore this question in the setting where each edge of a triangulation has
a label, and a flip transfers the label of the removed edge to the new edge. It
is not true that every labelled triangulation of a point set can be reconfigured
to every other labelled triangulation via a sequence of flips, but we characterize
when this is possible. There is an obvious necessary condition: for each label
l, if edge e has label l in the first triangulation and edge f has label l in
the second triangulation, then there must be some sequence of flips that moves
label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot
formulated the Orbit Conjecture, which states that this necessary condition is
also sufficient, i.e. that all labels can be simultaneously mapped to their destination
if and only if each label individually can be mapped to its destination. We prove
this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence
of flips to reconfigure one labelled triangulation to another, if such a sequence
exists, and we prove an upper bound of O(n7) on the length of the flip sequence.
Our proof uses the topological result that the sets of pairwise non-crossing edges
on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional
ball (this follows from a result of Orden and Santos; we give a different proof
based on a shelling argument). The dual cell complex of this simplicial ball,
called the flip complex, has the usual flip graph as its 1-skeleton. We use properties
of the 2-skeleton of the flip complex to prove the Orbit Conjecture.'
alternative_title:
- LIPIcs
article_number: '49'
author:
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping
edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2017. doi:10.4230/LIPIcs.SoCG.2017.49'
apa: 'Lubiw, A., Masárová, Z., & Wagner, U. (2017). A proof of the orbit conjecture
for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium
on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49'
chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture
for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.49.
ieee: 'A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for
flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational
Geometry, Brisbane, Australia, 2017, vol. 77.'
ista: 'Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for
flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry,
LIPIcs, vol. 77, 49.'
mla: Lubiw, Anna, et al. A Proof of the Orbit Conjecture for Flipping Edge Labelled
Triangulations. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, doi:10.4230/LIPIcs.SoCG.2017.49.
short: A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2017.
conference:
end_date: 2017-07-07
location: Brisbane, Australia
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2017-07-04
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-05T15:01:43Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.49
file:
- access_level: open_access
checksum: 24fdde981cc513352a78dcf9b0660ae9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:12Z
date_updated: 2020-07-14T12:47:41Z
file_id: '5265'
file_name: IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf
file_size: 710007
relation: main_file
file_date_updated: 2020-07-14T12:47:41Z
has_accepted_license: '1'
intvolume: ' 77'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7033'
pubrep_id: '896'
quality_controlled: '1'
related_material:
record:
- id: '5986'
relation: later_version
status: public
scopus_import: 1
status: public
title: A proof of the orbit conjecture for flipping edge labelled triangulations
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '684'
abstract:
- lang: eng
text: We generalize winning conditions in two-player games by adding a structural
acceptance condition called obligations. Obligations are orthogonal to the linear
winning conditions that define whether a play is winning. Obligations are a declaration
that player 0 can achieve a certain value from a configuration. If the obligation
is met, the value of that configuration for player 0 is 1. We define the value
in such games and show that obligation games are determined. For Markov chains
with Borel objectives and obligations, and finite turn-based stochastic parity
games with obligations we give an alternative and simpler characterization of
the value function. Based on this simpler definition we show that the decision
problem of winning finite turn-based stochastic parity games with obligations
is in NP∩co-NP. We also show that obligation games provide a game framework for
reasoning about p-automata. © 2017 The Association for Symbolic Logic.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal
of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71
apa: Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata.
Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71
chicago: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and
P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017.
https://doi.org/10.1017/jsl.2016.71.
ieee: K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,”
Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press,
pp. 420–452, 2017.
ista: Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata.
Journal of Symbolic Logic. 82(2), 420–452.
mla: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”
Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press,
2017, pp. 420–52, doi:10.1017/jsl.2016.71.
short: K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-04-16T12:10:53Z
day: '01'
department:
- _id: KrCh
doi: 10.1017/jsl.2016.71
intvolume: ' 82'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1206.5174
month: '06'
oa: 1
oa_version: Submitted Version
page: 420 - 452
publication: Journal of Symbolic Logic
publication_identifier:
eissn:
- 1943-5886
issn:
- 0022-4812
publication_status: published
publisher: Cambridge University Press
publist_id: '7026'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Obligation blackwell games and p-automata
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2017'
...
---
_id: '6841'
abstract:
- lang: eng
text: In classical machine learning, regression is treated as a black box process
of identifying a suitable function from a hypothesis set without attempting to
gain insight into the mechanism connecting inputs and outputs. In the natural
sciences, however, finding an interpretable function for a phenomenon is the prime
goal as it allows to understand and generalize results. This paper proposes a
novel type of function learning network, called equation learner (EQL), that can
learn analytical expressions and is able to extrapolate to unseen domains. It
is implemented as an end-to-end differentiable feed-forward network and allows
for efficient gradient based training. Due to sparsity regularization concise
interpretable expressions can be obtained. Often the true underlying source expression
is identified.
arxiv: 1
author:
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Martius GS, Lampert C. Extrapolation and learning equations. In: 5th International
Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings.
International Conference on Learning Representations; 2017.'
apa: 'Martius, G. S., & Lampert, C. (2017). Extrapolation and learning equations.
In 5th International Conference on Learning Representations, ICLR 2017 - Workshop
Track Proceedings. Toulon, France: International Conference on Learning Representations.'
chicago: Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.”
In 5th International Conference on Learning Representations, ICLR 2017 - Workshop
Track Proceedings. International Conference on Learning Representations, 2017.
ieee: G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in 5th
International Conference on Learning Representations, ICLR 2017 - Workshop Track
Proceedings, Toulon, France, 2017.
ista: 'Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International
Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings.
ICLR: International Conference on Learning Representations.'
mla: Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.”
5th International Conference on Learning Representations, ICLR 2017 - Workshop
Track Proceedings, International Conference on Learning Representations, 2017.
short: G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations,
ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations,
2017.
conference:
end_date: 2017-04-26
location: Toulon, France
name: 'ICLR: International Conference on Learning Representations'
start_date: 2017-04-24
date_created: 2019-09-01T22:01:00Z
date_published: 2017-02-21T00:00:00Z
date_updated: 2021-01-12T08:09:17Z
day: '21'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1610.02995'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1610.02995
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: 5th International Conference on Learning Representations, ICLR 2017 -
Workshop Track Proceedings
publication_status: published
publisher: International Conference on Learning Representations
quality_controlled: '1'
scopus_import: 1
status: public
title: Extrapolation and learning equations
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '685'
abstract:
- lang: eng
text: By applying methods and principles from the physical sciences to biological
problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning
reveals elegant, simple explanations for seemingly complex processes. This has
had a profound influence on subsequent generations of developmental biologists.
We discuss how this influence can be traced through twentieth century morphologists,
embryologists and theoreticians to current research that explores the molecular
and cellular mechanisms of tissue growth and patterning, including our own studies
of the vertebrate neural tube.
author:
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
citation:
ama: Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s
“on growth and form.” Mechanisms of Development. 2017;145:26-31. doi:10.1016/j.mod.2017.03.005
apa: Briscoe, J., & Kicheva, A. (2017). The physics of development 100 years
after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development.
Elsevier. https://doi.org/10.1016/j.mod.2017.03.005
chicago: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years
after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development.
Elsevier, 2017. https://doi.org/10.1016/j.mod.2017.03.005.
ieee: J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy
Thompson’s ‘on growth and form,’” Mechanisms of Development, vol. 145.
Elsevier, pp. 26–31, 2017.
ista: Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy
Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31.
mla: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after
D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development, vol.
145, Elsevier, 2017, pp. 26–31, doi:10.1016/j.mod.2017.03.005.
short: J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31.
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:20Z
day: '01'
ddc:
- '571'
department:
- _id: AnKi
doi: 10.1016/j.mod.2017.03.005
ec_funded: 1
external_id:
pmid:
- '28366718'
file:
- access_level: open_access
checksum: 727043d2e4199fbef6b3704e6d1ac105
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T07:58:48Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6335'
file_name: 2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf
file_size: 652313
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 145'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 26 - 31
pmid: 1
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
publication: Mechanisms of Development
publication_identifier:
issn:
- '09254773'
publication_status: published
publisher: Elsevier
publist_id: '7025'
pubrep_id: '985'
quality_controlled: '1'
scopus_import: 1
status: public
title: The physics of development 100 years after D'Arcy Thompson's “on growth and
form”
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 145
year: '2017'
...
---
_id: '686'
abstract:
- lang: eng
text: Tissues are thought to behave like fluids with a given surface tension. Differences
in tissue surface tension (TST) have been proposed to trigger cell sorting and
tissue envelopment. D'Arcy Thompson in his seminal book ‘On Growth and Form’ has
introduced this concept of differential TST as a key physical mechanism dictating
tissue formation and organization within the developing organism. Over the past
century, many studies have picked up the concept of differential TST and analyzed
the role and cell biological basis of TST in development, underlining the importance
and influence of this concept in developmental biology.
author:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Heisenberg C-PJ. D’Arcy Thompson’s ‘on growth and form’: From soap bubbles
to tissue self organization. Mechanisms of Development. 2017;145:32-37.
doi:10.1016/j.mod.2017.03.006'
apa: 'Heisenberg, C.-P. J. (2017). D’Arcy Thompson’s ‘on growth and form’: From
soap bubbles to tissue self organization. Mechanisms of Development. Elsevier.
https://doi.org/10.1016/j.mod.2017.03.006'
chicago: 'Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From
Soap Bubbles to Tissue Self Organization.” Mechanisms of Development. Elsevier,
2017. https://doi.org/10.1016/j.mod.2017.03.006.'
ieee: 'C.-P. J. Heisenberg, “D’Arcy Thompson’s ‘on growth and form’: From soap bubbles
to tissue self organization,” Mechanisms of Development, vol. 145. Elsevier,
pp. 32–37, 2017.'
ista: 'Heisenberg C-PJ. 2017. D’Arcy Thompson’s ‘on growth and form’: From soap
bubbles to tissue self organization. Mechanisms of Development. 145, 32–37.'
mla: 'Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From
Soap Bubbles to Tissue Self Organization.” Mechanisms of Development, vol.
145, Elsevier, 2017, pp. 32–37, doi:10.1016/j.mod.2017.03.006.'
short: C.-P.J. Heisenberg, Mechanisms of Development 145 (2017) 32–37.
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:23Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.mod.2017.03.006
intvolume: ' 145'
language:
- iso: eng
month: '06'
oa_version: None
page: 32 - 37
publication: Mechanisms of Development
publication_identifier:
issn:
- '09254773'
publication_status: published
publisher: Elsevier
publist_id: '7024'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'D''Arcy Thompson''s ‘on growth and form’: From soap bubbles to tissue self
organization'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 145
year: '2017'
...
---
_id: '687'
abstract:
- lang: eng
text: Pursuing the similarity between the Kontsevich-Soibelman construction of the
cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of
canonical bases for quantum enveloping algebras, and the similarity between the
integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem
for quantum enveloping algebras, we build a coproduct on the CoHA associated to
a quiver with potential. We also prove a cohomological dimensional reduction theorem,
further linking a special class of CoHAs with Yangians, and explaining how to
connect the study of character varieties with the study of CoHAs.
author:
- first_name: Ben
full_name: Davison, Ben
id: 4634AB1E-F248-11E8-B48F-1D18A9856A87
last_name: Davison
orcid: 0000-0002-8944-4390
citation:
ama: Davison B. The critical CoHA of a quiver with potential. Quarterly Journal
of Mathematics. 2017;68(2):635-703. doi:10.1093/qmath/haw053
apa: Davison, B. (2017). The critical CoHA of a quiver with potential. Quarterly
Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qmath/haw053
chicago: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” Quarterly
Journal of Mathematics. Oxford University Press, 2017. https://doi.org/10.1093/qmath/haw053.
ieee: B. Davison, “The critical CoHA of a quiver with potential,” Quarterly Journal
of Mathematics, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017.
ista: Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal
of Mathematics. 68(2), 635–703.
mla: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” Quarterly
Journal of Mathematics, vol. 68, no. 2, Oxford University Press, 2017, pp.
635–703, doi:10.1093/qmath/haw053.
short: B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703.
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:24Z
day: '01'
department:
- _id: TaHa
doi: 10.1093/qmath/haw053
ec_funded: 1
intvolume: ' 68'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.7172
month: '06'
oa: 1
oa_version: Submitted Version
page: 635 - 703
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Quarterly Journal of Mathematics
publication_identifier:
issn:
- '00335606'
publication_status: published
publisher: Oxford University Press
publist_id: '7022'
quality_controlled: '1'
scopus_import: 1
status: public
title: The critical CoHA of a quiver with potential
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 68
year: '2017'
...
---
_id: '688'
abstract:
- lang: eng
text: 'We show that the framework of topological data analysis can be extended from
metrics to general Bregman divergences, widening the scope of possible applications.
Examples are the Kullback - Leibler divergence, which is commonly used for comparing
text and images, and the Itakura - Saito divergence, popular for speech and sound.
In particular, we prove that appropriately generalized čech and Delaunay (alpha)
complexes capture the correct homotopy type, namely that of the corresponding
union of Bregman balls. Consequently, their filtrations give the correct persistence
diagram, namely the one generated by the uniformly growing Bregman balls. Moreover,
we show that unlike the metric setting, the filtration of Vietoris-Rips complexes
may fail to approximate the persistence diagram. We propose algorithms to compute
the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally
test their efficiency. Lastly, we explain their surprisingly good performance
by making a connection with discrete Morse theory. '
alternative_title:
- LIPIcs
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: 'Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences.
In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916.
doi:10.4230/LIPIcs.SoCG.2017.39'
apa: 'Edelsbrunner, H., & Wagner, H. (2017). Topological data analysis with
Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational
Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2017.39'
chicago: Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with
Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.39.
ieee: H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,”
presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia,
2017, vol. 77, pp. 391–3916.
ista: Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences.
Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
mla: Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with
Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39.
short: H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, pp. 391–3916.
conference:
end_date: 2017-07-07
location: Brisbane, Australia
name: Symposium on Computational Geometry, SoCG
start_date: 2017-07-04
date_created: 2018-12-11T11:47:56Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:26Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: HeEd
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.39
file:
- access_level: open_access
checksum: 067ab0cb3f962bae6c3af6bf0094e0f3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:03Z
date_updated: 2020-07-14T12:47:42Z
file_id: '4856'
file_name: IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf
file_size: 990546
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 391-3916
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7021'
pubrep_id: '895'
quality_controlled: '1'
scopus_import: 1
status: public
title: Topological data analysis with Bregman divergences
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '689'
abstract:
- lang: eng
text: Rett syndrome modeling in monkey mirrors the human disorder.
article_number: eaan8196
author:
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Novarino G. Rett syndrome modeling goes simian. Science Translational Medicine.
2017;9(393). doi:10.1126/scitranslmed.aan8196
apa: Novarino, G. (2017). Rett syndrome modeling goes simian. Science Translational
Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aan8196
chicago: Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” Science Translational
Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aan8196.
ieee: G. Novarino, “Rett syndrome modeling goes simian,” Science Translational
Medicine, vol. 9, no. 393. American Association for the Advancement of Science,
2017.
ista: Novarino G. 2017. Rett syndrome modeling goes simian. Science Translational
Medicine. 9(393), eaan8196.
mla: Novarino, Gaia. “Rett Syndrome Modeling Goes Simian.” Science Translational
Medicine, vol. 9, no. 393, eaan8196, American Association for the Advancement
of Science, 2017, doi:10.1126/scitranslmed.aan8196.
short: G. Novarino, Science Translational Medicine 9 (2017).
date_created: 2018-12-11T11:47:56Z
date_published: 2017-06-07T00:00:00Z
date_updated: 2021-01-12T08:09:29Z
day: '07'
department:
- _id: GaNo
doi: 10.1126/scitranslmed.aan8196
intvolume: ' 9'
issue: '393'
language:
- iso: eng
month: '06'
oa_version: None
publication: Science Translational Medicine
publication_identifier:
issn:
- '19466234'
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7019'
quality_controlled: '1'
scopus_import: 1
status: public
title: Rett syndrome modeling goes simian
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2017'
...
---
_id: '1000'
abstract:
- lang: eng
text: 'We study probabilistic models of natural images and extend the autoregressive
family of PixelCNN models by incorporating latent variables. Subsequently, we
describe two new generative image models that exploit different image transformations
as latent variables: a quantized grayscale view of the image or a multi-resolution
image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN
models: 1) their tendency to focus on low-level image details, while largely ignoring
high-level image information, such as object shapes, and 2) their computationally
costly procedure for image sampling. We experimentally demonstrate benefits of
our LatentPixelCNN models, in particular showing that they produce much more realistically
looking image samples than previous state-of-the-art probabilistic models. '
acknowledgement: We thank Tim Salimans for spotting a mistake in our preliminary arXiv
manuscript. This work was funded by the European Research Council under the European
Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural
image modeling. In: 34th International Conference on Machine Learning.
Vol 70. JMLR; 2017:1905-1914.'
apa: 'Kolesnikov, A., & Lampert, C. (2017). PixelCNN models with auxiliary variables
for natural image modeling. In 34th International Conference on Machine Learning
(Vol. 70, pp. 1905–1914). Sydney, Australia: JMLR.'
chicago: Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary
Variables for Natural Image Modeling.” In 34th International Conference on
Machine Learning, 70:1905–14. JMLR, 2017.
ieee: A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for
natural image modeling,” in 34th International Conference on Machine Learning,
Sydney, Australia, 2017, vol. 70, pp. 1905–1914.
ista: 'Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for
natural image modeling. 34th International Conference on Machine Learning. ICML:
International Conference on Machine Learning vol. 70, 1905–1914.'
mla: Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary
Variables for Natural Image Modeling.” 34th International Conference on Machine
Learning, vol. 70, JMLR, 2017, pp. 1905–14.
short: A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine
Learning, JMLR, 2017, pp. 1905–1914.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
date_created: 2018-12-11T11:49:37Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2023-09-22T09:50:41Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1612.08185'
isi:
- '000683309501102'
has_accepted_license: '1'
intvolume: ' 70'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.08185
month: '08'
oa: 1
oa_version: Submitted Version
page: 1905 - 1914
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: 34th International Conference on Machine Learning
publication_identifier:
isbn:
- 978-151085514-4
publication_status: published
publisher: JMLR
publist_id: '6398'
quality_controlled: '1'
scopus_import: '1'
status: public
title: PixelCNN models with auxiliary variables for natural image modeling
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 70
year: '2017'
...
---
_id: '1001'
abstract:
- lang: eng
text: We present a computational approach for designing CurveUps, curvy shells that
form from an initially flat state. They consist of small rigid tiles that are
tightly held together by two pre-stretched elastic sheets attached to them. Our
method allows the realization of smooth, doubly curved surfaces that can be fabricated
as a flat piece. Once released, the restoring forces of the pre-stretched sheets
support the object to take shape in 3D. CurveUps are structurally stable in their
target configuration. The design process starts with a target surface. Our method
generates a tile layout in 2D and optimizes the distribution, shape, and attachment
areas of the tiles to obtain a configuration that is fabricable and in which the
curved up state closely matches the target. Our approach is based on an efficient
approximate model and a local optimization strategy for an otherwise intractable
nonlinear optimization problem. We demonstrate the effectiveness of our approach
for a wide range of shapes, all realized as physical prototypes.
alternative_title:
- ACM Transactions on Graphics
article_number: '64'
article_processing_charge: No
author:
- first_name: Ruslan
full_name: Guseinov, Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
- first_name: Eder
full_name: Miguel, Eder
last_name: Miguel
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Guseinov R, Miguel E, Bickel B. CurveUps: Shaping objects from flat plates
with tension-actuated curvature. In: Vol 36. ACM; 2017. doi:10.1145/3072959.3073709'
apa: 'Guseinov, R., Miguel, E., & Bickel, B. (2017). CurveUps: Shaping objects
from flat plates with tension-actuated curvature (Vol. 36). Presented at the SIGGRAPH:
Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles,
CA, United States: ACM. https://doi.org/10.1145/3072959.3073709'
chicago: 'Guseinov, Ruslan, Eder Miguel, and Bernd Bickel. “CurveUps: Shaping Objects
from Flat Plates with Tension-Actuated Curvature,” Vol. 36. ACM, 2017. https://doi.org/10.1145/3072959.3073709.'
ieee: 'R. Guseinov, E. Miguel, and B. Bickel, “CurveUps: Shaping objects from flat
plates with tension-actuated curvature,” presented at the SIGGRAPH: Special Interest
Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United
States, 2017, vol. 36, no. 4.'
ista: 'Guseinov R, Miguel E, Bickel B. 2017. CurveUps: Shaping objects from flat
plates with tension-actuated curvature. SIGGRAPH: Special Interest Group on Computer
Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 64.'
mla: 'Guseinov, Ruslan, et al. CurveUps: Shaping Objects from Flat Plates with
Tension-Actuated Curvature. Vol. 36, no. 4, 64, ACM, 2017, doi:10.1145/3072959.3073709.'
short: R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017.
conference:
end_date: 2017-08-25
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2017-08-19
date_created: 2018-12-11T11:49:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-22T09:49:58Z
day: '01'
ddc:
- '003'
- '004'
department:
- _id: BeBi
doi: 10.1145/3072959.3073709
ec_funded: 1
external_id:
isi:
- '000406432100032'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:24Z
date_updated: 2018-12-12T10:10:24Z
file_id: '4811'
file_name: IST-2018-1053-v1+1_CurveUp.pdf
file_size: 36159696
relation: main_file
file_date_updated: 2018-12-12T10:10:24Z
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '4'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
project:
- _id: 25082902-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '645599'
name: Soft-bodied intelligence for Manipulation
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_status: published
publisher: ACM
publist_id: '6397'
pubrep_id: '1053'
quality_controlled: '1'
related_material:
record:
- id: '8366'
relation: dissertation_contains
status: public
status: public
title: 'CurveUps: Shaping objects from flat plates with tension-actuated curvature'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 36
year: '2017'
...
---
_id: '1002'
abstract:
- lang: eng
text: " We present an interactive design system to create functional mechanical
\ objects. Our computational approach allows novice users to retarget an existing
mechanical template to a user-specified input shape. Our proposed representation
for a mechanical template encodes a parameterized mechanism, mechanical constraints
that ensure a physically valid configuration, spatial relationships of mechanical
parts to the user-provided shape, and functional constraints that specify an intended
functionality. We provide an intuitive interface and optimization-in-the-loop
approach for finding a valid configuration of the mechanism and the shape to
ensure that higher-level functional goals are met. Our algorithm interactively
optimizes the mechanism while the user manipulates the placement of mechanical
components and the shape. Our system allows users to efficiently explore various
design choices and to synthesize customized mechanical objects that can be fabricated
with rapid prototyping technologies. We demonstrate the efficacy of our approach
by retargeting various mechanical templates to different shapes and fabricating
the resulting functional mechanical objects.\r\n"
alternative_title:
- ACM Transactions on Graphics
article_number: '81'
article_processing_charge: No
author:
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Duygu
full_name: Ceylan, Duygu
last_name: Ceylan
- first_name: Wilmot
full_name: Li, Wilmot
last_name: Li
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. Functionality-aware retargeting
of mechanisms to 3D shapes. In: Vol 36. ACM; 2017. doi:10.1145/3072959.3073710'
apa: 'Zhang, R., Auzinger, T., Ceylan, D., Li, W., & Bickel, B. (2017). Functionality-aware
retargeting of mechanisms to 3D shapes (Vol. 36). Presented at the SIGGRAPH: Computer
Graphics and Interactive Techniques, Los Angeles, CA, United States : ACM. https://doi.org/10.1145/3072959.3073710'
chicago: Zhang, Ran, Thomas Auzinger, Duygu Ceylan, Wilmot Li, and Bernd Bickel.
“Functionality-Aware Retargeting of Mechanisms to 3D Shapes,” Vol. 36. ACM, 2017.
https://doi.org/10.1145/3072959.3073710.
ieee: 'R. Zhang, T. Auzinger, D. Ceylan, W. Li, and B. Bickel, “Functionality-aware
retargeting of mechanisms to 3D shapes,” presented at the SIGGRAPH: Computer Graphics
and Interactive Techniques, Los Angeles, CA, United States , 2017, vol. 36, no.
4.'
ista: 'Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. 2017. Functionality-aware
retargeting of mechanisms to 3D shapes. SIGGRAPH: Computer Graphics and Interactive
Techniques, ACM Transactions on Graphics, vol. 36, 81.'
mla: Zhang, Ran, et al. Functionality-Aware Retargeting of Mechanisms to 3D Shapes.
Vol. 36, no. 4, 81, ACM, 2017, doi:10.1145/3072959.3073710.
short: R. Zhang, T. Auzinger, D. Ceylan, W. Li, B. Bickel, in:, ACM, 2017.
conference:
end_date: 2017-08-03
location: 'Los Angeles, CA, United States '
name: 'SIGGRAPH: Computer Graphics and Interactive Techniques'
start_date: 2017-07-30
date_created: 2018-12-11T11:49:38Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-22T09:49:31Z
day: '01'
ddc:
- '003'
- '004'
department:
- _id: BeBi
doi: 10.1145/3072959.3073710
ec_funded: 1
external_id:
isi:
- '000406432100049'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:05Z
date_updated: 2018-12-12T10:09:05Z
file_id: '4728'
file_name: IST-2018-1050-v1+1_MechRet.pdf
file_size: 25463895
relation: main_file
file_date_updated: 2018-12-12T10:09:05Z
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_identifier:
issn:
- '07300301'
publication_status: published
publisher: ACM
publist_id: '6396'
pubrep_id: '1050'
quality_controlled: '1'
related_material:
record:
- id: '8386'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Functionality-aware retargeting of mechanisms to 3D shapes
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 36
year: '2017'
...
---
_id: '1003'
abstract:
- lang: eng
text: Network games (NGs) are played on directed graphs and are extensively used
in network design and analysis. Search problems for NGs include finding special
strategy profiles such as a Nash equilibrium and a globally optimal solution.
The networks modeled by NGs may be huge. In formal verification, abstraction has
proven to be an extremely effective technique for reasoning about systems with
big and even infinite state spaces. We describe an abstraction-refinement methodology
for reasoning about NGs. Our methodology is based on an abstraction function that
maps the state space of an NG to a much smaller state space. We search for a global
optimum and a Nash equilibrium by reasoning on an under- and an overapproximation
defined on top of this smaller state space. When the approximations are too coarse
to find such profiles, we refine the abstraction function. Our experimental results
demonstrate the efficiency of the methodology.
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning
about network games. In: AAAI Press; 2017:70-76. doi:10.24963/ijcai.2017/11'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2017). An abstraction-refinement
methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI:
International Joint Conference on Artificial Intelligence , Melbourne, Australia:
AAAI Press. https://doi.org/10.24963/ijcai.2017/11'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement
Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. https://doi.org/10.24963/ijcai.2017/11.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology
for reasoning about network games,” presented at the IJCAI: International Joint
Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.'
ista: 'Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology
for reasoning about network games. IJCAI: International Joint Conference on Artificial
Intelligence , 70–76.'
mla: Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about
Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.
short: G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.
conference:
end_date: 2017-08-25
location: Melbourne, Australia
name: 'IJCAI: International Joint Conference on Artificial Intelligence '
start_date: 2017-08-19
date_created: 2018-12-11T11:49:38Z
date_published: 2017-05-30T00:00:00Z
date_updated: 2023-09-22T09:49:00Z
day: '30'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.24963/ijcai.2017/11
external_id:
isi:
- '000764137500011'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:58Z
date_updated: 2018-12-12T10:16:58Z
file_id: '5249'
file_name: IST-2017-818-v1+1_allIJCAI_CR.pdf
file_size: 365172
relation: main_file
file_date_updated: 2018-12-12T10:16:58Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 70 - 76
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
issn:
- '10450823'
publication_status: published
publisher: AAAI Press
publist_id: '6395'
pubrep_id: '818'
quality_controlled: '1'
related_material:
record:
- id: '6006'
relation: later_version
status: public
scopus_import: '1'
status: public
title: An abstraction-refinement methodology for reasoning about network games
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '1004'
abstract:
- lang: eng
text: The fundamental tasks of the root system are, besides anchoring, mediating
interactions between plant and soil and providing the plant with water and nutrients.
The architecture of the root system is controlled by endogenous mechanisms that
constantly integrate environmental signals, such as availability of nutrients
and water. Extremely important for efficient soil exploitation and survival under
less favorable conditions is the developmental flexibility of the root system
that is largely determined by its postembryonic branching capacity. Modulation
of initiation and outgrowth of lateral roots provides roots with an exceptional
plasticity, allows optimal adjustment to underground heterogeneity, and enables
effective soil exploitation and use of resources. Here we discuss recent advances
in understanding the molecular mechanisms that shape the plant root system and
integrate external cues to adapt to the changing environment.
article_processing_charge: No
author:
- first_name: Krisztina
full_name: Ötvös, Krisztina
id: 29B901B0-F248-11E8-B48F-1D18A9856A87
last_name: Ötvös
orcid: 0000-0002-5503-4983
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Ötvös K, Benková E. Spatiotemporal mechanisms of root branching. Current
Opinion in Genetics & Development. 2017;45:82-89. doi:10.1016/j.gde.2017.03.010
apa: Ötvös, K., & Benková, E. (2017). Spatiotemporal mechanisms of root branching.
Current Opinion in Genetics & Development. Elsevier. https://doi.org/10.1016/j.gde.2017.03.010
chicago: Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.”
Current Opinion in Genetics & Development. Elsevier, 2017. https://doi.org/10.1016/j.gde.2017.03.010.
ieee: K. Ötvös and E. Benková, “Spatiotemporal mechanisms of root branching,” Current
Opinion in Genetics & Development, vol. 45. Elsevier, pp. 82–89, 2017.
ista: Ötvös K, Benková E. 2017. Spatiotemporal mechanisms of root branching. Current
Opinion in Genetics & Development. 45, 82–89.
mla: Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.”
Current Opinion in Genetics & Development, vol. 45, Elsevier, 2017,
pp. 82–89, doi:10.1016/j.gde.2017.03.010.
short: K. Ötvös, E. Benková, Current Opinion in Genetics & Development 45 (2017)
82–89.
date_created: 2018-12-11T11:49:38Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2023-09-22T09:48:15Z
day: '01'
ddc:
- '575'
department:
- _id: EvBe
doi: 10.1016/j.gde.2017.03.010
external_id:
isi:
- '000404880400013'
pmid:
- '28391060'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T08:00:36Z
date_updated: 2019-04-17T08:00:36Z
file_id: '6336'
file_name: Otvos_Benkova_CurOpDevBiol_2017.pdf
file_size: 364133
relation: main_file
success: 1
file_date_updated: 2019-04-17T08:00:36Z
has_accepted_license: '1'
intvolume: ' 45'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Submitted Version
page: 82 - 89
pmid: 1
project:
- _id: 2542D156-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 1774-B16
name: Hormone cross-talk drives nutrient dependent plant development
publication: Current Opinion in Genetics & Development
publication_identifier:
issn:
- 0959437X
publication_status: published
publisher: Elsevier
publist_id: '6394'
pubrep_id: '1017'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spatiotemporal mechanisms of root branching
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 45
year: '2017'
...
---
_id: '1006'
abstract:
- lang: eng
text: 'Background: The phenomenon of immune priming, i.e. enhanced protection following
a secondary exposure to a pathogen, has now been demonstrated in a wide range
of invertebrate species. Despite accumulating phenotypic evidence, knowledge of
its mechanistic underpinnings is currently very limited. Here we used the system
of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus
thuringiensis (Bt) to further our molecular understanding of the oral immune priming
phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants)
of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon
later challenge exposure, using a whole-transcriptome sequencing approach. Results:
Whereas gene expression of individuals primed with the orally non-pathogenic strain
showed minor changes to controls, we found that priming with the pathogenic strain
induced regulation of a large set of distinct genes, many of which are known immune
candidates. Intriguingly, the immune repertoire activated upon priming and subsequent
challenge qualitatively differed from the one mounted upon infection with Bt without
previous priming. Moreover, a large subset of priming-specific genes showed an
inverse regulation compared to their regulation upon challenge only. Conclusions:
Our data demonstrate that gene expression upon infection is strongly affected
by previous immune priming. We hypothesise that this shift in gene expression
indicates activation of a more targeted and efficient response towards a previously
encountered pathogen, in anticipation of potential secondary encounter.'
article_processing_charge: No
author:
- first_name: Jenny
full_name: Greenwood, Jenny
last_name: Greenwood
- first_name: Barbara
full_name: Milutinovic, Barbara
id: 2CDC32B8-F248-11E8-B48F-1D18A9856A87
last_name: Milutinovic
orcid: 0000-0002-8214-4758
- first_name: Robert
full_name: Peuß, Robert
last_name: Peuß
- first_name: Sarah
full_name: Behrens, Sarah
last_name: Behrens
- first_name: Daniela
full_name: Essar, Daniela
last_name: Essar
- first_name: Philip
full_name: Rosenstiel, Philip
last_name: Rosenstiel
- first_name: Hinrich
full_name: Schulenburg, Hinrich
last_name: Schulenburg
- first_name: Joachim
full_name: Kurtz, Joachim
last_name: Kurtz
citation:
ama: Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus
thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae.
BMC Genomics. 2017;18(1):329. doi:10.1186/s12864-017-3705-7
apa: Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel,
P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces
a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics.
BioMed Central. https://doi.org/10.1186/s12864-017-3705-7
chicago: Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela
Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune
Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of
Tribolium Castaneum Larvae.” BMC Genomics. BioMed Central, 2017. https://doi.org/10.1186/s12864-017-3705-7.
ieee: J. Greenwood et al., “Oral immune priming with Bacillus thuringiensis
induces a shift in the gene expression of Tribolium castaneum larvae,” BMC
Genomics, vol. 18, no. 1. BioMed Central, p. 329, 2017.
ista: Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg
H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift
in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.
mla: Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces
a Shift in the Gene Expression of Tribolium Castaneum Larvae.” BMC Genomics,
vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:10.1186/s12864-017-3705-7.
short: J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel,
H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.
date_created: 2018-12-11T11:49:39Z
date_published: 2017-04-26T00:00:00Z
date_updated: 2023-09-22T09:47:44Z
day: '26'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1186/s12864-017-3705-7
external_id:
isi:
- '000400625200004'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:46Z
date_updated: 2018-12-12T10:16:46Z
file_id: '5236'
file_name: IST-2017-814-v1+1_s12864-017-3705-7.pdf
file_size: 2379672
relation: main_file
file_date_updated: 2018-12-12T10:16:46Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '329'
publication: BMC Genomics
publication_identifier:
issn:
- '14712164'
publication_status: published
publisher: BioMed Central
publist_id: '6392'
pubrep_id: '814'
quality_controlled: '1'
related_material:
record:
- id: '9859'
relation: research_data
status: public
- id: '9860'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Oral immune priming with Bacillus thuringiensis induces a shift in the gene
expression of Tribolium castaneum larvae
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 18
year: '2017'
...
---
_id: '1007'
abstract:
- lang: eng
text: 'A nonlinear system possesses an invariance with respect to a set of transformations
if its output dynamics remain invariant when transforming the input, and adjusting
the initial condition accordingly. Most research has focused on invariances with
respect to time-independent pointwise transformations like translational-invariance
(u(t) -> u(t) + p, p in R) or scale-invariance (u(t) -> pu(t), p in R>0).
In this article, we introduce the concept of s0-invariances with respect to continuous
input transformations exponentially growing/decaying over time. We show that s0-invariant
systems not only encompass linear time-invariant (LTI) systems with transfer functions
having an irreducible zero at s0 in R, but also that the input/output relationship
of nonlinear s0-invariant systems possesses properties well known from their linear
counterparts. Furthermore, we extend the concept of s0-invariances to second-
and higher-order s0-invariances, corresponding to invariances with respect to
transformations of the time-derivatives of the input, and encompassing LTI systems
with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant
systems realize – under mild conditions – nth-order nonlinear differential operators:
when excited by an input of a characteristic functional form, the system’s output
converges to a constant value only depending on the nth (nonlinear) derivative
of the input.'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Eduardo
full_name: Sontag, Eduardo
last_name: Sontag
citation:
ama: Lang M, Sontag E. Zeros of nonlinear systems with input invariances. Automatica.
2017;81C:46-55. doi:10.1016/j.automatica.2017.03.030
apa: Lang, M., & Sontag, E. (2017). Zeros of nonlinear systems with input invariances.
Automatica. International Federation of Automatic Control. https://doi.org/10.1016/j.automatica.2017.03.030
chicago: Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input
Invariances.” Automatica. International Federation of Automatic Control,
2017. https://doi.org/10.1016/j.automatica.2017.03.030.
ieee: M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,”
Automatica, vol. 81C. International Federation of Automatic Control, pp.
46–55, 2017.
ista: Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances.
Automatica. 81C, 46–55.
mla: Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.”
Automatica, vol. 81C, International Federation of Automatic Control, 2017,
pp. 46–55, doi:10.1016/j.automatica.2017.03.030.
short: M. Lang, E. Sontag, Automatica 81C (2017) 46–55.
date_created: 2018-12-11T11:49:39Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-10-17T08:51:18Z
day: '01'
ddc:
- '000'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1016/j.automatica.2017.03.030
ec_funded: 1
external_id:
isi:
- '000403513900006'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:29Z
date_updated: 2018-12-12T10:11:29Z
file_id: '4884'
file_name: IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf
file_size: 1401954
relation: main_file
file_date_updated: 2018-12-12T10:11:29Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 46 - 55
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Automatica
publication_identifier:
issn:
- 0005-1098
publication_status: published
publisher: International Federation of Automatic Control
publist_id: '6391'
pubrep_id: '813'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zeros of nonlinear systems with input invariances
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 81C
year: '2017'
...
---
_id: '1009'
abstract:
- lang: eng
text: A standard objective in partially-observable Markov decision processes (POMDPs)
is to find a policy that maximizes the expected discounted-sum payoff. However,
such policies may still permit unlikely but highly undesirable outcomes, which
is problematic especially in safety-critical applications. Recently, there has
been a surge of interest in POMDPs where the goal is to maximize the probability
to ensure that the payoff is at least a given threshold, but these approaches
do not consider any optimization beyond satisfying this threshold constraint.
In this work we go beyond both the “expectation” and “threshold” approaches and
consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we
are given a threshold t and the objective is to find a policy σ such that a) each
possible outcome of σ yields a discounted-sum payoff of at least t, and b) the
expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies
satisfying a). We present a practical approach to tackle the GPO problem and evaluate
it on standard POMDP benchmarks.
acknowledgement: 'he research leading to these results was supported by the Austrian
Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants
(279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund
(WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions)
of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant
agreement no. [291734].'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Guillermo
full_name: Pérez, Guillermo
last_name: Pérez
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
- first_name: Djordje
full_name: Zikelic, Djordje
last_name: Zikelic
citation:
ama: 'Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation
with guarantees in POMDPs. In: Proceedings of the 31st AAAI Conference on Artificial
Intelligence. Vol 5. AAAI Press; 2017:3725-3732.'
apa: 'Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., & Zikelic, D. (2017).
Optimizing expectation with guarantees in POMDPs. In Proceedings of the 31st
AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3725–3732). San Francisco,
CA, United States: AAAI Press.'
chicago: Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and
Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings
of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press,
2017.
ieee: K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing
expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference
on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5,
pp. 3725–3732.
ista: 'Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation
with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial
Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.'
mla: Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.”
Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol.
5, AAAI Press, 2017, pp. 3725–32.
short: K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings
of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp.
3725–3732.
conference:
end_date: 2017-02-10
location: San Francisco, CA, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2017-02-04
date_created: 2018-12-11T11:49:40Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-06-02T08:53:49Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
isi:
- '000485630703107'
intvolume: ' 5'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092
month: '01'
oa: 1
oa_version: Submitted Version
page: 3725 - 3732
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the 31st AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '6387'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimizing expectation with guarantees in POMDPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 5
year: '2017'
...
---
_id: '1010'
abstract:
- lang: eng
text: 'We prove a local law in the bulk of the spectrum for random Gram matrices
XX∗, a generalization of sample covariance matrices, where X is a large matrix
with independent, centered entries with arbitrary variances. The limiting eigenvalue
density that generalizes the Marchenko-Pastur law is determined by solving a system
of nonlinear equations. Our entrywise and averaged local laws are on the optimal
scale with the optimal error bounds. They hold both in the square case (hard edge)
and in the properly rectangular case (soft edge). In the latter case we also establish
a macroscopic gap away from zero in the spectrum of XX∗. '
article_number: '25'
article_processing_charge: No
arxiv: 1
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Alt J, Erdös L, Krüger TH. Local law for random Gram matrices. Electronic
Journal of Probability. 2017;22. doi:10.1214/17-EJP42
apa: Alt, J., Erdös, L., & Krüger, T. H. (2017). Local law for random Gram matrices.
Electronic Journal of Probability. Institute of Mathematical Statistics.
https://doi.org/10.1214/17-EJP42
chicago: Alt, Johannes, László Erdös, and Torben H Krüger. “Local Law for Random
Gram Matrices.” Electronic Journal of Probability. Institute of Mathematical
Statistics, 2017. https://doi.org/10.1214/17-EJP42.
ieee: J. Alt, L. Erdös, and T. H. Krüger, “Local law for random Gram matrices,”
Electronic Journal of Probability, vol. 22. Institute of Mathematical Statistics,
2017.
ista: Alt J, Erdös L, Krüger TH. 2017. Local law for random Gram matrices. Electronic
Journal of Probability. 22, 25.
mla: Alt, Johannes, et al. “Local Law for Random Gram Matrices.” Electronic Journal
of Probability, vol. 22, 25, Institute of Mathematical Statistics, 2017, doi:10.1214/17-EJP42.
short: J. Alt, L. Erdös, T.H. Krüger, Electronic Journal of Probability 22 (2017).
date_created: 2018-12-11T11:49:40Z
date_published: 2017-03-08T00:00:00Z
date_updated: 2023-09-22T09:45:23Z
day: '08'
ddc:
- '510'
- '539'
department:
- _id: LaEr
doi: 10.1214/17-EJP42
ec_funded: 1
external_id:
arxiv:
- '1606.07353'
isi:
- '000396611900025'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:39Z
date_updated: 2018-12-12T10:13:39Z
file_id: '5024'
file_name: IST-2017-807-v1+1_euclid.ejp.1488942016.pdf
file_size: 639384
relation: main_file
file_date_updated: 2018-12-12T10:13:39Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Journal of Probability
publication_identifier:
issn:
- '10836489'
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '6386'
pubrep_id: '807'
quality_controlled: '1'
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Local law for random Gram matrices
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: 22
year: '2017'
...
---
_id: '1011'
abstract:
- lang: eng
text: Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly
equivalent, are standard models for interprocedural analysis. Yet RSMs are more
convenient as they (a) explicitly model function calls and returns, and (b) specify
many natural parameters for algorithmic analysis, e.g., the number of entries
and exits. We consider a general framework where RSM transitions are labeled from
a semiring and path properties are algebraic with semiring operations, which can
model, e.g., interprocedural reachability and dataflow analysis problems. Our
main contributions are new algorithms for several fundamental problems. As compared
to a direct translation of RSMs to PDSs and the best-known existing bounds of
PDSs, our analysis algorithm improves the complexity for finite-height semirings
(that subsumes reachability and standard dataflow properties). We further consider
the problem of extracting distance values from the representation structures computed
by our algorithm, and give efficient algorithms that distinguish the complexity
of a one-time preprocessing from the complexity of each individual query. Another
advantage of our algorithm is that our improvements carry over to the concurrent
setting, where we improve the bestknown complexity for the context-bounded analysis
of concurrent RSMs. Finally, we provide a prototype implementation that gives
a significant speed-up on several benchmarks from the SLAM/SDV project.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Samarth
full_name: Mishra, Samarth
last_name: Mishra
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted
recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:10.1007/978-3-662-54434-1_11'
apa: 'Chatterjee, K., Kragl, B., Mishra, S., & Pavlogiannis, A. (2017). Faster
algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201,
pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala,
Sweden: Springer. https://doi.org/10.1007/978-3-662-54434-1_11'
chicago: Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis.
“Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok
Yang, 10201:287–313. Springer, 2017. https://doi.org/10.1007/978-3-662-54434-1_11.
ieee: 'K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms
for weighted recursive state machines,” presented at the ESOP: European Symposium
on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.'
ista: 'Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms
for weighted recursive state machines. ESOP: European Symposium on Programming,
LNCS, vol. 10201, 287–313.'
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive
State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313,
doi:10.1007/978-3-662-54434-1_11.
short: K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.),
Springer, 2017, pp. 287–313.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'ESOP: European Symposium on Programming'
start_date: 2017-04-22
date_created: 2018-12-11T11:49:41Z
date_published: 2017-03-19T00:00:00Z
date_updated: 2023-09-22T09:44:50Z
day: '19'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-662-54434-1_11
ec_funded: 1
editor:
- first_name: Hongseok
full_name: Yang, Hongseok
last_name: Yang
external_id:
isi:
- '000681702400011'
intvolume: ' 10201'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.04914
month: '03'
oa: 1
oa_version: Submitted Version
page: 287 - 313
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- '03029743'
publication_status: published
publisher: Springer
publist_id: '6384'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for weighted recursive state machines
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10201
year: '2017'
...
---
_id: '10126'
article_number: 391a
article_processing_charge: No
article_type: letter_note
author:
- first_name: Afshin
full_name: Vahid Belarghou, Afshin
last_name: Vahid Belarghou
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Timon
full_name: Idema, Timon
last_name: Idema
citation:
ama: Vahid Belarghou A, Šarić A, Idema T. Curvature mediated interactions in highly
curved membranes. Biophysical Journal. 2017;112(3). doi:10.1016/j.bpj.2016.11.2123
apa: Vahid Belarghou, A., Šarić, A., & Idema, T. (2017). Curvature mediated
interactions in highly curved membranes. Biophysical Journal. Elsevier
. https://doi.org/10.1016/j.bpj.2016.11.2123
chicago: Vahid Belarghou, Afshin, Anđela Šarić, and Timon Idema. “Curvature Mediated
Interactions in Highly Curved Membranes.” Biophysical Journal. Elsevier
, 2017. https://doi.org/10.1016/j.bpj.2016.11.2123.
ieee: A. Vahid Belarghou, A. Šarić, and T. Idema, “Curvature mediated interactions
in highly curved membranes,” Biophysical Journal, vol. 112, no. 3. Elsevier
, 2017.
ista: Vahid Belarghou A, Šarić A, Idema T. 2017. Curvature mediated interactions
in highly curved membranes. Biophysical Journal. 112(3), 391a.
mla: Vahid Belarghou, Afshin, et al. “Curvature Mediated Interactions in Highly
Curved Membranes.” Biophysical Journal, vol. 112, no. 3, 391a, Elsevier
, 2017, doi:10.1016/j.bpj.2016.11.2123.
short: A. Vahid Belarghou, A. Šarić, T. Idema, Biophysical Journal 112 (2017).
date_created: 2021-10-12T07:47:55Z
date_published: 2017-02-03T00:00:00Z
date_updated: 2021-11-03T10:02:45Z
day: '03'
doi: 10.1016/j.bpj.2016.11.2123
extern: '1'
intvolume: ' 112'
issue: '3'
keyword:
- biophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.cell.com/biophysj/fulltext/S0006-3495(16)33153-8
month: '02'
oa: 1
oa_version: Published Version
publication: Biophysical Journal
publication_identifier:
issn:
- 0006-3495
publication_status: published
publisher: 'Elsevier '
quality_controlled: '1'
status: public
title: Curvature mediated interactions in highly curved membranes
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 112
year: '2017'
...
---
_id: '1013'
abstract:
- lang: eng
text: From microwave ovens to satellite television to the GPS and data services
on our mobile phones, microwave technology is everywhere today. But one technology
that has so far failed to prove its worth in this wavelength regime is quantum
communication that uses the states of single photons as information carriers.
This is because single microwave photons, as opposed to classical microwave signals,
are extremely vulnerable to noise from thermal excitations in the channels through
which they travel. Two new independent studies, one by Ze-Liang Xiang at Technische
Universität Wien (Vienna), Austria, and colleagues [1] and another by Benoît Vermersch
at the University of Innsbruck, also in Austria, and colleagues [2] now describe
a theoretical protocol for microwave quantum communication that is resilient to
thermal and other types of noise. Their approach could become a powerful technique
to establish fast links between superconducting data processors in a future all-microwave
quantum network.
article_processing_charge: No
article_type: review
author:
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Fink JM. Viewpoint: Microwave quantum states beat the heat. Physics.
2017;10(32). doi:10.1103/Physics.10.32'
apa: 'Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. Physics.
American Physical Society. https://doi.org/10.1103/Physics.10.32'
chicago: 'Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.”
Physics. American Physical Society, 2017. https://doi.org/10.1103/Physics.10.32.'
ieee: 'J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” Physics,
vol. 10, no. 32. American Physical Society, 2017.'
ista: 'Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics.
10(32).'
mla: 'Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” Physics,
vol. 10, no. 32, American Physical Society, 2017, doi:10.1103/Physics.10.32.'
short: J.M. Fink, Physics 10 (2017).
date_created: 2018-12-11T11:49:41Z
date_published: 2017-03-27T00:00:00Z
date_updated: 2022-06-07T10:58:31Z
day: '27'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.1103/Physics.10.32
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T11:38:14Z
date_updated: 2019-10-24T11:38:14Z
file_id: '6968'
file_name: 2017_Physics_Fink.pdf
file_size: 193622
relation: main_file
success: 1
file_date_updated: 2019-10-24T11:38:14Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '32'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Physics
publication_status: published
publisher: American Physical Society
publist_id: '6382'
quality_controlled: '1'
status: public
title: 'Viewpoint: Microwave quantum states beat the heat'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2017'
...