2022 IEEE Symposium on Security and Privacy.
Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:10.1109/sp46214.2022.9833584'
apa: 'Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., & Ren,
L. (2022). Practical asynchronous distributed key generation. In 2022 IEEE
Symposium on Security and Privacy (pp. 2518–2534). San Francisco, CA, United
States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/sp46214.2022.9833584'
chicago: Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris
Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In
2022 IEEE Symposium on Security and Privacy, 2518–34. Institute of Electrical
and Electronics Engineers, 2022. https://doi.org/10.1109/sp46214.2022.9833584.
ieee: S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical
asynchronous distributed key generation,” in 2022 IEEE Symposium on Security
and Privacy, San Francisco, CA, United States, 2022, pp. 2518–2534.
ista: 'Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical
asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy.
SP: Symposium on Security and Privacy, 2518–2534.'
mla: Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” 2022
IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics
Engineers, 2022, pp. 2518–34, doi:10.1109/sp46214.2022.9833584.
short: S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022
IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics
Engineers, 2022, pp. 2518–2534.
conference:
end_date: 2022-05-26
location: San Francisco, CA, United States
name: 'SP: Symposium on Security and Privacy'
start_date: 2022-05-23
date_created: 2023-01-16T10:06:11Z
date_published: 2022-07-27T00:00:00Z
date_updated: 2023-02-16T07:43:53Z
day: '27'
department:
- _id: ElKo
doi: 10.1109/sp46214.2022.9833584
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1591
month: '07'
oa: 1
oa_version: Preprint
page: 2518-2534
publication: 2022 IEEE Symposium on Security and Privacy
publication_identifier:
eisbn:
- '9781665413169'
eissn:
- 2375-1207
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical asynchronous distributed key generation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12303'
abstract:
- lang: eng
text: We construct for each choice of a quiver Q, a cohomology theory A, and a poset
P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple
groups and the loop Grassmannians of based quadratic forms. The addition of a
“dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated
by the program of introducing an inner cohomology theory in algebraic geometry
adequate for the Geometric Langlands program (Mirković, Some extensions of the
notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić
issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups
from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic
quantum groups, preprint. arxiv1708.01418).
acknowledgement: I.M. thanks Zhijie Dong for long-term discussions on the material
that entered this work. We thank Misha Finkelberg for pointing out errors in earlier
versions. His advice and his insistence have led to a much better paper. A part
of the writing was done at the conference at IST (Vienna) attended by all coauthors.
We therefore thank the organizers of the conference and the support of ERC Advanced
Grant Arithmetic and Physics of Higgs moduli spaces No. 320593. The work of I.M.
was partially supported by NSF grants. The work of Y.Y. was partially supported
by the Australian Research Council (ARC) via the award DE190101231. The work of
G.Z. was partially supported by ARC via the award DE190101222.
alternative_title:
- Trends in Mathematics
article_processing_charge: No
author:
- first_name: Ivan
full_name: Mirković, Ivan
last_name: Mirković
- first_name: Yaping
full_name: Yang, Yaping
last_name: Yang
- first_name: Gufang
full_name: Zhao, Gufang
id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
last_name: Zhao
citation:
ama: 'Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum
Groups. In: Baranovskky V, Guay N, Schedler T, eds. Representation Theory and
Algebraic Geometry. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392.
doi:10.1007/978-3-030-82007-7_8'
apa: 'Mirković, I., Yang, Y., & Zhao, G. (2022). Loop Grassmannians of Quivers
and Affine Quantum Groups. In V. Baranovskky, N. Guay, & T. Schedler (Eds.),
Representation Theory and Algebraic Geometry (1st ed., pp. 347–392). Cham:
Springer Nature; Birkhäuser. https://doi.org/10.1007/978-3-030-82007-7_8'
chicago: 'Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers
and Affine Quantum Groups.” In Representation Theory and Algebraic Geometry,
edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92.
TM. Cham: Springer Nature; Birkhäuser, 2022. https://doi.org/10.1007/978-3-030-82007-7_8.'
ieee: 'I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine
Quantum Groups,” in Representation Theory and Algebraic Geometry, 1st ed.,
V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser,
2022, pp. 347–392.'
ista: 'Mirković I, Yang Y, Zhao G. 2022.Loop Grassmannians of Quivers and Affine
Quantum Groups. In: Representation Theory and Algebraic Geometry. Trends in Mathematics,
, 347–392.'
mla: Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.”
Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky
et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:10.1007/978-3-030-82007-7_8.
short: I. Mirković, Y. Yang, G. Zhao, in:, V. Baranovskky, N. Guay, T. Schedler
(Eds.), Representation Theory and Algebraic Geometry, 1st ed., Springer Nature;
Birkhäuser, Cham, 2022, pp. 347–392.
date_created: 2023-01-16T10:06:41Z
date_published: 2022-06-16T00:00:00Z
date_updated: 2023-01-27T07:07:31Z
day: '16'
department:
- _id: TaHa
doi: 10.1007/978-3-030-82007-7_8
ec_funded: 1
edition: '1'
editor:
- first_name: Vladimir
full_name: Baranovskky, Vladimir
last_name: Baranovskky
- first_name: Nicolas
full_name: Guay, Nicolas
last_name: Guay
- first_name: Travis
full_name: Schedler, Travis
last_name: Schedler
external_id:
arxiv:
- '1810.10095'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1810.10095
month: '06'
oa: 1
oa_version: Preprint
page: 347-392
place: Cham
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Representation Theory and Algebraic Geometry
publication_identifier:
eisbn:
- '9783030820077'
eissn:
- 2297-024X
isbn:
- '9783030820060'
issn:
- 2297-0215
publication_status: published
publisher: Springer Nature; Birkhäuser
quality_controlled: '1'
scopus_import: '1'
series_title: TM
status: public
title: Loop Grassmannians of Quivers and Affine Quantum Groups
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12508'
abstract:
- lang: eng
text: "We explore the notion of history-determinism in the context of timed automata
(TA). History-deterministic automata are those in which nondeterminism can be
resolved on the fly, based on the run constructed thus far. History-determinism
is a robust property that admits different game-based characterisations, and history-deterministic
specifications allow for game-based verification without an expensive determinization
step.\r\nWe show yet another characterisation of history-determinism in terms
of fair simulation, at the general level of labelled transition systems: a system
is history-deterministic precisely if and only if it fairly simulates all language
smaller systems.\r\nFor timed automata over infinite timed words it is known that
universality is undecidable for Büchi TA. We show that for history-deterministic
TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis
all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with
safety or reachability acceptance, we show that checking whether such an automaton
is history-deterministic is decidable (in ExpTime), and history-deterministic
TA with safety acceptance are effectively determinizable without introducing new
automata states."
acknowledgement: "Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG
101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n"
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- 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: Karoliina
full_name: Lehtinen, Karoliina
last_name: Lehtinen
- first_name: Patrick
full_name: Totzke, Patrick
last_name: Totzke
citation:
ama: 'Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata.
In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14'
apa: 'Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic
timed automata. In 33rd International Conference on Concurrency Theory
(Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14'
chicago: Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic
Timed Automata.” In 33rd International Conference on Concurrency Theory,
243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14.
ieee: T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed
automata,” in 33rd International Conference on Concurrency Theory, Warsaw,
Poland, 2022, vol. 243, p. 14:1-14:21.
ista: 'Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata.
33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 243, 14:1-14:21.'
mla: Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” 33rd
International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14.
short: T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
p. 14:1-14:21.
conference:
end_date: 2022-09-16
location: Warsaw, Poland
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2022-09-13
date_created: 2023-02-05T17:24:23Z
date_published: 2022-09-06T00:00:00Z
date_updated: 2023-02-06T09:23:31Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2022.14
ec_funded: 1
file:
- access_level: open_access
checksum: 9e97e15628f66b2ad77f535bb0327dee
content_type: application/pdf
creator: dernst
date_created: 2023-02-06T09:21:09Z
date_updated: 2023-02-06T09:21:09Z
file_id: '12520'
file_name: 2022_LIPICs_Henzinger2.pdf
file_size: 717940
relation: main_file
success: 1
file_date_updated: 2023-02-06T09:21:09Z
has_accepted_license: '1'
intvolume: ' 243'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 14:1-14:21
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 33rd International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959772464'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: History-deterministic timed automata
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: 243
year: '2022'
...
---
_id: '12509'
abstract:
- lang: eng
text: A graph game is a two-player zero-sum game in which the players move a token
throughout a graph to produce an infinite path, which determines the winner or
payoff of the game. In bidding games, both players have budgets, and in each turn,
we hold an "auction" (bidding) to determine which player moves the token. In this
survey, we consider several bidding mechanisms and their effect on the properties
of the game. Specifically, bidding games, and in particular bidding games of infinite
duration, have an intriguing equivalence with random-turn games in which in each
turn, the player who moves is chosen randomly. We summarize how minor changes
in the bidding mechanism lead to unexpected differences in the equivalence with
random-turn games.
acknowledgement: "Guy Avni: Work partially supported by the Israel Science Foundation,
ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported
in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators
Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný,
Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful
for you as it was for us."
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th
International Symposium on Mathematical Foundations of Computer Science. Vol
241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3'
apa: 'Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games
on graphs. In 47th International Symposium on Mathematical Foundations of Computer
Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3'
chicago: 'Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games
on Graphs.” In 47th International Symposium on Mathematical Foundations of
Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3.'
ieee: G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,”
in 47th International Symposium on Mathematical Foundations of Computer Science,
Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.
ista: 'Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs.
47th International Symposium on Mathematical Foundations of Computer Science.
MFCS: Symposium on Mathematical Foundations of Computer ScienceLeibniz International
Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.'
mla: Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on
Graphs.” 47th International Symposium on Mathematical Foundations of Computer
Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.
short: G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical
Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
Dagstuhl, Germany, 2022, p. 3:1-3:6.
conference:
end_date: 2022-08-26
location: Vienna, Austria
name: 'MFCS: Symposium on Mathematical Foundations of Computer Science'
start_date: 2022-08-22
date_created: 2023-02-05T17:26:01Z
date_published: 2022-08-22T00:00:00Z
date_updated: 2023-02-06T09:16:54Z
day: '22'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2022.3
ec_funded: 1
file:
- access_level: open_access
checksum: 1888ec9421622f9526fbec2de035f132
content_type: application/pdf
creator: dernst
date_created: 2023-02-06T09:13:04Z
date_updated: 2023-02-06T09:13:04Z
file_id: '12519'
file_name: 2022_LIPICs_Avni.pdf
file_size: 624586
relation: main_file
success: 1
file_date_updated: 2023-02-06T09:13:04Z
has_accepted_license: '1'
intvolume: ' 241'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 3:1-3:6
place: Dagstuhl, Germany
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 47th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959772563'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: An updated survey of bidding games on graphs
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: 241
year: '2022'
...
---
_id: '12540'
abstract:
- lang: eng
text: We consider the problem of signal estimation in generalized linear models
defined via rotationally invariant design matrices. Since these matrices can have
an arbitrary spectral distribution, this model is well suited for capturing complex
correlation structures which often arise in applications. We propose a novel family
of approximate message passing (AMP) algorithms for signal estimation, and rigorously
characterize their performance in the high-dimensional limit via a state evolution
recursion. Our rotationally invariant AMP has complexity of the same order as
the existing AMP derived under the restrictive assumption of a Gaussian design;
our algorithm also recovers this existing AMP as a special case. Numerical results
showcase a performance close to Vector AMP (which is conjectured to be Bayes-optimal
in some settings), but obtained with a much lower complexity, as the proposed
algorithm does not require a computationally expensive singular value decomposition.
acknowledgement: The authors would like to thank the anonymous reviewers for their
helpful comments. KK and MM were partially supported by the 2019 Lopez-Loreta Prize.
article_number: '22'
article_processing_charge: No
author:
- first_name: Ramji
full_name: Venkataramanan, Ramji
last_name: Venkataramanan
- first_name: Kevin
full_name: Kögler, Kevin
id: 94ec913c-dc85-11ea-9058-e5051ab2428b
last_name: Kögler
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Venkataramanan R, Kögler K, Mondelli M. Estimation in rotationally invariant
generalized linear models via approximate message passing. In: Proceedings
of the 39th International Conference on Machine Learning. Vol 162. ML Research
Press; 2022.'
apa: 'Venkataramanan, R., Kögler, K., & Mondelli, M. (2022). Estimation in rotationally
invariant generalized linear models via approximate message passing. In Proceedings
of the 39th International Conference on Machine Learning (Vol. 162). Baltimore,
MD, United States: ML Research Press.'
chicago: Venkataramanan, Ramji, Kevin Kögler, and Marco Mondelli. “Estimation in
Rotationally Invariant Generalized Linear Models via Approximate Message Passing.”
In Proceedings of the 39th International Conference on Machine Learning,
Vol. 162. ML Research Press, 2022.
ieee: R. Venkataramanan, K. Kögler, and M. Mondelli, “Estimation in rotationally
invariant generalized linear models via approximate message passing,” in Proceedings
of the 39th International Conference on Machine Learning, Baltimore, MD, United
States, 2022, vol. 162.
ista: 'Venkataramanan R, Kögler K, Mondelli M. 2022. Estimation in rotationally
invariant generalized linear models via approximate message passing. Proceedings
of the 39th International Conference on Machine Learning. ICML: International
Conference on Machine Learning vol. 162, 22.'
mla: Venkataramanan, Ramji, et al. “Estimation in Rotationally Invariant Generalized
Linear Models via Approximate Message Passing.” Proceedings of the 39th International
Conference on Machine Learning, vol. 162, 22, ML Research Press, 2022.
short: R. Venkataramanan, K. Kögler, M. Mondelli, in:, Proceedings of the 39th International
Conference on Machine Learning, ML Research Press, 2022.
conference:
end_date: 2022-07-23
location: Baltimore, MD, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2022-07-17
date_created: 2023-02-10T13:49:04Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2023-02-13T10:54:58Z
ddc:
- '000'
department:
- _id: MaMo
file:
- access_level: open_access
checksum: 67436eb0a660789514cdf9db79e84683
content_type: application/pdf
creator: dernst
date_created: 2023-02-13T10:53:11Z
date_updated: 2023-02-13T10:53:11Z
file_id: '12547'
file_name: 2022_PMLR_Venkataramanan.pdf
file_size: 2341343
relation: main_file
success: 1
file_date_updated: 2023-02-13T10:53:11Z
has_accepted_license: '1'
intvolume: ' 162'
language:
- iso: eng
oa: 1
oa_version: Published Version
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 39th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: Estimation in rotationally invariant generalized linear models via approximate
message passing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 162
year: '2022'
...
---
_id: '12536'
abstract:
- lang: eng
text: 'We consider the problem of estimating a rank-1 signal corrupted by structured
rotationally invariant noise, and address the following question: how well do
inference algorithms perform when the noise statistics is unknown and hence Gaussian
noise is assumed? While the matched Bayes-optimal setting with unstructured noise
is well understood, the analysis of this mismatched problem is only at its premises.
In this paper, we make a step towards understanding the effect of the strong source
of mismatch which is the noise statistics. Our main technical contribution is
the rigorous analysis of a Bayes estimator and of an approximate message passing
(AMP) algorithm, both of which incorrectly assume a Gaussian setup. The first
result exploits the theory of spherical integrals and of low-rank matrix perturbations;
the idea behind the second one is to design and analyze an artificial AMP which,
by taking advantage of the flexibility in the denoisers, is able to "correct"
the mismatch. Armed with these sharp asymptotic characterizations, we unveil a
rich and often unexpected phenomenology. For example, despite AMP is in principle
designed to efficiently compute the Bayes estimator, the former is outperformed
by the latter in terms of mean-square error. We show that this performance gap
is due to an incorrect estimation of the signal norm. In fact, when the SNR is
large enough, the overlaps of the AMP and the Bayes estimator coincide, and they
even match those of optimal estimators taking into account the structure of the
noise.'
article_number: '2205.10009'
article_processing_charge: No
author:
- first_name: Jean
full_name: Barbier, Jean
last_name: Barbier
- first_name: TianQi
full_name: Hou, TianQi
last_name: Hou
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Manuel
full_name: Saenz, Manuel
last_name: Saenz
citation:
ama: 'Barbier J, Hou T, Mondelli M, Saenz M. The price of ignorance: How much does
it cost to forget noise structure in low-rank matrix estimation? arXiv.
doi:10.48550/arXiv.2205.10009'
apa: 'Barbier, J., Hou, T., Mondelli, M., & Saenz, M. (n.d.). The price of ignorance:
How much does it cost to forget noise structure in low-rank matrix estimation?
arXiv. https://doi.org/10.48550/arXiv.2205.10009'
chicago: 'Barbier, Jean, TianQi Hou, Marco Mondelli, and Manuel Saenz. “The Price
of Ignorance: How Much Does It Cost to Forget Noise Structure in Low-Rank Matrix
Estimation?” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.10009.'
ieee: 'J. Barbier, T. Hou, M. Mondelli, and M. Saenz, “The price of ignorance: How
much does it cost to forget noise structure in low-rank matrix estimation?,” arXiv.
.'
ista: 'Barbier J, Hou T, Mondelli M, Saenz M. The price of ignorance: How much does
it cost to forget noise structure in low-rank matrix estimation? arXiv, 2205.10009.'
mla: 'Barbier, Jean, et al. “The Price of Ignorance: How Much Does It Cost to Forget
Noise Structure in Low-Rank Matrix Estimation?” ArXiv, 2205.10009, doi:10.48550/arXiv.2205.10009.'
short: J. Barbier, T. Hou, M. Mondelli, M. Saenz, ArXiv (n.d.).
date_created: 2023-02-10T13:45:41Z
date_published: 2022-05-20T00:00:00Z
date_updated: 2023-02-16T09:41:25Z
day: '20'
department:
- _id: MaMo
doi: 10.48550/arXiv.2205.10009
external_id:
arxiv:
- '2205.10009'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2205.10009
month: '05'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: accepted
status: public
title: 'The price of ignorance: How much does it cost to forget noise structure in
low-rank matrix estimation?'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12568'
abstract:
- lang: eng
text: We treat the problem of risk-aware control for stochastic shortest path (SSP)
on Markov decision processes (MDP). Typically, expectation is considered for SSP,
which however is oblivious to the incurred risk. We present an alternative view,
instead optimizing conditional value-at-risk (CVaR), an established risk measure.
We treat both Markov chains as well as MDP and introduce, through novel insights,
two algorithms, based on linear programming and value iteration, respectively.
Both algorithms offer precise and provably correct solutions. Evaluation of our
prototype implementation shows that risk-aware control is feasible on several
moderately sized models.
article_processing_charge: No
author:
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
citation:
ama: 'Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of
the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association
for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222'
apa: 'Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36,
pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence.
https://doi.org/10.1609/aaai.v36i9.21222'
chicago: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 36:9858–67.
Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i9.21222.
ieee: T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual,
2022, vol. 36, no. 9, pp. 9858–9867.
ista: Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of
the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on
Artificial Intelligence vol. 36, 9858–9867.
mla: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” Proceedings
of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36,
no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67,
doi:10.1609/aaai.v36i9.21222.
short: T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial
Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence,
2022, pp. 9858–9867.
conference:
end_date: 2022-03-01
location: Virtual
name: Conference on Artificial Intelligence
start_date: 2022-02-22
date_created: 2023-02-19T23:00:56Z
date_published: 2022-06-28T00:00:00Z
date_updated: 2023-02-20T07:19:12Z
day: '28'
department:
- _id: KrCh
doi: 10.1609/aaai.v36i9.21222
external_id:
arxiv:
- '2203.01640'
intvolume: ' 36'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2203.01640'
month: '06'
oa: 1
oa_version: Preprint
page: 9858-9867
publication: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI
2022
publication_identifier:
eissn:
- 2374-3468
isbn:
- '1577358767'
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: Risk-aware stochastic shortest path
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2022'
...
---
_id: '12660'
abstract:
- lang: eng
text: 'We present Cross-Client Label Propagation(XCLP), a new method for transductive
federated learning. XCLP estimates a data graph jointly from the data of multiple
clients and computes labels for the unlabeled data by propagating label information
across the graph. To avoid clients having to share their data with anyone, XCLP
employs two cryptographically secure protocols: secure Hamming distance computation
and secure summation. We demonstrate two distinct applications of XCLP within
federated learning. In the first, we use it in a one-shot way to predict labels
for unseen test points. In the second, we use it to repeatedly pseudo-label unlabeled
training data in a federated semi-supervised setting. Experiments on both real
federated and standard benchmark datasets show that in both applications XCLP
achieves higher classification accuracy than alternative approaches.'
article_number: '2210.06434'
article_processing_charge: No
author:
- first_name: Jonathan A
full_name: Scott, Jonathan A
id: e499926b-f6e0-11ea-865d-9c63db0031e8
last_name: Scott
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Scott JA, Yeo MX, Lampert C. Cross-client Label Propagation for transductive
federated learning. arXiv. doi:10.48550/arXiv.2210.06434
apa: Scott, J. A., Yeo, M. X., & Lampert, C. (n.d.). Cross-client Label Propagation
for transductive federated learning. arXiv. https://doi.org/10.48550/arXiv.2210.06434
chicago: Scott, Jonathan A, Michelle X Yeo, and Christoph Lampert. “Cross-Client
Label Propagation for Transductive Federated Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2210.06434.
ieee: J. A. Scott, M. X. Yeo, and C. Lampert, “Cross-client Label Propagation for
transductive federated learning,” arXiv. .
ista: Scott JA, Yeo MX, Lampert C. Cross-client Label Propagation for transductive
federated learning. arXiv, 2210.06434.
mla: Scott, Jonathan A., et al. “Cross-Client Label Propagation for Transductive
Federated Learning.” ArXiv, 2210.06434, doi:10.48550/arXiv.2210.06434.
short: J.A. Scott, M.X. Yeo, C. Lampert, ArXiv (n.d.).
date_created: 2023-02-20T08:21:50Z
date_published: 2022-10-12T00:00:00Z
date_updated: 2023-02-21T08:20:18Z
day: '12'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.48550/arXiv.2210.06434
external_id:
arxiv:
- '2210.06434'
file:
- access_level: open_access
checksum: 7ab20543fd4393f14fb857ce2e4f03c6
content_type: application/pdf
creator: chl
date_created: 2023-02-20T08:21:35Z
date_updated: 2023-02-20T08:21:35Z
file_id: '12661'
file_name: 2210.06434.pdf
file_size: 291893
relation: main_file
success: 1
file_date_updated: 2023-02-20T08:21:35Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Cross-client Label Propagation for transductive federated learning
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12662'
abstract:
- lang: eng
text: 'Modern machine learning tasks often require considering not just one but
multiple objectives. For example, besides the prediction quality, this could be
the efficiency, robustness or fairness of the learned models, or any of their
combinations. Multi-objective learning offers a natural framework for handling
such problems without having to commit to early trade-offs. Surprisingly, statistical
learning theory so far offers almost no insight into the generalization properties
of multi-objective learning. In this work, we make first steps to fill this gap:
we establish foundational generalization bounds for the multi-objective setting
as well as generalization and excess bounds for learning with scalarizations.
We also provide the first theoretical analysis of the relation between the Pareto-optimal
sets of the true objectives and the Pareto-optimal sets of their empirical approximations
from training data. In particular, we show a surprising asymmetry: all Pareto-optimal
solutions can be approximated by empirically Pareto-optimal ones, but not vice
versa.'
article_number: '2208.13499'
article_processing_charge: No
author:
- first_name: Peter
full_name: Súkeník, Peter
id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
last_name: Súkeník
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Súkeník P, Lampert C. Generalization in Multi-objective machine learning. arXiv.
doi:10.48550/arXiv.2208.13499
apa: Súkeník, P., & Lampert, C. (n.d.). Generalization in Multi-objective machine
learning. arXiv. https://doi.org/10.48550/arXiv.2208.13499
chicago: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective
Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2208.13499.
ieee: P. Súkeník and C. Lampert, “Generalization in Multi-objective machine learning,”
arXiv. .
ista: Súkeník P, Lampert C. Generalization in Multi-objective machine learning.
arXiv, 2208.13499.
mla: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine
Learning.” ArXiv, 2208.13499, doi:10.48550/arXiv.2208.13499.
short: P. Súkeník, C. Lampert, ArXiv (n.d.).
date_created: 2023-02-20T08:23:06Z
date_published: 2022-08-29T00:00:00Z
date_updated: 2023-02-21T08:24:55Z
day: '29'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.48550/arXiv.2208.13499
external_id:
arxiv:
- '2208.13499'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2208.13499'
month: '08'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Generalization in Multi-objective machine learning
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12664'
abstract:
- lang: eng
text: Randomized smoothing is currently considered the state-of-the-art method to
obtain certifiably robust classifiers. Despite its remarkable performance, the
method is associated with various serious problems such as “certified accuracy
waterfalls”, certification vs. accuracy trade-off, or even fairness issues. Input-dependent
smoothing approaches have been proposed with intention of overcoming these flaws.
However, we demonstrate that these methods lack formal guarantees and so the resulting
certificates are not justified. We show that in general, the input-dependent smoothing
suffers from the curse of dimensionality, forcing the variance function to have
low semi-elasticity. On the other hand, we provide a theoretical and practical
framework that enables the usage of input-dependent smoothing even in the presence
of the curse of dimensionality, under strict restrictions. We present one concrete
design of the smoothing variance function and test it on CIFAR10 and MNIST. Our
design mitigates some of the problems of classical smoothing and is formally underlined,
yet further improvement of the design is still necessary.
article_processing_charge: No
author:
- first_name: Peter
full_name: Súkeník, Peter
id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
last_name: Súkeník
- first_name: Aleksei
full_name: Kuvshinov, Aleksei
last_name: Kuvshinov
- first_name: Stephan
full_name: Günnemann, Stephan
last_name: Günnemann
citation:
ama: 'Súkeník P, Kuvshinov A, Günnemann S. Intriguing properties of input-dependent
randomized smoothing. In: Proceedings of the 39th International Conference
on Machine Learning. Vol 162. ML Research Press; 2022:20697-20743.'
apa: 'Súkeník, P., Kuvshinov, A., & Günnemann, S. (2022). Intriguing properties
of input-dependent randomized smoothing. In Proceedings of the 39th International
Conference on Machine Learning (Vol. 162, pp. 20697–20743). Baltimore, MD,
United States: ML Research Press.'
chicago: Súkeník, Peter, Aleksei Kuvshinov, and Stephan Günnemann. “Intriguing Properties
of Input-Dependent Randomized Smoothing.” In Proceedings of the 39th International
Conference on Machine Learning, 162:20697–743. ML Research Press, 2022.
ieee: P. Súkeník, A. Kuvshinov, and S. Günnemann, “Intriguing properties of input-dependent
randomized smoothing,” in Proceedings of the 39th International Conference
on Machine Learning, Baltimore, MD, United States, 2022, vol. 162, pp. 20697–20743.
ista: Súkeník P, Kuvshinov A, Günnemann S. 2022. Intriguing properties of input-dependent
randomized smoothing. Proceedings of the 39th International Conference on Machine
Learning. International Conference on Machine Learning vol. 162, 20697–20743.
mla: Súkeník, Peter, et al. “Intriguing Properties of Input-Dependent Randomized
Smoothing.” Proceedings of the 39th International Conference on Machine Learning,
vol. 162, ML Research Press, 2022, pp. 20697–743.
short: P. Súkeník, A. Kuvshinov, S. Günnemann, in:, Proceedings of the 39th International
Conference on Machine Learning, ML Research Press, 2022, pp. 20697–20743.
conference:
end_date: 2022-07-23
location: Baltimore, MD, United States
name: International Conference on Machine Learning
start_date: 2022-07-17
date_created: 2023-02-20T08:30:21Z
date_published: 2022-07-19T00:00:00Z
date_updated: 2023-02-23T10:03:47Z
day: '19'
ddc:
- '004'
external_id:
arxiv:
- '2110.05365'
file:
- access_level: open_access
checksum: ab8695b1e24fb4fef4f1f9cd63ca8238
content_type: application/pdf
creator: chl
date_created: 2023-02-20T08:30:10Z
date_updated: 2023-02-20T08:30:10Z
file_id: '12665'
file_name: sukeni-k22a.pdf
file_size: 8470811
relation: main_file
success: 1
file_date_updated: 2023-02-20T08:30:10Z
has_accepted_license: '1'
intvolume: ' 162'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 20697-20743
publication: Proceedings of the 39th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intriguing properties of input-dependent randomized smoothing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 162
year: '2022'
...
---
_id: '12495'
abstract:
- lang: eng
text: "Fairness-aware learning aims at constructing classifiers that not only make
accurate predictions, but also do not discriminate against specific groups. It
is a fast-growing area of\r\nmachine learning with far-reaching societal impact.
However, existing fair learning methods\r\nare vulnerable to accidental or malicious
artifacts in the training data, which can cause\r\nthem to unknowingly produce
unfair classifiers. In this work we address the problem of\r\nfair learning from
unreliable training data in the robust multisource setting, where the\r\navailable
training data comes from multiple sources, a fraction of which might not be representative
of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat
identifies and suppresses those data sources that would have a negative impact
on\r\nfairness or accuracy if they were used for training. As such, FLEA is not
a replacement of\r\nprior fairness-aware learning methods but rather an augmentation
that makes any of them\r\nrobust against unreliable training data. We show the
effectiveness of our approach by a\r\ndiverse range of experiments on multiple
datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects
the learner against corruptions as long as the fraction of\r\naffected data sources
is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: 'The authors would like to thank Bernd Prach, Elias Frantar, Alexandra
Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research
was supported by the Scientific Service Units (SSU) of IST Austria through resources
provided by Scientific Computing (SciComp). This publication was made possible by
an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia
Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. '
article_processing_charge: No
article_type: original
author:
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource
learning from unreliable training data. Transactions on Machine Learning Research.
2022.'
apa: 'Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably
robust fair multisource learning from unreliable training data. Transactions
on Machine Learning Research. ML Research Press.'
chicago: 'Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA:
Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions
on Machine Learning Research. ML Research Press, 2022.'
ieee: 'E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust
fair multisource learning from unreliable training data,” Transactions on Machine
Learning Research. ML Research Press, 2022.'
ista: 'Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair
multisource learning from unreliable training data. Transactions on Machine Learning
Research.'
mla: 'Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning
from Unreliable Training Data.” Transactions on Machine Learning Research,
ML Research Press, 2022.'
short: E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning
Research (2022).
date_created: 2023-02-02T20:29:57Z
date_published: 2022-12-22T00:00:00Z
date_updated: 2023-02-23T10:30:54Z
day: '22'
ddc:
- '000'
department:
- _id: ChLa
external_id:
arxiv:
- '2106.11732'
file:
- access_level: open_access
checksum: 97c8a8470759cab597abb973ca137a3b
content_type: application/pdf
creator: dernst
date_created: 2023-02-23T10:30:04Z
date_updated: 2023-02-23T10:30:04Z
file_id: '12673'
file_name: 2022_TMLR_Iofinova.pdf
file_size: 1948063
relation: main_file
success: 1
file_date_updated: 2023-02-23T10:30:04Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=XsPopigZXV
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: ' W1260-N35'
name: Vienna Graduate School on Computational Optimization
publication: Transactions on Machine Learning Research
publication_identifier:
issn:
- 2835-8856
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- description: source code
relation: software
url: https://github.com/ISTAustria-CVML/FLEA
status: public
title: 'FLEA: Provably robust fair multisource learning from unreliable training data'
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
year: '2022'
...
---
_id: '11938'
abstract:
- lang: eng
text: A matching is compatible to two or more labeled point sets of size n with
labels {1, . . . , n} if its straight-line drawing on each of these point sets
is crossing-free. We study the maximum number of edges in a matching compatible
to two or more labeled point sets in general position in the plane. We show that
for any two labeled sets of n points in convex position there exists a compatible
matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets
we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound,
we use probabilistic arguments to show that for any ℓ given sets of n points there
exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1))
edges. Finally, we show that Θ(log n) copies of any set of n points are necessary
and sufficient for the existence of labelings of these point sets such that any
compatible matching consists only of a single edge.
acknowledgement: 'A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411.
Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative
DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported
by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by
ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23
(RiSE).'
article_processing_charge: No
article_type: original
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- 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: Irene
full_name: Parada, Irene
last_name: Parada
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Alexander
full_name: Pilz, Alexander
last_name: Pilz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings.
Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591
apa: Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph
Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591
chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
Matchings.” Journal of Graph Algorithms and Applications. Brown University,
2022. https://doi.org/10.7155/jgaa.00591.
ieee: O. Aichholzer et al., “On compatible matchings,” Journal of Graph
Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240,
2022.
ista: Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec
J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and
Applications. 26(2), 225–240.
mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms
and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.
short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz,
J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022)
225–240.
date_created: 2022-08-21T22:01:56Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2023-02-23T13:54:21Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
- _id: HeEd
- _id: KrCh
doi: 10.7155/jgaa.00591
ec_funded: 1
external_id:
arxiv:
- '2101.03928'
file:
- access_level: open_access
checksum: dc6e255e3558faff924fd9e370886c11
content_type: application/pdf
creator: dernst
date_created: 2022-08-22T06:42:42Z
date_updated: 2022-08-22T06:42:42Z
file_id: '11940'
file_name: 2022_JourGraphAlgorithmsApplic_Aichholzer.pdf
file_size: 694538
relation: main_file
success: 1
file_date_updated: 2022-08-22T06:42:42Z
has_accepted_license: '1'
intvolume: ' 26'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 225-240
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Brown University
quality_controlled: '1'
related_material:
record:
- id: '9296'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On compatible matchings
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: 26
year: '2022'
...
---
_id: '10706'
abstract:
- lang: eng
text: This is a collection of problems composed by some participants of the workshop
“Differential Geometry, Billiards, and Geometric Optics” that took place at CIRM
on October 4–8, 2021.
article_processing_charge: No
article_type: original
author:
- first_name: Misha
full_name: Bialy, Misha
last_name: Bialy
- first_name: Corentin
full_name: Fiorebe, Corentin
id: 06619f18-9070-11eb-847d-d1ee780bd88b
last_name: Fiorebe
- first_name: Alexey
full_name: Glutsyuk, Alexey
last_name: Glutsyuk
- first_name: Mark
full_name: Levi, Mark
last_name: Levi
- first_name: Alexander
full_name: Plakhov, Alexander
last_name: Plakhov
- first_name: Serge
full_name: Tabachnikov, Serge
last_name: Tabachnikov
citation:
ama: Bialy M, Fiorebe C, Glutsyuk A, Levi M, Plakhov A, Tabachnikov S. Open problems
on billiards and geometric optics. Arnold Mathematical Journal. 2022;8:411-422.
doi:10.1007/s40598-022-00198-y
apa: 'Bialy, M., Fiorebe, C., Glutsyuk, A., Levi, M., Plakhov, A., & Tabachnikov,
S. (2022). Open problems on billiards and geometric optics. Arnold Mathematical
Journal. Hybrid: Springer Nature. https://doi.org/10.1007/s40598-022-00198-y'
chicago: Bialy, Misha, Corentin Fiorebe, Alexey Glutsyuk, Mark Levi, Alexander Plakhov,
and Serge Tabachnikov. “Open Problems on Billiards and Geometric Optics.” Arnold
Mathematical Journal. Springer Nature, 2022. https://doi.org/10.1007/s40598-022-00198-y.
ieee: M. Bialy, C. Fiorebe, A. Glutsyuk, M. Levi, A. Plakhov, and S. Tabachnikov,
“Open problems on billiards and geometric optics,” Arnold Mathematical Journal,
vol. 8. Springer Nature, pp. 411–422, 2022.
ista: Bialy M, Fiorebe C, Glutsyuk A, Levi M, Plakhov A, Tabachnikov S. 2022. Open
problems on billiards and geometric optics. Arnold Mathematical Journal. 8, 411–422.
mla: Bialy, Misha, et al. “Open Problems on Billiards and Geometric Optics.” Arnold
Mathematical Journal, vol. 8, Springer Nature, 2022, pp. 411–22, doi:10.1007/s40598-022-00198-y.
short: M. Bialy, C. Fiorebe, A. Glutsyuk, M. Levi, A. Plakhov, S. Tabachnikov, Arnold
Mathematical Journal 8 (2022) 411–422.
conference:
end_date: 2021-10-08
location: Hybrid
name: 'CIRM: Centre International de Rencontres Mathématiques'
start_date: 2021-10-04
date_created: 2022-01-30T23:01:34Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2023-02-27T07:34:08Z
day: '01'
department:
- _id: VaKa
doi: 10.1007/s40598-022-00198-y
external_id:
arxiv:
- '2110.10750'
intvolume: ' 8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2110.10750
month: '10'
oa: 1
oa_version: Preprint
page: 411-422
publication: Arnold Mathematical Journal
publication_identifier:
eissn:
- 2199-6806
issn:
- 2199-6792
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://conferences.cirm-math.fr/2383.html
scopus_import: '1'
status: public
title: Open problems on billiards and geometric optics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2022'
...
---
_id: '12677'
abstract:
- lang: eng
text: "In modern sample-driven Prophet Inequality, an adversary chooses a sequence
of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The
process follows in two phases. In the first phase (sampling phase), some items,
possibly selected at random, are revealed to the DM, but she can never accept
them. In the second phase, the DM is presented with the other items in a random
order and online fashion. For each item, she must make an irrevocable decision
to either accept the item and stop the process or reject the item forever and
proceed to the next item. The goal of the DM is to maximize the expected value
as compared to a Prophet (or offline algorithm) that has access to all information.
In this setting, the sampling phase has no cost and is not part of the optimization
process. However, in many scenarios, the samples are obtained as part of the decision-making
process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary
chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly
ordered. Finally, there are two phases of the Prophet Inequality problem with
the first n-items and the rest of the items, respectively. We show that some basic
algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves
a ratio of at least 0.495. Finally, we show that for every algorithm the ratio
it can achieve is at most 0.502. Hence our algorithm is near-optimal."
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant.
article_number: '2209.14368'
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: Mona
full_name: Mohammadi, Mona
id: 4363614d-b686-11ed-a7d5-ac9e4a24bc2e
last_name: Mohammadi
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
citation:
ama: Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with
near-optimal bounds. arXiv. doi:10.48550/ARXIV.2209.14368
apa: Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated
prophet inequality with near-optimal bounds. arXiv. https://doi.org/10.48550/ARXIV.2209.14368
chicago: Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta.
“Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2209.14368.
ieee: K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality
with near-optimal bounds,” arXiv. .
ista: Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality
with near-optimal bounds. arXiv, 2209.14368.
mla: Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal
Bounds.” ArXiv, 2209.14368, doi:10.48550/ARXIV.2209.14368.
short: K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).
date_created: 2023-02-24T12:21:40Z
date_published: 2022-09-28T00:00:00Z
date_updated: 2023-02-27T10:07:40Z
day: '28'
department:
- _id: GradSch
- _id: KrCh
doi: 10.48550/ARXIV.2209.14368
ec_funded: 1
external_id:
arxiv:
- '2209.14368'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2209.14368'
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: arXiv
publication_status: submitted
status: public
title: Repeated prophet inequality with near-optimal bounds
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12780'
abstract:
- lang: eng
text: "The ability to scale out training workloads has been one of the key performance
enablers of deep learning. The main scaling approach is data-parallel GPU-based
training, which has been boosted by hardware and software support for highly efficient
point-to-point communication, and in particular via hardware bandwidth over-provisioning.
Overprovisioning comes at a cost: there is an order of magnitude price difference
between \"cloud-grade\" servers with such support, relative to their popular \"consumer-grade\"
counterparts, although single server-grade and consumer-grade GPUs can have similar
computational envelopes.\r\n\r\nIn this paper, we show that the costly hardware
overprovisioning approach can be supplanted via algorithmic and system design,
and propose a framework called CGX, which provides efficient software support
for compressed communication in ML applications, for both multi-GPU single-node
training, as well as larger-scale multi-node training. CGX is based on two technical
advances: At the system level, it relies on a re-developed communication stack
for ML frameworks, which provides flexible, highly-efficient support for compressed
communication. At the application level, it provides seamless, parameter-free
integration with popular frameworks, so that end-users do not have to modify training
recipes, nor significant training code. This is complemented by a layer-wise adaptive
compression technique which dynamically balances compression gains with accuracy
preservation. CGX integrates with popular ML frameworks, providing up to 3X speedups
for multi-GPU nodes based on commodity hardware, and order-of-magnitude improvements
in the multi-node setting, with negligible impact on accuracy."
acknowledgement: The authors sincerely thank Nikoli Dryden, Tal Ben-Nun, Torsten Hoefler
and Bapi Chatterjee for useful discussions throughout the development of this project.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Hamidreza
full_name: Ramezanikebrya, Hamidreza
last_name: Ramezanikebrya
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Markov I, Ramezanikebrya H, Alistarh D-A. CGX: Adaptive system support for
communication-efficient deep learning. In: Proceedings of the 23rd ACM/IFIP
International Middleware Conference. Association for Computing Machinery;
2022:241-254. doi:10.1145/3528535.3565248'
apa: 'Markov, I., Ramezanikebrya, H., & Alistarh, D.-A. (2022). CGX: Adaptive
system support for communication-efficient deep learning. In Proceedings of
the 23rd ACM/IFIP International Middleware Conference (pp. 241–254). Quebec,
QC, Canada: Association for Computing Machinery. https://doi.org/10.1145/3528535.3565248'
chicago: 'Markov, Ilia, Hamidreza Ramezanikebrya, and Dan-Adrian Alistarh. “CGX:
Adaptive System Support for Communication-Efficient Deep Learning.” In Proceedings
of the 23rd ACM/IFIP International Middleware Conference, 241–54. Association
for Computing Machinery, 2022. https://doi.org/10.1145/3528535.3565248.'
ieee: 'I. Markov, H. Ramezanikebrya, and D.-A. Alistarh, “CGX: Adaptive system support
for communication-efficient deep learning,” in Proceedings of the 23rd ACM/IFIP
International Middleware Conference, Quebec, QC, Canada, 2022, pp. 241–254.'
ista: 'Markov I, Ramezanikebrya H, Alistarh D-A. 2022. CGX: Adaptive system support
for communication-efficient deep learning. Proceedings of the 23rd ACM/IFIP International
Middleware Conference. Middleware: International Middleware Conference, 241–254.'
mla: 'Markov, Ilia, et al. “CGX: Adaptive System Support for Communication-Efficient
Deep Learning.” Proceedings of the 23rd ACM/IFIP International Middleware Conference,
Association for Computing Machinery, 2022, pp. 241–54, doi:10.1145/3528535.3565248.'
short: I. Markov, H. Ramezanikebrya, D.-A. Alistarh, in:, Proceedings of the 23rd
ACM/IFIP International Middleware Conference, Association for Computing Machinery,
2022, pp. 241–254.
conference:
end_date: 2022-11-11
location: Quebec, QC, Canada
name: 'Middleware: International Middleware Conference'
start_date: 2022-11-07
date_created: 2023-03-31T06:17:00Z
date_published: 2022-11-01T00:00:00Z
date_updated: 2023-04-03T06:21:04Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3528535.3565248
external_id:
arxiv:
- '2111.08617'
file:
- access_level: open_access
checksum: 1a397746235f245da5468819247ff663
content_type: application/pdf
creator: dernst
date_created: 2023-04-03T06:17:58Z
date_updated: 2023-04-03T06:17:58Z
file_id: '12795'
file_name: 2022_ACMMiddleware_Markov.pdf
file_size: 1514169
relation: main_file
success: 1
file_date_updated: 2023-04-03T06:17:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 241-254
publication: Proceedings of the 23rd ACM/IFIP International Middleware Conference
publication_identifier:
isbn:
- '9781450393409'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: 'CGX: Adaptive system support for communication-efficient deep learning'
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
year: '2022'
...
---
_id: '12860'
abstract:
- lang: eng
text: 'Memorization of the relation between entities in a dataset can lead to privacy
issues when using a trained model for question answering. We introduce Relational
Memorization (RM) to understand, quantify and control this phenomenon. While bounding
general memorization can have detrimental effects on the performance of a trained
model, bounding RM does not prevent effective learning. The difference is most
pronounced when the data distribution is long-tailed, with many queries having
only few training examples: Impeding general memorization prevents effective learning,
while impeding only relational memorization still allows learning general properties
of the underlying concepts. We formalize the notion of Relational Privacy (RP)
and, inspired by Differential Privacy (DP), we provide a possible definition of
Differential Relational Privacy (DrP). These notions can be used to describe and
compute bounds on the amount of RM in a trained model. We illustrate Relational
Privacy concepts in experiments with large-scale models for Question Answering.'
article_number: '2203.16701'
article_processing_charge: No
author:
- first_name: Simone
full_name: Bombari, Simone
id: ca726dda-de17-11ea-bc14-f9da834f63aa
last_name: Bombari
- first_name: Alessandro
full_name: Achille, Alessandro
last_name: Achille
- first_name: Zijian
full_name: Wang, Zijian
last_name: Wang
- first_name: Yu-Xiang
full_name: Wang, Yu-Xiang
last_name: Wang
- first_name: Yusheng
full_name: Xie, Yusheng
last_name: Xie
- first_name: Kunwar Yashraj
full_name: Singh, Kunwar Yashraj
last_name: Singh
- first_name: Srikar
full_name: Appalaraju, Srikar
last_name: Appalaraju
- first_name: Vijay
full_name: Mahadevan, Vijay
last_name: Mahadevan
- first_name: Stefano
full_name: Soatto, Stefano
last_name: Soatto
citation:
ama: Bombari S, Achille A, Wang Z, et al. Towards differential relational privacy
and its use in question answering. arXiv. doi:10.48550/arXiv.2203.16701
apa: Bombari, S., Achille, A., Wang, Z., Wang, Y.-X., Xie, Y., Singh, K. Y., … Soatto,
S. (n.d.). Towards differential relational privacy and its use in question answering.
arXiv. https://doi.org/10.48550/arXiv.2203.16701
chicago: Bombari, Simone, Alessandro Achille, Zijian Wang, Yu-Xiang Wang, Yusheng
Xie, Kunwar Yashraj Singh, Srikar Appalaraju, Vijay Mahadevan, and Stefano Soatto.
“Towards Differential Relational Privacy and Its Use in Question Answering.” ArXiv,
n.d. https://doi.org/10.48550/arXiv.2203.16701.
ieee: S. Bombari et al., “Towards differential relational privacy and its
use in question answering,” arXiv. .
ista: Bombari S, Achille A, Wang Z, Wang Y-X, Xie Y, Singh KY, Appalaraju S, Mahadevan
V, Soatto S. Towards differential relational privacy and its use in question answering.
arXiv, 2203.16701.
mla: Bombari, Simone, et al. “Towards Differential Relational Privacy and Its Use
in Question Answering.” ArXiv, 2203.16701, doi:10.48550/arXiv.2203.16701.
short: S. Bombari, A. Achille, Z. Wang, Y.-X. Wang, Y. Xie, K.Y. Singh, S. Appalaraju,
V. Mahadevan, S. Soatto, ArXiv (n.d.).
date_created: 2023-04-23T16:11:48Z
date_published: 2022-03-30T00:00:00Z
date_updated: 2023-04-25T07:34:49Z
day: '30'
department:
- _id: GradSch
- _id: MaMo
doi: 10.48550/arXiv.2203.16701
external_id:
arxiv:
- '2203.16701'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2203.16701
month: '03'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Towards differential relational privacy and its use in question answering
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '10788'
abstract:
- lang: eng
text: "We determine an asymptotic formula for the number of integral points of\r\nbounded
height on a certain toric variety, which is incompatible with part of a\r\npreprint
by Chambert-Loir and Tschinkel. We provide an alternative\r\ninterpretation of
the asymptotic formula we get. To do so, we construct an\r\nanalogue of Peyre's
constant $\\alpha$ and describe its relation to a new\r\nobstruction to the Zariski
density of integral points in certain regions of\r\nvarieties."
acknowledgement: "Part of this work was conducted as a guest at the Institut de Mathématiques
de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD.\r\nDuring
this time, I had interesting and fruitful discussions on the interpretation of the
result for\r\nthe toric variety discussed in Section 3 with Antoine Chambert-Loir.
I wish to thank him for these\r\nopportunities and for his useful remarks on earlier
versions of this article. This work was partly\r\nfunded by FWF grant P 32428-N35."
article_number: '2202.10909'
article_processing_charge: No
author:
- first_name: Florian Alexander
full_name: Wilsch, Florian Alexander
id: 560601DA-8D36-11E9-A136-7AC1E5697425
last_name: Wilsch
orcid: 0000-0001-7302-8256
citation:
ama: Wilsch FA. Integral points of bounded height on a certain toric variety. arXiv.
doi:10.48550/arXiv.2202.10909
apa: Wilsch, F. A. (n.d.). Integral points of bounded height on a certain toric
variety. arXiv. https://doi.org/10.48550/arXiv.2202.10909
chicago: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Certain
Toric Variety.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2202.10909.
ieee: F. A. Wilsch, “Integral points of bounded height on a certain toric variety,”
arXiv. .
ista: Wilsch FA. Integral points of bounded height on a certain toric variety. arXiv,
2202.10909.
mla: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Certain
Toric Variety.” ArXiv, 2202.10909, doi:10.48550/arXiv.2202.10909.
short: F.A. Wilsch, ArXiv (n.d.).
date_created: 2022-02-23T09:04:43Z
date_published: 2022-02-22T00:00:00Z
date_updated: 2023-05-03T07:46:35Z
day: '22'
department:
- _id: TiBr
doi: 10.48550/arXiv.2202.10909
external_id:
arxiv:
- '2202.10909'
keyword:
- Integral point
- toric variety
- Manin's conjecture
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2202.10909
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P32428
name: New frontiers of the Manin conjecture
publication: arXiv
publication_status: submitted
status: public
title: Integral points of bounded height on a certain toric variety
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11839'
abstract:
- lang: eng
text: "It is a highly desirable property for deep networks to be robust against\r\nsmall
input changes. One popular way to achieve this property is by designing\r\nnetworks
with a small Lipschitz constant. In this work, we propose a new\r\ntechnique for
constructing such Lipschitz networks that has a number of\r\ndesirable properties:
it can be applied to any linear network layer\r\n(fully-connected or convolutional),
it provides formal guarantees on the\r\nLipschitz constant, it is easy to implement
and efficient to run, and it can be\r\ncombined with any training objective and
optimization method. In fact, our\r\ntechnique is the first one in the literature
that achieves all of these\r\nproperties simultaneously. Our main contribution
is a rescaling-based weight\r\nmatrix parametrization that guarantees each network
layer to have a Lipschitz\r\nconstant of at most 1 and results in the learned
weight matrices to be close to\r\northogonal. Hence we call such layers almost-orthogonal
Lipschitz (AOL).\r\nExperiments and ablation studies in the context of image classification
with\r\ncertified robust accuracy confirm that AOL layers achieve results that
are on\r\npar with most existing methods. Yet, they are simpler to implement and
more\r\nbroadly applicable, because they do not require computationally expensive\r\nmatrix
orthogonalization or inversion steps as part of the network\r\narchitecture. We
provide code at https://github.com/berndprach/AOL."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernd
full_name: Prach, Bernd
id: 2D561D42-C427-11E9-89B4-9C1AE6697425
last_name: Prach
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Prach B, Lampert C. Almost-orthogonal layers for efficient general-purpose
Lipschitz networks. In: Computer Vision – ECCV 2022. Vol 13681. Springer
Nature; 2022:350-365. doi:10.1007/978-3-031-19803-8_21'
apa: 'Prach, B., & Lampert, C. (2022). Almost-orthogonal layers for efficient
general-purpose Lipschitz networks. In Computer Vision – ECCV 2022 (Vol.
13681, pp. 350–365). Tel Aviv, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-19803-8_21'
chicago: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient
General-Purpose Lipschitz Networks.” In Computer Vision – ECCV 2022, 13681:350–65.
Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19803-8_21.
ieee: B. Prach and C. Lampert, “Almost-orthogonal layers for efficient general-purpose
Lipschitz networks,” in Computer Vision – ECCV 2022, Tel Aviv, Israel,
2022, vol. 13681, pp. 350–365.
ista: 'Prach B, Lampert C. 2022. Almost-orthogonal layers for efficient general-purpose
Lipschitz networks. Computer Vision – ECCV 2022. ECCV: European Conference on
Computer Vision, LNCS, vol. 13681, 350–365.'
mla: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient
General-Purpose Lipschitz Networks.” Computer Vision – ECCV 2022, vol.
13681, Springer Nature, 2022, pp. 350–65, doi:10.1007/978-3-031-19803-8_21.
short: B. Prach, C. Lampert, in:, Computer Vision – ECCV 2022, Springer Nature,
2022, pp. 350–365.
conference:
end_date: 2022-10-27
location: Tel Aviv, Israel
name: 'ECCV: European Conference on Computer Vision'
start_date: 2022-10-23
date_created: 2022-08-12T15:09:47Z
date_published: 2022-10-23T00:00:00Z
date_updated: 2023-05-03T08:00:46Z
day: '23'
department:
- _id: GradSch
- _id: ChLa
doi: 10.1007/978-3-031-19803-8_21
external_id:
arxiv:
- '2208.03160'
intvolume: ' 13681'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2208.03160'
month: '10'
oa: 1
oa_version: Preprint
page: 350-365
publication: Computer Vision – ECCV 2022
publication_identifier:
eisbn:
- '9783031198038'
isbn:
- '9783031198021'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Almost-orthogonal layers for efficient general-purpose Lipschitz networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13681
year: '2022'
...
---
_id: '12894'
acknowledgement: "The abstracts in this booklet are licenced under a CC BY 4.0 licence
(https://creativecommons.org/licenses/by/4.0/legalcode), except Markus Wallerberger’s
contribution at page 21, licenced under a CC BY-SA 4.0 licence (https://creativecommons.org/licenses/by-sa/4.0/legalcode).\r\n"
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Andrei
full_name: Hornoiu, Andrei
id: 77129392-B450-11EA-8745-D4653DDC885E
last_name: Hornoiu
- first_name: Stefano
full_name: Elefante, Stefano
id: 490F40CE-F248-11E8-B48F-1D18A9856A87
last_name: Elefante
- first_name: Stephan
full_name: Stadlbauer, Stephan
id: 4D0BC184-F248-11E8-B48F-1D18A9856A87
last_name: Stadlbauer
citation:
ama: 'Schlögl A, Hornoiu A, Elefante S, Stadlbauer S. Where is the sweet spot? A
procurement story of general purpose compute nodes. In: ASHPC22 - Austrian-Slovenian
HPC Meeting 2022. EuroCC Austria c/o Universität Wien; 2022:7. doi:10.25365/phaidra.337'
apa: 'Schlögl, A., Hornoiu, A., Elefante, S., & Stadlbauer, S. (2022). Where
is the sweet spot? A procurement story of general purpose compute nodes. In ASHPC22
- Austrian-Slovenian HPC Meeting 2022 (p. 7). Grundlsee, Austria: EuroCC Austria
c/o Universität Wien. https://doi.org/10.25365/phaidra.337'
chicago: Schlögl, Alois, Andrei Hornoiu, Stefano Elefante, and Stephan Stadlbauer.
“Where Is the Sweet Spot? A Procurement Story of General Purpose Compute Nodes.”
In ASHPC22 - Austrian-Slovenian HPC Meeting 2022, 7. EuroCC Austria c/o
Universität Wien, 2022. https://doi.org/10.25365/phaidra.337.
ieee: A. Schlögl, A. Hornoiu, S. Elefante, and S. Stadlbauer, “Where is the sweet
spot? A procurement story of general purpose compute nodes,” in ASHPC22 - Austrian-Slovenian
HPC Meeting 2022, Grundlsee, Austria, 2022, p. 7.
ista: 'Schlögl A, Hornoiu A, Elefante S, Stadlbauer S. 2022. Where is the sweet
spot? A procurement story of general purpose compute nodes. ASHPC22 - Austrian-Slovenian
HPC Meeting 2022. ASHPC: Austrian-Slovenian HPC Meeting, 7.'
mla: Schlögl, Alois, et al. “Where Is the Sweet Spot? A Procurement Story of General
Purpose Compute Nodes.” ASHPC22 - Austrian-Slovenian HPC Meeting 2022,
EuroCC Austria c/o Universität Wien, 2022, p. 7, doi:10.25365/phaidra.337.
short: A. Schlögl, A. Hornoiu, S. Elefante, S. Stadlbauer, in:, ASHPC22 - Austrian-Slovenian
HPC Meeting 2022, EuroCC Austria c/o Universität Wien, 2022, p. 7.
conference:
end_date: 2022-06-02
location: Grundlsee, Austria
name: 'ASHPC: Austrian-Slovenian HPC Meeting'
start_date: 2022-05-31
date_created: 2023-05-05T09:13:42Z
date_published: 2022-06-02T00:00:00Z
date_updated: 2023-05-16T07:42:56Z
day: '02'
ddc:
- '000'
department:
- _id: ScienComp
doi: 10.25365/phaidra.337
file:
- access_level: open_access
checksum: e3f8c240b85422ce2190e7b203cc2563
content_type: application/pdf
creator: schloegl
date_created: 2023-05-05T09:06:00Z
date_updated: 2023-05-05T09:06:00Z
file_id: '12895'
file_name: BOOKLET_ASHPC22.pdf
file_size: 7180531
relation: main_file
success: 1
file_date_updated: 2023-05-05T09:06:00Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '7'
publication: ASHPC22 - Austrian-Slovenian HPC Meeting 2022
publication_identifier:
isbn:
- 978-3-200-08499-5
publication_status: published
publisher: EuroCC Austria c/o Universität Wien
status: public
title: Where is the sweet spot? A procurement story of general purpose compute nodes
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_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11336'
abstract:
- lang: eng
text: The generation of a correctly-sized cerebral cortex with all-embracing neuronal
and glial cell-type diversity critically depends on faithful radial glial progenitor
(RGP) cell proliferation/differentiation programs. Temporal RGP lineage progression
is regulated by Polycomb Repressive Complex 2 (PRC2) and loss of PRC2 activity
results in severe neurogenesis defects and microcephaly. How PRC2-dependent gene
expression instructs RGP lineage progression is unknown. Here we utilize Mosaic
Analysis with Double Markers (MADM)-based single cell technology and demonstrate
that PRC2 is not cell-autonomously required in neurogenic RGPs but rather acts
at the global tissue-wide level. Conversely, cortical astrocyte production and
maturation is cell-autonomously controlled by PRC2-dependent transcriptional regulation.
We thus reveal highly distinct and sequential PRC2 functions in RGP lineage progression
that are dependent on complex interplays between intrinsic and tissue-wide properties.
In a broader context our results imply a critical role for the genetic and cellular
niche environment in neural stem cell behavior.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: LifeSc
acknowledgement: We thank A. Heger (IST Austria Preclinical Facility), A. Sommer and
C. Czepe (VBCF GmbH, NGS Unit) and S. Gharagozlou for technical support. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Imaging & Optics
Facility (IOF), Lab Support Facility (LSF), and Preclinical Facility (PCF). N.A.
received funding from the FWF Firnberg-Programm (T 1031). The work was supported by IST institutional funds and by the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation program (grant agreement 725780 LinPro) to S.H.
article_number: abq1263
article_processing_charge: No
article_type: original
author:
- first_name: Nicole
full_name: Amberg, Nicole
id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
last_name: Amberg
orcid: 0000-0002-3183-8207
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Amberg N, Pauler F, Streicher C, Hippenmeyer S. Tissue-wide genetic and cellular
landscape shapes the execution of sequential PRC2 functions in neural stem cell
lineage progression. Science Advances. 2022;8(44). doi:10.1126/sciadv.abq1263
apa: Amberg, N., Pauler, F., Streicher, C., & Hippenmeyer, S. (2022). Tissue-wide
genetic and cellular landscape shapes the execution of sequential PRC2 functions
in neural stem cell lineage progression. Science Advances. American Association
for the Advancement of Science. https://doi.org/10.1126/sciadv.abq1263
chicago: Amberg, Nicole, Florian Pauler, Carmen Streicher, and Simon Hippenmeyer.
“Tissue-Wide Genetic and Cellular Landscape Shapes the Execution of Sequential
PRC2 Functions in Neural Stem Cell Lineage Progression.” Science Advances.
American Association for the Advancement of Science, 2022. https://doi.org/10.1126/sciadv.abq1263.
ieee: N. Amberg, F. Pauler, C. Streicher, and S. Hippenmeyer, “Tissue-wide genetic
and cellular landscape shapes the execution of sequential PRC2 functions in neural
stem cell lineage progression,” Science Advances, vol. 8, no. 44. American
Association for the Advancement of Science, 2022.
ista: Amberg N, Pauler F, Streicher C, Hippenmeyer S. 2022. Tissue-wide genetic
and cellular landscape shapes the execution of sequential PRC2 functions in neural
stem cell lineage progression. Science Advances. 8(44), abq1263.
mla: Amberg, Nicole, et al. “Tissue-Wide Genetic and Cellular Landscape Shapes the
Execution of Sequential PRC2 Functions in Neural Stem Cell Lineage Progression.”
Science Advances, vol. 8, no. 44, abq1263, American Association for the
Advancement of Science, 2022, doi:10.1126/sciadv.abq1263.
short: N. Amberg, F. Pauler, C. Streicher, S. Hippenmeyer, Science Advances 8 (2022).
date_created: 2022-04-26T15:04:50Z
date_published: 2022-11-01T00:00:00Z
date_updated: 2023-05-31T12:24:10Z
day: '01'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1126/sciadv.abq1263
ec_funded: 1
file:
- access_level: open_access
checksum: 0117023e188542082ca6693cf39e7f03
content_type: application/pdf
creator: patrickd
date_created: 2023-03-21T14:18:10Z
date_updated: 2023-03-21T14:18:10Z
file_id: '12742'
file_name: sciadv.abq1263.pdf
file_size: 2973998
relation: main_file
success: 1
file_date_updated: 2023-03-21T14:18:10Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '44'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 268F8446-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T0101031
name: Role of Eed in neural stem cell lineage progression
publication: Science Advances
publication_identifier:
issn:
- 2375-2548
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/whole-tissue-shapes-brain-development/
scopus_import: '1'
status: public
title: Tissue-wide genetic and cellular landscape shapes the execution of sequential
PRC2 functions in neural stem cell lineage progression
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2022'
...
---
_id: '11442'
abstract:
- lang: eng
text: "Enabling additive manufacturing to employ a wide range of novel, functional
materials can be a major boost to this technology. However, making such materials
printable requires painstaking trial-and-error by an expert operator,\r\nas they
typically tend to exhibit peculiar rheological or hysteresis properties. Even
in the case of successfully finding the process parameters, there is no guarantee
of print-to-print consistency due to material differences between batches. These
challenges make closed-loop feedback an attractive option where the process parameters
are adjusted on-the-fly. There are several challenges for designing an efficient
controller: the deposition parameters are complex and highly coupled, artifacts
occur after long time horizons, simulating the deposition is computationally costly,
and learning on hardware is intractable. In this work, we demonstrate the feasibility
of learning a closed-loop control policy for additive manufacturing using reinforcement
learning. We show that approximate, but efficient, numerical simulation is\r\nsufficient
as long as it allows learning the behavioral patterns of deposition that translate
to real-world experiences. In combination with reinforcement learning, our model
can be used to discover control policies that outperform\r\nbaseline controllers.
Furthermore, the recovered policies have a minimal sim-to-real gap. We showcase
this by applying our control policy in-vivo on a single-layer, direct ink writing
printer. "
acknowledgement: "This work is graciously supported by the following grant agencies:
FWF Lise Meitner (Grant M 3319), SNSF (Grant 200502), ERC Starting Grant (MATERIALIZABLE-715767),
NSF (Grant IIS-181507).\r\n"
article_number: '112'
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Piovarci, Michael
id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
last_name: Piovarci
- first_name: Michael
full_name: Foshey, Michael
last_name: Foshey
- first_name: Jie
full_name: Xu, Jie
last_name: Xu
- first_name: Timothy
full_name: Erps, Timothy
last_name: Erps
- first_name: Vahid
full_name: Babaei, Vahid
last_name: Babaei
- first_name: Piotr
full_name: Didyk, Piotr
last_name: Didyk
- first_name: Szymon
full_name: Rusinkiewicz, Szymon
last_name: Rusinkiewicz
- first_name: Wojciech
full_name: Matusik, Wojciech
last_name: Matusik
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: Piovarci M, Foshey M, Xu J, et al. Closed-loop control of direct ink writing
via reinforcement learning. ACM Transactions on Graphics. 2022;41(4). doi:10.1145/3528223.3530144
apa: Piovarci, M., Foshey, M., Xu, J., Erps, T., Babaei, V., Didyk, P., … Bickel,
B. (2022). Closed-loop control of direct ink writing via reinforcement learning.
ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3528223.3530144
chicago: Piovarci, Michael, Michael Foshey, Jie Xu, Timothy Erps, Vahid Babaei,
Piotr Didyk, Szymon Rusinkiewicz, Wojciech Matusik, and Bernd Bickel. “Closed-Loop
Control of Direct Ink Writing via Reinforcement Learning.” ACM Transactions
on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528223.3530144.
ieee: M. Piovarci et al., “Closed-loop control of direct ink writing via
reinforcement learning,” ACM Transactions on Graphics, vol. 41, no. 4.
Association for Computing Machinery, 2022.
ista: Piovarci M, Foshey M, Xu J, Erps T, Babaei V, Didyk P, Rusinkiewicz S, Matusik
W, Bickel B. 2022. Closed-loop control of direct ink writing via reinforcement
learning. ACM Transactions on Graphics. 41(4), 112.
mla: Piovarci, Michael, et al. “Closed-Loop Control of Direct Ink Writing via Reinforcement
Learning.” ACM Transactions on Graphics, vol. 41, no. 4, 112, Association
for Computing Machinery, 2022, doi:10.1145/3528223.3530144.
short: M. Piovarci, M. Foshey, J. Xu, T. Erps, V. Babaei, P. Didyk, S. Rusinkiewicz,
W. Matusik, B. Bickel, ACM Transactions on Graphics 41 (2022).
date_created: 2022-06-10T06:41:47Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2023-05-31T12:38:21Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3528223.3530144
ec_funded: 1
external_id:
arxiv:
- '2201.11819'
file:
- access_level: open_access
checksum: 27f6fe41c6ff84d50445cc9b0176d45b
content_type: application/pdf
creator: dernst
date_created: 2022-06-28T08:32:58Z
date_updated: 2022-06-28T08:32:58Z
file_id: '11467'
file_name: 2022_ACM_acceptedversion_Piovarci.pdf
file_size: 33994829
relation: main_file
success: 1
file_date_updated: 2022-06-28T08:32:58Z
has_accepted_license: '1'
intvolume: ' 41'
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: eb901961-77a9-11ec-83b8-f5c883a62027
grant_number: M03319
name: Perception-Aware Appearance Fabrication
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/machine-learning-3d-printing-fluids/
status: public
title: Closed-loop control of direct ink writing via reinforcement learning
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: 41
year: '2022'
...
---
_id: '11844'
abstract:
- lang: eng
text: "In the stochastic population protocol model, we are given a connected graph
with n nodes, and in every time step, a scheduler samples an edge of the graph
uniformly at random and the nodes connected by this edge interact. A fundamental
task in this model is stable leader election, in which all nodes start in an identical
state and the aim is to reach a configuration in which (1) exactly one node is
elected as leader and (2) this node remains as the unique leader no matter what
sequence of interactions follows. On cliques, the complexity of this problem has
recently been settled: time-optimal protocols stabilize in Θ(n log n) expected
steps using Θ(log log n) states, whereas protocols that use O(1) states require
Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable
leader election on general graphs. We provide the first non-trivial time lower
bounds for leader election on general graphs, showing that, when moving beyond
cliques, the complexity landscape of leader election becomes very diverse: the
time required to elect a leader can range from O(1) to Θ(n3) expected steps. On
the upper bound side, we first observe that there exists a protocol that is time-optimal
on many graph families, but uses polynomially-many states. In contrast, we give
a near-time-optimal protocol that uses only O(log2n) states that is at most a
factor log n slower. Finally, we show that the constant-state protocol of Beauquier
et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state
protocol. Moreover, among constant-state protocols, this protocol has near-optimal
average case complexity on dense random graphs."
acknowledgement: We thank the anonymous reviewers for their helpful comments. We gratefully
acknowledge funding from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (grant agreement No 805223
ScaleML).
article_processing_charge: Yes (via OA deal)
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Sasha
full_name: Voitovych, Sasha
last_name: Voitovych
citation:
ama: 'Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population
protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2022:246-256.
doi:10.1145/3519270.3538435'
apa: 'Alistarh, D.-A., Rybicki, J., & Voitovych, S. (2022). Near-optimal leader
election in population protocols on graphs. In Proceedings of the Annual ACM
Symposium on Principles of Distributed Computing (pp. 246–256). Salerno, Italy:
Association for Computing Machinery. https://doi.org/10.1145/3519270.3538435'
chicago: Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal
Leader Election in Population Protocols on Graphs.” In Proceedings of the Annual
ACM Symposium on Principles of Distributed Computing, 246–56. Association
for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538435.
ieee: D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election
in population protocols on graphs,” in Proceedings of the Annual ACM Symposium
on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256.
ista: 'Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election
in population protocols on graphs. Proceedings of the Annual ACM Symposium on
Principles of Distributed Computing. PODC: Symposium on Principles of Distributed
Computing, 246–256.'
mla: Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols
on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435.
short: D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual
ACM Symposium on Principles of Distributed Computing, Association for Computing
Machinery, 2022, pp. 246–256.
conference:
end_date: 2022-07-29
location: Salerno, Italy
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2022-07-25
date_created: 2022-08-14T22:01:46Z
date_published: 2022-07-21T00:00:00Z
date_updated: 2023-06-14T12:06:01Z
day: '21'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3519270.3538435
ec_funded: 1
external_id:
arxiv:
- '2205.12597'
file:
- access_level: open_access
checksum: 4c6b29172b8e355b4fbc364a2e0827b2
content_type: application/pdf
creator: cchlebak
date_created: 2022-08-16T08:05:15Z
date_updated: 2022-08-16T08:05:15Z
file_id: '11854'
file_name: 2022_PODC_Alistarh.pdf
file_size: 1593474
relation: main_file
success: 1
file_date_updated: 2022-08-16T08:05:15Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 246-256
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the Annual ACM Symposium on Principles of Distributed
Computing
publication_identifier:
isbn:
- '9781450392624'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Near-optimal leader election in population protocols on graphs
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
year: '2022'
...
---
_id: '11777'
abstract:
- lang: eng
text: "In this dissertation we study coboundary expansion of simplicial complex
with a view of giving geometric applications.\r\nOur main novel tool is an equivariant
version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological
overlap theorem leads to various geometric applications including a quantitative
non-embeddability result for sufficiently thick buildings (which partially resolves
a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing
number of (bounded degree) expander graphs. Additionally, we will give new proofs
for several known lower bounds for geometric problems such as the number of Tverberg
partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned
applications one is naturally lead to study expansion properties of joins of simplicial
complexes. In the presence of a special certificate for expansion (as it is the
case, e.g., for spherical buildings), the join of two expanders is an expander.
On the flip-side, we report quite some evidence that coboundary expansion exhibits
very non-product-like behaviour under taking joins. For instance, we exhibit infinite
families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$
whose join $G_n*H_n$ has expansion of lower order than the product of the expansion
constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the
normalized coboundary expansion constants for the complete multipartite complex
$[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic
method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$
on the coboundary expansion constant of the spherical building associated with
$\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently
large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and
Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we
make further progress towards closing the gap between the known lower and upper
bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements
we achieve using computer-aided proofs and flag algebras. The exact value even
for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown
but we are happy to conjecture a precise value for every $n$. %Moreover, we show
that a previously shown lower bound on the expansion constant of the spherical
building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn
a loosely structured, last chapter of this thesis we collect further smaller observations
related to expansion. We point out a link between discrete Morse theory and a
technique for showing coboundary expansion, elaborate a bit on the hardness of
computing coboundary expansion constants, propose a new criterion for coboundary
expansion (in a very dense setting) and give one way of making the folklore result
that expansion of links is a necessary condition for a simplicial complex to be
an expander precise."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Pascal
full_name: Wild, Pascal
id: 4C20D868-F248-11E8-B48F-1D18A9856A87
last_name: Wild
citation:
ama: Wild P. High-dimensional expansion and crossing numbers of simplicial complexes.
2022. doi:10.15479/at:ista:11777
apa: Wild, P. (2022). High-dimensional expansion and crossing numbers of simplicial
complexes. Institute of Science and Technology. https://doi.org/10.15479/at:ista:11777
chicago: Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial
Complexes.” Institute of Science and Technology, 2022. https://doi.org/10.15479/at:ista:11777.
ieee: P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,”
Institute of Science and Technology, 2022.
ista: Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial
complexes. Institute of Science and Technology.
mla: Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial
Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777.
short: P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes,
Institute of Science and Technology, 2022.
date_created: 2022-08-10T15:51:19Z
date_published: 2022-08-11T00:00:00Z
date_updated: 2023-06-22T09:56:36Z
day: '11'
ddc:
- '500'
- '516'
- '514'
degree_awarded: PhD
department:
- _id: GradSch
- _id: UlWa
doi: 10.15479/at:ista:11777
ec_funded: 1
file:
- access_level: open_access
checksum: f5f3af1fb7c8a24b71ddc88ad7f7c5b4
content_type: text/x-python
creator: pwild
date_created: 2022-08-10T15:34:04Z
date_updated: 2022-08-10T15:34:04Z
description: Code for computer-assisted proofs in Section 8.4.7 in Thesis
file_id: '11780'
file_name: flags.py
file_size: 16828
relation: supplementary_material
- access_level: open_access
checksum: 1f7c12dfe3bdaa9b147e4fbc3d34e3d5
content_type: text/x-c++src
creator: pwild
date_created: 2022-08-10T15:34:10Z
date_updated: 2022-08-10T15:34:10Z
description: Code for proof of Lemma 8.20 in Thesis
file_id: '11781'
file_name: lowerbound.cpp
file_size: 12226
relation: supplementary_material
- access_level: open_access
checksum: 4cf81455c49e5dec3b9b2e3980137eeb
content_type: text/x-python
creator: pwild
date_created: 2022-08-10T15:34:17Z
date_updated: 2022-08-10T15:34:17Z
description: Code for proof of Proposition 7.9 in Thesis
file_id: '11782'
file_name: upperbound.py
file_size: 3240
relation: supplementary_material
- access_level: open_access
checksum: 4e96575b10cbe4e0d0db2045b2847774
content_type: application/pdf
creator: pwild
date_created: 2022-08-11T16:08:33Z
date_updated: 2022-08-11T16:08:33Z
file_id: '11809'
file_name: finalthesisPascalWildPDFA.pdf
file_size: 5086282
relation: main_file
title: High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes
- access_level: closed
checksum: 92d94842a1fb6dca5808448137573b2e
content_type: application/zip
creator: pwild
date_created: 2022-08-11T16:09:19Z
date_updated: 2022-08-11T16:09:19Z
file_id: '11810'
file_name: ThesisSubmission.zip
file_size: 18150068
relation: source_file
file_date_updated: 2022-08-11T16:09:19Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '170'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_identifier:
isbn:
- 978-3-99078-021-3
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology
status: public
supervisor:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
title: High-dimensional expansion and crossing numbers of simplicial complexes
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2022'
...
---
_id: '11128'
abstract:
- lang: eng
text: "Although we often see studies focusing on simple or even discrete traits
in studies of colouration,\r\nthe variation of “appearance” phenotypes found in
nature is often more complex, continuous\r\nand high-dimensional. Therefore, we
developed automated methods suitable for large datasets\r\nof genomes and images,
striving to account for their complex nature, while minimising human\r\nbias.
We used these methods on a dataset of more than 20, 000 plant SNP genomes and\r\ncorresponding
fower images from a hybrid zone of two subspecies of Antirrhinum majus with\r\ndistinctly
coloured fowers to improve our understanding of the genetic nature of the fower\r\ncolour
in our study system.\r\nFirstly, we use the advantage of large numbers of genotyped
plants to estimate the haplotypes in\r\nthe main fower colour regulating region.
We study colour- and geography-related characteristics\r\nof the estimated haplotypes
and how they connect to their relatedness. We show discrepancies\r\nfrom the expected
fower colour distributions given the genotype and identify particular\r\nhaplotypes
leading to unexpected phenotypes. We also confrm a signifcant defcit of the\r\ndouble
recessive recombinant and quite surprisingly, we show that haplotypes of the most\r\nfrequent
parental type are much less variable than others.\r\nSecondly, we introduce our
pipeline capable of processing tens of thousands of full fower\r\nimages without
human interaction and summarising each image into a set of informative scores.\r\nWe
show the compatibility of these machine-measured fower colour scores with the
previously\r\nused manual scores and study impact of external efect on the resulting
scores. Finally, we use\r\nthe machine-measured fower colour scores to ft and
examine a phenotype cline across the\r\nhybrid zone in Planoles using full fower
images as opposed to discrete, manual scores and\r\ncompare it with the genotypic
cline."
acknowledged_ssus:
- _id: ScienComp
- _id: Bio
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lenka
full_name: Matejovicova, Lenka
id: 2DFDEC72-F248-11E8-B48F-1D18A9856A87
last_name: Matejovicova
citation:
ama: Matejovicova L. Genetic basis of flower colour as a model for adaptive evolution.
2022. doi:10.15479/at:ista:11128
apa: Matejovicova, L. (2022). Genetic basis of flower colour as a model for adaptive
evolution. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:11128
chicago: Matejovicova, Lenka. “Genetic Basis of Flower Colour as a Model for Adaptive
Evolution.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:11128.
ieee: L. Matejovicova, “Genetic basis of flower colour as a model for adaptive evolution,”
Institute of Science and Technology Austria, 2022.
ista: Matejovicova L. 2022. Genetic basis of flower colour as a model for adaptive
evolution. Institute of Science and Technology Austria.
mla: Matejovicova, Lenka. Genetic Basis of Flower Colour as a Model for Adaptive
Evolution. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:11128.
short: L. Matejovicova, Genetic Basis of Flower Colour as a Model for Adaptive Evolution,
Institute of Science and Technology Austria, 2022.
date_created: 2022-04-07T08:19:54Z
date_published: 2022-04-06T00:00:00Z
date_updated: 2023-06-23T06:26:41Z
day: '06'
ddc:
- '576'
- '582'
degree_awarded: PhD
department:
- _id: GradSch
- _id: NiBa
doi: 10.15479/at:ista:11128
file:
- access_level: open_access
checksum: e9609bc4e8f8e20146fc1125fd4f1bf7
content_type: application/pdf
creator: cchlebak
date_created: 2022-04-07T08:11:34Z
date_updated: 2022-04-07T08:11:34Z
file_id: '11129'
file_name: LenkaPhD_Official_PDFA.pdf
file_size: 11906472
relation: main_file
- access_level: closed
checksum: 99d67040432fd07a225643a212ee8588
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2022-04-07T08:11:51Z
date_updated: 2022-04-07T08:11:51Z
file_id: '11130'
file_name: LenkaPhD Official_source.zip
file_size: 23036766
relation: source_file
file_date_updated: 2022-04-07T08:11:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '112'
publication_identifier:
isbn:
- 978-3-99078-016-9
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Genetic basis of flower colour as a model for adaptive 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: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2022'
...
---
_id: '13239'
abstract:
- lang: eng
text: Brains are thought to engage in predictive learning - learning to predict
upcoming stimuli - to construct an internal model of their environment. This is
especially notable for spatial navigation, as first described by Tolman’s latent
learning tasks. However, predictive learning has also been observed in sensory
cortex, in settings unrelated to spatial navigation. Apart from normative frameworks
such as active inference or efficient coding, what could be the utility of learning
to predict the patterns of occurrence of correlated stimuli? Here we show that
prediction, and thereby the construction of an internal model of sequential stimuli,
can bootstrap the learning process of a working memory task in a recurrent neural
network. We implemented predictive learning alongside working memory match-tasks,
and networks emerged to solve the prediction task first by encoding information
across time to predict upcoming stimuli, and then eavesdropped on this solution
to solve the matching task. Eavesdropping was most beneficial when neural resources
were limited. Hence, predictive learning acts as a general neural mechanism to
learn to store sensory information that can later be essential for working memory
tasks.
acknowledgement: "The authors would like to thank members of the Vogels lab and Manohar
lab, as well as Adam Packer, Andrew Saxe, Stefano Sarao Mannelli and Jacob Bakermans
for fruitful discussions and comments on earlier versions of the manuscript.\r\nTLvdP
was supported by funding from the Biotechnology and Biological Sciences Research
Council (BBSRC) [grant number BB/M011224/1]. TPV was supported by an ERC Consolidator
Grant (SYNAPSEEK). SGM was funded by a MRC Clinician Scientist Fellowship MR/P00878X
and Leverhulme Grant RPG-2018-310."
article_processing_charge: No
author:
- first_name: Thijs L.
full_name: Van Der Plas, Thijs L.
last_name: Van Der Plas
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
- first_name: Sanjay G.
full_name: Manohar, Sanjay G.
last_name: Manohar
citation:
ama: 'Van Der Plas TL, Vogels TP, Manohar SG. Predictive learning enables neural
networks to learn complex working memory tasks. In: Proceedings of Machine
Learning Research. Vol 199. ML Research Press; 2022:518-531.'
apa: Van Der Plas, T. L., Vogels, T. P., & Manohar, S. G. (2022). Predictive
learning enables neural networks to learn complex working memory tasks. In Proceedings
of Machine Learning Research (Vol. 199, pp. 518–531). ML Research Press.
chicago: Van Der Plas, Thijs L., Tim P Vogels, and Sanjay G. Manohar. “Predictive
Learning Enables Neural Networks to Learn Complex Working Memory Tasks.” In Proceedings
of Machine Learning Research, 199:518–31. ML Research Press, 2022.
ieee: T. L. Van Der Plas, T. P. Vogels, and S. G. Manohar, “Predictive learning
enables neural networks to learn complex working memory tasks,” in Proceedings
of Machine Learning Research, 2022, vol. 199, pp. 518–531.
ista: Van Der Plas TL, Vogels TP, Manohar SG. 2022. Predictive learning enables
neural networks to learn complex working memory tasks. Proceedings of Machine
Learning Research. vol. 199, 518–531.
mla: Van Der Plas, Thijs L., et al. “Predictive Learning Enables Neural Networks
to Learn Complex Working Memory Tasks.” Proceedings of Machine Learning Research,
vol. 199, ML Research Press, 2022, pp. 518–31.
short: T.L. Van Der Plas, T.P. Vogels, S.G. Manohar, in:, Proceedings of Machine
Learning Research, ML Research Press, 2022, pp. 518–531.
date_created: 2023-07-16T22:01:12Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-07-18T06:36:28Z
day: '01'
ddc:
- '000'
department:
- _id: TiVo
ec_funded: 1
file:
- access_level: open_access
checksum: 7530a93ef42e10b4db1e5e4b69796e93
content_type: application/pdf
creator: dernst
date_created: 2023-07-18T06:32:38Z
date_updated: 2023-07-18T06:32:38Z
file_id: '13243'
file_name: 2022_PMLR_vanderPlas.pdf
file_size: 585135
relation: main_file
success: 1
file_date_updated: 2023-07-18T06:32:38Z
has_accepted_license: '1'
intvolume: ' 199'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 518-531
project:
- _id: 0aacfa84-070f-11eb-9043-d7eb2c709234
call_identifier: H2020
grant_number: '819603'
name: Learning the shape of synaptic plasticity rules for neuronal architectures
and function through machine learning.
publication: Proceedings of Machine Learning Research
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Predictive learning enables neural networks to learn complex working memory
tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 199
year: '2022'
...
---
_id: '11366'
abstract:
- lang: eng
text: "Adversarial training (i.e., training on adversarially perturbed input data)
is a well-studied method for making neural networks robust to potential adversarial
attacks during inference. However, the improved robustness does not\r\ncome for
free but rather is accompanied by a decrease in overall model accuracy and performance.
Recent work has shown that, in practical robot learning applications, the effects
of adversarial training do not pose a fair trade-off\r\nbut inflict a net loss
when measured in holistic robot performance. This work revisits the robustness-accuracy
trade-off in robot learning by systematically analyzing if recent advances in
robust training methods and theory in\r\nconjunction with adversarial robot learning
can make adversarial training suitable for real-world robot applications. We evaluate
a wide variety of robot learning tasks ranging from autonomous driving in a high-fidelity
environment\r\namenable to sim-to-real deployment, to mobile robot gesture recognition.
Our results demonstrate that, while these techniques make incremental improvements
on the trade-off on a relative scale, the negative side-effects caused by\r\nadversarial
training still outweigh the improvements by an order of magnitude. We conclude
that more substantial advances in robust learning methods are necessary before
they can benefit robot learning tasks in practice."
acknowledgement: "This work was supported in parts by the ERC-2020-AdG 101020093,
National Science Foundation (NSF), and JP\r\nMorgan Graduate Fellowships. We thank
Christoph Lampert for inspiring this work.\r\n"
article_number: '2204.07373'
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy
tradeoff in robot learning. arXiv. doi:10.48550/arXiv.2204.07373
apa: Lechner, M., Amini, A., Rus, D., & Henzinger, T. A. (n.d.). Revisiting
the adversarial robustness-accuracy tradeoff in robot learning. arXiv.
https://doi.org/10.48550/arXiv.2204.07373
chicago: Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger.
“Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” ArXiv,
n.d. https://doi.org/10.48550/arXiv.2204.07373.
ieee: M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial
robustness-accuracy tradeoff in robot learning,” arXiv. .
ista: Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy
tradeoff in robot learning. arXiv, 2204.07373.
mla: Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff
in Robot Learning.” ArXiv, 2204.07373, doi:10.48550/arXiv.2204.07373.
short: M. Lechner, A. Amini, D. Rus, T.A. Henzinger, ArXiv (n.d.).
date_created: 2022-05-12T13:20:17Z
date_published: 2022-04-15T00:00:00Z
date_updated: 2023-08-01T13:36:50Z
day: '15'
department:
- _id: ToHe
doi: 10.48550/arXiv.2204.07373
ec_funded: 1
external_id:
arxiv:
- '2204.07373'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2204.07373
month: '04'
oa: 1
oa_version: Preprint
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
- id: '12704'
relation: later_version
status: public
status: public
title: Revisiting the adversarial robustness-accuracy tradeoff in robot learning
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11432'
abstract:
- lang: eng
text: "This paper proposes a method for simulating liquids in large bodies of water
by coupling together a water surface wave simulator with a 3D Navier-Stokes simulator.
The surface wave simulation uses the equivalent sources method (ESM) to efficiently
animate large bodies of water with precisely controllable wave propagation behavior.
The 3D liquid simulator animates complex non-linear fluid behaviors like splashes
and breaking waves using off-the-shelf simulators using FLIP or the level set
method with semi-Lagrangian advection.\r\nWe combine the two approaches by using
the 3D solver to animate localized non-linear behaviors, and the 2D wave solver
to animate larger regions with linear surface physics. We use the surface motion
from the 3D solver as boundary conditions for 2D surface wave simulator, and we
use the velocity and surface heights from the 2D surface wave simulator as boundary
conditions for the 3D fluid simulation. We also introduce a novel technique for
removing visual artifacts caused by numerical errors in 3D fluid solvers: we use
experimental data to estimate the artificial dispersion caused by the 3D solver
and we then carefully tune the wave speeds of the 2D solver to match it, effectively
eliminating any differences in wave behavior across the boundary. To the best
of our knowledge, this is the first time such a empirically driven error compensation
approach has been used to remove coupling errors from a physics simulator.\r\nOur
coupled simulation approach leverages the strengths of each simulation technique,
animating large environments with seamless transitions between 2D and 3D physics."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: We wish to thank the anonymous reviewers and the members of the Visual
Computing Group at IST Austria and MFX Team at INRIA for their valuable feedback.
This research was supported by the Scientific Service Units (SSU) of IST Austria
through resources provided by Scientific Computing. This project has received funding
from the European Research Council (ERC) under the European Union’s Horizon 2020
research and innovation programme under grant agreement No. 638176.
article_processing_charge: No
article_type: original
author:
- first_name: Camille
full_name: Schreck, Camille
id: 2B14B676-F248-11E8-B48F-1D18A9856A87
last_name: Schreck
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Schreck C, Wojtan C. Coupling 3D liquid simulation with 2D wave propagation
for large scale water surface animation using the equivalent sources method. Computer
Graphics Forum. 2022;41(2):343-353. doi:10.1111/cgf.14478
apa: Schreck, C., & Wojtan, C. (2022). Coupling 3D liquid simulation with 2D
wave propagation for large scale water surface animation using the equivalent
sources method. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.14478
chicago: Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with
2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent
Sources Method.” Computer Graphics Forum. Wiley, 2022. https://doi.org/10.1111/cgf.14478.
ieee: C. Schreck and C. Wojtan, “Coupling 3D liquid simulation with 2D wave propagation
for large scale water surface animation using the equivalent sources method,”
Computer Graphics Forum, vol. 41, no. 2. Wiley, pp. 343–353, 2022.
ista: Schreck C, Wojtan C. 2022. Coupling 3D liquid simulation with 2D wave propagation
for large scale water surface animation using the equivalent sources method. Computer
Graphics Forum. 41(2), 343–353.
mla: Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D
Wave Propagation for Large Scale Water Surface Animation Using the Equivalent
Sources Method.” Computer Graphics Forum, vol. 41, no. 2, Wiley, 2022,
pp. 343–53, doi:10.1111/cgf.14478.
short: C. Schreck, C. Wojtan, Computer Graphics Forum 41 (2022) 343–353.
date_created: 2022-06-05T22:01:49Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T06:44:05Z
day: '01'
department:
- _id: ChWo
doi: 10.1111/cgf.14478
ec_funded: 1
external_id:
isi:
- '000802723900027'
intvolume: ' 41'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-03641349/
month: '05'
oa: 1
oa_version: Submitted Version
page: 343-353
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coupling 3D liquid simulation with 2D wave propagation for large scale water
surface animation using the equivalent sources method
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '10335'
abstract:
- lang: eng
text: "Van der Holst and Pendavingh introduced a graph parameter σ, which coincides
with the more famous Colin de Verdière graph parameter μ for small values. However,
the definition of a is much more geometric/topological directly reflecting embeddability
properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G)
for any graph G. We confirm this conjecture. As far as we know, this is the first
topological upper bound on σ(G) which is, in general, tight.\r\nEquality between
μ and σ does not hold in general as van der Holst and Pendavingh showed that there
is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much
smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8.
We also prove that, in general, the gap can be large: The incidence graphs Hq
of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2."
acknowledgement: 'V. K. gratefully acknowledges the support of Austrian Science Fund
(FWF): P 30902-N35. This work was done mostly while he was employed at the University
of Innsbruck. During the early stage of this research, V. K. was partially supported
by Charles University project GAUK 926416. M. T. is supported by the grant no. 19-04113Y
of the Czech Science Foundation(GA ˇCR) and partially supported by Charles University
project UNCE/SCI/004.'
article_processing_charge: No
article_type: original
author:
- first_name: Vojtech
full_name: Kaluza, Vojtech
id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E
last_name: Kaluza
orcid: 0000-0002-2512-8698
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
citation:
ama: Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations
of graphs. Combinatorica. 2022;42:1317-1345. doi:10.1007/s00493-021-4443-7
apa: Kaluza, V., & Tancer, M. (2022). Even maps, the Colin de Verdière number
and representations of graphs. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-021-4443-7
chicago: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number
and Representations of Graphs.” Combinatorica. Springer Nature, 2022. https://doi.org/10.1007/s00493-021-4443-7.
ieee: V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations
of graphs,” Combinatorica, vol. 42. Springer Nature, pp. 1317–1345, 2022.
ista: Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations
of graphs. Combinatorica. 42, 1317–1345.
mla: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number
and Representations of Graphs.” Combinatorica, vol. 42, Springer Nature,
2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7.
short: V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345.
date_created: 2021-11-25T13:49:16Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-08-02T06:43:27Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.1007/s00493-021-4443-7
external_id:
arxiv:
- '1907.05055'
isi:
- '000798210100003'
intvolume: ' 42'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1907.05055'
month: '12'
oa: 1
oa_version: Preprint
page: 1317-1345
publication: Combinatorica
publication_identifier:
issn:
- 0209-9683
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Even maps, the Colin de Verdière number and representations of graphs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 42
year: '2022'
...
---
_id: '9199'
abstract:
- lang: eng
text: "We associate a certain tensor product lattice to any primitive integer lattice
and ask about its typical shape. These lattices are related to the tangent bundle
of Grassmannians and their study is motivated by Peyre's programme on \"freeness\"
for rational points of bounded height on Fano\r\nvarieties."
acknowledgement: The authors are very grateful to Will Sawin for useful remarks about
this topic. While working on this paper the first two authors were supported by
EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35.
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Tal
full_name: Horesh, Tal
id: C8B7BF48-8D81-11E9-BCA9-F536E6697425
last_name: Horesh
- first_name: Florian Alexander
full_name: Wilsch, Florian Alexander
id: 560601DA-8D36-11E9-A136-7AC1E5697425
last_name: Wilsch
orcid: 0000-0001-7302-8256
citation:
ama: Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians.
Algebra & Number Theory. 2022;16(10):2385-2407. doi:10.2140/ant.2022.16.2385
apa: Browning, T. D., Horesh, T., & Wilsch, F. A. (2022). Equidistribution and
freeness on Grassmannians. Algebra & Number Theory. Mathematical Sciences
Publishers. https://doi.org/10.2140/ant.2022.16.2385
chicago: Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution
and Freeness on Grassmannians.” Algebra & Number Theory. Mathematical
Sciences Publishers, 2022. https://doi.org/10.2140/ant.2022.16.2385.
ieee: T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness
on Grassmannians,” Algebra & Number Theory, vol. 16, no. 10. Mathematical
Sciences Publishers, pp. 2385–2407, 2022.
ista: Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians.
Algebra & Number Theory. 16(10), 2385–2407.
mla: Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.”
Algebra & Number Theory, vol. 16, no. 10, Mathematical Sciences Publishers,
2022, pp. 2385–407, doi:10.2140/ant.2022.16.2385.
short: T.D. Browning, T. Horesh, F.A. Wilsch, Algebra & Number Theory 16 (2022)
2385–2407.
date_created: 2021-02-25T09:56:57Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-08-02T06:46:38Z
day: '01'
department:
- _id: TiBr
doi: 10.2140/ant.2022.16.2385
external_id:
arxiv:
- '2102.11552'
isi:
- '000961514100004'
intvolume: ' 16'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.11552
month: '12'
oa: 1
oa_version: Preprint
page: 2385-2407
project:
- _id: 26A8D266-B435-11E9-9278-68D0E5697425
grant_number: EP-P026710-2
name: Between rational and integral points
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P32428
name: New frontiers of the Manin conjecture
publication: Algebra & Number Theory
publication_identifier:
eissn:
- 1944-7833
issn:
- 1937-0652
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Equidistribution and freeness on Grassmannians
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 16
year: '2022'
...
---
_id: '9794'
abstract:
- lang: eng
text: 'Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular
cells that form dedicated niches for immune cell interaction and capsular fibroblasts
that build a shell around the organ. Immunological challenge causes LNs to increase
more than tenfold in size within a few days. Here, we characterized the biomechanics
of LN swelling on the cellular and organ scale. We identified lymphocyte trapping
by influx and proliferation as drivers of an outward pressure force, causing fibroblastic
reticular cells of the T-zone (TRCs) and their associated conduits to stretch.
After an initial phase of relaxation, TRCs sensed the resulting strain through
cell matrix adhesions, which coordinated local growth and remodeling of the stromal
network. While the expanded TRC network readopted its typical configuration, a
massive fibrotic reaction of the organ capsule set in and countered further organ
expansion. Thus, different fibroblast populations mechanically control LN swelling
in a multitier fashion.'
acknowledged_ssus:
- _id: Bio
- _id: EM-Fac
- _id: PreCl
- _id: LifeSc
acknowledgement: This research was supported by the Scientific Service Units of IST
Austria through resources provided by the Imaging and Optics, Electron Microscopy,
Preclinical and Life Science Facilities. We thank C. Moussion for providing anti-PNAd
antibody and D. Critchley for Talin1-floxed mice, and E. Papusheva for providing
a custom 3D channel alignment script. This work was supported by a European Research
Council grant ERC-CoG-72437 to M.S. M.H. was supported by Czech Sciencundation GACR
20-24603Y and Charles University PRIMUS/20/MED/013.
article_processing_charge: No
article_type: original
author:
- first_name: Frank P
full_name: Assen, Frank P
id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87
last_name: Assen
orcid: 0000-0003-3470-6119
- first_name: Jun
full_name: Abe, Jun
last_name: Abe
- first_name: Miroslav
full_name: Hons, Miroslav
id: 4167FE56-F248-11E8-B48F-1D18A9856A87
last_name: Hons
orcid: 0000-0002-6625-3348
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Tommaso
full_name: Costanzo, Tommaso
id: D93824F4-D9BA-11E9-BB12-F207E6697425
last_name: Costanzo
orcid: 0000-0001-9732-3815
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Burkhard
full_name: Ludewig, Burkhard
last_name: Ludewig
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- 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
- first_name: Wolfgang
full_name: Weninger, Wolfgang
last_name: Weninger
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Sanjiv A.
full_name: Luther, Sanjiv A.
last_name: Luther
- first_name: Jens V.
full_name: Stein, Jens V.
last_name: Stein
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-4561-241X
citation:
ama: Assen FP, Abe J, Hons M, et al. Multitier mechanics control stromal adaptations
in swelling lymph nodes. Nature Immunology. 2022;23:1246-1255. doi:10.1038/s41590-022-01257-4
apa: Assen, F. P., Abe, J., Hons, M., Hauschild, R., Shamipour, S., Kaufmann, W.,
… Sixt, M. K. (2022). Multitier mechanics control stromal adaptations in swelling
lymph nodes. Nature Immunology. Springer Nature. https://doi.org/10.1038/s41590-022-01257-4
chicago: Assen, Frank P, Jun Abe, Miroslav Hons, Robert Hauschild, Shayan Shamipour,
Walter Kaufmann, Tommaso Costanzo, et al. “Multitier Mechanics Control Stromal
Adaptations in Swelling Lymph Nodes.” Nature Immunology. Springer Nature,
2022. https://doi.org/10.1038/s41590-022-01257-4.
ieee: F. P. Assen et al., “Multitier mechanics control stromal adaptations
in swelling lymph nodes,” Nature Immunology, vol. 23. Springer Nature,
pp. 1246–1255, 2022.
ista: Assen FP, Abe J, Hons M, Hauschild R, Shamipour S, Kaufmann W, Costanzo T,
Krens G, Brown M, Ludewig B, Hippenmeyer S, Heisenberg C-PJ, Weninger W, Hannezo
EB, Luther SA, Stein JV, Sixt MK. 2022. Multitier mechanics control stromal adaptations
in swelling lymph nodes. Nature Immunology. 23, 1246–1255.
mla: Assen, Frank P., et al. “Multitier Mechanics Control Stromal Adaptations in
Swelling Lymph Nodes.” Nature Immunology, vol. 23, Springer Nature, 2022,
pp. 1246–55, doi:10.1038/s41590-022-01257-4.
short: F.P. Assen, J. Abe, M. Hons, R. Hauschild, S. Shamipour, W. Kaufmann, T.
Costanzo, G. Krens, M. Brown, B. Ludewig, S. Hippenmeyer, C.-P.J. Heisenberg,
W. Weninger, E.B. Hannezo, S.A. Luther, J.V. Stein, M.K. Sixt, Nature Immunology
23 (2022) 1246–1255.
date_created: 2021-08-06T09:09:11Z
date_published: 2022-07-11T00:00:00Z
date_updated: 2023-08-02T06:53:07Z
day: '11'
ddc:
- '570'
department:
- _id: SiHi
- _id: CaHe
- _id: EdHa
- _id: EM-Fac
- _id: Bio
- _id: MiSi
doi: 10.1038/s41590-022-01257-4
ec_funded: 1
external_id:
isi:
- '000822975900002'
file:
- access_level: open_access
checksum: 628e7b49809f22c75b428842efe70c68
content_type: application/pdf
creator: dernst
date_created: 2022-07-25T07:11:32Z
date_updated: 2022-07-25T07:11:32Z
file_id: '11642'
file_name: 2022_NatureImmunology_Assen.pdf
file_size: 11475325
relation: main_file
success: 1
file_date_updated: 2022-07-25T07:11:32Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1246-1255
project:
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular navigation along spatial gradients
publication: Nature Immunology
publication_identifier:
eissn:
- 1529-2916
issn:
- 1529-2908
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multitier mechanics control stromal adaptations in swelling lymph nodes
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 23
year: '2022'
...
---
_id: '9649'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued
smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an
isomanifold is to consider its Piecewise-Linear (PL) approximation based on a
triangulation T of the ambient space Rd. In this paper, we give conditions under
which the PL-approximation of an isomanifold is topologically equivalent to the
isomanifold. The conditions are easy to satisfy in the sense that they can always
be met by taking a sufficiently\r\nfine triangulation T . This contrasts with
previous results on the triangulation of manifolds where, in arbitrary dimensions,
delicate perturbations are needed to guarantee topological correctness, which
leads to strong limitations in practice. We further give a bound on the Fréchet
distance between the original isomanifold and its PL-approximation. Finally we
show analogous results for the PL-approximation of an isomanifold with boundary."
acknowledgement: "First and foremost, we acknowledge Siargey Kachanovich for discussions.
We thank Herbert Edelsbrunner and all members of his group, all former and current
members of the Datashape team (formerly known as Geometrica), and André Lieutier
for encouragement. We further thank the reviewers of Foundations of Computational
Mathematics and the reviewers and program committee of the Symposium on Computational
Geometry for their feedback, which improved the exposition.\r\nThis work was funded
by the European Research Council under the European Union’s ERC Grant Agreement
number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher
Dimensions). This work was also supported by the French government, through the
3IA Côte d’Azur Investments in the Future project managed by the National Research
Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also
received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement no. 754411."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations
of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012.
doi:10.1007/s10208-021-09520-0
apa: Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness
of PL approximations of isomanifolds. Foundations of Computational Mathematics
. Springer Nature. https://doi.org/10.1007/s10208-021-09520-0
chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics
. Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0.
ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations
of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer
Nature, pp. 967–1012, 2022.
ista: Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations
of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.
mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics
, vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0.
short: J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22
(2022) 967–1012.
date_created: 2021-07-14T06:44:53Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2023-08-02T06:49:17Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s10208-021-09520-0
ec_funded: 1
external_id:
isi:
- '000673039600001'
file:
- access_level: open_access
checksum: f1d372ec3c08ec22e84f8e93e1126b8c
content_type: application/pdf
creator: mwintrae
date_created: 2021-07-14T06:44:36Z
date_updated: 2021-07-14T06:44:36Z
file_id: '9650'
file_name: Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf
file_size: 1455699
relation: main_file
file_date_updated: 2021-07-14T06:44:36Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '0'
oa: 1
oa_version: Published Version
page: 967-1012
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 'Foundations of Computational Mathematics '
publication_identifier:
eissn:
- 1615-3383
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '7952'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: The topological correctness of PL approximations of isomanifolds
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 22
year: '2022'
...
---
_id: '9364'
abstract:
- lang: eng
text: 'Let t : Fp → C be a complex valued function on Fp. A classical problem in
analytic number theory is bounding the maximum M(t) := max 0≤H 0 there exists a large subset of a ∈ F×p
such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1))
log log p, as p→∞. Finally, we prove a result on the growth of the moments of
{M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary);
14F20, 60F10 (Secondary).'
acknowledgement: I am most thankful to my advisor, Emmanuel Kowalski, for suggesting
this problem and for his guidance during these years. I also would like to thank
Youness Lamzouri for informing me about his work on sum of incomplete Birch sums
and Tal Horesh for her suggestions on a previous version of the paper. Finally,
I am very grateful to the anonymous referee for their careful reading of the manuscript
and their valuable comments.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Dante
full_name: Bonolis, Dante
id: 6A459894-5FDD-11E9-AF35-BB24E6697425
last_name: Bonolis
citation:
ama: Bonolis D. On the size of the maximum of incomplete Kloosterman sums. Mathematical
Proceedings of the Cambridge Philosophical Society. 2022;172(3):563-590. doi:10.1017/S030500412100030X
apa: Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums.
Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge
University Press. https://doi.org/10.1017/S030500412100030X
chicago: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.”
Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge
University Press, 2022. https://doi.org/10.1017/S030500412100030X.
ieee: D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” Mathematical
Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3. Cambridge
University Press, pp. 563–590, 2022.
ista: Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums.
Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590.
mla: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.”
Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172,
no. 3, Cambridge University Press, 2022, pp. 563–90, doi:10.1017/S030500412100030X.
short: D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society
172 (2022) 563–590.
date_created: 2021-05-02T22:01:29Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T06:47:48Z
day: '01'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1017/S030500412100030X
external_id:
arxiv:
- '1811.10563'
isi:
- '000784421500001'
file:
- access_level: open_access
checksum: 614d2e9b83a78100408e4ee7752a80a8
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-01T14:01:54Z
date_updated: 2021-12-01T14:01:54Z
file_id: '10395'
file_name: 2021_MathProcCamPhilSoc_Bonolis.pdf
file_size: 334064
relation: main_file
success: 1
file_date_updated: 2021-12-01T14:01:54Z
has_accepted_license: '1'
intvolume: ' 172'
isi: 1
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 563 - 590
publication: Mathematical Proceedings of the Cambridge Philosophical Society
publication_identifier:
eissn:
- 1469-8064
issn:
- 0305-0041
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the size of the maximum of incomplete Kloosterman sums
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 172
year: '2022'
...
---
_id: '9977'
abstract:
- lang: eng
text: "For a Seifert fibered homology sphere X we show that the q-series invariant
Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki
series Z0(X). We show that for every even k ∈ N there exists a full asymptotic
expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit
Zˆ0(X; e 2πi/k) exists and is equal to the\r\nWRT quantum invariant τk(X). We
show that the poles of the Borel transform of Z0(X) coincide with the classical
complex Chern-Simons values, which we further show classifies the corresponding
components of the moduli space of flat SL(2, C)-connections."
acknowledgement: "We warmly thank S. Gukov for valuable discussions on the GPPV invariant
̂Z\U0001D44E(\U0001D4403; \U0001D45E). The first\r\nauthor was supported in part
by the center of excellence grant ‘Center for Quantum Geometry\r\nof Moduli Spaces’
from the Danish National Research Foundation (DNRF95) and by the ERCSynergy\r\ngrant
‘ReNewQuantum’. The second author received funding from the European Union’s Horizon
2020 research and innovation program under the Marie Skłodowska-Curie grant agreement
no. 754411."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: William
full_name: Mistegaard, William
id: 41B03CD0-62AE-11E9-84EF-0718E6697425
last_name: Mistegaard
- first_name: Jørgen Ellegaard
full_name: Andersen, Jørgen Ellegaard
last_name: Andersen
citation:
ama: Mistegaard W, Andersen JE. Resurgence analysis of quantum invariants of Seifert
fibered homology spheres. Journal of the London Mathematical Society. 2022;105(2):709-764.
doi:10.1112/jlms.12506
apa: Mistegaard, W., & Andersen, J. E. (2022). Resurgence analysis of quantum
invariants of Seifert fibered homology spheres. Journal of the London Mathematical
Society. Wiley. https://doi.org/10.1112/jlms.12506
chicago: Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis
of Quantum Invariants of Seifert Fibered Homology Spheres.” Journal of the
London Mathematical Society. Wiley, 2022. https://doi.org/10.1112/jlms.12506.
ieee: W. Mistegaard and J. E. Andersen, “Resurgence analysis of quantum invariants
of Seifert fibered homology spheres,” Journal of the London Mathematical Society,
vol. 105, no. 2. Wiley, pp. 709–764, 2022.
ista: Mistegaard W, Andersen JE. 2022. Resurgence analysis of quantum invariants
of Seifert fibered homology spheres. Journal of the London Mathematical Society.
105(2), 709–764.
mla: Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of
Quantum Invariants of Seifert Fibered Homology Spheres.” Journal of the London
Mathematical Society, vol. 105, no. 2, Wiley, 2022, pp. 709–64, doi:10.1112/jlms.12506.
short: W. Mistegaard, J.E. Andersen, Journal of the London Mathematical Society
105 (2022) 709–764.
date_created: 2021-08-31T12:51:40Z
date_published: 2022-03-01T00:00:00Z
date_updated: 2023-08-02T06:53:51Z
day: '01'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.1112/jlms.12506
ec_funded: 1
external_id:
arxiv:
- '1811.05376'
isi:
- '000755205700001'
file:
- access_level: open_access
checksum: 9c72327d39f34f1a6eaa98fa4b8493f2
content_type: application/pdf
creator: dernst
date_created: 2022-03-24T11:42:25Z
date_updated: 2022-03-24T11:42:25Z
file_id: '10917'
file_name: 2022_JourLondonMathSoc_Andersen.pdf
file_size: 649130
relation: main_file
success: 1
file_date_updated: 2022-03-24T11:42:25Z
has_accepted_license: '1'
intvolume: ' 105'
isi: 1
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 709-764
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of the London Mathematical Society
publication_identifier:
eissn:
- 1469-7750
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resurgence analysis of quantum invariants of Seifert fibered homology spheres
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 105
year: '2022'
...
---
_id: '10016'
abstract:
- lang: eng
text: 'Auxin has always been at the forefront of research in plant physiology and
development. Since the earliest contemplations by Julius von Sachs and Charles
Darwin, more than a century-long struggle has been waged to understand its function.
This largely reflects the failures, successes, and inevitable progress in the
entire field of plant signaling and development. Here I present 14 stations on
our long and sometimes mystical journey to understand auxin. These highlights
were selected to give a flavor of the field and to show the scope and limits of
our current knowledge. A special focus is put on features that make auxin unique
among phytohormones, such as its dynamic, directional transport network, which
integrates external and internal signals, including self-organizing feedback.
Accented are persistent mysteries and controversies. The unexpected discoveries
related to rapid auxin responses and growth regulation recently disturbed our
contentment regarding understanding of the auxin signaling mechanism. These new
revelations, along with advances in technology, usher us into a new, exciting
era in auxin research. '
acknowledgement: "The author thanks the whole community of researchers consciously
or unconsciously working on questions related to auxin, whose hard work and enthusiasm
contributed to development of this exciting story. Particular thanks go to many\r\nbrilliant
present and past members of the Friml group and our numerous excellent collaborators,
without whom my own personal journey would not be possible. The way of the cross
with its 14 stations is a popular devotion among Roman Catholics and inspires them
to make a spiritual pilgrimage through contemplation of Christ on his last day.
Its aspects of gradual progress, struggle, passion, and revelation served as an
inspiration for the formal depiction of our journey to understanding auxin as described
in this review. It is in no way intended to reflect the personal beliefs of the
author and readers. I am grateful to Nick Barton, Eva Benková, Lenka Caisová, Matyáš
Fendrych, Lukáš Fiedler, Monika Frátriková, Jarmila Frimlová, Michelle Gallei, Jakub
Hajný, Lukas Hoermayer, Alexandra Mally, Ondrˇej Novák, Jan Petrášek, Aleš Pěnčík,
Steffen Vanneste, Tongda Xu, and Zhenbiao Yang for their valuable comments. Special
thanks go to Michelle Gallei for her invaluable assistance with the figures."
article_number: a039859
article_processing_charge: No
article_type: review
author:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Friml J. Fourteen stations of auxin. Cold Spring Harbor Perspectives in
Biology. 2022;14(5). doi:10.1101/cshperspect.a039859
apa: Friml, J. (2022). Fourteen stations of auxin. Cold Spring Harbor Perspectives
in Biology. Cold Spring Harbor Laboratory. https://doi.org/10.1101/cshperspect.a039859
chicago: Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives
in Biology. Cold Spring Harbor Laboratory, 2022. https://doi.org/10.1101/cshperspect.a039859 .
ieee: J. Friml, “Fourteen stations of auxin,” Cold Spring Harbor Perspectives
in Biology, vol. 14, no. 5. Cold Spring Harbor Laboratory, 2022.
ista: Friml J. 2022. Fourteen stations of auxin. Cold Spring Harbor Perspectives
in Biology. 14(5), a039859.
mla: Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives
in Biology, vol. 14, no. 5, a039859, Cold Spring Harbor Laboratory, 2022,
doi:10.1101/cshperspect.a039859
.
short: J. Friml, Cold Spring Harbor Perspectives in Biology 14 (2022).
date_created: 2021-09-14T11:36:53Z
date_published: 2022-05-27T00:00:00Z
date_updated: 2023-08-02T06:54:42Z
day: '27'
department:
- _id: JiFr
doi: '10.1101/cshperspect.a039859 '
external_id:
isi:
- '000806563000003'
pmid:
- '34400554'
intvolume: ' 14'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://doi.org/10.1101/cshperspect.a039859 '
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Cold Spring Harbor Perspectives in Biology
publication_identifier:
issn:
- 1943-0264
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fourteen stations of auxin
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 14
year: '2022'
...
---
_id: '10018'
abstract:
- lang: eng
text: In order to study integral points of bounded log-anticanonical height on weak
del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example,
we consider a quartic del Pezzo surface of singularity type A1 + A3 and prove
an analogue of Manin's conjecture for integral points with respect to its singularities
and its lines.
acknowledgement: The first author was partly supported by grant DE 1646/4-2 of the
Deutsche Forschungsgemeinschaft. The second author was partly supported by FWF grant
P 32428-N35 and conducted part of this work as a guest at the Institut de Mathématiques
de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Ulrich
full_name: Derenthal, Ulrich
last_name: Derenthal
- first_name: Florian Alexander
full_name: Wilsch, Florian Alexander
id: 560601DA-8D36-11E9-A136-7AC1E5697425
last_name: Wilsch
orcid: 0000-0001-7302-8256
citation:
ama: Derenthal U, Wilsch FA. Integral points on singular del Pezzo surfaces. Journal
of the Institute of Mathematics of Jussieu. 2022. doi:10.1017/S1474748022000482
apa: Derenthal, U., & Wilsch, F. A. (2022). Integral points on singular del
Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. Cambridge
University Press. https://doi.org/10.1017/S1474748022000482
chicago: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular
Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu.
Cambridge University Press, 2022. https://doi.org/10.1017/S1474748022000482.
ieee: U. Derenthal and F. A. Wilsch, “Integral points on singular del Pezzo surfaces,”
Journal of the Institute of Mathematics of Jussieu. Cambridge University
Press, 2022.
ista: Derenthal U, Wilsch FA. 2022. Integral points on singular del Pezzo surfaces.
Journal of the Institute of Mathematics of Jussieu.
mla: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular
Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu,
Cambridge University Press, 2022, doi:10.1017/S1474748022000482.
short: U. Derenthal, F.A. Wilsch, Journal of the Institute of Mathematics of Jussieu
(2022).
date_created: 2021-09-15T10:06:48Z
date_published: 2022-11-10T00:00:00Z
date_updated: 2023-08-02T06:55:10Z
day: '10'
department:
- _id: TiBr
doi: 10.1017/S1474748022000482
external_id:
arxiv:
- '2109.06778'
isi:
- '000881319200001'
isi: 1
keyword:
- Integral points
- del Pezzo surface
- universal torsor
- Manin’s conjecture
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1017/S1474748022000482
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P32428
name: New frontiers of the Manin conjecture
publication: Journal of the Institute of Mathematics of Jussieu
publication_identifier:
eissn:
- '1475-3030 '
issn:
- 1474-7480
publication_status: epub_ahead
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Integral points on singular del Pezzo surfaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2022'
...
---
_id: '10530'
abstract:
- lang: eng
text: "Cell dispersion from a confined area is fundamental in a number of biological
processes,\r\nincluding cancer metastasis. To date, a quantitative understanding
of the interplay of single\r\ncell motility, cell proliferation, and intercellular
contacts remains elusive. In particular, the role\r\nof E- and N-Cadherin junctions,
central components of intercellular contacts, is still\r\ncontroversial. Combining
theoretical modeling with in vitro observations, we investigate the\r\ncollective
spreading behavior of colonies of human cancer cells (T24). The spreading of these\r\ncolonies
is driven by stochastic single-cell migration with frequent transient cell-cell
contacts.\r\nWe find that inhibition of E- and N-Cadherin junctions decreases
colony spreading and average\r\nspreading velocities, without affecting the strength
of correlations in spreading velocities of\r\nneighboring cells. Based on a biophysical
simulation model for cell migration, we show that the\r\nbehavioral changes upon
disruption of these junctions can be explained by reduced repulsive\r\nexcluded
volume interactions between cells. This suggests that in cancer cell migration,\r\ncadherin-based
intercellular contacts sharpen cell boundaries leading to repulsive rather than\r\ncohesive
interactions between cells, thereby promoting efficient cell spreading during
collective\r\nmigration.\r\n"
acknowledgement: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research
Foundation) - Project-ID 201269156 - SFB 1032 (Projects B8 and B12). D.B.B. is supported
in part by a DFG fellowship within the Graduate School of Quantitative Biosciences
Munich (QBM) and by the Joachim Herz Stiftung.
article_processing_charge: No
article_type: original
author:
- first_name: Themistoklis
full_name: Zisis, Themistoklis
last_name: Zisis
- first_name: David
full_name: Brückner, David
id: e1e86031-6537-11eb-953a-f7ab92be508d
last_name: Brückner
orcid: 0000-0001-7205-2975
- first_name: Tom
full_name: Brandstätter, Tom
last_name: Brandstätter
- first_name: Wei Xiong
full_name: Siow, Wei Xiong
last_name: Siow
- first_name: Joseph
full_name: d’Alessandro, Joseph
last_name: d’Alessandro
- first_name: Angelika M.
full_name: Vollmar, Angelika M.
last_name: Vollmar
- first_name: Chase P.
full_name: Broedersz, Chase P.
last_name: Broedersz
- first_name: Stefan
full_name: Zahler, Stefan
last_name: Zahler
citation:
ama: Zisis T, Brückner D, Brandstätter T, et al. Disentangling cadherin-mediated
cell-cell interactions in collective cancer cell migration. Biophysical Journal.
2022;121(1):P44-60. doi:10.1016/j.bpj.2021.12.006
apa: Zisis, T., Brückner, D., Brandstätter, T., Siow, W. X., d’Alessandro, J., Vollmar,
A. M., … Zahler, S. (2022). Disentangling cadherin-mediated cell-cell interactions
in collective cancer cell migration. Biophysical Journal. Elsevier. https://doi.org/10.1016/j.bpj.2021.12.006
chicago: Zisis, Themistoklis, David Brückner, Tom Brandstätter, Wei Xiong Siow,
Joseph d’Alessandro, Angelika M. Vollmar, Chase P. Broedersz, and Stefan Zahler.
“Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell
Migration.” Biophysical Journal. Elsevier, 2022. https://doi.org/10.1016/j.bpj.2021.12.006.
ieee: T. Zisis et al., “Disentangling cadherin-mediated cell-cell interactions
in collective cancer cell migration,” Biophysical Journal, vol. 121, no.
1. Elsevier, pp. P44-60, 2022.
ista: Zisis T, Brückner D, Brandstätter T, Siow WX, d’Alessandro J, Vollmar AM,
Broedersz CP, Zahler S. 2022. Disentangling cadherin-mediated cell-cell interactions
in collective cancer cell migration. Biophysical Journal. 121(1), P44-60.
mla: Zisis, Themistoklis, et al. “Disentangling Cadherin-Mediated Cell-Cell Interactions
in Collective Cancer Cell Migration.” Biophysical Journal, vol. 121, no.
1, Elsevier, 2022, pp. P44-60, doi:10.1016/j.bpj.2021.12.006.
short: T. Zisis, D. Brückner, T. Brandstätter, W.X. Siow, J. d’Alessandro, A.M.
Vollmar, C.P. Broedersz, S. Zahler, Biophysical Journal 121 (2022) P44-60.
date_created: 2021-12-10T09:48:19Z
date_published: 2022-01-04T00:00:00Z
date_updated: 2023-08-02T13:34:25Z
day: '04'
ddc:
- '570'
department:
- _id: EdHa
- _id: GaTk
doi: 10.1016/j.bpj.2021.12.006
external_id:
isi:
- '000740815400007'
file:
- access_level: open_access
checksum: 1aa7c3478e0c8256b973b632efd1f6b4
content_type: application/pdf
creator: dernst
date_created: 2022-07-29T10:17:10Z
date_updated: 2022-07-29T10:17:10Z
file_id: '11697'
file_name: 2022_BiophysicalJour_Zisis.pdf
file_size: 4475504
relation: main_file
success: 1
file_date_updated: 2022-07-29T10:17:10Z
has_accepted_license: '1'
intvolume: ' 121'
isi: 1
issue: '1'
keyword:
- Biophysics
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: P44-60
project:
- _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A
name: NOMIS Fellowship Program
publication: Biophysical Journal
publication_identifier:
issn:
- 0006-3495
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Disentangling cadherin-mediated cell-cell interactions in collective cancer
cell migration
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 121
year: '2022'
...
---
_id: '10548'
abstract:
- lang: eng
text: "Consider a linear elliptic partial differential equation in divergence form
with a random coefficient field. The solution operator displays fluctuations around
its expectation. The recently developed pathwise theory of fluctuations in stochastic
homogenization reduces the characterization of these fluctuations to those of
the so-called standard homogenization commutator. In this contribution, we investigate
the scaling limit of this key quantity: starting\r\nfrom a Gaussian-like coefficient
field with possibly strong correlations, we establish the convergence of the rescaled
commutator to a fractional Gaussian field, depending on the decay of correlations
of the coefficient field, and we\r\ninvestigate the (non)degeneracy of the limit.
This extends to general dimension $d\\ge1$ previous results so far limited to
dimension $d=1$, and to the continuum setting with strong correlations recent
results in the discrete iid case."
acknowledgement: The authors thank Ivan Nourdin and Felix Otto for inspiring discussions.
The work of MD is financially supported by the CNRS-Momentum program. Financial
support of AG is acknowledged from the European Research Council under the European
Community’s Seventh Framework Programme (FP7/2014-2019 Grant Agreement QUANTHOM
335410).
article_processing_charge: No
article_type: original
author:
- first_name: Mitia
full_name: Duerinckx, Mitia
last_name: Duerinckx
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Antoine
full_name: Gloria, Antoine
last_name: Gloria
citation:
ama: Duerinckx M, Fischer JL, Gloria A. Scaling limit of the homogenization commutator
for Gaussian coefficient fields. Annals of applied probability. 2022;32(2):1179-1209.
doi:10.1214/21-AAP1705
apa: Duerinckx, M., Fischer, J. L., & Gloria, A. (2022). Scaling limit of the
homogenization commutator for Gaussian coefficient fields. Annals of Applied
Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/21-AAP1705
chicago: Duerinckx, Mitia, Julian L Fischer, and Antoine Gloria. “Scaling Limit
of the Homogenization Commutator for Gaussian Coefficient Fields.” Annals
of Applied Probability. Institute of Mathematical Statistics, 2022. https://doi.org/10.1214/21-AAP1705.
ieee: M. Duerinckx, J. L. Fischer, and A. Gloria, “Scaling limit of the homogenization
commutator for Gaussian coefficient fields,” Annals of applied probability,
vol. 32, no. 2. Institute of Mathematical Statistics, pp. 1179–1209, 2022.
ista: Duerinckx M, Fischer JL, Gloria A. 2022. Scaling limit of the homogenization
commutator for Gaussian coefficient fields. Annals of applied probability. 32(2),
1179–1209.
mla: Duerinckx, Mitia, et al. “Scaling Limit of the Homogenization Commutator for
Gaussian Coefficient Fields.” Annals of Applied Probability, vol. 32,
no. 2, Institute of Mathematical Statistics, 2022, pp. 1179–209, doi:10.1214/21-AAP1705.
short: M. Duerinckx, J.L. Fischer, A. Gloria, Annals of Applied Probability 32 (2022)
1179–1209.
date_created: 2021-12-16T12:10:16Z
date_published: 2022-04-28T00:00:00Z
date_updated: 2023-08-02T13:35:06Z
day: '28'
department:
- _id: JuFi
doi: 10.1214/21-AAP1705
external_id:
arxiv:
- '1910.04088'
isi:
- '000791003700011'
intvolume: ' 32'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.04088
month: '04'
oa: 1
oa_version: Preprint
page: 1179-1209
publication: Annals of applied probability
publication_identifier:
issn:
- 1050-5164
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scaling limit of the homogenization commutator for Gaussian coefficient fields
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 32
year: '2022'
...
---
_id: '10583'
abstract:
- lang: eng
text: The synthetic strigolactone (SL) analog, rac-GR24, has been instrumental in
studying the role of SLs as well as karrikins because it activates the receptors
DWARF14 (D14) and KARRIKIN INSENSITIVE 2 (KAI2) of their signaling pathways, respectively.
Treatment with rac-GR24 modifies the root architecture at different levels, such
as decreasing the lateral root density (LRD), while promoting root hair elongation
or flavonol accumulation. Previously, we have shown that the flavonol biosynthesis
is transcriptionally activated in the root by rac-GR24 treatment, but, thus far,
the molecular players involved in that response have remained unknown. To get
an in-depth insight into the changes that occur after the compound is perceived
by the roots, we compared the root transcriptomes of the wild type and the more
axillary growth2 (max2) mutant, affected in both SL and karrikin signaling pathways,
with and without rac-GR24 treatment. Quantitative reverse transcription (qRT)-PCR,
reporter line analysis and mutant phenotyping indicated that the flavonol response
and the root hair elongation are controlled by the ELONGATED HYPOCOTYL 5 (HY5)
and MYB12 transcription factors, but HY5, in contrast to MYB12, affects the LRD
as well. Furthermore, we identified the transcription factors TARGET OF MONOPTEROS
5 (TMO5) and TMO5 LIKE1 as negative and the Mediator complex as positive regulators
of the rac-GR24 effect on LRD. Altogether, hereby, we get closer toward understanding
the molecular mechanisms that underlay the rac-GR24 responses in the root.
acknowledgement: The authors thank Ralf Stracke (Bielefeld University, Bielefeld,
Germany) for providing the myb mutants and their colleagues Bert De Rybel for the
tmo5t;mo5l1 double mutant, Boris Parizot for tips on the RNA-seq analysis, Veronique
Storme for statistical help on both the RNA-seq and lateral root density, and Martine
De Cock for help in preparing the manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: Sylwia
full_name: Struk, Sylwia
last_name: Struk
- first_name: Lukas
full_name: Braem, Lukas
last_name: Braem
- first_name: Cedrick
full_name: Matthys, Cedrick
last_name: Matthys
- first_name: Alan
full_name: Walton, Alan
last_name: Walton
- first_name: Nick
full_name: Vangheluwe, Nick
last_name: Vangheluwe
- first_name: Stan
full_name: Van Praet, Stan
last_name: Van Praet
- first_name: Lingxiang
full_name: Jiang, Lingxiang
last_name: Jiang
- first_name: Pawel
full_name: Baster, Pawel
id: 3028BD74-F248-11E8-B48F-1D18A9856A87
last_name: Baster
- first_name: Carolien
full_name: De Cuyper, Carolien
last_name: De Cuyper
- first_name: Francois-Didier
full_name: Boyer, Francois-Didier
last_name: Boyer
- first_name: Elisabeth
full_name: Stes, Elisabeth
last_name: Stes
- first_name: Tom
full_name: Beeckman, Tom
last_name: Beeckman
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Kris
full_name: Gevaert, Kris
last_name: Gevaert
- first_name: Sofie
full_name: Goormachtig, Sofie
last_name: Goormachtig
citation:
ama: Struk S, Braem L, Matthys C, et al. Transcriptional analysis in the Arabidopsis
roots reveals new regulators that link rac-GR24 treatment with changes in flavonol
accumulation, root hair elongation and lateral root density. Plant & Cell
Physiology. 2022;63(1):104-119. doi:10.1093/pcp/pcab149
apa: Struk, S., Braem, L., Matthys, C., Walton, A., Vangheluwe, N., Van Praet, S.,
… Goormachtig, S. (2022). Transcriptional analysis in the Arabidopsis roots reveals
new regulators that link rac-GR24 treatment with changes in flavonol accumulation,
root hair elongation and lateral root density. Plant & Cell Physiology.
Oxford University Press. https://doi.org/10.1093/pcp/pcab149
chicago: Struk, Sylwia, Lukas Braem, Cedrick Matthys, Alan Walton, Nick Vangheluwe,
Stan Van Praet, Lingxiang Jiang, et al. “Transcriptional Analysis in the Arabidopsis
Roots Reveals New Regulators That Link Rac-GR24 Treatment with Changes in Flavonol
Accumulation, Root Hair Elongation and Lateral Root Density.” Plant & Cell
Physiology. Oxford University Press, 2022. https://doi.org/10.1093/pcp/pcab149.
ieee: S. Struk et al., “Transcriptional analysis in the Arabidopsis roots
reveals new regulators that link rac-GR24 treatment with changes in flavonol accumulation,
root hair elongation and lateral root density,” Plant & Cell Physiology,
vol. 63, no. 1. Oxford University Press, pp. 104–119, 2022.
ista: Struk S, Braem L, Matthys C, Walton A, Vangheluwe N, Van Praet S, Jiang L,
Baster P, De Cuyper C, Boyer F-D, Stes E, Beeckman T, Friml J, Gevaert K, Goormachtig
S. 2022. Transcriptional analysis in the Arabidopsis roots reveals new regulators
that link rac-GR24 treatment with changes in flavonol accumulation, root hair
elongation and lateral root density. Plant & Cell Physiology. 63(1), 104–119.
mla: Struk, Sylwia, et al. “Transcriptional Analysis in the Arabidopsis Roots Reveals
New Regulators That Link Rac-GR24 Treatment with Changes in Flavonol Accumulation,
Root Hair Elongation and Lateral Root Density.” Plant & Cell Physiology,
vol. 63, no. 1, Oxford University Press, 2022, pp. 104–19, doi:10.1093/pcp/pcab149.
short: S. Struk, L. Braem, C. Matthys, A. Walton, N. Vangheluwe, S. Van Praet, L.
Jiang, P. Baster, C. De Cuyper, F.-D. Boyer, E. Stes, T. Beeckman, J. Friml, K.
Gevaert, S. Goormachtig, Plant & Cell Physiology 63 (2022) 104–119.
date_created: 2021-12-28T11:44:18Z
date_published: 2022-01-21T00:00:00Z
date_updated: 2023-08-02T13:40:43Z
day: '21'
department:
- _id: JiFr
doi: 10.1093/pcp/pcab149
external_id:
isi:
- '000877899400009'
pmid:
- '34791413'
intvolume: ' 63'
isi: 1
issue: '1'
keyword:
- flavonols
- MAX2
- rac-Gr24
- RNA-seq
- root development
- transcriptional regulation
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/pcp/pcab149
month: '01'
oa: 1
oa_version: Published Version
page: 104-119
pmid: 1
publication: Plant & Cell Physiology
publication_identifier:
eissn:
- 1471-9053
issn:
- 0032-0781
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transcriptional analysis in the Arabidopsis roots reveals new regulators that
link rac-GR24 treatment with changes in flavonol accumulation, root hair elongation
and lateral root density
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 63
year: '2022'
...
---
_id: '10588'
abstract:
- lang: eng
text: We prove the Sobolev-to-Lipschitz property for metric measure spaces satisfying
the quasi curvature-dimension condition recently introduced in Milman (Commun
Pure Appl Math, to appear). We provide several applications to properties of the
corresponding heat semigroup. In particular, under the additional assumption of
infinitesimal Hilbertianity, we show the Varadhan short-time asymptotics for the
heat semigroup with respect to the distance, and prove the irreducibility of the
heat semigroup. These results apply in particular to large classes of (ideal)
sub-Riemannian manifolds.
acknowledgement: "The authors are grateful to Dr. Bang-Xian Han for helpful discussions
on the Sobolev-to-Lipschitz property on metric measure spaces, and to Professor
Kazuhiro Kuwae, Professor Emanuel Milman, Dr. Giorgio Stefani, and Dr. Gioacchino
Antonelli for reading a preliminary version of this work and for their valuable
comments and suggestions. Finally, they wish to express their gratitude to two anonymous
Reviewers whose suggestions improved the presentation of this work.\r\n\r\nL.D.S.
gratefully acknowledges funding of his position by the Austrian Science Fund (FWF)
grant F65, and by the European Research Council (ERC, grant No. 716117, awarded
to Prof. Dr. Jan Maas).\r\n\r\nK.S. gratefully acknowledges funding by: the JSPS
Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research
Center Initiative (WPI), MEXT, Japan; JSPS Grant-in-Aid for Scientific Research
on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number
17H06465; and the Alexander von Humboldt Stiftung, Humboldt-Forschungsstipendium."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Lorenzo
full_name: Dello Schiavo, Lorenzo
id: ECEBF480-9E4F-11EA-B557-B0823DDC885E
last_name: Dello Schiavo
orcid: 0000-0002-9881-6870
- first_name: Kohei
full_name: Suzuki, Kohei
last_name: Suzuki
citation:
ama: Dello Schiavo L, Suzuki K. Sobolev-to-Lipschitz property on QCD- spaces and
applications. Mathematische Annalen. 2022;384:1815-1832. doi:10.1007/s00208-021-02331-2
apa: Dello Schiavo, L., & Suzuki, K. (2022). Sobolev-to-Lipschitz property on
QCD- spaces and applications. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-021-02331-2
chicago: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property
on QCD- Spaces and Applications.” Mathematische Annalen. Springer Nature,
2022. https://doi.org/10.1007/s00208-021-02331-2.
ieee: L. Dello Schiavo and K. Suzuki, “Sobolev-to-Lipschitz property on QCD- spaces
and applications,” Mathematische Annalen, vol. 384. Springer Nature, pp.
1815–1832, 2022.
ista: Dello Schiavo L, Suzuki K. 2022. Sobolev-to-Lipschitz property on QCD- spaces
and applications. Mathematische Annalen. 384, 1815–1832.
mla: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property on
QCD- Spaces and Applications.” Mathematische Annalen, vol. 384, Springer
Nature, 2022, pp. 1815–32, doi:10.1007/s00208-021-02331-2.
short: L. Dello Schiavo, K. Suzuki, Mathematische Annalen 384 (2022) 1815–1832.
date_created: 2022-01-02T23:01:35Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-08-02T13:39:05Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00208-021-02331-2
ec_funded: 1
external_id:
arxiv:
- '2110.05137'
isi:
- '000734150200001'
file:
- access_level: open_access
checksum: 2593abbf195e38efa93b6006b1e90eb1
content_type: application/pdf
creator: alisjak
date_created: 2022-01-03T11:08:31Z
date_updated: 2022-01-03T11:08:31Z
file_id: '10596'
file_name: 2021_MathAnn_DelloSchiavo.pdf
file_size: 410090
relation: main_file
success: 1
file_date_updated: 2022-01-03T11:08:31Z
has_accepted_license: '1'
intvolume: ' 384'
isi: 1
keyword:
- quasi curvature-dimension condition
- sub-riemannian geometry
- Sobolev-to-Lipschitz property
- Varadhan short-time asymptotics
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1815-1832
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Mathematische Annalen
publication_identifier:
eissn:
- 1432-1807
issn:
- 0025-5831
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sobolev-to-Lipschitz property on QCD- spaces and applications
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 384
year: '2022'
...
---
_id: '10602'
abstract:
- lang: eng
text: Transforming ω-automata into parity automata is traditionally done using appearance
records. We present an efficient variant of this idea, tailored to Rabin automata,
and several optimizations applicable to all appearance records. We compare the
methods experimentally and show that our method produces significantly smaller
automata than previous approaches.
acknowledgement: This work is partially funded by the German Research Foundation (DFG)
projects Verified Model Checkers (No. 317422601) and Statistical Unbounded Verification
(No. 383882557), and the Alexander von Humboldt Foundation with funds from the German
Federal Ministry of Education and Research. It is an extended version of [21], including
all proofs together with further explanations and examples. Moreover, we provide
a new, more efficient construction based on (total) preorders, unifying previous
optimizations. Experiments are performed with a new, performant implementation,
comparing our approach to the current state of the art.
article_processing_charge: Yes (via OA deal)
article_type: original
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
with preorders. Acta Informatica. 2022;59:585-618. doi:10.1007/s00236-021-00412-y
apa: Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2022).
Index appearance record with preorders. Acta Informatica. Springer Nature.
https://doi.org/10.1007/s00236-021-00412-y
chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger.
“Index Appearance Record with Preorders.” Acta Informatica. Springer Nature,
2022. https://doi.org/10.1007/s00236-021-00412-y.
ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance
record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp.
585–618, 2022.
ista: Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance
record with preorders. Acta Informatica. 59, 585–618.
mla: Kretinsky, Jan, et al. “Index Appearance Record with Preorders.” Acta Informatica,
vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y.
short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica
59 (2022) 585–618.
date_created: 2022-01-06T12:37:27Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2023-08-02T13:49:28Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/s00236-021-00412-y
external_id:
isi:
- '000735765500001'
file:
- access_level: open_access
checksum: bf1c195b6aaf59e8530cf9e3a9d731f7
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-07T07:50:31Z
date_updated: 2022-01-07T07:50:31Z
file_id: '10603'
file_name: 2021_ActaInfor_Křetínský.pdf
file_size: 1066082
relation: main_file
success: 1
file_date_updated: 2022-01-07T07:50:31Z
has_accepted_license: '1'
intvolume: ' 59'
isi: 1
keyword:
- computer networks and communications
- information systems
- software
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 585-618
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Acta Informatica
publication_identifier:
eissn:
- 1432-0525
issn:
- 0001-5903
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Index appearance record with preorders
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 59
year: '2022'
...
---
_id: '10600'
abstract:
- lang: eng
text: We show that recent results on adiabatic theory for interacting gapped many-body
systems on finite lattices remain valid in the thermodynamic limit. More precisely,
we prove a generalized super-adiabatic theorem for the automorphism group describing
the infinite volume dynamics on the quasi-local algebra of observables. The key
assumption is the existence of a sequence of gapped finite volume Hamiltonians,
which generates the same infinite volume dynamics in the thermodynamic limit.
Our adiabatic theorem also holds for certain perturbations of gapped ground states
that close the spectral gap (so it is also an adiabatic theorem for resonances
and, in this sense, “generalized”), and it provides an adiabatic approximation
to all orders in the adiabatic parameter (a property often called “super-adiabatic”).
In addition to the existing results for finite lattices, we also perform a resummation
of the adiabatic expansion and allow for observables that are not strictly local.
Finally, as an application, we prove the validity of linear and higher order response
theory for our class of perturbations for infinite systems. While we consider
the result and its proof as new and interesting in itself, we also lay the foundation
for the proof of an adiabatic theorem for systems with a gap only in the bulk,
which will be presented in a follow-up article.
acknowledgement: J.H. acknowledges partial financial support from ERC Advanced Grant
“RMTBeyond” No. 101020331.
article_number: '011901'
article_processing_charge: No
article_type: original
author:
- first_name: Sven Joscha
full_name: Henheik, Sven Joscha
id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
last_name: Henheik
orcid: 0000-0003-1106-327X
- first_name: Stefan
full_name: Teufel, Stefan
last_name: Teufel
citation:
ama: 'Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems
with a uniform gap. Journal of Mathematical Physics. 2022;63(1). doi:10.1063/5.0051632'
apa: 'Henheik, S. J., & Teufel, S. (2022). Adiabatic theorem in the thermodynamic
limit: Systems with a uniform gap. Journal of Mathematical Physics. AIP
Publishing. https://doi.org/10.1063/5.0051632'
chicago: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
Limit: Systems with a Uniform Gap.” Journal of Mathematical Physics. AIP
Publishing, 2022. https://doi.org/10.1063/5.0051632.'
ieee: 'S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit:
Systems with a uniform gap,” Journal of Mathematical Physics, vol. 63,
no. 1. AIP Publishing, 2022.'
ista: 'Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit:
Systems with a uniform gap. Journal of Mathematical Physics. 63(1), 011901.'
mla: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
Limit: Systems with a Uniform Gap.” Journal of Mathematical Physics, vol.
63, no. 1, 011901, AIP Publishing, 2022, doi:10.1063/5.0051632.'
short: S.J. Henheik, S. Teufel, Journal of Mathematical Physics 63 (2022).
date_created: 2022-01-03T12:19:48Z
date_published: 2022-01-03T00:00:00Z
date_updated: 2023-08-02T13:44:32Z
day: '03'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1063/5.0051632
ec_funded: 1
external_id:
arxiv:
- '2012.15238'
isi:
- '000739446000009'
intvolume: ' 63'
isi: 1
issue: '1'
keyword:
- mathematical physics
- statistical and nonlinear physics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2012.15238
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Journal of Mathematical Physics
publication_identifier:
eissn:
- 1089-7658
issn:
- 0022-2488
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
status: public
title: 'Adiabatic theorem in the thermodynamic limit: Systems with a uniform gap'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 63
year: '2022'
...
---
_id: '10587'
abstract:
- lang: eng
text: Access to a blossoming library of colloidal nanomaterials provides building
blocks for complex assembled materials. The journey to bring these prospects to
fruition stands to benefit from the application of advanced processing methods.
Epitaxially connected nanocrystal (or quantum dot) superlattices present a captivating
model system for mesocrystals with intriguing emergent properties. The conventional
processing approach to creating these materials involves assembling and attaching
the constituent nanocrystals at the interface between two immiscible fluids. Processing
small liquid volumes of the colloidal nanocrystal solution involves several complexities
arising from the concurrent spreading, evaporation, assembly, and attachment.
The ability of inkjet printers to deliver small (typically picoliter) liquid volumes
with precise positioning is attractive to advance fundamental insights into the
processing science, and thereby potentially enable new routes to incorporate the
epitaxially connected superlattices into technology platforms. In this study,
we identified the processing window of opportunity, including nanocrystal ink
formulation and printing approach to enable delivery of colloidal nanocrystals
from an inkjet nozzle onto the surface of a sessile droplet of the immiscible
subphase. We demonstrate how inkjet printing can be scaled-down to enable the
fabrication of epitaxially connected superlattices on patterned sub-millimeter
droplets. We anticipate that insights from this work will spur on future advances
to enable more mechanistic insights into the assembly processes and new avenues
to create high-fidelity superlattices.
acknowledgement: This project was supported by the US Department of Energy through
award (No. DE-SC0018026). The work was performed in part at the Cornell NanoScale
Facility, a member of the National Nanotechnology Coordinated Infrastructure (NNCI),
which is supported by the National Science Foundation (No. NNCI-1542081) and in
part at the Cornell Center for Materials Research with funding from the NSF MRSEC
program (No. DMR-1719875). The authors thank Beth Rhodes for the technical assistance
with inkjet printing, and E. Peretz and Q. Wen for the early exploratory experiments.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Balazs, Daniel
id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E
last_name: Balazs
orcid: 0000-0001-7597-043X
- first_name: N. Deniz
full_name: Erkan, N. Deniz
last_name: Erkan
- first_name: Michelle
full_name: Quien, Michelle
last_name: Quien
- first_name: Tobias
full_name: Hanrath, Tobias
last_name: Hanrath
citation:
ama: Balazs D, Erkan ND, Quien M, Hanrath T. Inkjet printing of epitaxially connected
nanocrystal superlattices. Nano Research. 2022;15(5):4536–4543. doi:10.1007/s12274-021-4022-7
apa: Balazs, D., Erkan, N. D., Quien, M., & Hanrath, T. (2022). Inkjet printing
of epitaxially connected nanocrystal superlattices. Nano Research. Springer
Nature. https://doi.org/10.1007/s12274-021-4022-7
chicago: Balazs, Daniel, N. Deniz Erkan, Michelle Quien, and Tobias Hanrath. “Inkjet
Printing of Epitaxially Connected Nanocrystal Superlattices.” Nano Research.
Springer Nature, 2022. https://doi.org/10.1007/s12274-021-4022-7.
ieee: D. Balazs, N. D. Erkan, M. Quien, and T. Hanrath, “Inkjet printing of epitaxially
connected nanocrystal superlattices,” Nano Research, vol. 15, no. 5. Springer
Nature, pp. 4536–4543, 2022.
ista: Balazs D, Erkan ND, Quien M, Hanrath T. 2022. Inkjet printing of epitaxially
connected nanocrystal superlattices. Nano Research. 15(5), 4536–4543.
mla: Balazs, Daniel, et al. “Inkjet Printing of Epitaxially Connected Nanocrystal
Superlattices.” Nano Research, vol. 15, no. 5, Springer Nature, 2022, pp.
4536–4543, doi:10.1007/s12274-021-4022-7.
short: D. Balazs, N.D. Erkan, M. Quien, T. Hanrath, Nano Research 15 (2022) 4536–4543.
date_created: 2022-01-02T23:01:34Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T13:47:21Z
day: '01'
department:
- _id: MaIb
doi: 10.1007/s12274-021-4022-7
external_id:
isi:
- '000735340300001'
intvolume: ' 15'
isi: 1
issue: '5'
keyword:
- interfacial assembly
- colloidal nanocrystal
- superlattice
- inkjet printing
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.osti.gov/biblio/1837946
month: '05'
oa: 1
oa_version: Submitted Version
page: 4536–4543
publication: Nano Research
publication_identifier:
eissn:
- 1998-0000
issn:
- 1998-0124
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inkjet printing of epitaxially connected nanocrystal superlattices
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2022'
...
---
_id: '10547'
abstract:
- lang: eng
text: "We establish global-in-time existence results for thermodynamically consistent
reaction-(cross-)diffusion systems coupled to an equation describing heat transfer.
Our main interest is to model species-dependent diffusivities,\r\nwhile at the
same time ensuring thermodynamic consistency. A key difficulty of the non-isothermal
case lies in the intrinsic presence of cross-diffusion type phenomena like the
Soret and the Dufour effect: due to the temperature/energy dependence of the thermodynamic
equilibria, a nonvanishing temperature gradient may drive a concentration flux
even in a situation with constant concentrations; likewise, a nonvanishing concentration
gradient may drive a heat flux even in a case of spatially constant temperature.
We use time discretisation and regularisation techniques and derive a priori estimates
based on a suitable entropy and the associated entropy production. Renormalised
solutions are used in cases where non-integrable diffusion fluxes or reaction
terms appear."
acknowledgement: M.K. gratefully acknowledges the hospitality of WIAS Berlin, where
a major part of the project was carried out. The research stay of M.K. at WIAS Berlin
was funded by the Austrian Federal Ministry of Education, Science and Research through
a research fellowship for graduates of a promotio sub auspiciis. The research of
A.M. has been partially supported by Deutsche Forschungsgemeinschaft (DFG) through
the Collaborative Research Center SFB 1114 “Scaling Cascades in Complex Systems”
(Project no. 235221301), Subproject C05 “Effective models for materials and interfaces
with multiple scales”. J.F. and A.M. are grateful for the hospitality of the Erwin
Schrödinger Institute in Vienna, where some ideas for this work have been developed.
The authors are grateful to two anonymous referees for several helpful comments,
in particular for the short proof of estimate (2.7).
article_processing_charge: No
article_type: original
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Katharina
full_name: Hopf, Katharina
last_name: Hopf
- first_name: Michael
full_name: Kniely, Michael
id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87
last_name: Kniely
orcid: 0000-0001-5645-4333
- first_name: Alexander
full_name: Mielke, Alexander
last_name: Mielke
citation:
ama: Fischer JL, Hopf K, Kniely M, Mielke A. Global existence analysis of energy-reaction-diffusion
systems. SIAM Journal on Mathematical Analysis. 2022;54(1):220-267. doi:10.1137/20M1387237
apa: Fischer, J. L., Hopf, K., Kniely, M., & Mielke, A. (2022). Global existence
analysis of energy-reaction-diffusion systems. SIAM Journal on Mathematical
Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/20M1387237
chicago: Fischer, Julian L, Katharina Hopf, Michael Kniely, and Alexander Mielke.
“Global Existence Analysis of Energy-Reaction-Diffusion Systems.” SIAM Journal
on Mathematical Analysis. Society for Industrial and Applied Mathematics,
2022. https://doi.org/10.1137/20M1387237.
ieee: J. L. Fischer, K. Hopf, M. Kniely, and A. Mielke, “Global existence analysis
of energy-reaction-diffusion systems,” SIAM Journal on Mathematical Analysis,
vol. 54, no. 1. Society for Industrial and Applied Mathematics, pp. 220–267, 2022.
ista: Fischer JL, Hopf K, Kniely M, Mielke A. 2022. Global existence analysis of
energy-reaction-diffusion systems. SIAM Journal on Mathematical Analysis. 54(1),
220–267.
mla: Fischer, Julian L., et al. “Global Existence Analysis of Energy-Reaction-Diffusion
Systems.” SIAM Journal on Mathematical Analysis, vol. 54, no. 1, Society
for Industrial and Applied Mathematics, 2022, pp. 220–67, doi:10.1137/20M1387237.
short: J.L. Fischer, K. Hopf, M. Kniely, A. Mielke, SIAM Journal on Mathematical
Analysis 54 (2022) 220–267.
date_created: 2021-12-16T12:08:56Z
date_published: 2022-01-04T00:00:00Z
date_updated: 2023-08-02T13:37:03Z
day: '04'
department:
- _id: JuFi
doi: 10.1137/20M1387237
external_id:
arxiv:
- '2012.03792 '
isi:
- '000762768000006'
intvolume: ' 54'
isi: 1
issue: '1'
keyword:
- Energy-Reaction-Diffusion Systems
- Cross Diffusion
- Global-In-Time Existence of Weak/Renormalised Solutions
- Entropy Method
- Onsager System
- Soret/Dufour Effect
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.03792
month: '01'
oa: 1
oa_version: Preprint
page: 220-267
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
issn:
- 0036-1410
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Global existence analysis of energy-reaction-diffusion systems
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 54
year: '2022'
...
---
_id: '10604'
abstract:
- lang: eng
text: Maternally inherited Wolbachia transinfections are being introduced into natural
mosquito populations to reduce the transmission of dengue, Zika, and other arboviruses.
Wolbachia-induced cytoplasmic incompatibility provides a frequency-dependent reproductive
advantage to infected females that can spread transinfections within and among
populations. However, because transinfections generally reduce host fitness, they
tend to spread within populations only after their frequency exceeds a critical
threshold. This produces bistability with stable equilibrium frequencies at both
0 and 1, analogous to the bistability produced by underdominance between alleles
or karyotypes and by population dynamics under Allee effects. Here, we analyze
how stochastic frequency variation produced by finite population size can facilitate
the local spread of variants with bistable dynamics into areas where invasion
is unexpected from deterministic models. Our exemplar is the establishment of
wMel Wolbachia in the Aedes aegypti population of Pyramid Estates (PE), a small
community in far north Queensland, Australia. In 2011, wMel was stably introduced
into Gordonvale, separated from PE by barriers to A. aegypti dispersal. After
nearly 6 years during which wMel was observed only at low frequencies in PE, corresponding
to an apparent equilibrium between immigration and selection, wMel rose to fixation
by 2018. Using analytic approximations and statistical analyses, we demonstrate
that the observed fixation of wMel at PE is consistent with both stochastic transition
past an unstable threshold frequency and deterministic transformation produced
by steady immigration at a rate just above the threshold required for deterministic
invasion. The indeterminacy results from a delicate balance of parameters needed
to produce the delayed transition observed. Our analyses suggest that once Wolbachia
transinfections are established locally through systematic introductions, stochastic
“threshold crossing” is likely to only minimally enhance spatial spread, providing
a local ratchet that slightly—but systematically—aids area-wide transformation
of disease-vector populations in heterogeneous landscapes.
acknowledgement: We thank S. O'Neill, C. Simmons, and the World Mosquito Project for
providing access to unpublished data. S. Ritchie provided valuable insights into
Aedes aegypti biology and the literature describing A. aegypti populations near
Cairns. We thank B. Cooper for help with the figures and D. Shropshire, S. O'Neill,
S. Ritchie, A. Hoffmann, B. Cooper, and members of the Cooper lab for comments on
an earlier draft. Comments from three reviewers greatly improved our presentation.
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Turelli, Michael
last_name: Turelli
- 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: Turelli M, Barton NH. Why did the Wolbachia transinfection cross the road?
Drift, deterministic dynamics, and disease control. Evolution Letters.
2022;6(1):92-105. doi:10.1002/evl3.270
apa: Turelli, M., & Barton, N. H. (2022). Why did the Wolbachia transinfection
cross the road? Drift, deterministic dynamics, and disease control. Evolution
Letters. Wiley. https://doi.org/10.1002/evl3.270
chicago: Turelli, Michael, and Nicholas H Barton. “Why Did the Wolbachia Transinfection
Cross the Road? Drift, Deterministic Dynamics, and Disease Control.” Evolution
Letters. Wiley, 2022. https://doi.org/10.1002/evl3.270.
ieee: M. Turelli and N. H. Barton, “Why did the Wolbachia transinfection cross the
road? Drift, deterministic dynamics, and disease control,” Evolution Letters,
vol. 6, no. 1. Wiley, pp. 92–105, 2022.
ista: Turelli M, Barton NH. 2022. Why did the Wolbachia transinfection cross the
road? Drift, deterministic dynamics, and disease control. Evolution Letters. 6(1),
92–105.
mla: Turelli, Michael, and Nicholas H. Barton. “Why Did the Wolbachia Transinfection
Cross the Road? Drift, Deterministic Dynamics, and Disease Control.” Evolution
Letters, vol. 6, no. 1, Wiley, 2022, pp. 92–105, doi:10.1002/evl3.270.
short: M. Turelli, N.H. Barton, Evolution Letters 6 (2022) 92–105.
date_created: 2022-01-09T09:45:17Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2023-08-02T13:50:09Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1002/evl3.270
external_id:
isi:
- '000754412600008'
file:
- access_level: open_access
checksum: 7e9a37e3b65b480cd7014a6a4a7e460a
content_type: application/pdf
creator: dernst
date_created: 2022-07-29T06:59:10Z
date_updated: 2022-07-29T06:59:10Z
file_id: '11689'
file_name: 2022_EvolutionLetters_Turelli.pdf
file_size: 2435185
relation: main_file
success: 1
file_date_updated: 2022-07-29T06:59:10Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '1'
keyword:
- genetics
- ecology
- evolution
- behavior and systematics
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 92-105
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '11686'
relation: research_data
status: public
status: public
title: Why did the Wolbachia transinfection cross the road? Drift, deterministic dynamics,
and disease control
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 6
year: '2022'
...
---
_id: '10639'
abstract:
- lang: eng
text: With more than 80 members worldwide, the Orthobunyavirus genus in the Peribunyaviridae
family is a large genus of enveloped RNA viruses, many of which are emerging pathogens
in humans and livestock. How orthobunyaviruses (OBVs) penetrate and infect mammalian
host cells remains poorly characterized. Here, we investigated the entry mechanisms
of the OBV Germiston (GERV). Viral particles were visualized by cryo-electron
microscopy and appeared roughly spherical with an average diameter of 98 nm. Labeling
of the virus with fluorescent dyes did not adversely affect its infectivity and
allowed the monitoring of single particles in fixed and live cells. Using this
approach, we found that endocytic internalization of bound viruses was asynchronous
and occurred within 30-40 min. The virus entered Rab5a+ early endosomes and, subsequently,
late endosomal vacuoles containing Rab7a but not LAMP-1. Infectious entry did
not require proteolytic cleavage, and endosomal acidification was sufficient and
necessary for viral fusion. Acid-activated penetration began 15-25 min after initiation
of virus internalization and relied on maturation of early endosomes to late endosomes.
The optimal pH for viral membrane fusion was slightly below 6.0, and penetration
was hampered when the potassium influx was abolished. Overall, our study provides
real-time visualization of GERV entry into host cells and demonstrates the importance
of late endosomal maturation in facilitating OBV penetration.
acknowledged_ssus:
- _id: EM-Fac
acknowledgement: This work was supported by INRAE starter funds, Project IDEXLYON (University of Lyon)
within the Programme Investissements d’Avenir (ANR-16-IDEX-0005), and FINOVIAO14
(Fondation pour l’Université de Lyon), all to P.Y.L. This work was also supported by
CellNetworks Research Group funds and Deutsche Forschungsgemeinschaft (DFG) funding
(grant numbers LO-2338/1-1 and LO-2338/3-1) awarded to P.Y.L., Austrian Science Fund
(FWF) grant P31445 to F.K.M.S., a Chinese Scholarship Council (CSC;no. 201904910701)
fellowship to Q.X., and a ministére de l’enseignement supérieur, de la recherche et de
l’innovation (MESRI) doctoral thesis grant to M.D.
article_number: e02146-21
article_processing_charge: No
article_type: original
author:
- first_name: Stefan
full_name: Windhaber, Stefan
last_name: Windhaber
- first_name: Qilin
full_name: Xin, Qilin
last_name: Xin
- first_name: Zina M.
full_name: Uckeley, Zina M.
last_name: Uckeley
- first_name: Jana
full_name: Koch, Jana
last_name: Koch
- first_name: Martin
full_name: Obr, Martin
id: 4741CA5A-F248-11E8-B48F-1D18A9856A87
last_name: Obr
- first_name: Céline
full_name: Garnier, Céline
last_name: Garnier
- first_name: Catherine
full_name: Luengo-Guyonnot, Catherine
last_name: Luengo-Guyonnot
- first_name: Maëva
full_name: Duboeuf, Maëva
last_name: Duboeuf
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Pierre-Yves
full_name: Lozach, Pierre-Yves
last_name: Lozach
citation:
ama: Windhaber S, Xin Q, Uckeley ZM, et al. The Orthobunyavirus Germiston enters
host cells from late endosomes. Journal of Virology. 2022;96(5). doi:10.1128/jvi.02146-21
apa: Windhaber, S., Xin, Q., Uckeley, Z. M., Koch, J., Obr, M., Garnier, C., … Lozach,
P.-Y. (2022). The Orthobunyavirus Germiston enters host cells from late endosomes.
Journal of Virology. American Society for Microbiology. https://doi.org/10.1128/jvi.02146-21
chicago: Windhaber, Stefan, Qilin Xin, Zina M. Uckeley, Jana Koch, Martin Obr, Céline
Garnier, Catherine Luengo-Guyonnot, Maëva Duboeuf, Florian KM Schur, and Pierre-Yves
Lozach. “The Orthobunyavirus Germiston Enters Host Cells from Late Endosomes.”
Journal of Virology. American Society for Microbiology, 2022. https://doi.org/10.1128/jvi.02146-21.
ieee: S. Windhaber et al., “The Orthobunyavirus Germiston enters host cells
from late endosomes,” Journal of Virology, vol. 96, no. 5. American Society
for Microbiology, 2022.
ista: Windhaber S, Xin Q, Uckeley ZM, Koch J, Obr M, Garnier C, Luengo-Guyonnot
C, Duboeuf M, Schur FK, Lozach P-Y. 2022. The Orthobunyavirus Germiston enters
host cells from late endosomes. Journal of Virology. 96(5), e02146-21.
mla: Windhaber, Stefan, et al. “The Orthobunyavirus Germiston Enters Host Cells
from Late Endosomes.” Journal of Virology, vol. 96, no. 5, e02146-21, American
Society for Microbiology, 2022, doi:10.1128/jvi.02146-21.
short: S. Windhaber, Q. Xin, Z.M. Uckeley, J. Koch, M. Obr, C. Garnier, C. Luengo-Guyonnot,
M. Duboeuf, F.K. Schur, P.-Y. Lozach, Journal of Virology 96 (2022).
date_created: 2022-01-18T10:04:18Z
date_published: 2022-03-01T00:00:00Z
date_updated: 2023-08-02T13:52:33Z
day: '01'
department:
- _id: FlSc
doi: 10.1128/jvi.02146-21
external_id:
isi:
- '000779305000033'
pmid:
- '35019710'
intvolume: ' 96'
isi: 1
issue: '5'
keyword:
- virology
- insect science
- immunology
- microbiology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8906410
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 26736D6A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31445
name: Structural conservation and diversity in retroviral capsid
publication: Journal of Virology
publication_identifier:
eissn:
- 1098-5514
issn:
- 0022-538X
publication_status: published
publisher: American Society for Microbiology
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Orthobunyavirus Germiston enters host cells from late endosomes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 96
year: '2022'
...
---
_id: '10642'
abstract:
- lang: eng
text: Based on a result by Yarotsky (J Stat Phys 118, 2005), we prove that localized
but otherwise arbitrary perturbations of weakly interacting quantum spin systems
with uniformly gapped on-site terms change the ground state of such a system only
locally, even if they close the spectral gap. We call this a strong version of
the local perturbations perturb locally (LPPL) principle which is known to hold
for much more general gapped systems, but only for perturbations that do not close
the spectral gap of the Hamiltonian. We also extend this strong LPPL-principle
to Hamiltonians that have the appropriate structure of gapped on-site terms and
weak interactions only locally in some region of space. While our results are
technically corollaries to a theorem of Yarotsky, we expect that the paradigm
of systems with a locally gapped ground state that is completely insensitive to
the form of the Hamiltonian elsewhere extends to other situations and has important
physical consequences.
acknowledgement: J. H. acknowledges partial financial support by the ERC Advanced
Grant “RMTBeyond” No. 101020331. S. T. thanks Marius Lemm and Simone Warzel for
very helpful comments and discussions and Jürg Fröhlich for references to the literature.
Open Access funding enabled and organized by Projekt DEAL.
article_number: '9'
article_processing_charge: No
article_type: original
author:
- first_name: Sven Joscha
full_name: Henheik, Sven Joscha
id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
last_name: Henheik
orcid: 0000-0003-1106-327X
- first_name: Stefan
full_name: Teufel, Stefan
last_name: Teufel
- first_name: Tom
full_name: Wessel, Tom
last_name: Wessel
citation:
ama: Henheik SJ, Teufel S, Wessel T. Local stability of ground states in locally
gapped and weakly interacting quantum spin systems. Letters in Mathematical
Physics. 2022;112(1). doi:10.1007/s11005-021-01494-y
apa: Henheik, S. J., Teufel, S., & Wessel, T. (2022). Local stability of ground
states in locally gapped and weakly interacting quantum spin systems. Letters
in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-021-01494-y
chicago: Henheik, Sven Joscha, Stefan Teufel, and Tom Wessel. “Local Stability of
Ground States in Locally Gapped and Weakly Interacting Quantum Spin Systems.”
Letters in Mathematical Physics. Springer Nature, 2022. https://doi.org/10.1007/s11005-021-01494-y.
ieee: S. J. Henheik, S. Teufel, and T. Wessel, “Local stability of ground states
in locally gapped and weakly interacting quantum spin systems,” Letters in
Mathematical Physics, vol. 112, no. 1. Springer Nature, 2022.
ista: Henheik SJ, Teufel S, Wessel T. 2022. Local stability of ground states in
locally gapped and weakly interacting quantum spin systems. Letters in Mathematical
Physics. 112(1), 9.
mla: Henheik, Sven Joscha, et al. “Local Stability of Ground States in Locally Gapped
and Weakly Interacting Quantum Spin Systems.” Letters in Mathematical Physics,
vol. 112, no. 1, 9, Springer Nature, 2022, doi:10.1007/s11005-021-01494-y.
short: S.J. Henheik, S. Teufel, T. Wessel, Letters in Mathematical Physics 112 (2022).
date_created: 2022-01-18T16:18:25Z
date_published: 2022-01-18T00:00:00Z
date_updated: 2023-08-02T13:57:02Z
day: '18'
ddc:
- '530'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1007/s11005-021-01494-y
ec_funded: 1
external_id:
arxiv:
- '2106.13780'
isi:
- '000744930400001'
file:
- access_level: open_access
checksum: 7e8e69b76e892c305071a4736131fe18
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-19T09:41:14Z
date_updated: 2022-01-19T09:41:14Z
file_id: '10647'
file_name: 2022_LettersMathPhys_Henheik.pdf
file_size: 357547
relation: main_file
success: 1
file_date_updated: 2022-01-19T09:41:14Z
has_accepted_license: '1'
intvolume: ' 112'
isi: 1
issue: '1'
keyword:
- mathematical physics
- statistical and nonlinear physics
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Letters in Mathematical Physics
publication_identifier:
eissn:
- 1573-0530
issn:
- 0377-9017
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Local stability of ground states in locally gapped and weakly interacting quantum
spin systems
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 112
year: '2022'
...