---
_id: '659'
abstract:
- lang: eng
text: Migration frequently involves Rac-mediated protrusion of lamellipodia, formed
by Arp2/3 complex-dependent branching thought to be crucial for force generation
and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors
targeting to the lamellipodium tip and shown here to nucleate and elongate actin
filaments with complementary activities in vitro. In migrating B16-F1 melanoma
cells, both formins contribute to the velocity of lamellipodium protrusion. Loss
of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width,
actin filament density and -bundling, without changing patterns of Arp2/3 complex
incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost
completely abolishes protrusion forces exerted by lamellipodia and modifies their
ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3
in fibroblasts reduces both migration and capability of cells to move against
viscous media. Together, we conclude that force generation in lamellipodia strongly
depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent
filament branching.
article_number: '14832'
article_processing_charge: No
author:
- first_name: Frieda
full_name: Kage, Frieda
last_name: Kage
- first_name: Moritz
full_name: Winterhoff, Moritz
last_name: Winterhoff
- first_name: Vanessa
full_name: Dimchev, Vanessa
last_name: Dimchev
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Tobias
full_name: Thalheim, Tobias
last_name: Thalheim
- first_name: Anika
full_name: Freise, Anika
last_name: Freise
- first_name: Stefan
full_name: Brühmann, Stefan
last_name: Brühmann
- first_name: Jana
full_name: Kollasser, Jana
last_name: Kollasser
- first_name: Jennifer
full_name: Block, Jennifer
last_name: Block
- first_name: Georgi A
full_name: Dimchev, Georgi A
last_name: Dimchev
- first_name: Matthias
full_name: Geyer, Matthias
last_name: Geyer
- first_name: Hams
full_name: Schnittler, Hams
last_name: Schnittler
- first_name: Cord
full_name: Brakebusch, Cord
last_name: Brakebusch
- first_name: Theresia
full_name: Stradal, Theresia
last_name: Stradal
- first_name: Marie
full_name: Carlier, Marie
last_name: Carlier
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Josef
full_name: Käs, Josef
last_name: Käs
- first_name: Jan
full_name: Faix, Jan
last_name: Faix
- first_name: Klemens
full_name: Rottner, Klemens
last_name: Rottner
citation:
ama: Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force
generation. Nature Communications. 2017;8. doi:10.1038/ncomms14832
apa: Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A.,
… Rottner, K. (2017). FMNL formins boost lamellipodial force generation. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14832
chicago: Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim,
Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force
Generation.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14832.
ieee: F. Kage et al., “FMNL formins boost lamellipodial force generation,”
Nature Communications, vol. 8. Nature Publishing Group, 2017.
ista: Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann
S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal
T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial
force generation. Nature Communications. 8, 14832.
mla: Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature
Communications, vol. 8, 14832, Nature Publishing Group, 2017, doi:10.1038/ncomms14832.
short: F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S.
Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch,
T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications
8 (2017).
date_created: 2018-12-11T11:47:46Z
date_published: 2017-03-22T00:00:00Z
date_updated: 2021-01-12T08:08:06Z
day: '22'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1038/ncomms14832
file:
- access_level: open_access
checksum: dae30190291c3630e8102d8714a8d23e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:21Z
date_updated: 2020-07-14T12:47:34Z
file_id: '5072'
file_name: IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf
file_size: 9523746
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7075'
pubrep_id: '902'
quality_controlled: '1'
scopus_import: 1
status: public
title: FMNL formins boost lamellipodial force generation
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...
---
_id: '660'
abstract:
- lang: eng
text: Growing microtubules are protected from depolymerization by the presence of
a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing
cap, allowing monitoring of its size in real time. The cap size has been shown
to correlate with instantaneous microtubule stability. Here we have quantitatively
characterized the properties of cap size fluctuations during steadystate growth
and have developed a theory predicting their timescale and amplitude from the
kinetics of microtubule growth and cap maturation. In contrast to growth speed
fluctuations, cap size fluctuations show a characteristic timescale, which is
defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude
of cap size fluctuations; however, cap size does not affect growth speed, indicating
that microtubules are far from instability during most of their time of growth.
Our theory provides the basis for a quantitative understanding of microtubule
stability fluctuations during steady-state growth.
acknowledgement: We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner
for data analysis advice. This work was supported by the Francis Crick Institute,
which receives its core funding from Cancer Research UK Grant FC001163, Medical
Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was
also supported by European Research Council Advanced Grant Project 323042 (to C.D.
and T.S.).
author:
- first_name: Jamie
full_name: Rickman, Jamie
last_name: Rickman
- first_name: Christian F
full_name: Düllberg, Christian F
id: 459064DC-F248-11E8-B48F-1D18A9856A87
last_name: Düllberg
orcid: 0000-0001-6335-9748
- first_name: Nicholas
full_name: Cade, Nicholas
last_name: Cade
- first_name: Lewis
full_name: Griffin, Lewis
last_name: Griffin
- first_name: Thomas
full_name: Surrey, Thomas
last_name: Surrey
citation:
ama: Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size
fluctuations are determined by stochastic microtubule growth and maturation. PNAS.
2017;114(13):3427-3432. doi:10.1073/pnas.1620274114
apa: Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., & Surrey, T. (2017).
Steady state EB cap size fluctuations are determined by stochastic microtubule
growth and maturation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1620274114
chicago: Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and
Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic
Microtubule Growth and Maturation.” PNAS. National Academy of Sciences,
2017. https://doi.org/10.1073/pnas.1620274114.
ieee: J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state
EB cap size fluctuations are determined by stochastic microtubule growth and maturation,”
PNAS, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017.
ista: Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB
cap size fluctuations are determined by stochastic microtubule growth and maturation.
PNAS. 114(13), 3427–3432.
mla: Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined
by Stochastic Microtubule Growth and Maturation.” PNAS, vol. 114, no. 13,
National Academy of Sciences, 2017, pp. 3427–32, doi:10.1073/pnas.1620274114.
short: J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017)
3427–3432.
date_created: 2018-12-11T11:47:46Z
date_published: 2017-03-28T00:00:00Z
date_updated: 2021-01-12T08:08:09Z
day: '28'
department:
- _id: MaLo
doi: 10.1073/pnas.1620274114
external_id:
pmid:
- '28280102'
intvolume: ' 114'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/
month: '03'
oa: 1
oa_version: Submitted Version
page: 3427 - 3432
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7073'
quality_controlled: '1'
scopus_import: 1
status: public
title: Steady state EB cap size fluctuations are determined by stochastic microtubule
growth and maturation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '661'
abstract:
- lang: eng
text: During embryonic development, mechanical forces are essential for cellular
rearrangements driving tissue morphogenesis. Here, we show that in the early zebrafish
embryo, friction forces are generated at the interface between anterior axial
mesoderm (prechordal plate, ppl) progenitors migrating towards the animal pole
and neurectoderm progenitors moving in the opposite direction towards the vegetal
pole of the embryo. These friction forces lead to global rearrangement of cells
within the neurectoderm and determine the position of the neural anlage. Using
a combination of experiments and simulations, we show that this process depends
on hydrodynamic coupling between neurectoderm and ppl as a result of E-cadherin-mediated
adhesion between those tissues. Our data thus establish the emergence of friction
forces at the interface between moving tissues as a critical force-generating
process shaping the embryo.
acknowledged_ssus:
- _id: SSU
author:
- first_name: Michael
full_name: Smutny, Michael
id: 3FE6E4E8-F248-11E8-B48F-1D18A9856A87
last_name: Smutny
orcid: 0000-0002-5920-9090
- first_name: Zsuzsa
full_name: Ákos, Zsuzsa
last_name: Ákos
- first_name: Silvia
full_name: Grigolon, Silvia
last_name: Grigolon
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Verena
full_name: Ruprecht, Verena
last_name: Ruprecht
- first_name: Daniel
full_name: Capek, Daniel
id: 31C42484-F248-11E8-B48F-1D18A9856A87
last_name: Capek
orcid: 0000-0001-5199-9940
- first_name: Martin
full_name: Behrndt, Martin
id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
last_name: Behrndt
- first_name: Ekaterina
full_name: Papusheva, Ekaterina
id: 41DB591E-F248-11E8-B48F-1D18A9856A87
last_name: Papusheva
- first_name: Masazumi
full_name: Tada, Masazumi
last_name: Tada
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Tamás
full_name: Vicsek, Tamás
last_name: Vicsek
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- 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: Smutny M, Ákos Z, Grigolon S, et al. Friction forces position the neural anlage.
Nature Cell Biology. 2017;19:306-317. doi:10.1038/ncb3492
apa: Smutny, M., Ákos, Z., Grigolon, S., Shamipour, S., Ruprecht, V., Capek, D.,
… Heisenberg, C.-P. J. (2017). Friction forces position the neural anlage. Nature
Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb3492
chicago: Smutny, Michael, Zsuzsa Ákos, Silvia Grigolon, Shayan Shamipour, Verena
Ruprecht, Daniel Capek, Martin Behrndt, et al. “Friction Forces Position the Neural
Anlage.” Nature Cell Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/ncb3492.
ieee: M. Smutny et al., “Friction forces position the neural anlage,” Nature
Cell Biology, vol. 19. Nature Publishing Group, pp. 306–317, 2017.
ista: Smutny M, Ákos Z, Grigolon S, Shamipour S, Ruprecht V, Capek D, Behrndt M,
Papusheva E, Tada M, Hof B, Vicsek T, Salbreux G, Heisenberg C-PJ. 2017. Friction
forces position the neural anlage. Nature Cell Biology. 19, 306–317.
mla: Smutny, Michael, et al. “Friction Forces Position the Neural Anlage.” Nature
Cell Biology, vol. 19, Nature Publishing Group, 2017, pp. 306–17, doi:10.1038/ncb3492.
short: M. Smutny, Z. Ákos, S. Grigolon, S. Shamipour, V. Ruprecht, D. Capek, M.
Behrndt, E. Papusheva, M. Tada, B. Hof, T. Vicsek, G. Salbreux, C.-P.J. Heisenberg,
Nature Cell Biology 19 (2017) 306–317.
date_created: 2018-12-11T11:47:46Z
date_published: 2017-03-27T00:00:00Z
date_updated: 2024-03-25T23:30:21Z
day: '27'
department:
- _id: CaHe
- _id: BjHo
- _id: Bio
doi: 10.1038/ncb3492
ec_funded: 1
external_id:
pmid:
- '28346437'
intvolume: ' 19'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://europepmc.org/articles/pmc5635970
month: '03'
oa: 1
oa_version: Submitted Version
page: 306 - 317
pmid: 1
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
- _id: 252ABD0A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 930-B20
name: Control of Epithelial Cell Layer Spreading in Zebrafish
publication: Nature Cell Biology
publication_identifier:
issn:
- '14657392'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7074'
quality_controlled: '1'
related_material:
record:
- id: '50'
relation: dissertation_contains
status: public
- id: '8350'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Friction forces position the neural anlage
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2017'
...
---
_id: '1433'
abstract:
- lang: eng
text: Phat is an open-source C. ++ library for the computation of persistent homology
by matrix reduction, targeted towards developers of software for topological data
analysis. We aim for a simple generic design that decouples algorithms from data
structures without sacrificing efficiency or user-friendliness. We provide numerous
different reduction strategies as well as data types to store and manipulate the
boundary matrix. We compare the different combinations through extensive experimental
evaluation and identify optimization techniques that work well in practical situations.
We also compare our software with various other publicly available libraries for
persistent homology.
article_processing_charge: No
article_type: original
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
last_name: Bauer
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
- first_name: Jan
full_name: Reininghaus, Jan
last_name: Reininghaus
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: Bauer U, Kerber M, Reininghaus J, Wagner H. Phat - Persistent homology algorithms
toolbox. Journal of Symbolic Computation. 2017;78:76-90. doi:10.1016/j.jsc.2016.03.008
apa: Bauer, U., Kerber, M., Reininghaus, J., & Wagner, H. (2017). Phat - Persistent
homology algorithms toolbox. Journal of Symbolic Computation. Academic
Press. https://doi.org/10.1016/j.jsc.2016.03.008
chicago: Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “Phat
- Persistent Homology Algorithms Toolbox.” Journal of Symbolic Computation.
Academic Press, 2017. https://doi.org/10.1016/j.jsc.2016.03.008.
ieee: U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “Phat - Persistent homology
algorithms toolbox,” Journal of Symbolic Computation, vol. 78. Academic
Press, pp. 76–90, 2017.
ista: Bauer U, Kerber M, Reininghaus J, Wagner H. 2017. Phat - Persistent homology
algorithms toolbox. Journal of Symbolic Computation. 78, 76–90.
mla: Bauer, Ulrich, et al. “Phat - Persistent Homology Algorithms Toolbox.” Journal
of Symbolic Computation, vol. 78, Academic Press, 2017, pp. 76–90, doi:10.1016/j.jsc.2016.03.008.
short: U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, Journal of Symbolic Computation
78 (2017) 76–90.
date_created: 2018-12-11T11:51:59Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-20T09:42:40Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jsc.2016.03.008
ec_funded: 1
external_id:
isi:
- '000384396000005'
intvolume: ' 78'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jsc.2016.03.008
month: '01'
oa: 1
oa_version: Published Version
page: 76 - 90
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Journal of Symbolic Computation
publication_identifier:
issn:
- ' 07477171'
publication_status: published
publisher: Academic Press
publist_id: '5765'
quality_controlled: '1'
related_material:
record:
- id: '10894'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Phat - Persistent homology algorithms toolbox
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 78
year: '2017'
...
---
_id: '1528'
abstract:
- lang: eng
text: 'We consider N×N Hermitian random matrices H consisting of blocks of size
M≥N6/7. The matrix elements are i.i.d. within the blocks, close to a Gaussian
in the four moment matching sense, but their distribution varies from block to
block to form a block-band structure, with an essential band width M. We show
that the entries of the Green’s function G(z)=(H−z)−1 satisfy the local semicircle
law with spectral parameter z=E+iη down to the real axis for any η≫N−1, using
a combination of the supersymmetry method inspired by Shcherbina (J Stat Phys
155(3): 466–499, 2014) and the Green’s function comparison strategy. Previous
estimates were valid only for η≫M−1. The new estimate also implies that the eigenvectors
in the middle of the spectrum are fully delocalized.'
acknowledgement: "Z. Bao was supported by ERC Advanced Grant RANMAT No. 338804; L.
Erdős was partially supported by ERC Advanced Grant RANMAT No. 338804.\r\nOpen access
funding provided by Institute of Science and Technology (IST Austria). The authors
are very grateful to the anonymous referees for careful reading and valuable comments,
which helped to improve the organization."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: Bao Z, Erdös L. Delocalization for a class of random block band matrices. Probability
Theory and Related Fields. 2017;167(3-4):673-776. doi:10.1007/s00440-015-0692-y
apa: Bao, Z., & Erdös, L. (2017). Delocalization for a class of random block
band matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-015-0692-y
chicago: Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block
Band Matrices.” Probability Theory and Related Fields. Springer, 2017.
https://doi.org/10.1007/s00440-015-0692-y.
ieee: Z. Bao and L. Erdös, “Delocalization for a class of random block band matrices,”
Probability Theory and Related Fields, vol. 167, no. 3–4. Springer, pp.
673–776, 2017.
ista: Bao Z, Erdös L. 2017. Delocalization for a class of random block band matrices.
Probability Theory and Related Fields. 167(3–4), 673–776.
mla: Bao, Zhigang, and László Erdös. “Delocalization for a Class of Random Block
Band Matrices.” Probability Theory and Related Fields, vol. 167, no. 3–4,
Springer, 2017, pp. 673–776, doi:10.1007/s00440-015-0692-y.
short: Z. Bao, L. Erdös, Probability Theory and Related Fields 167 (2017) 673–776.
date_created: 2018-12-11T11:52:32Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2023-09-20T09:42:12Z
day: '01'
ddc:
- '530'
department:
- _id: LaEr
doi: 10.1007/s00440-015-0692-y
ec_funded: 1
external_id:
isi:
- '000398842700004'
file:
- access_level: open_access
checksum: 67afa85ff1e220cbc1f9f477a828513c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:05Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4665'
file_name: IST-2016-489-v1+1_s00440-015-0692-y.pdf
file_size: 1615755
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 167'
isi: 1
issue: 3-4
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 673 - 776
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_identifier:
issn:
- '01788051'
publication_status: published
publisher: Springer
publist_id: '5644'
pubrep_id: '489'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Delocalization for a class of random block band 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: 167
year: '2017'
...
---
_id: '13160'
abstract:
- lang: eng
text: "Transforming deterministic ω\r\n-automata into deterministic parity automata
is traditionally done using variants of appearance records. We present a more
efficient variant of this approach, tailored to Rabin automata, and several optimizations
applicable to all appearance records. We compare the methods experimentally and
find out that our method produces smaller automata than previous approaches. Moreover,
the experiments demonstrate the potential of our method for LTL synthesis, using
LTL-to-Rabin translators. It leads to significantly smaller parity automata when
compared to state-of-the-art approaches on complex formulae."
acknowledgement: This work is partially funded by the DFG project “Verified Model
Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Clara
full_name: Waldmann, Clara
last_name: Waldmann
- first_name: Maximilian
full_name: Weininger, Maximilian
last_name: Weininger
citation:
ama: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record
for transforming Rabin automata into parity automata. In: Tools and Algorithms
for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460.
doi:10.1007/978-3-662-54577-5_26'
apa: 'Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017).
Index appearance record for transforming Rabin automata into parity automata.
In Tools and Algorithms for the Construction and Analysis of Systems (Vol.
10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26'
chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger.
“Index Appearance Record for Transforming Rabin Automata into Parity Automata.”
In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60.
Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26.
ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance
record for transforming Rabin automata into parity automata,” in Tools and
Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden,
2017, vol. 10205, pp. 443–460.
ista: 'Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance
record for transforming Rabin automata into parity automata. Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.'
mla: Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata
into Parity Automata.” Tools and Algorithms for the Construction and Analysis
of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.
short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and
Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
date_created: 2023-06-21T13:21:14Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2023-06-21T13:29:46Z
day: '31'
department:
- _id: KrCh
doi: 10.1007/978-3-662-54577-5_26
external_id:
arxiv:
- '1701.05738'
intvolume: ' 10205'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1701.05738
month: '03'
oa: 1
oa_version: Preprint
page: 443-460
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783662545775'
eissn:
- 1611-3349
isbn:
- '9783662545768'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Index appearance record for transforming Rabin automata into parity automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10205
year: '2017'
...
---
_id: '1336'
abstract:
- lang: eng
text: Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired
by natural evolution. In recent years the field of evolutionary computation has
developed a rigorous analytical theory to analyse the runtimes of EAs on many
illustrative problems. Here we apply this theory to a simple model of natural
evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the
time between occurrences of new mutations is much longer than the time it takes
for a mutated genotype to take over the population. In this situation, the population
only contains copies of one genotype and evolution can be modelled as a stochastic
process evolving one genotype by means of mutation and selection between the resident
and the mutated genotype. The probability of accepting the mutated genotype then
depends on the change in fitness. We study this process, SSWM, from an algorithmic
perspective, quantifying its expected optimisation time for various parameters
and investigating differences to a similar evolutionary algorithm, the well-known
(1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at
crossing fitness valleys and study an example where SSWM outperforms the (1+1)
EA by taking advantage of information on the fitness gradient.
article_processing_charge: No
author:
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Jorge
full_name: Pérez Heredia, Jorge
last_name: Pérez Heredia
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
citation:
ama: Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. Towards a runtime comparison
of natural and artificial evolution. Algorithmica. 2017;78(2):681-713.
doi:10.1007/s00453-016-0212-1
apa: Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2017). Towards
a runtime comparison of natural and artificial evolution. Algorithmica.
Springer. https://doi.org/10.1007/s00453-016-0212-1
chicago: Paixao, Tiago, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova.
“Towards a Runtime Comparison of Natural and Artificial Evolution.” Algorithmica.
Springer, 2017. https://doi.org/10.1007/s00453-016-0212-1.
ieee: T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “Towards a runtime
comparison of natural and artificial evolution,” Algorithmica, vol. 78,
no. 2. Springer, pp. 681–713, 2017.
ista: Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2017. Towards a runtime
comparison of natural and artificial evolution. Algorithmica. 78(2), 681–713.
mla: Paixao, Tiago, et al. “Towards a Runtime Comparison of Natural and Artificial
Evolution.” Algorithmica, vol. 78, no. 2, Springer, 2017, pp. 681–713,
doi:10.1007/s00453-016-0212-1.
short: T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 78 (2017)
681–713.
date_created: 2018-12-11T11:51:27Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-20T11:14:42Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1007/s00453-016-0212-1
ec_funded: 1
external_id:
isi:
- '000400379500013'
file:
- access_level: open_access
checksum: 7873f665a0c598ac747c908f34cb14b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:19Z
date_updated: 2020-07-14T12:44:44Z
file_id: '4805'
file_name: IST-2016-658-v1+1_s00453-016-0212-1.pdf
file_size: 710206
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 78'
isi: 1
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 681 - 713
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Algorithmica
publication_identifier:
issn:
- '01784617'
publication_status: published
publisher: Springer
publist_id: '5931'
pubrep_id: '658'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Towards a runtime comparison of natural and artificial evolution
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: 78
year: '2017'
...
---
_id: '1337'
abstract:
- lang: eng
text: We consider the local eigenvalue distribution of large self-adjoint N×N random
matrices H=H∗ with centered independent entries. In contrast to previous works
the matrix of variances sij=\mathbbmE|hij|2 is not assumed to be stochastic. Hence
the density of states is not the Wigner semicircle law. Its possible shapes are
described in the companion paper (Ajanki et al. in Quadratic Vector Equations
on the Complex Upper Half Plane. arXiv:1506.05095). We show that as N grows, the
resolvent, G(z)=(H−z)−1, converges to a diagonal matrix, diag(m(z)), where m(z)=(m1(z),…,mN(z))
solves the vector equation −1/mi(z)=z+∑jsijmj(z) that has been analyzed in Ajanki
et al. (Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095).
We prove a local law down to the smallest spectral resolution scale, and bulk
universality for both real symmetric and complex hermitian symmetry classes.
acknowledgement: 'Open access funding provided by Institute of Science and Technology
(IST Austria). '
article_processing_charge: Yes (via OA deal)
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- 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: Ajanki OH, Erdös L, Krüger TH. Universality for general Wigner-type matrices.
Probability Theory and Related Fields. 2017;169(3-4):667-727. doi:10.1007/s00440-016-0740-2
apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2017). Universality for general
Wigner-type matrices. Probability Theory and Related Fields. Springer.
https://doi.org/10.1007/s00440-016-0740-2
chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Universality for
General Wigner-Type Matrices.” Probability Theory and Related Fields. Springer,
2017. https://doi.org/10.1007/s00440-016-0740-2.
ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Universality for general Wigner-type
matrices,” Probability Theory and Related Fields, vol. 169, no. 3–4. Springer,
pp. 667–727, 2017.
ista: Ajanki OH, Erdös L, Krüger TH. 2017. Universality for general Wigner-type
matrices. Probability Theory and Related Fields. 169(3–4), 667–727.
mla: Ajanki, Oskari H., et al. “Universality for General Wigner-Type Matrices.”
Probability Theory and Related Fields, vol. 169, no. 3–4, Springer, 2017,
pp. 667–727, doi:10.1007/s00440-016-0740-2.
short: O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields
169 (2017) 667–727.
date_created: 2018-12-11T11:51:27Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-09-20T11:14:17Z
day: '01'
ddc:
- '510'
- '530'
department:
- _id: LaEr
doi: 10.1007/s00440-016-0740-2
ec_funded: 1
external_id:
isi:
- '000414358400002'
file:
- access_level: open_access
checksum: 29f5a72c3f91e408aeb9e78344973803
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:25Z
date_updated: 2020-07-14T12:44:44Z
file_id: '4686'
file_name: IST-2017-657-v1+2_s00440-016-0740-2.pdf
file_size: 988843
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 169'
isi: 1
issue: 3-4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 667 - 727
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Probability Theory and Related Fields
publication_identifier:
issn:
- '01788051'
publication_status: published
publisher: Springer
publist_id: '5930'
pubrep_id: '657'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Universality for general Wigner-type 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: 169
year: '2017'
...
---
_id: '1338'
abstract:
- lang: eng
text: We present a computer-aided programming approach to concurrency. The approach
allows programmers to program assuming a friendly, non-preemptive scheduler, and
our synthesis procedure inserts synchronization to ensure that the final program
works even with a preemptive scheduler. The correctness specification is implicit,
inferred from the non-preemptive behavior. Let us consider sequences of calls
that the program makes to an external interface. The specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of sequences produced under a non-preemptive scheduler. We guarantee that
our synthesis does not introduce deadlocks and that the synchronization inserted
is optimal w.r.t. a given objective function. The solution is based on a finitary
abstraction, an algorithm for bounded language inclusion modulo an independence
relation, and generation of a set of global constraints over synchronization placements.
Each model of the global constraints set corresponds to a correctness-ensuring
synchronization placement. The placement that is optimal w.r.t. the given objective
function is chosen as the synchronization solution. We apply the approach to device-driver
programming, where the driver threads call the software interface of the device
and the API provided by the operating system. Our experiments demonstrate that
our synthesis method is precise and efficient. The implicit specification helped
us find one concurrency bug previously missed when model-checking using an explicit,
user-provided specification. We implemented objective functions for coarse-grained
and fine-grained locking and observed that different synchronization placements
are produced for our experiments, favoring a minimal number of synchronization
operations or maximum concurrency, respectively.
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Leonid
full_name: Ryzhyk, Leonid
last_name: Ryzhyk
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling
using synchronization synthesis. Formal Methods in System Design. 2017;50(2-3):97-139.
doi:10.1007/s10703-016-0256-5
apa: Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta,
R., & Tarrach, T. (2017). From non-preemptive to preemptive scheduling using
synchronization synthesis. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-016-0256-5
chicago: Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid
Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive
Scheduling Using Synchronization Synthesis.” Formal Methods in System Design.
Springer, 2017. https://doi.org/10.1007/s10703-016-0256-5.
ieee: P. Cerny et al., “From non-preemptive to preemptive scheduling using
synchronization synthesis,” Formal Methods in System Design, vol. 50, no.
2–3. Springer, pp. 97–139, 2017.
ista: Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach
T. 2017. From non-preemptive to preemptive scheduling using synchronization synthesis.
Formal Methods in System Design. 50(2–3), 97–139.
mla: Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization
Synthesis.” Formal Methods in System Design, vol. 50, no. 2–3, Springer,
2017, pp. 97–139, doi:10.1007/s10703-016-0256-5.
short: P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta,
T. Tarrach, Formal Methods in System Design 50 (2017) 97–139.
date_created: 2018-12-11T11:51:27Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-09-20T11:13:51Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s10703-016-0256-5
ec_funded: 1
external_id:
isi:
- '000399888900001'
file:
- access_level: open_access
checksum: 1163dfd997e8212c789525d4178b1653
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:05Z
date_updated: 2020-07-14T12:44:44Z
file_id: '4985'
file_name: IST-2016-656-v1+1_s10703-016-0256-5.pdf
file_size: 1416170
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 50'
isi: 1
issue: 2-3
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 97 - 139
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '5929'
pubrep_id: '656'
quality_controlled: '1'
related_material:
record:
- id: '1729'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: From non-preemptive to preemptive scheduling using synchronization synthesis
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 50
year: '2017'
...
---
_id: '1351'
abstract:
- lang: eng
text: The behaviour of gene regulatory networks (GRNs) is typically analysed using
simulation-based statistical testing-like methods. In this paper, we demonstrate
that we can replace this approach by a formal verification-like method that gives
higher assurance and scalability. We focus on Wagner’s weighted GRN model with
varying weights, which is used in evolutionary biology. In the model, weight parameters
represent the gene interaction strength that may change due to genetic mutations.
For a property of interest, we synthesise the constraints over the parameter space
that represent the set of GRNs satisfying the property. We experimentally show
that our parameter synthesis procedure computes the mutational robustness of GRNs—an
important problem of interest in evolutionary biology—more efficiently than the
classical simulation method. We specify the property in linear temporal logic.
We employ symbolic bounded model checking and SMT solving to compute the space
of GRNs that satisfy the property, which amounts to synthesizing a set of linear
constraints on the weights.
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking
the evolution of gene regulatory networks. Acta Informatica. 2017;54(8):765-787.
doi:10.1007/s00236-016-0278-x
apa: Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., & Petrov,
T. (2017). Model checking the evolution of gene regulatory networks. Acta Informatica.
Springer. https://doi.org/10.1007/s00236-016-0278-x
chicago: Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago
Paixao, and Tatjana Petrov. “Model Checking the Evolution of Gene Regulatory Networks.”
Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-016-0278-x.
ieee: M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov,
“Model checking the evolution of gene regulatory networks,” Acta Informatica,
vol. 54, no. 8. Springer, pp. 765–787, 2017.
ista: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2017. Model
checking the evolution of gene regulatory networks. Acta Informatica. 54(8), 765–787.
mla: Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.”
Acta Informatica, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:10.1007/s00236-016-0278-x.
short: M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta
Informatica 54 (2017) 765–787.
date_created: 2018-12-11T11:51:32Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2025-05-28T11:57:04Z
day: '01'
ddc:
- '006'
- '576'
department:
- _id: ToHe
- _id: CaGu
- _id: NiBa
doi: 10.1007/s00236-016-0278-x
ec_funded: 1
external_id:
isi:
- '000414343200003'
file:
- access_level: open_access
checksum: 4e661d9135d7f8c342e8e258dee76f3e
content_type: application/pdf
creator: dernst
date_created: 2019-01-17T15:57:29Z
date_updated: 2020-07-14T12:44:46Z
file_id: '5841'
file_name: 2017_ActaInformatica_Giacobbe.pdf
file_size: 755241
relation: main_file
file_date_updated: 2020-07-14T12:44:46Z
has_accepted_license: '1'
intvolume: ' 54'
isi: 1
issue: '8'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 765 - 787
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Acta Informatica
publication_identifier:
issn:
- '00015903'
publication_status: published
publisher: Springer
publist_id: '5898'
pubrep_id: '649'
quality_controlled: '1'
related_material:
record:
- id: '1835'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Model checking the evolution of gene regulatory networks
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: 54
year: '2017'
...
---
_id: '1367'
abstract:
- lang: eng
text: One of the major challenges in physically based modelling is making simulations
efficient. Adaptive models provide an essential solution to these efficiency goals.
These models are able to self-adapt in space and time, attempting to provide the
best possible compromise between accuracy and speed. This survey reviews the adaptive
solutions proposed so far in computer graphics. Models are classified according
to the strategy they use for adaptation, from time-stepping and freezing techniques
to geometric adaptivity in the form of structured grids, meshes and particles.
Applications range from fluids, through deformable bodies, to articulated solids.
acknowledgement: This work was partly supported by the starting grants ADAPT and BigSplash,
as well as the advanced grant EXPRESSIVE from the European Research Council (ERC-2012-StG_20111012,
ERC-2014-StG_638176 and ERC-2011-ADG_20110209).
article_processing_charge: No
author:
- first_name: Pierre
full_name: Manteaux, Pierre
last_name: Manteaux
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Rahul
full_name: Narain, Rahul
last_name: Narain
- first_name: Stéphane
full_name: Redon, Stéphane
last_name: Redon
- first_name: François
full_name: Faure, François
last_name: Faure
- first_name: Marie
full_name: Cani, Marie
last_name: Cani
citation:
ama: Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. Adaptive physically
based models in computer graphics. Computer Graphics Forum. 2017;36(6):312-337.
doi:10.1111/cgf.12941
apa: Manteaux, P., Wojtan, C., Narain, R., Redon, S., Faure, F., & Cani, M.
(2017). Adaptive physically based models in computer graphics. Computer Graphics
Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12941
chicago: Manteaux, Pierre, Chris Wojtan, Rahul Narain, Stéphane Redon, François
Faure, and Marie Cani. “Adaptive Physically Based Models in Computer Graphics.”
Computer Graphics Forum. Wiley-Blackwell, 2017. https://doi.org/10.1111/cgf.12941.
ieee: P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, and M. Cani, “Adaptive
physically based models in computer graphics,” Computer Graphics Forum,
vol. 36, no. 6. Wiley-Blackwell, pp. 312–337, 2017.
ista: Manteaux P, Wojtan C, Narain R, Redon S, Faure F, Cani M. 2017. Adaptive physically
based models in computer graphics. Computer Graphics Forum. 36(6), 312–337.
mla: Manteaux, Pierre, et al. “Adaptive Physically Based Models in Computer Graphics.”
Computer Graphics Forum, vol. 36, no. 6, Wiley-Blackwell, 2017, pp. 312–37,
doi:10.1111/cgf.12941.
short: P. Manteaux, C. Wojtan, R. Narain, S. Redon, F. Faure, M. Cani, Computer
Graphics Forum 36 (2017) 312–337.
date_created: 2018-12-11T11:51:37Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-20T11:05:36Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.12941
external_id:
isi:
- '000408634200019'
file:
- access_level: open_access
checksum: 7676e9a9ead6d58c3000988c97deb2ef
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:21Z
date_updated: 2020-07-14T12:44:47Z
file_id: '5208'
file_name: IST-2016-634-v1+1_starAdaptivity-cgf.pdf
file_size: 1434439
relation: main_file
file_date_updated: 2020-07-14T12:44:47Z
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '6'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 312 - 337
publication: Computer Graphics Forum
publication_identifier:
issn:
- '01677055'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5873'
pubrep_id: '634'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adaptive physically based models in computer graphics
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 36
year: '2017'
...
---
_id: '1407'
abstract:
- lang: eng
text: We consider the problem of computing the set of initial states of a dynamical
system such that there exists a control strategy to ensure that the trajectories
satisfy a temporal logic specification with probability 1 (almost-surely). We
focus on discrete-time, stochastic linear dynamics and specifications given as
formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over
linear predicates in the states of the system. We propose a solution based on
iterative abstraction-refinement, and turn-based 2-player probabilistic games.
While the theoretical guarantee of our algorithm after any finite number of iterations
is only a partial solution, we show that if our algorithm terminates, then the
result is the set of all satisfying initial states. Moreover, for any (partial)
solution our algorithm synthesizes witness control strategies to ensure almost-sure
satisfaction of the temporal logic specification. While the proposed algorithm
guarantees progress and soundness in every iteration, it is computationally demanding.
We offer an alternative, more efficient solution for the reachability properties
that decomposes the problem into a series of smaller problems of the same type.
All algorithms are demonstrated on an illustrative case study.
article_processing_charge: No
arxiv: 1
author:
- first_name: Mária
full_name: Svoreňová, Mária
last_name: Svoreňová
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ivana
full_name: Cěrná, Ivana
last_name: Cěrná
- first_name: Cǎlin
full_name: Belta, Cǎlin
last_name: Belta
citation:
ama: 'Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal
logic control for stochastic linear systems using abstraction refinement of probabilistic
games. Nonlinear Analysis: Hybrid Systems. 2017;23(2):230-253. doi:10.1016/j.nahs.2016.04.006'
apa: 'Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., &
Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction
refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems.
Elsevier. https://doi.org/10.1016/j.nahs.2016.04.006'
chicago: 'Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee,
Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems
Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid
Systems. Elsevier, 2017. https://doi.org/10.1016/j.nahs.2016.04.006.'
ieee: 'M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta,
“Temporal logic control for stochastic linear systems using abstraction refinement
of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no.
2. Elsevier, pp. 230–253, 2017.'
ista: 'Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017.
Temporal logic control for stochastic linear systems using abstraction refinement
of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.'
mla: 'Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems
Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid
Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.'
short: 'M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta,
Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.'
date_created: 2018-12-11T11:51:50Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-20T09:43:09Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1016/j.nahs.2016.04.006
ec_funded: 1
external_id:
arxiv:
- '1410.5387'
isi:
- '000390637000014'
intvolume: ' 23'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.5387
month: '02'
oa: 1
oa_version: Preprint
page: 230 - 253
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: 'Nonlinear Analysis: Hybrid Systems'
publication_status: published
publisher: Elsevier
publist_id: '5800'
quality_controlled: '1'
related_material:
record:
- id: '1689'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Temporal logic control for stochastic linear systems using abstraction refinement
of probabilistic games
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 23
year: '2017'
...
---
_id: '14205'
abstract:
- lang: eng
text: Two of the most fundamental prototypes of greedy optimization are the matching
pursuit and Frank-Wolfe algorithms. In this paper, we take a unified view on both
classes of methods, leading to the first explicit convergence rates of matching
pursuit methods in an optimization sense, for general sets of atoms. We derive
sublinear (1/t) convergence for both classes on general smooth objectives, and
linear convergence on strongly convex objectives, as well as a clear correspondence
of algorithm variants. Our presented algorithms and rates are affine invariant,
and do not need any incoherence or sparsity assumptions.
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Rajiv
full_name: Khanna, Rajiv
last_name: Khanna
- first_name: Michael
full_name: Tschannen, Michael
last_name: Tschannen
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
citation:
ama: 'Locatello F, Khanna R, Tschannen M, Jaggi M. A unified optimization view on
generalized matching pursuit and Frank-Wolfe. In: Proceedings of the 20th International
Conference on Artificial Intelligence and Statistics. Vol 54. ML Research
Press; 2017:860-868.'
apa: 'Locatello, F., Khanna, R., Tschannen, M., & Jaggi, M. (2017). A unified
optimization view on generalized matching pursuit and Frank-Wolfe. In Proceedings
of the 20th International Conference on Artificial Intelligence and Statistics
(Vol. 54, pp. 860–868). Fort Lauderdale, FL, United States: ML Research Press.'
chicago: Locatello, Francesco, Rajiv Khanna, Michael Tschannen, and Martin Jaggi.
“A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe.”
In Proceedings of the 20th International Conference on Artificial Intelligence
and Statistics, 54:860–68. ML Research Press, 2017.
ieee: F. Locatello, R. Khanna, M. Tschannen, and M. Jaggi, “A unified optimization
view on generalized matching pursuit and Frank-Wolfe,” in Proceedings of the
20th International Conference on Artificial Intelligence and Statistics, Fort
Lauderdale, FL, United States, 2017, vol. 54, pp. 860–868.
ista: 'Locatello F, Khanna R, Tschannen M, Jaggi M. 2017. A unified optimization
view on generalized matching pursuit and Frank-Wolfe. Proceedings of the 20th
International Conference on Artificial Intelligence and Statistics. AISTATS: Conference
on Artificial Intelligence and Statistics vol. 54, 860–868.'
mla: Locatello, Francesco, et al. “A Unified Optimization View on Generalized Matching
Pursuit and Frank-Wolfe.” Proceedings of the 20th International Conference
on Artificial Intelligence and Statistics, vol. 54, ML Research Press, 2017,
pp. 860–68.
short: F. Locatello, R. Khanna, M. Tschannen, M. Jaggi, in:, Proceedings of the
20th International Conference on Artificial Intelligence and Statistics, ML Research
Press, 2017, pp. 860–868.
conference:
end_date: 2017-04-22
location: Fort Lauderdale, FL, United States
name: 'AISTATS: Conference on Artificial Intelligence and Statistics'
start_date: 2017-04-20
date_created: 2023-08-22T14:17:19Z
date_published: 2017-02-21T00:00:00Z
date_updated: 2023-09-13T09:49:10Z
day: '21'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1702.06457'
intvolume: ' 54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1702.06457
month: '02'
oa: 1
oa_version: Preprint
page: 860-868
publication: Proceedings of the 20th International Conference on Artificial Intelligence
and Statistics
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: A unified optimization view on generalized matching pursuit and Frank-Wolfe
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 54
year: '2017'
...
---
_id: '14206'
abstract:
- lang: eng
text: Greedy optimization methods such as Matching Pursuit (MP) and Frank-Wolfe
(FW) algorithms regained popularity in recent years due to their simplicity, effectiveness
and theoretical guarantees. MP and FW address optimization over the linear span
and the convex hull of a set of atoms, respectively. In this paper, we consider
the intermediate case of optimization over the convex cone, parametrized as the
conic hull of a generic atom set, leading to the first principled definitions
of non-negative MP algorithms for which we give explicit convergence rates and
demonstrate excellent empirical performance. In particular, we derive sublinear
(O(1/t)) convergence on general smooth and convex objectives, and linear convergence
(O(e−t)) on strongly convex objectives, in both cases for general sets of atoms.
Furthermore, we establish a clear correspondence of our algorithms to known algorithms
from the MP and FW literature. Our novel algorithms and analyses target general
atom sets and general objective functions, and hence are directly applicable to
a large variety of learning settings.
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Michael
full_name: Tschannen, Michael
last_name: Tschannen
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
citation:
ama: 'Locatello F, Tschannen M, Rätsch G, Jaggi M. Greedy algorithms for cone constrained
optimization with convergence guarantees. In: Advances in Neural Information
Processing Systems. ; 2017.'
apa: Locatello, F., Tschannen, M., Rätsch, G., & Jaggi, M. (2017). Greedy algorithms
for cone constrained optimization with convergence guarantees. In Advances
in Neural Information Processing Systems. Long Beach, CA, United States.
chicago: Locatello, Francesco, Michael Tschannen, Gunnar Rätsch, and Martin Jaggi.
“Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees.”
In Advances in Neural Information Processing Systems, 2017.
ieee: F. Locatello, M. Tschannen, G. Rätsch, and M. Jaggi, “Greedy algorithms for
cone constrained optimization with convergence guarantees,” in Advances in
Neural Information Processing Systems, Long Beach, CA, United States, 2017.
ista: 'Locatello F, Tschannen M, Rätsch G, Jaggi M. 2017. Greedy algorithms for
cone constrained optimization with convergence guarantees. Advances in Neural
Information Processing Systems. NeurIPS: Neural Information Processing Systems.'
mla: Locatello, Francesco, et al. “Greedy Algorithms for Cone Constrained Optimization
with Convergence Guarantees.” Advances in Neural Information Processing Systems,
2017.
short: F. Locatello, M. Tschannen, G. Rätsch, M. Jaggi, in:, Advances in Neural
Information Processing Systems, 2017.
conference:
end_date: 2017-12-09
location: Long Beach, CA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2017-12-04
date_created: 2023-08-22T14:17:38Z
date_published: 2017-05-31T00:00:00Z
date_updated: 2023-09-13T08:32:23Z
day: '31'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '1705.11041'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.11041
month: '05'
oa: 1
oa_version: Preprint
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781510860964'
publication_status: published
quality_controlled: '1'
status: public
title: Greedy algorithms for cone constrained optimization with convergence guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '909'
abstract:
- lang: eng
text: We study the lengths of curves passing through a fixed number of points on
the boundary of a convex shape in the plane. We show that, for any convex shape
K, there exist four points on the boundary of K such that the length of any curve
passing through these points is at least half of the perimeter of K. It is also
shown that the same statement does not remain valid with the additional constraint
that the points are extreme points of K. Moreover, the factor ½ cannot
be achieved with any fixed number of extreme points. We conclude the paper with
a few other inequalities related to the perimeter of a convex shape.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Vladislav
full_name: Vysotsky, Vladislav
last_name: Vysotsky
citation:
ama: Akopyan A, Vysotsky V. On the lengths of curves passing through boundary points
of a planar convex shape. The American Mathematical Monthly. 2017;124(7):588-596.
doi:10.4169/amer.math.monthly.124.7.588
apa: Akopyan, A., & Vysotsky, V. (2017). On the lengths of curves passing through
boundary points of a planar convex shape. The American Mathematical Monthly.
Mathematical Association of America. https://doi.org/10.4169/amer.math.monthly.124.7.588
chicago: Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing
through Boundary Points of a Planar Convex Shape.” The American Mathematical
Monthly. Mathematical Association of America, 2017. https://doi.org/10.4169/amer.math.monthly.124.7.588.
ieee: A. Akopyan and V. Vysotsky, “On the lengths of curves passing through boundary
points of a planar convex shape,” The American Mathematical Monthly, vol.
124, no. 7. Mathematical Association of America, pp. 588–596, 2017.
ista: Akopyan A, Vysotsky V. 2017. On the lengths of curves passing through boundary
points of a planar convex shape. The American Mathematical Monthly. 124(7), 588–596.
mla: Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing
through Boundary Points of a Planar Convex Shape.” The American Mathematical
Monthly, vol. 124, no. 7, Mathematical Association of America, 2017, pp. 588–96,
doi:10.4169/amer.math.monthly.124.7.588.
short: A. Akopyan, V. Vysotsky, The American Mathematical Monthly 124 (2017) 588–596.
date_created: 2018-12-11T11:49:09Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-10-17T11:24:57Z
day: '01'
department:
- _id: HeEd
doi: 10.4169/amer.math.monthly.124.7.588
ec_funded: 1
external_id:
arxiv:
- '1605.07997'
isi:
- '000413947300002'
intvolume: ' 124'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.07997
month: '01'
oa: 1
oa_version: Submitted Version
page: 588 - 596
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: The American Mathematical Monthly
publication_identifier:
issn:
- '00029890'
publication_status: published
publisher: Mathematical Association of America
publist_id: '6534'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the lengths of curves passing through boundary points of a planar convex
shape
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 124
year: '2017'
...
---
_id: '910'
abstract:
- lang: eng
text: "Frequency-independent selection is generally considered as a force that acts
to reduce the genetic variation in evolving populations, yet rigorous arguments
for this idea are scarce. When selection fluctuates in time, it is unclear whether
frequency-independent selection may maintain genetic polymorphism without invoking
additional mechanisms. We show that constant frequency-independent selection with
arbitrary epistasis on a well-mixed haploid population eliminates genetic variation
if we assume linkage equilibrium between alleles. To this end, we introduce the
notion of frequency-independent selection at the level of alleles, which is sufficient
to prove our claim and contains the notion of frequency-independent selection
on haploids. When selection and recombination are weak but of the same order,
there may be strong linkage disequilibrium; numerical calculations show that stable
equilibria are highly unlikely. Using the example of a diallelic two-locus model,
we then demonstrate that frequency-independent selection that fluctuates in time
can maintain stable polymorphism if linkage disequilibrium changes its sign periodically.
We put our findings in the context of results from the existing literature and
point out those scenarios in which the possible role of frequency-independent
selection in maintaining genetic variation remains unclear.\r\n"
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Novak S, Barton NH. When does frequency-independent selection maintain genetic
variation? Genetics. 2017;207(2):653-668. doi:10.1534/genetics.117.300129
apa: Novak, S., & Barton, N. H. (2017). When does frequency-independent selection
maintain genetic variation? Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.117.300129
chicago: Novak, Sebastian, and Nicholas H Barton. “When Does Frequency-Independent
Selection Maintain Genetic Variation?” Genetics. Genetics Society of America,
2017. https://doi.org/10.1534/genetics.117.300129.
ieee: S. Novak and N. H. Barton, “When does frequency-independent selection maintain
genetic variation?,” Genetics, vol. 207, no. 2. Genetics Society of America,
pp. 653–668, 2017.
ista: Novak S, Barton NH. 2017. When does frequency-independent selection maintain
genetic variation? Genetics. 207(2), 653–668.
mla: Novak, Sebastian, and Nicholas H. Barton. “When Does Frequency-Independent
Selection Maintain Genetic Variation?” Genetics, vol. 207, no. 2, Genetics
Society of America, 2017, pp. 653–68, doi:10.1534/genetics.117.300129.
short: S. Novak, N.H. Barton, Genetics 207 (2017) 653–668.
date_created: 2018-12-11T11:49:09Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2023-09-26T15:49:15Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1534/genetics.117.300129
ec_funded: 1
external_id:
isi:
- '000412232600019'
file:
- access_level: open_access
checksum: f7c32dabf52e6d9e709d9203761e39fd
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:12Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5264'
file_name: IST-2018-974-v1+1_manuscript.pdf
file_size: 494268
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 207'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 653 - 668
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '6533'
pubrep_id: '974'
quality_controlled: '1'
scopus_import: '1'
status: public
title: When does frequency-independent selection maintain genetic variation?
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 207
year: '2017'
...
---
_id: '911'
abstract:
- lang: eng
text: We develop a probabilistic technique for colorizing grayscale natural images.
In light of the intrinsic uncertainty of this task, the proposed probabilistic
framework has numerous desirable properties. In particular, our model is able
to produce multiple plausible and vivid colorizations for a given grayscale image
and is one of the first colorization models to provide a proper stochastic sampling
scheme. Moreover, our training procedure is supported by a rigorous theoretical
framework that does not require any ad hoc heuristics and allows for efficient
modeling and learning of the joint pixel color distribution.We demonstrate strong
quantitative and qualitative experimental results on the CIFAR-10 dataset and
the challenging ILSVRC 2012 dataset.
article_processing_charge: No
arxiv: 1
author:
- first_name: Amélie
full_name: Royer, Amélie
id: 3811D890-F248-11E8-B48F-1D18A9856A87
last_name: Royer
orcid: 0000-0002-8407-0705
- 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: 'Royer A, Kolesnikov A, Lampert C. Probabilistic image colorization. In: BMVA
Press; 2017:85.1-85.12. doi:10.5244/c.31.85'
apa: 'Royer, A., Kolesnikov, A., & Lampert, C. (2017). Probabilistic image colorization
(p. 85.1-85.12). Presented at the BMVC: British Machine Vision Conference, London,
United Kingdom: BMVA Press. https://doi.org/10.5244/c.31.85'
chicago: Royer, Amélie, Alexander Kolesnikov, and Christoph Lampert. “Probabilistic
Image Colorization,” 85.1-85.12. BMVA Press, 2017. https://doi.org/10.5244/c.31.85.
ieee: 'A. Royer, A. Kolesnikov, and C. Lampert, “Probabilistic image colorization,”
presented at the BMVC: British Machine Vision Conference, London, United Kingdom,
2017, p. 85.1-85.12.'
ista: 'Royer A, Kolesnikov A, Lampert C. 2017. Probabilistic image colorization.
BMVC: British Machine Vision Conference, 85.1-85.12.'
mla: Royer, Amélie, et al. Probabilistic Image Colorization. BMVA Press,
2017, p. 85.1-85.12, doi:10.5244/c.31.85.
short: A. Royer, A. Kolesnikov, C. Lampert, in:, BMVA Press, 2017, p. 85.1-85.12.
conference:
end_date: 2017-09-07
location: London, United Kingdom
name: 'BMVC: British Machine Vision Conference'
start_date: 2017-09-04
date_created: 2018-12-11T11:49:09Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-10-16T10:04:02Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.5244/c.31.85
ec_funded: 1
external_id:
arxiv:
- '1705.04258'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-10T07:14:33Z
date_updated: 2020-08-10T07:14:33Z
file_id: '8224'
file_name: 2017_BMVC_Royer.pdf
file_size: 1625363
relation: main_file
success: 1
file_date_updated: 2020-08-10T07:14:33Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 85.1-85.12
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
eisbn:
- 190172560X
publication_status: published
publisher: BMVA Press
publist_id: '6532'
quality_controlled: '1'
related_material:
record:
- id: '8390'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Probabilistic image colorization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '912'
abstract:
- lang: eng
text: "We consider a many-body system of fermionic atoms interacting via a local
pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer
(BCS) theory. We measure the free energy of the whole sample with respect to the
free energy of a reference state which allows us to define a BCS functional with
boundary conditions at infinity. Our main result is a lower bound for this energy
functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"
article_number: '081901'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
citation:
ama: Deuchert A. A lower bound for the BCS functional with boundary conditions at
infinity. Journal of Mathematical Physics. 2017;58(8). doi:10.1063/1.4996580
apa: Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions
at infinity. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/1.4996580
chicago: Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary
Conditions at Infinity.” Journal of Mathematical Physics. AIP Publishing,
2017. https://doi.org/10.1063/1.4996580.
ieee: A. Deuchert, “A lower bound for the BCS functional with boundary conditions
at infinity,” Journal of Mathematical Physics, vol. 58, no. 8. AIP Publishing,
2017.
ista: Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions
at infinity. Journal of Mathematical Physics. 58(8), 081901.
mla: Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions
at Infinity.” Journal of Mathematical Physics, vol. 58, no. 8, 081901,
AIP Publishing, 2017, doi:10.1063/1.4996580.
short: A. Deuchert, Journal of Mathematical Physics 58 (2017).
date_created: 2018-12-11T11:49:10Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2024-02-28T13:07:56Z
day: '01'
department:
- _id: RoSe
doi: 10.1063/1.4996580
ec_funded: 1
external_id:
isi:
- '000409197200015'
intvolume: ' 58'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.04616
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: ' Journal of Mathematical Physics'
publication_identifier:
issn:
- '00222488'
publication_status: published
publisher: AIP Publishing
publist_id: '6531'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A lower bound for the BCS functional with boundary conditions at infinity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2017'
...
---
_id: '914'
abstract:
- lang: eng
text: Infections with potentially lethal pathogens may negatively affect an individual’s
lifespan and decrease its reproductive value. The terminal investment hypothesis
predicts that individuals faced with a reduced survival should invest more into
reproduction instead of maintenance and growth. Several studies suggest that individuals
are indeed able to estimate their body condition and to increase their reproductive
effort with approaching death, while other studies gave ambiguous results. We
investigate whether queens of a perennial social insect (ant) are able to boost
their reproduction following infection with an obligate killing pathogen. Social
insect queens are special with regard to reproduction and aging, as they outlive
conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior,
fecundity increases with queen age. However, it remained unclear whether this
reflects negative reproductive senescence or terminal investment in response to
approaching death. Here, we test whether queens of C. obscurior react to infection
with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying
rate. We show that a fungal infection triggers a reinforced investment in reproduction
in queens. This adjustment of the reproductive rate by ant queens is consistent
with predictions of the terminal investment hypothesis and is reported for the
first time in a social insect.
acknowledgement: We thank two anonymous reviewers for helpful suggestions on the manuscript.
article_number: '170547'
article_processing_charge: No
author:
- first_name: Julia
full_name: Giehr, Julia
last_name: Giehr
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Alexandra
full_name: Schrempf, Alexandra
last_name: Schrempf
citation:
ama: Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. Ant queens increase their
reproductive efforts after pathogen infection. Royal Society Open Science.
2017;4(7). doi:10.1098/rsos.170547
apa: Giehr, J., Grasse, A. V., Cremer, S., Heinze, J., & Schrempf, A. (2017).
Ant queens increase their reproductive efforts after pathogen infection. Royal
Society Open Science. Royal Society, The. https://doi.org/10.1098/rsos.170547
chicago: Giehr, Julia, Anna V Grasse, Sylvia Cremer, Jürgen Heinze, and Alexandra
Schrempf. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.”
Royal Society Open Science. Royal Society, The, 2017. https://doi.org/10.1098/rsos.170547.
ieee: J. Giehr, A. V. Grasse, S. Cremer, J. Heinze, and A. Schrempf, “Ant queens
increase their reproductive efforts after pathogen infection,” Royal Society
Open Science, vol. 4, no. 7. Royal Society, The, 2017.
ista: Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. 2017. Ant queens increase
their reproductive efforts after pathogen infection. Royal Society Open Science.
4(7), 170547.
mla: Giehr, Julia, et al. “Ant Queens Increase Their Reproductive Efforts after
Pathogen Infection.” Royal Society Open Science, vol. 4, no. 7, 170547,
Royal Society, The, 2017, doi:10.1098/rsos.170547.
short: J. Giehr, A.V. Grasse, S. Cremer, J. Heinze, A. Schrempf, Royal Society Open
Science 4 (2017).
date_created: 2018-12-11T11:49:10Z
date_published: 2017-07-05T00:00:00Z
date_updated: 2023-09-26T15:45:47Z
day: '05'
ddc:
- '576'
- '592'
department:
- _id: SyCr
doi: 10.1098/rsos.170547
external_id:
isi:
- '000406670000025'
file:
- access_level: open_access
checksum: 351ae5e7a37e6e7d9295cd41146c4190
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:24Z
date_updated: 2020-07-14T12:48:15Z
file_id: '4684'
file_name: IST-2017-849-v1+1_2017_Grasse_Cremer_AntQueens.pdf
file_size: 530412
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Royal Society Open Science
publication_identifier:
issn:
- '20545703'
publication_status: published
publisher: Royal Society, The
publist_id: '6527'
pubrep_id: '849'
quality_controlled: '1'
related_material:
record:
- id: '9853'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Ant queens increase their reproductive efforts after pathogen infection
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: 4
year: '2017'
...
---
_id: '915'
abstract:
- lang: eng
text: We propose a dual decomposition and linear program relaxation of the NP-hard
minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut
polytope, it is amenable to efficient optimization by message passing. Like other
polyhedral relaxations, it can be tightened efficiently by cutting planes. We
define an algorithm that alternates between message passing and efficient separation
of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art
algorithms based on linear programming, including algorithms written in the framework
of leading commercial software, as we show in experiments with large instances
of the problem from applications in computer vision, biomedical image analysis
and data mining.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bjoern
full_name: Andres, Bjoern
last_name: Andres
citation:
ama: 'Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut
problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530'
apa: 'Swoboda, P., & Andres, B. (2017). A message passing algorithm for the
minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR:
Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530'
chicago: Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the
Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.530.
ieee: 'P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost
multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition,
Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.'
ista: 'Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost
multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.'
mla: Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum
Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
short: P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-09-26T15:43:27Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.530
ec_funded: 1
external_id:
isi:
- '000418371405009'
file:
- access_level: open_access
checksum: 7e51dacefa693574581a32da3eff63dc
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:52:46Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5849'
file_name: Swoboda_A_Message_Passing_CVPR_2017_paper.pdf
file_size: 883264
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 4990-4999
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6526'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A message passing algorithm for the minimum cost multicut problem
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...