---
_id: '8600'
abstract:
- lang: eng
text: 'A vector addition system with states (VASS) consists of a finite set of states
and counters. A transition changes the current state to the next state, and every
counter is either incremented, or decremented, or left unchanged. A state and
value for each counter is a configuration; and a computation is an infinite sequence
of configurations with transitions between successive configurations. A probabilistic
VASS consists of a VASS along with a probability distribution over the transitions
for each state. Qualitative properties such as state and configuration reachability
have been widely studied for VASS. In this work we consider multi-dimensional
long-run average objectives for VASS and probabilistic VASS. For a counter, the
cost of a configuration is the value of the counter; and the long-run average
value of a computation for the counter is the long-run average of the costs of
the configurations in the computation. The multi-dimensional long-run average
problem given a VASS and a threshold value for each counter, asks whether there
is a computation such that for each counter the long-run average value for the
counter does not exceed the respective threshold. For probabilistic VASS, instead
of the existence of a computation, we consider whether the expected long-run average
value for each counter does not exceed the respective threshold. Our main results
are as follows: we show that the multi-dimensional long-run average problem (a)
is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued
VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for
probabilistic integer-valued VASS, and probabilistic natural-valued VASS when
all computations are non-terminating.'
alternative_title:
- LIPIcs
article_number: '23'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems
for vector addition systems with states. In: 31st International Conference
on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2020. doi:10.4230/LIPIcs.CONCUR.2020.23'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional
long-run average problems for vector addition systems with states. In 31st
International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional
Long-Run Average Problems for Vector Addition Systems with States.” In 31st
International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average
problems for vector addition systems with states,” in 31st International Conference
on Concurrency Theory, Virtual, 2020, vol. 171.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average
problems for vector addition systems with states. 31st International Conference
on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol.
171, 23.'
mla: Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems
for Vector Addition Systems with States.” 31st International Conference on
Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.CONCUR.2020.23.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-04
location: Virtual
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2020-09-01
date_created: 2020-10-04T22:01:36Z
date_published: 2020-08-06T00:00:00Z
date_updated: 2021-01-12T08:20:15Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2020.23
external_id:
arxiv:
- '2007.08917'
file:
- access_level: open_access
checksum: 5039752f644c4b72b9361d21a5e31baf
content_type: application/pdf
creator: dernst
date_created: 2020-10-05T14:04:25Z
date_updated: 2020-10-05T14:04:25Z
file_id: '8610'
file_name: 2020_LIPIcsCONCUR_Chatterjee.pdf
file_size: 601231
relation: main_file
success: 1
file_date_updated: 2020-10-05T14:04:25Z
has_accepted_license: '1'
intvolume: ' 171'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 31st International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959771603'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-dimensional long-run average problems for vector addition systems with
states
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2020'
...
---
_id: '8599'
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 study 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 show how minor changes in the
bidding mechanism lead to unexpected differences in the equivalence with random-turn
games.
acknowledgement: We 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.
alternative_title:
- LIPIcs
article_number: '2'
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. A survey of bidding games on graphs. In: 31st International
Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2'
apa: 'Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs.
In 31st International Conference on Concurrency Theory (Vol. 171). Virtual:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2'
chicago: Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.”
In 31st International Conference on Concurrency Theory, Vol. 171. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2.
ieee: G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st
International Conference on Concurrency Theory, Virtual, 2020, vol. 171.
ista: 'Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International
Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs,
vol. 171, 2.'
mla: Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.”
31st International Conference on Concurrency Theory, vol. 171, 2, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.
short: G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency
Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-04
location: Virtual
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2020-09-01
date_created: 2020-10-04T22:01:36Z
date_published: 2020-08-06T00:00:00Z
date_updated: 2021-01-12T08:20:13Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2020.2
file:
- access_level: open_access
checksum: 8f33b098e73724e0ac817f764d8e1a2d
content_type: application/pdf
creator: dernst
date_created: 2020-10-05T14:13:19Z
date_updated: 2020-10-05T14:13:19Z
file_id: '8611'
file_name: 2020_LIPIcsCONCUR_Avni.pdf
file_size: 868510
relation: main_file
success: 1
file_date_updated: 2020-10-05T14:13:19Z
has_accepted_license: '1'
intvolume: ' 171'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 31st International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959771603'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A survey of bidding games on graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2020'
...
---
_id: '8725'
abstract:
- lang: eng
text: "The design and implementation of efficient concurrent data structures have\r\nseen
significant attention. However, most of this work has focused on\r\nconcurrent
data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads,
objects are often accessed at different rates, since access\r\ndistributions may
be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in
the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to
translate efficiently in the concurrent case.\r\n In this paper, we investigate
distribution-adaptive concurrent data\r\nstructures and propose a new design called
the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list,
with the key distinction that\r\nthe height of each element adapts dynamically
to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements
decrease in height. We\r\nshow that the splay-list provides order-optimal amortized
complexity bounds for\r\na subset of operations while being amenable to efficient
concurrent\r\nimplementation. Experimental results show that the splay-list can
leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns,
and can outperform the only previously-known distribution-adaptive\r\ndesign in
certain settings."
acknowledgement: "Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan
Alistarh: ERC Starting Grant 805223 ScaleML."
article_processing_charge: No
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- 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: Alexandra
full_name: Drozdova, Alexandra
last_name: Drozdova
- first_name: Amirkeivan
full_name: Mohtashami, Amirkeivan
last_name: Mohtashami
citation:
ama: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive
concurrent skip-list. In: 34th International Symposium on Distributed Computing.
Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18.
doi:10.4230/LIPIcs.DISC.2020.3'
apa: 'Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2020). The
splay-list: A distribution-adaptive concurrent skip-list. In 34th International
Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.3'
chicago: 'Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan
Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In
34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.'
ieee: 'V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list:
A distribution-adaptive concurrent skip-list,” in 34th International Symposium
on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.'
ista: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list:
A distribution-adaptive concurrent skip-list. 34th International Symposium on
Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179,
3:1-3:18.'
mla: 'Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent
Skip-List.” 34th International Symposium on Distributed Computing, vol.
179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.'
short: V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International
Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, p. 3:1-3:18.
conference:
end_date: 2020-10-16
location: Freiburg, Germany
name: 'DISC: Symposium on Distributed Computing'
start_date: 2020-10-12
date_created: 2020-11-05T15:26:17Z
date_published: 2020-08-03T00:00:00Z
date_updated: 2023-02-23T13:41:40Z
day: '03'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.4230/LIPIcs.DISC.2020.3
ec_funded: 1
external_id:
arxiv:
- '2008.01009'
file:
- access_level: open_access
checksum: a626a9c47df52b6f6d97edd910dae4ba
content_type: application/pdf
creator: dernst
date_created: 2021-03-11T12:33:35Z
date_updated: 2021-03-11T12:33:35Z
file_id: '9237'
file_name: 2020_LIPIcs_Aksenov.pdf
file_size: 740358
relation: main_file
success: 1
file_date_updated: 2021-03-11T12:33:35Z
has_accepted_license: '1'
intvolume: ' 179'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 3:1-3:18
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 34th International Symposium on Distributed Computing
publication_identifier:
isbn:
- '9783959771689'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
series_title: LIPIcs
status: public
title: 'The splay-list: A distribution-adaptive concurrent skip-list'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 179
year: '2020'
...
---
_id: '8726'
abstract:
- lang: eng
text: Several realistic spin-orbital models for transition metal oxides go beyond
the classical expectations and could be understood only by employing the quantum
entanglement. Experiments on these materials confirm that spin-orbital entanglement
has measurable consequences. Here, we capture the essential features of spin-orbital
entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates
SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site
spin-orbit coupling. Building on the results obtained for full and effective models
in the regime of strong spin-orbit coupling, we address the question whether the
entanglement found on superexchange bonds always increases when the Ising spin-orbit
coupling is added. We show that (i) quantum entanglement is amplified by strong
spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states
are possible. We complete the latter case by analyzing how the entanglement existing
for intermediate values of spin-orbit coupling can disappear for higher values
of this coupling.
article_number: '53'
article_processing_charge: No
article_type: original
author:
- first_name: Dorota
full_name: Gotfryd, Dorota
last_name: Gotfryd
- first_name: Ekaterina
full_name: Paerschke, Ekaterina
id: 8275014E-6063-11E9-9B7F-6338E6697425
last_name: Paerschke
orcid: 0000-0003-0853-8182
- first_name: Krzysztof
full_name: Wohlfeld, Krzysztof
last_name: Wohlfeld
- first_name: Andrzej M.
full_name: Oleś, Andrzej M.
last_name: Oleś
citation:
ama: Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement
with increasing ising spin-orbit coupling. Condensed Matter. 2020;5(3).
doi:10.3390/condmat5030053
apa: Gotfryd, D., Paerschke, E., Wohlfeld, K., & Oleś, A. M. (2020). Evolution
of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed
Matter. MDPI. https://doi.org/10.3390/condmat5030053
chicago: Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M.
Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit
Coupling.” Condensed Matter. MDPI, 2020. https://doi.org/10.3390/condmat5030053.
ieee: D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital
entanglement with increasing ising spin-orbit coupling,” Condensed Matter,
vol. 5, no. 3. MDPI, 2020.
ista: Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital
entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3),
53.
mla: Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing
Ising Spin-Orbit Coupling.” Condensed Matter, vol. 5, no. 3, 53, MDPI,
2020, doi:10.3390/condmat5030053.
short: D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).
date_created: 2020-11-06T07:21:00Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2021-01-12T08:20:46Z
day: '26'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.3390/condmat5030053
ec_funded: 1
external_id:
arxiv:
- '2009.11773'
file:
- access_level: open_access
checksum: a57a698ff99a11b6665bafd1bac7afbc
content_type: application/pdf
creator: dernst
date_created: 2020-11-06T07:24:40Z
date_updated: 2020-11-06T07:24:40Z
file_id: '8727'
file_name: 2020_CondensedMatter_Gotfryd.pdf
file_size: 768336
relation: main_file
success: 1
file_date_updated: 2020-11-06T07:24:40Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Condensed Matter
publication_identifier:
issn:
- 2410-3896
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling
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: 5
year: '2020'
...
---
_id: '9040'
abstract:
- lang: eng
text: Machine learning and formal methods have complimentary benefits and drawbacks.
In this work, we address the controller-design problem with a combination of techniques
from both fields. The use of black-box neural networks in deep reinforcement learning
(deep RL) poses a challenge for such a combination. Instead of reasoning formally
about the output of deep RL, which we call the wizard, we extract from it a decision-tree
based model, which we refer to as the magic book. Using the extracted model as
an intermediary, we are able to handle problems that are infeasible for either
deep RL or formal methods by themselves. First, we suggest, for the first time,
a synthesis procedure that is based on a magic book. We synthesize a stand-alone
correct-by-design controller that enjoys the favorable performance of RL. Second,
we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows
us to find numerous traces of the plant under the control of the wizard, which
a user can use to increase the trustworthiness of the wizard and direct further
training.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein Award).
article_processing_charge: No
author:
- first_name: Par Alizadeh
full_name: Alamdari, Par Alizadeh
last_name: Alamdari
- 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
- first_name: Anna
full_name: Lukina, Anna
id: CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425
last_name: Lukina
citation:
ama: 'Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of
magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided
Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21'
apa: 'Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal
methods with a touch of magic. In Proceedings of the 20th Conference on Formal
Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien
Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21'
chicago: Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina.
“Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference
on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press,
2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21.
ieee: P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with
a touch of magic,” in Proceedings of the 20th Conference on Formal Methods
in Computer-Aided Design, Online Conference, 2020, pp. 138–147.
ista: 'Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a
touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided
Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.'
mla: Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings
of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien
Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.
short: P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the
20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press,
2020, pp. 138–147.
conference:
end_date: 2020-09-24
location: Online Conference
name: ' FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2020-09-21
date_created: 2021-01-24T23:01:10Z
date_published: 2020-09-21T00:00:00Z
date_updated: 2021-02-09T09:39:59Z
day: '21'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.34727/2020/isbn.978-3-85448-042-6_21
file:
- access_level: open_access
checksum: d616d549a0ade78606b16f8a9540820f
content_type: application/pdf
creator: dernst
date_created: 2021-02-09T09:39:02Z
date_updated: 2021-02-09T09:39:02Z
file_id: '9109'
file_name: 2020_FMCAD_Alamdari.pdf
file_size: 990999
relation: main_file
success: 1
file_date_updated: 2021-02-09T09:39:02Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 138-147
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 20th Conference on Formal Methods in Computer-Aided
Design
publication_identifier:
eissn:
- 2708-7824
isbn:
- '9783854480426'
publication_status: published
publisher: TU Wien Academic Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Formal methods with a touch of magic
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: '2020'
...
---
_id: '9249'
abstract:
- lang: eng
text: Rhombic dodecahedron is a space filling polyhedron which represents the close
packing of spheres in 3D space and the Voronoi structures of the face centered
cubic (FCC) lattice. In this paper, we describe a new coordinate system where
every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid.
In order to illustrate the interest of the new coordinate system, we propose the
characterization of 3D digital plane with its topological features, such as the
interrelation between the thickness of the digital plane and the separability
constraint we aim to obtain. We also present the characterization of 3D digital
lines and study it as the intersection of multiple digital planes. Characterization
of 3D digital sphere with relevant topological features is proposed as well along
with the 48-symmetry appearing in the new coordinate system.
acknowledgement: "This work has been partially supported by the European Research
Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation
programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109,
‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no.
I 02979-N35. "
article_processing_charge: No
article_type: original
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Gaëlle
full_name: Largeteau-Skapin, Gaëlle
last_name: Largeteau-Skapin
- first_name: Rita
full_name: Zrour, Rita
last_name: Zrour
- first_name: Eric
full_name: Andres, Eric
last_name: Andres
citation:
ama: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic
dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158.
doi:10.1515/mathm-2020-0106
apa: Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital
objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and
Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106
chicago: Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital
Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and
Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106.
ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects
in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications,
vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.
ista: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in
rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications.
4(1), 143–158.
mla: Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical
Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp.
143–58, doi:10.1515/mathm-2020-0106.
short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology
- Theory and Applications 4 (2020) 143–158.
date_created: 2021-03-16T08:55:19Z
date_published: 2020-11-17T00:00:00Z
date_updated: 2021-03-22T09:01:50Z
day: '17'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1515/mathm-2020-0106
ec_funded: 1
file:
- access_level: open_access
checksum: 4a1043fa0548a725d464017fe2483ce0
content_type: application/pdf
creator: dernst
date_created: 2021-03-22T08:56:37Z
date_updated: 2021-03-22T08:56:37Z
file_id: '9272'
file_name: 2020_MathMorpholTheoryAppl_Biswas.pdf
file_size: 3668725
relation: main_file
success: 1
file_date_updated: 2021-03-22T08:56:37Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 143-158
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Mathematical Morphology - Theory and Applications
publication_identifier:
issn:
- 2353-3390
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
status: public
title: Digital objects in rhombic dodecahedron grid
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2020'
...
---
_id: '9299'
abstract:
- lang: eng
text: We call a multigraph non-homotopic if it can be drawn in the plane in such
a way that no two edges connecting the same pair of vertices can be continuously
transformed into each other without passing through a vertex, and no loop can
be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic
multigraph on n>1 vertices can have arbitrarily many edges. We prove that the
number of crossings between the edges of a non-homotopic multigraph with n vertices
and m>4n edges is larger than cm2n for some constant c>0 , and that this
bound is tight up to a polylogarithmic factor. We also show that the lower bound
is not asymptotically sharp as n is fixed and m⟶∞ .
acknowledgement: Supported by the National Research, Development and Innovation Office,
NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional
Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant
Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant
No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full
version can be found at https://arxiv.org/abs/2006.14908.
article_processing_charge: No
author:
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Gábor
full_name: Tardos, Gábor
last_name: Tardos
- first_name: Géza
full_name: Tóth, Géza
last_name: Tóth
citation:
ama: 'Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th
International Symposium on Graph Drawing and Network Visualization. Vol 12590.
LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28'
apa: 'Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic
edges. In 28th International Symposium on Graph Drawing and Network Visualization
(Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28'
chicago: Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic
Edges.” In 28th International Symposium on Graph Drawing and Network Visualization,
12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28.
ieee: J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,”
in 28th International Symposium on Graph Drawing and Network Visualization,
Virtual, Online, 2020, vol. 12590, pp. 359–371.
ista: 'Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th
International Symposium on Graph Drawing and Network Visualization. GD: Graph
Drawing and Network VisualizationLNCS vol. 12590, 359–371.'
mla: Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International
Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer
Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.
short: J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing
and Network Visualization, Springer Nature, 2020, pp. 359–371.
conference:
end_date: 2020-09-18
location: Virtual, Online
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2020-09-16
date_created: 2021-03-28T22:01:44Z
date_published: 2020-09-20T00:00:00Z
date_updated: 2021-04-06T11:32:32Z
day: '20'
department:
- _id: HeEd
doi: 10.1007/978-3-030-68766-3_28
external_id:
arxiv:
- '2006.14908'
intvolume: ' 12590'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2006.14908
month: '09'
oa: 1
oa_version: Preprint
page: 359-371
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
publication: 28th International Symposium on Graph Drawing and Network Visualization
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030687656'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Crossings between non-homotopic edges
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12590
year: '2020'
...
---
_id: '9632'
abstract:
- lang: eng
text: "Second-order information, in the form of Hessian- or Inverse-Hessian-vector
products, is a fundamental tool for solving optimization problems. Recently, there
has been significant interest in utilizing this information in the context of
deep\r\nneural networks; however, relatively little is known about the quality
of existing approximations in this context. Our work examines this question, identifies
issues with existing approaches, and proposes a method called WoodFisher to compute
a faithful and efficient estimate of the inverse Hessian. Our main application
is to neural network compression, where we build on the classic Optimal Brain
Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms
popular state-of-the-art methods for oneshot pruning. Further, even when iterative,
gradual pruning is allowed, our method results in a gain in test accuracy over
the state-of-the-art approaches, for standard image classification datasets such
as ImageNet ILSVRC. We examine how our method can be extended to take into account
first-order information, as well as\r\nillustrate its ability to automatically
set layer-wise pruning thresholds and perform compression in the limited-data
regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher."
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko,
Alexandra Peste, and other members of the group for fruitful discussions.
article_processing_charge: No
author:
- first_name: Sidak Pal
full_name: Singh, Sidak Pal
id: DD138E24-D89D-11E9-9DC0-DEF6E5697425
last_name: Singh
- 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: 'Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for
neural network compression. In: Advances in Neural Information Processing Systems.
Vol 33. Curran Associates; 2020:18098-18109.'
apa: 'Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order
approximation for neural network compression. In Advances in Neural Information
Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.'
chicago: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order
Approximation for Neural Network Compression.” In Advances in Neural Information
Processing Systems, 33:18098–109. Curran Associates, 2020.'
ieee: 'S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation
for neural network compression,” in Advances in Neural Information Processing
Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.'
ista: 'Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation
for neural network compression. Advances in Neural Information Processing Systems.
NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.'
mla: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order
Approximation for Neural Network Compression.” Advances in Neural Information
Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.'
short: S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing
Systems, Curran Associates, 2020, pp. 18098–18109.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2023-02-23T14:03:06Z
day: '06'
department:
- _id: DaAl
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '2004.14340'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
page: 18098-18109
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
issn:
- '10495258'
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'WoodFisher: Efficient second-order approximation for neural network compression'
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 33
year: '2020'
...
---
_id: '9630'
abstract:
- lang: eng
text: Various kinds of data are routinely represented as discrete probability distributions.
Examples include text documents summarized by histograms of word occurrences and
images represented as histograms of oriented gradients. Viewing a discrete probability
distribution as a point in the standard simplex of the appropriate dimension,
we can understand collections of such objects in geometric and topological terms. Importantly,
instead of using the standard Euclidean distance, we look into dissimilarity measures
with information-theoretic justification, and we develop the theory needed for
applying topological data analysis in this setting. In doing so, we emphasize
constructions that enable the usage of existing computational topology software
in this context.
acknowledgement: This research is partially supported by the Office of Naval Research,
through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR
109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of
the Austrian Science Fund (FWF).
article_processing_charge: Yes
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ziga
full_name: Virk, Ziga
id: 2E36B656-F248-11E8-B48F-1D18A9856A87
last_name: Virk
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information
space. Journal of Computational Geometry. 2020;11(2):162-182. doi:10.20382/jocg.v11i2a7
apa: Edelsbrunner, H., Virk, Z., & Wagner, H. (2020). Topological data analysis
in information space. Journal of Computational Geometry. Carleton University.
https://doi.org/10.20382/jocg.v11i2a7
chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data
Analysis in Information Space.” Journal of Computational Geometry. Carleton
University, 2020. https://doi.org/10.20382/jocg.v11i2a7.
ieee: H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information
space,” Journal of Computational Geometry, vol. 11, no. 2. Carleton University,
pp. 162–182, 2020.
ista: Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information
space. Journal of Computational Geometry. 11(2), 162–182.
mla: Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.”
Journal of Computational Geometry, vol. 11, no. 2, Carleton University,
2020, pp. 162–82, doi:10.20382/jocg.v11i2a7.
short: H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11
(2020) 162–182.
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2021-08-11T12:26:34Z
day: '14'
ddc:
- '510'
- '000'
department:
- _id: HeEd
doi: 10.20382/jocg.v11i2a7
file:
- access_level: open_access
checksum: f02d0b2b3838e7891a6c417fc34ffdcd
content_type: application/pdf
creator: asandaue
date_created: 2021-08-11T11:55:11Z
date_updated: 2021-08-11T11:55:11Z
file_id: '9882'
file_name: 2020_JournalOfComputationalGeometry_Edelsbrunner.pdf
file_size: 1449234
relation: main_file
success: 1
file_date_updated: 2021-08-11T11:55:11Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '2'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 162-182
project:
- _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316
grant_number: I4887
name: Discretization in Geometry and Dynamics
publication: Journal of Computational Geometry
publication_identifier:
eissn:
- 1920180X
publication_status: published
publisher: Carleton University
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topological data analysis in information space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 11
year: '2020'
...
---
_id: '9631'
abstract:
- lang: eng
text: The ability to leverage large-scale hardware parallelism has been one of the
key enablers of the accelerated recent progress in machine learning. Consequently,
there has been considerable effort invested into developing efficient parallel
variants of classic machine learning algorithms. However, despite the wealth of
knowledge on parallelization, some classic machine learning algorithms often prove
hard to parallelize efficiently while maintaining convergence. In this paper,
we focus on efficient parallel algorithms for the key machine learning task of
inference on graphical models, in particular on the fundamental belief propagation
algorithm. We address the challenge of efficiently parallelizing this classic
paradigm by showing how to leverage scalable relaxed schedulers in this context.
We present an extensive empirical study, showing that our approach outperforms
previous parallel belief propagation implementations both in terms of scalability
and in terms of wall-clock convergence time, on a range of practical applications.
acknowledgement: "We thank Marco Mondelli for discussions related to LDPC decoding,
and Giorgi Nadiradze for discussions on analysis of relaxed schedulers. This project
has received funding from the European Research Council (ERC) under the European\r\nUnion’s
Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML)."
article_processing_charge: No
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- 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: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
citation:
ama: 'Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed
scheduling. In: Advances in Neural Information Processing Systems. Vol
33. Curran Associates; 2020:22361-22372.'
apa: 'Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation
via relaxed scheduling. In Advances in Neural Information Processing Systems
(Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.'
chicago: Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief
Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing
Systems, 33:22361–72. Curran Associates, 2020.
ieee: V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation
via relaxed scheduling,” in Advances in Neural Information Processing Systems,
Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.
ista: 'Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via
relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS:
Conference on Neural Information Processing Systems vol. 33, 22361–22372.'
mla: Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.”
Advances in Neural Information Processing Systems, vol. 33, Curran Associates,
2020, pp. 22361–72.
short: V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information
Processing Systems, Curran Associates, 2020, pp. 22361–22372.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2023-02-23T14:03:03Z
day: '06'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2002.11505'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
page: 22361-22372
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
issn:
- '10495258'
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scalable belief propagation via relaxed scheduling
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 33
year: '2020'
...
---
_id: '8533'
abstract:
- lang: eng
text: Game of Life is a simple and elegant model to study dynamical system over
networks. The model consists of a graph where every vertex has one of two types,
namely, dead or alive. A configuration is a mapping of the vertices to the types.
An update rule describes how the type of a vertex is updated given the types of
its neighbors. In every round, all vertices are updated synchronously, which leads
to a configuration update. While in general, Game of Life allows a broad range
of update rules, we focus on two simple families of update rules, namely, underpopulation
and overpopulation, that model several interesting dynamics studied in the literature.
In both settings, a dead vertex requires at least a desired number of live neighbors
to become alive. For underpopulation (resp., overpopulation), a live vertex requires
at least (resp. at most) a desired number of live neighbors to remain alive. We
study the basic computation problems, e.g., configuration reachability, for these
two families of rules. For underpopulation rules, we show that these problems
can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.
acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the
Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker:
This project has received funding from the European Union’s Horizon 2020 research\r\nand
innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411."
alternative_title:
- LIPIcs
article_number: 22:1-22:13
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life:
Algorithms and complexity. In: 45th International Symposium on Mathematical
Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22'
apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020).
Simplified game of life: Algorithms and complexity. In 45th International Symposium
on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech
Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22'
chicago: 'Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub
Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International
Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.'
ieee: 'K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified
game of life: Algorithms and complexity,” in 45th International Symposium on
Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020,
vol. 170.'
ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game
of life: Algorithms and complexity. 45th International Symposium on Mathematical
Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of
Computer Science, LIPIcs, vol. 170, 22:1-22:13.'
mla: 'Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”
45th International Symposium on Mathematical Foundations of Computer Science,
vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020,
doi:10.4230/LIPIcs.MFCS.2020.22.'
short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International
Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Symposium on Mathematical Foundations of Computer Science'
start_date: 2020-08-24
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2021-01-12T08:19:55Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.22
ec_funded: 1
external_id:
arxiv:
- '2007.02894'
file:
- access_level: open_access
checksum: bbd7c4f55d45f2ff2a0a4ef0e10a77b1
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T13:57:34Z
date_updated: 2020-09-21T13:57:34Z
file_id: '8550'
file_name: 2020_LIPIcs_Chatterjee.pdf
file_size: 491374
relation: main_file
success: 1
file_date_updated: 2020-09-21T13:57:34Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Simplified game of life: Algorithms and complexity'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 170
year: '2020'
...
---
_id: '8534'
abstract:
- lang: eng
text: A regular language L of finite words is composite if there are regular languages
L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a
minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise,
L is prime. Primality of regular languages was introduced and studied in [O. Kupferman
and J. Mosheiff, 2015], where the complexity of deciding the primality of the
language of a given DFA was left open, with a doubly-exponential gap between the
upper and lower bounds. We study primality for unary regular languages, namely
regular languages with a singleton alphabet. A unary language corresponds to a
subset of ℕ, making the study of unary prime languages closer to that of primality
in number theory. We show that the setting of languages is richer. In particular,
while every composite number is the product of two smaller numbers, the number
t of languages necessary to decompose a composite unary language induces a strict
hierarchy. In addition, a primality witness for a unary language L, namely a word
that is not in L but is in all products of languages that contain L and have an
index smaller than L’s, may be of exponential length. Still, we are able to characterize
compositionality by structural properties of a DFA for L, leading to a LogSpace
algorithm for primality checking of unary DFAs.
acknowledgement: "Ismaël Jecker: This project has received funding from the European
Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS."
alternative_title:
- LIPIcs
article_number: 51:1-51:12
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
citation:
ama: 'Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International
Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51'
apa: 'Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages.
In 45th International Symposium on Mathematical Foundations of Computer Science
(Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2020.51'
chicago: Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.”
In 45th International Symposium on Mathematical Foundations of Computer Science,
Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51.
ieee: I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in
45th International Symposium on Mathematical Foundations of Computer Science,
Prague, Czech Republic, 2020, vol. 170.
ista: 'Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International
Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on
Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.'
mla: Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium
on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
short: I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium
on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Symposium on Mathematical Foundations of Computer Science'
start_date: 2020-08-24
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2021-01-12T08:19:56Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.51
ec_funded: 1
file:
- access_level: open_access
checksum: 2dc9e2fad6becd4563aef3e27a473f70
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T14:17:08Z
date_updated: 2020-09-21T14:17:08Z
file_id: '8552'
file_name: 2020_LIPIcsMFCS_Jecker.pdf
file_size: 597977
relation: main_file
success: 1
file_date_updated: 2020-09-21T14:17:08Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unary prime languages
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 170
year: '2020'
...
---
_id: '8538'
abstract:
- lang: eng
text: We prove some recent experimental observations of Dan Reznik concerning periodic
billiard orbits in ellipses. For example, the sum of cosines of the angles of
a periodic billiard polygon remains constant in the 1-parameter family of such
polygons (that exist due to the Poncelet porism). In our proofs, we use geometric
and complex analytic methods.
acknowledgement: " This paper would not be written if not for Dan Reznik’s curiosity
and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller
for interesting discussions. It is a pleasure to thank the Mathematical Institute
of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy
for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality.
AA was supported by European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported
by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR
191."
article_processing_charge: No
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Richard
full_name: Schwartz, Richard
last_name: Schwartz
- first_name: Serge
full_name: Tabachnikov, Serge
last_name: Tabachnikov
citation:
ama: Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European
Journal of Mathematics. 2020. doi:10.1007/s40879-020-00426-9
apa: Akopyan, A., Schwartz, R., & Tabachnikov, S. (2020). Billiards in ellipses
revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9
chicago: Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in
Ellipses Revisited.” European Journal of Mathematics. Springer Nature,
2020. https://doi.org/10.1007/s40879-020-00426-9.
ieee: A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,”
European Journal of Mathematics. Springer Nature, 2020.
ista: Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited.
European Journal of Mathematics.
mla: Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal
of Mathematics, Springer Nature, 2020, doi:10.1007/s40879-020-00426-9.
short: A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics
(2020).
date_created: 2020-09-20T22:01:38Z
date_published: 2020-09-09T00:00:00Z
date_updated: 2021-12-02T15:10:17Z
day: '09'
department:
- _id: HeEd
doi: 10.1007/s40879-020-00426-9
ec_funded: 1
external_id:
arxiv:
- '2001.02934'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2001.02934
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Billiards in ellipses revisited
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '8616'
abstract:
- lang: eng
text: The brain vasculature supplies neurons with glucose and oxygen, but little
is known about how vascular plasticity contributes to brain function. Using longitudinal
in vivo imaging, we reported that a substantial proportion
of blood vessels in the adult brain sporadically occluded and regressed. Their
regression proceeded through sequential stages of blood-flow occlusion, endothelial
cell collapse, relocation or loss of pericytes, and retraction of glial endfeet.
Regressing vessels were found to be widespread in mouse, monkey and human brains.
Both brief occlusions of the middle cerebral artery and lipopolysaccharide-mediated
inflammation induced an increase of vessel regression. Blockage of leukocyte adhesion
to endothelial cells alleviated LPS-induced vessel regression. We further revealed
that blood vessel regression caused a reduction of neuronal activity due to a
dysfunction in mitochondrial metabolism and glutamate production. Our results
elucidate the mechanism of vessel regression and its role in neuronal function
in the adult brain.
acknowledgement: 'The project was initiated in the Jan lab at UCSF. We thank Lily
Jan and Yuh-Nung Jan’s generous support. We thank Liqun Luo’s lab for providing
MADM-7 mice and Rolf A Brekken for VEGF-antibodies. Drs. Yuanquan Song (UPenn),
Zhaozhu Hu (JHU), Ji Hu (ShanghaiTech), Yang Xiang (U. Mass), Hao Wang (Zhejiang
U.) and Ruikang Wang (U. Washington) for critical input, colleagues at Children’s
Research Institute, Departments of Neuroscience, Neurology and Neurotherapeutics,
Pediatrics from UT Southwestern, and colleagues from the Jan lab for discussion.
Dr. Bridget Samuels, Sean Morrison (UT Southwestern), and Nannan Lu (Zhejiang U.)
for critical reading. We acknowledge the assistance of the CIBR Imaging core. We
also thank UT Southwestern Live Cell Imaging Facility, a Shared Resource of the
Harold C. Simmons Cancer Center, supported in part by an NCI Cancer Center Support
Grant, P30 CA142543K. This work is supported by CIBR funds and the American Heart
Association AWRP Summer 2016 Innovative Research Grant (17IRG33410377) to W-P.G.;
National Natural Science Foundation of China (No.81370031) to Z.Z.;National Key
Research and Development Program of China (2016YFE0125400)to F.H.;National Natural
Science Foundations of China (No. 81473202) to Y.L.; National Natural Science Foundation
of China (No.31600839) and Shenzhen Science and Technology Research Program (JCYJ20170818163320865)
to B.P.; National Natural Science Foundation of China (No. 31800864) and Westlake
University start-up funds to J-M. J. NIH R01NS088627 to W.L.J.; NIH: R01 AG020670
and RF1AG054111 to H.Z.; R01 NS088555 to A.M.S., and European Research Council No.725780
to S.H.;W-P.G. was a recipient of Bugher-American Heart Association Dan Adams Thinking
Outside the Box Award.'
article_processing_charge: No
author:
- first_name: Xiaofei
full_name: Gao, Xiaofei
last_name: Gao
- first_name: Jun-Liszt
full_name: Li, Jun-Liszt
last_name: Li
- first_name: Xingjun
full_name: Chen, Xingjun
last_name: Chen
- first_name: Bo
full_name: Ci, Bo
last_name: Ci
- first_name: Fei
full_name: Chen, Fei
last_name: Chen
- first_name: Nannan
full_name: Lu, Nannan
last_name: Lu
- first_name: Bo
full_name: Shen, Bo
last_name: Shen
- first_name: Lijun
full_name: Zheng, Lijun
last_name: Zheng
- first_name: Jie-Min
full_name: Jia, Jie-Min
last_name: Jia
- first_name: Yating
full_name: Yi, Yating
last_name: Yi
- first_name: Shiwen
full_name: Zhang, Shiwen
last_name: Zhang
- first_name: Ying-Chao
full_name: Shi, Ying-Chao
last_name: Shi
- first_name: Kaibin
full_name: Shi, Kaibin
last_name: Shi
- first_name: Nicholas E
full_name: Propson, Nicholas E
last_name: Propson
- first_name: Yubin
full_name: Huang, Yubin
last_name: Huang
- first_name: Katherine
full_name: Poinsatte, Katherine
last_name: Poinsatte
- first_name: Zhaohuan
full_name: Zhang, Zhaohuan
last_name: Zhang
- first_name: Yuanlei
full_name: Yue, Yuanlei
last_name: Yue
- first_name: Dale B
full_name: Bosco, Dale B
last_name: Bosco
- first_name: Ying-mei
full_name: Lu, Ying-mei
last_name: Lu
- first_name: Shi-bing
full_name: Yang, Shi-bing
last_name: Yang
- first_name: Ralf H.
full_name: Adams, Ralf H.
last_name: Adams
- first_name: Volkhard
full_name: Lindner, Volkhard
last_name: Lindner
- first_name: Fen
full_name: Huang, Fen
last_name: Huang
- first_name: Long-Jun
full_name: Wu, Long-Jun
last_name: Wu
- first_name: Hui
full_name: Zheng, Hui
last_name: Zheng
- first_name: Feng
full_name: Han, Feng
last_name: Han
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Ann M.
full_name: Stowe, Ann M.
last_name: Stowe
- first_name: Bo
full_name: Peng, Bo
last_name: Peng
- first_name: Marta
full_name: Margeta, Marta
last_name: Margeta
- first_name: Xiaoqun
full_name: Wang, Xiaoqun
last_name: Wang
- first_name: Qiang
full_name: Liu, Qiang
last_name: Liu
- first_name: Jakob
full_name: Körbelin, Jakob
last_name: Körbelin
- first_name: Martin
full_name: Trepel, Martin
last_name: Trepel
- first_name: Hui
full_name: Lu, Hui
last_name: Lu
- first_name: Bo O.
full_name: Zhou, Bo O.
last_name: Zhou
- first_name: Hu
full_name: Zhao, Hu
last_name: Zhao
- first_name: Wenzhi
full_name: Su, Wenzhi
last_name: Su
- first_name: Robert M.
full_name: Bachoo, Robert M.
last_name: Bachoo
- first_name: Woo-ping
full_name: Ge, Woo-ping
last_name: Ge
citation:
ama: Gao X, Li J-L, Chen X, et al. Reduction of neuronal activity mediated by blood-vessel
regression in the brain. bioRxiv. doi:10.1101/2020.09.15.262782
apa: Gao, X., Li, J.-L., Chen, X., Ci, B., Chen, F., Lu, N., … Ge, W. (n.d.). Reduction
of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.09.15.262782
chicago: Gao, Xiaofei, Jun-Liszt Li, Xingjun Chen, Bo Ci, Fei Chen, Nannan Lu, Bo
Shen, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression
in the Brain.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.09.15.262782.
ieee: X. Gao et al., “Reduction of neuronal activity mediated by blood-vessel
regression in the brain,” bioRxiv. Cold Spring Harbor Laboratory.
ista: Gao X, Li J-L, Chen X, Ci B, Chen F, Lu N, Shen B, Zheng L, Jia J-M, Yi Y,
Zhang S, Shi Y-C, Shi K, Propson NE, Huang Y, Poinsatte K, Zhang Z, Yue Y, Bosco
DB, Lu Y, Yang S, Adams RH, Lindner V, Huang F, Wu L-J, Zheng H, Han F, Hippenmeyer
S, Stowe AM, Peng B, Margeta M, Wang X, Liu Q, Körbelin J, Trepel M, Lu H, Zhou
BO, Zhao H, Su W, Bachoo RM, Ge W. Reduction of neuronal activity mediated by
blood-vessel regression in the brain. bioRxiv, 10.1101/2020.09.15.262782.
mla: Gao, Xiaofei, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel
Regression in the Brain.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.09.15.262782.
short: X. Gao, J.-L. Li, X. Chen, B. Ci, F. Chen, N. Lu, B. Shen, L. Zheng, J.-M.
Jia, Y. Yi, S. Zhang, Y.-C. Shi, K. Shi, N.E. Propson, Y. Huang, K. Poinsatte,
Z. Zhang, Y. Yue, D.B. Bosco, Y. Lu, S. Yang, R.H. Adams, V. Lindner, F. Huang,
L.-J. Wu, H. Zheng, F. Han, S. Hippenmeyer, A.M. Stowe, B. Peng, M. Margeta, X.
Wang, Q. Liu, J. Körbelin, M. Trepel, H. Lu, B.O. Zhou, H. Zhao, W. Su, R.M. Bachoo,
W. Ge, BioRxiv (n.d.).
date_created: 2020-10-06T08:58:59Z
date_published: 2020-09-15T00:00:00Z
date_updated: 2021-01-12T08:20:19Z
day: '15'
department:
- _id: SiHi
doi: 10.1101/2020.09.15.262782
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.09.15.262782
month: '09'
oa: 1
oa_version: Preprint
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
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Reduction of neuronal activity mediated by blood-vessel regression in the brain
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8695'
abstract:
- lang: eng
text: A look at international activities on Open Science reveals a broad spectrum
from individual institutional policies to national action plans. The present Recommendations
for a National Open Science Strategy in Austria are based on these international
initiatives and present practical considerations for their coordinated implementation
with regard to strategic developments in research, technology and innovation (RTI)
in Austria until 2030. They are addressed to all relevant actors in the RTI system,
in particular to Research Performing Organisations, Research Funding Organisations,
Research Policy, memory institutions such as Libraries and Researchers. The recommendation
paper was developed from 2018 to 2020 by the OANA working group "Open Science
Strategy" and published for the first time in spring 2020 for a public consultation.
The now available final version of the recommendation document, which contains
feedback and comments from the consultation, is intended to provide an impetus
for further discussion and implementation of Open Science in Austria and serves
as a contribution and basis for a potential national Open Science Strategy in
Austria. The document builds on the diverse expertise of the authors (academia,
administration, library and archive, information technology, science policy, funding
system, etc.) and reflects their personal experiences and opinions.
- lang: ger
text: Der Blick auf internationale Aktivitäten zu Open Science zeigt ein breites
Spektrum von einzelnen institutionellen Policies bis hin zu nationalen Aktionsplänen.
Die vorliegenden Empfehlungen für eine nationale Open Science Strategie in Österreich
orientieren sich an diesen internationalen Initiativen und stellen praktische
Überlegungen für ihre koordinierte Implementierung im Hinblick auf strategische
Entwicklungen in Forschung, Technologie und Innovation (FTI) bis 2030 in Österreich
dar. Dabei richten sie sich an alle relevanten Akteur*innen im FTI System, im
Besonderen an Forschungsstätten, Forschungsförderer, Forschungspolitik, Gedächtnisinstitutionen
wie Bibliotheken und Wissenschafter*innen. Das Empfehlungspapier wurde von 2018
bis 2020 von der OANA-Arbeitsgruppe "Open Science Strategie" entwickelt und im
Frühling 2020 das erste Mal für eine öffentliche Konsultation veröffentlicht.
Die nun vorliegende finale Version des Empfehlungsdokuments, die Feedback und
Kommentare aus der Konsultation enthält, soll ein Anstoß für die weitere Diskussion
und Umsetzung von Open Science in Österreich sein und als Beitrag und Grundlage
einer potentiellen nationalen Open Science Strategie in Österreich dienen. Das
Dokument baut auf der vielfältigen Expertise der Autor*innen auf (Wissenschaft,
Administration, Bibliothek und Archiv, Informationstechnologie, Wissenschaftspolitik,
Förderwesen etc.) und spiegelt deren persönliche Erfahrungen und Meinung wider.
article_processing_charge: No
author:
- first_name: Katja
full_name: Mayer, Katja
last_name: Mayer
- first_name: Katharina
full_name: Rieck, Katharina
last_name: Rieck
- first_name: Stefan
full_name: Reichmann, Stefan
last_name: Reichmann
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Anton
full_name: Graschopf, Anton
last_name: Graschopf
- first_name: Thomas
full_name: König, Thomas
last_name: König
- first_name: Peter
full_name: Kraker, Peter
last_name: Kraker
- first_name: Patrick
full_name: Lehner, Patrick
last_name: Lehner
- first_name: Falk
full_name: Reckling, Falk
last_name: Reckling
- first_name: Tony
full_name: Ross-Hellauer, Tony
last_name: Ross-Hellauer
- first_name: Daniel
full_name: Spichtinger, Daniel
last_name: Spichtinger
- first_name: Michalis
full_name: Tzatzanis, Michalis
last_name: Tzatzanis
- first_name: Stefanie
full_name: Schürz, Stefanie
last_name: Schürz
citation:
ama: Mayer K, Rieck K, Reichmann S, et al. Empfehlungen für eine nationale Open
Science Strategie in Österreich / Recommendations for a National Open Science
Strategy in Austria. OANA; 2020. doi:10.5281/ZENODO.4109242
apa: Mayer, K., Rieck, K., Reichmann, S., Danowski, P., Graschopf, A., König, T.,
… Schürz, S. (2020). Empfehlungen für eine nationale Open Science Strategie
in Österreich / Recommendations for a National Open Science Strategy in Austria.
OANA. https://doi.org/10.5281/ZENODO.4109242
chicago: Mayer, Katja, Katharina Rieck, Stefan Reichmann, Patrick Danowski, Anton
Graschopf, Thomas König, Peter Kraker, et al. Empfehlungen für eine nationale
Open Science Strategie in Österreich / Recommendations for a National Open Science
Strategy in Austria. OANA, 2020. https://doi.org/10.5281/ZENODO.4109242.
ieee: K. Mayer et al., Empfehlungen für eine nationale Open Science Strategie
in Österreich / Recommendations for a National Open Science Strategy in Austria.
OANA, 2020.
ista: Mayer K, Rieck K, Reichmann S, Danowski P, Graschopf A, König T, Kraker P,
Lehner P, Reckling F, Ross-Hellauer T, Spichtinger D, Tzatzanis M, Schürz S. 2020.
Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations
for a National Open Science Strategy in Austria, OANA, 36p.
mla: Mayer, Katja, et al. Empfehlungen für eine nationale Open Science Strategie
in Österreich / Recommendations for a National Open Science Strategy in Austria.
OANA, 2020, doi:10.5281/ZENODO.4109242.
short: K. Mayer, K. Rieck, S. Reichmann, P. Danowski, A. Graschopf, T. König, P.
Kraker, P. Lehner, F. Reckling, T. Ross-Hellauer, D. Spichtinger, M. Tzatzanis,
S. Schürz, Empfehlungen für eine nationale Open Science Strategie in Österreich
/ Recommendations for a National Open Science Strategy in Austria, OANA, 2020.
date_created: 2020-10-23T09:08:28Z
date_published: 2020-10-21T00:00:00Z
date_updated: 2020-10-23T09:34:40Z
day: '21'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/ZENODO.4109242
file:
- access_level: open_access
checksum: 8eba912bb4b20b4f82f8010f2110461a
content_type: application/pdf
creator: dernst
date_created: 2020-10-23T09:29:45Z
date_updated: 2020-10-23T09:29:45Z
file_id: '8696'
file_name: 2020_OANA_Mayer.pdf
file_size: 2298363
relation: main_file
success: 1
file_date_updated: 2020-10-23T09:29:45Z
has_accepted_license: '1'
language:
- iso: ger
month: '10'
oa: 1
oa_version: Published Version
page: '36'
publication_status: published
publisher: OANA
status: public
title: Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations
for a National Open Science Strategy in Austria
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: working_paper
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8706'
abstract:
- lang: eng
text: As part of the Austrian Transition to Open Access (AT2OA) project, subproject
TP1-B is working on designing a monitoring solution for the output of Open Access
publications in Austria. This report on a potential Open Access monitoring approach
in Austria is one of the results of these efforts and can serve as a basis for
discussion on an international level.
- lang: ger
text: Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open
Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung
für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht
zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse
dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler
Ebene dienen.
article_processing_charge: No
article_type: original
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Andreas
full_name: Ferus, Andreas
last_name: Ferus
- first_name: Anna-Laetitia
full_name: Hikl, Anna-Laetitia
last_name: Hikl
- first_name: Gerda
full_name: McNeill, Gerda
last_name: McNeill
- first_name: Clemens
full_name: Miniberger, Clemens
last_name: Miniberger
- first_name: Steve
full_name: Reding, Steve
last_name: Reding
- first_name: Tobias
full_name: Zarka, Tobias
last_name: Zarka
- first_name: Michael
full_name: Zojer, Michael
last_name: Zojer
citation:
ama: Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure
for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(2):278-284.
doi:10.31263/voebm.v73i2.3941
apa: Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding,
S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access
monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer
Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i2.3941
chicago: Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens
Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for
the further procedure for open access monitoring. Deliverable of the AT2OA subproject
TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und
Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare,
2020. https://doi.org/10.31263/voebm.v73i2.3941.
ieee: P. Danowski et al., “„Recommendation“ for the further procedure for
open access monitoring. Deliverable of the AT2OA subproject TP1-B,” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol.
73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp.
278–284, 2020.
ista: Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T,
Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring.
Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare. 73(2), 278–284.
mla: Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open
access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol.
73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020,
pp. 278–84, doi:10.31263/voebm.v73i2.3941.
short: P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding,
T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen
und Bibliothekare 73 (2020) 278–284.
date_created: 2020-10-25T23:01:19Z
date_published: 2020-07-14T00:00:00Z
date_updated: 2021-01-12T08:20:40Z
day: '14'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v73i2.3941
file:
- access_level: open_access
checksum: 37443c34d91d5bdbeb38c78b14792537
content_type: application/pdf
creator: kschuh
date_created: 2020-10-27T16:27:25Z
date_updated: 2020-10-27T16:27:25Z
file_id: '8714'
file_name: 2020_VOEB_Danowski.pdf
file_size: 960317
relation: main_file
success: 1
file_date_updated: 2020-10-27T16:27:25Z
has_accepted_license: '1'
intvolume: ' 73'
issue: '2'
language:
- iso: ger
month: '07'
oa: 1
oa_version: Published Version
page: 278-284
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publication_identifier:
eissn:
- '10222588'
publication_status: published
publisher: Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare
quality_controlled: '1'
scopus_import: '1'
status: public
title: „Recommendation“ for the further procedure for open access monitoring. Deliverable
of the AT2OA subproject TP1-B
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: 73
year: '2020'
...
---
_id: '8978'
abstract:
- lang: eng
text: "Mosaic analysis with double markers (MADM) technology enables concomitant
fluorescent cell labeling and induction of uniparental chromosome disomy (UPD)
with single-cell resolution. In UPD, imprinted genes are either overexpressed
2-fold or are not expressed. Here, the MADM platform is utilized to probe imprinting
phenotypes at the transcriptional level. This protocol highlights major steps
for the generation and isolation of projection neurons and astrocytes with MADM-induced
UPD from mouse cerebral cortex for downstream single-cell and low-input sample
RNA-sequencing experiments.\r\n\r\nFor complete details on the use and execution
of this protocol, please refer to Laukoter et al. (2020b)."
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: This research was supported by the Scientific Service Units (SSU)
at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical
Facilities (PCF). N.A received support from the FWF Firnberg-Programm (T 1031).
This work was also supported by IST Austria institutional funds; FWF SFB F78 to
S.H.; NÖ Forschung und Bildung n[f+b] life science call grant (C13-002) to S.H.;
the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement no. 618444 to S.H.; and the
European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant agreement no. 725780 LinPro) to S.H.
article_number: '100215'
article_processing_charge: No
article_type: original
author:
- first_name: Susanne
full_name: Laukoter, Susanne
id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87
last_name: Laukoter
- 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: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Laukoter S, Amberg N, Pauler F, Hippenmeyer S. Generation and isolation of
single cells from mouse brain with mosaic analysis with double markers-induced
uniparental chromosome disomy. STAR Protocols. 2020;1(3). doi:10.1016/j.xpro.2020.100215
apa: Laukoter, S., Amberg, N., Pauler, F., & Hippenmeyer, S. (2020). Generation
and isolation of single cells from mouse brain with mosaic analysis with double
markers-induced uniparental chromosome disomy. STAR Protocols. Elsevier.
https://doi.org/10.1016/j.xpro.2020.100215
chicago: Laukoter, Susanne, Nicole Amberg, Florian Pauler, and Simon Hippenmeyer.
“Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis
with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols.
Elsevier, 2020. https://doi.org/10.1016/j.xpro.2020.100215.
ieee: S. Laukoter, N. Amberg, F. Pauler, and S. Hippenmeyer, “Generation and isolation
of single cells from mouse brain with mosaic analysis with double markers-induced
uniparental chromosome disomy,” STAR Protocols, vol. 1, no. 3. Elsevier,
2020.
ista: Laukoter S, Amberg N, Pauler F, Hippenmeyer S. 2020. Generation and isolation
of single cells from mouse brain with mosaic analysis with double markers-induced
uniparental chromosome disomy. STAR Protocols. 1(3), 100215.
mla: Laukoter, Susanne, et al. “Generation and Isolation of Single Cells from Mouse
Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome
Disomy.” STAR Protocols, vol. 1, no. 3, 100215, Elsevier, 2020, doi:10.1016/j.xpro.2020.100215.
short: S. Laukoter, N. Amberg, F. Pauler, S. Hippenmeyer, STAR Protocols 1 (2020).
date_created: 2020-12-30T10:17:07Z
date_published: 2020-12-18T00:00:00Z
date_updated: 2021-01-12T08:21:36Z
day: '18'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1016/j.xpro.2020.100215
ec_funded: 1
external_id:
pmid:
- '33377108'
file:
- access_level: open_access
checksum: f1e9a433e9cb0f41f7b6df6b76db1f6e
content_type: application/pdf
creator: dernst
date_created: 2021-01-07T15:57:27Z
date_updated: 2021-01-07T15:57:27Z
file_id: '8996'
file_name: 2020_STARProtocols_Laukoter.pdf
file_size: 4031449
relation: main_file
success: 1
file_date_updated: 2021-01-07T15:57:27Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 268F8446-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T0101031
name: Role of Eed in neural stem cell lineage progression
- _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E
grant_number: F07805
name: Molecular Mechanisms of Neural Stem Cell Lineage Progression
- _id: 25D92700-B435-11E9-9278-68D0E5697425
grant_number: LS13-002
name: Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618444'
name: Molecular Mechanisms of Cerebral Cortex Development
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: STAR Protocols
publication_identifier:
issn:
- 2666-1667
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Generation and isolation of single cells from mouse brain with mosaic analysis
with double markers-induced uniparental chromosome disomy
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2020'
...
---
_id: '9103'
abstract:
- lang: eng
text: 'We introduce LRT-NG, a set of techniques and an associated toolset that computes
a reachtube (an over-approximation of the set of reachable states over a given
time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the
state-of-the-art Langrangian Reachability and its associated tool LRT. From a
theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses
for the first time an analytically computed metric for the propagated ball which
is proven to minimize the ball’s volume. We emphasize that the metric computation
is the centerpiece of all bloating-based techniques. Secondly, it computes the
next reachset as the intersection of two balls: one based on the Cartesian metric
and the other on the new metric. While the two metrics were previously considered
opposing approaches, their joint use considerably tightens the reachtubes. Thirdly,
it avoids the "wrapping effect" associated with the validated integration of the
center of the reachset, by optimally absorbing the interval approximation in the
radius of the next ball. From a tool-development perspective, LRT-NG is superior
to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD.
This required the implementation of the Lohner method and a Runge-Kutta time-propagation
method. Secondly, it has an improved interface, allowing the input model and initial
conditions to be provided as external input files. Our experiments on a comprehensive
set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance
compared to LRT, CAPD, and Flow*.'
acknowledgement: "The authors would like to thank Ramin Hasani and Guillaume Berger
for intellectual discussions about the research which lead to the generation of
new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant
Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832
and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially
supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n"
article_processing_charge: No
author:
- first_name: Sophie
full_name: Gruenbacher, Sophie
last_name: Gruenbacher
- first_name: Jacek
full_name: Cyranka, Jacek
last_name: Cyranka
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Md Ariful
full_name: Islam, Md Ariful
last_name: Islam
- first_name: Scott A.
full_name: Smolka, Scott A.
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian
reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference
on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042'
apa: 'Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &
Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings
of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563).
Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042'
chicago: 'Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam,
Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.”
In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63.
IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.'
ieee: 'S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R.
Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the
59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South),
2020, vol. 2020, pp. 1556–1563.'
ista: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020.
Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference
on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.'
mla: 'Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.”
Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020,
IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.'
short: S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu,
in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020,
pp. 1556–1563.
conference:
end_date: 2020-12-18
location: Jeju Islang, Korea (South)
name: 'CDC: Conference on Decision and Control'
start_date: 2020-12-14
date_created: 2021-02-07T23:01:14Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2021-02-09T09:20:58Z
day: '14'
department:
- _id: ToHe
doi: 10.1109/CDC42340.2020.9304042
external_id:
arxiv:
- '2012.07458'
intvolume: ' 2020'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.07458
month: '12'
oa: 1
oa_version: Preprint
page: 1556-1563
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 59th IEEE Conference on Decision and Control
publication_identifier:
isbn:
- '9781728174471'
issn:
- '07431546'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lagrangian reachtubes: The next generation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2020
year: '2020'
...
---
_id: '9221'
abstract:
- lang: eng
text: "Recent works have shown that gradient descent can find a global minimum for
over-parameterized neural networks where the widths of all the hidden layers scale
polynomially with N (N being the number of training samples). In this paper, we
prove that, for deep networks, a single layer of width N following the input layer
suffices to ensure a similar guarantee. In particular, all the remaining layers
are allowed to have constant widths, and form a pyramidal topology. We show an
application of our result to the widely used LeCun’s initialization and obtain
an over-parameterization requirement for the single wide layer of order N2.\r\n"
acknowledgement: The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and
Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc
Dinh Tran for proofreading portions of a prior version of this paper, and James
Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially
supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the
German Research Foundation (DFG) award KL 2698/2-1.
article_processing_charge: No
author:
- first_name: Quynh
full_name: Nguyen, Quynh
last_name: Nguyen
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer
followed by pyramidal topology. In: 34th Conference on Neural Information Processing
Systems. Vol 33. Curran Associates; 2020:11961–11972.'
apa: 'Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks
with one wide layer followed by pyramidal topology. In 34th Conference on Neural
Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada:
Curran Associates.'
chicago: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks
with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on
Neural Information Processing Systems, 33:11961–11972. Curran Associates,
2020.
ieee: Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide
layer followed by pyramidal topology,” in 34th Conference on Neural Information
Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.
ista: 'Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one
wide layer followed by pyramidal topology. 34th Conference on Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972.'
mla: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with
One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information
Processing Systems, vol. 33, Curran Associates, 2020, pp. 11961–11972.
short: Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing
Systems, Curran Associates, 2020, pp. 11961–11972.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-03-03T12:06:02Z
date_published: 2020-07-07T00:00:00Z
date_updated: 2022-01-04T09:24:41Z
day: '07'
department:
- _id: MaMo
external_id:
arxiv:
- '2002.07867'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.07867
month: '07'
oa: 1
oa_version: Preprint
page: 11961–11972
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 34th Conference on Neural Information Processing Systems
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
status: public
title: Global convergence of deep networks with one wide layer followed by pyramidal
topology
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 33
year: '2020'
...
---
_id: '9415'
abstract:
- lang: eng
text: 'Optimizing convolutional neural networks for fast inference has recently
become an extremely active area of research. One of the go-to solutions in this
context is weight pruning, which aims to reduce computational and memory footprint
by removing large subsets of the connections in a neural network. Surprisingly,
much less attention has been given to exploiting sparsity in the activation maps,
which tend to be naturally sparse in many settings thanks to the structure of
rectified linear (ReLU) activation functions. In this paper, we present an in-depth
analysis of methods for maximizing the sparsity of the activations in a trained
neural network, and show that, when coupled with an efficient sparse-input convolution
algorithm, we can leverage this sparsity for significant performance gains. To
induce highly sparse activation maps without accuracy loss, we introduce a new
regularization technique, coupled with a new threshold-based sparsification method
based on a parameterized activation function called Forced-Activation-Threshold
Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular
image classification models, showing that most architectures can adapt to significantly
sparser activation maps without any accuracy loss. Our second contribution is
showing that these these compression gains can be translated into inference speedups:
we provide a new algorithm to enable fast convolution operations over networks
with sparse activations, and show that it can enable significant speedups for
end-to-end inference on a range of popular models on the large-scale ImageNet
image classification task on modern Intel CPUs, with little or no retraining cost. '
article_processing_charge: No
author:
- first_name: Mark
full_name: Kurtz, Mark
last_name: Kurtz
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: John
full_name: Carr, John
last_name: Carr
- first_name: Michael
full_name: Goin, Michael
last_name: Goin
- first_name: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Sage
full_name: Moore, Sage
last_name: Moore
- first_name: Bill
full_name: Nell, Bill
last_name: Nell
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
- 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: 'Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation
sparsity for fast neural network inference. In: 37th International Conference
on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.'
apa: Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., …
Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural
network inference. In 37th International Conference on Machine Learning, ICML
2020 (Vol. 119, pp. 5533–5543). Online.
chicago: Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John
Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation
Sparsity for Fast Neural Network Inference.” In 37th International Conference
on Machine Learning, ICML 2020, 119:5533–43, 2020.
ieee: M. Kurtz et al., “Inducing and exploiting activation sparsity for fast
neural network inference,” in 37th International Conference on Machine Learning,
ICML 2020, Online, 2020, vol. 119, pp. 5533–5543.
ista: 'Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W,
Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation
sparsity for fast neural network inference. 37th International Conference on Machine
Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119,
5533–5543.'
mla: Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural
Network Inference.” 37th International Conference on Machine Learning, ICML
2020, vol. 119, 2020, pp. 5533–43.
short: M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson,
S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference
on Machine Learning, ICML 2020, 2020, pp. 5533–5543.
conference:
end_date: 2020-07-18
location: Online
name: 'ICML: International Conference on Machine Learning'
start_date: 2020-07-12
date_created: 2021-05-23T22:01:45Z
date_published: 2020-07-12T00:00:00Z
date_updated: 2023-02-23T13:57:24Z
day: '12'
ddc:
- '000'
department:
- _id: DaAl
file:
- access_level: open_access
checksum: 2aaaa7d7226e49161311d91627cf783b
content_type: application/pdf
creator: kschuh
date_created: 2021-05-25T09:51:36Z
date_updated: 2021-05-25T09:51:36Z
file_id: '9421'
file_name: 2020_PMLR_Kurtz.pdf
file_size: 741899
relation: main_file
success: 1
file_date_updated: 2021-05-25T09:51:36Z
has_accepted_license: '1'
intvolume: ' 119'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 5533-5543
publication: 37th International Conference on Machine Learning, ICML 2020
publication_identifier:
issn:
- 2640-3498
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inducing and exploiting activation sparsity for fast neural network inference
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '10672'
abstract:
- lang: eng
text: The family of feedback alignment (FA) algorithms aims to provide a more biologically
motivated alternative to backpropagation (BP), by substituting the computations
that are unrealistic to be implemented in physical brains. While FA algorithms
have been shown to work well in practice, there is a lack of rigorous theory proofing
their learning capabilities. Here we introduce the first feedback alignment algorithm
with provable learning guarantees. In contrast to existing work, we do not require
any assumption about the size or depth of the network except that it has a single
output neuron, i.e., such as for binary classification tasks. We show that our
FA algorithm can deliver its theoretical promises in practice, surpassing the
learning performance of existing FA methods and matching backpropagation in binary
classification tasks. Finally, we demonstrate the limits of our FA variant when
the number of output neurons grows beyond a certain quantity.
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n"
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
citation:
ama: 'Lechner M. Learning representations for binary-classification without backpropagation.
In: 8th International Conference on Learning Representations. ICLR; 2020.'
apa: 'Lechner, M. (2020). Learning representations for binary-classification without
backpropagation. In 8th International Conference on Learning Representations.
Virtual ; Addis Ababa, Ethiopia: ICLR.'
chicago: Lechner, Mathias. “Learning Representations for Binary-Classification without
Backpropagation.” In 8th International Conference on Learning Representations.
ICLR, 2020.
ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,”
in 8th International Conference on Learning Representations, Virtual ;
Addis Ababa, Ethiopia, 2020.
ista: 'Lechner M. 2020. Learning representations for binary-classification without
backpropagation. 8th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Lechner, Mathias. “Learning Representations for Binary-Classification without
Backpropagation.” 8th International Conference on Learning Representations,
ICLR, 2020.
short: M. Lechner, in:, 8th International Conference on Learning Representations,
ICLR, 2020.
conference:
end_date: 2020-05-01
location: Virtual ; Addis Ababa, Ethiopia
name: 'ICLR: International Conference on Learning Representations'
start_date: 2020-04-26
date_created: 2022-01-25T15:50:00Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2023-04-03T07:33:40Z
day: '11'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: ea13d42dd4541ddb239b6a75821fd6c9
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:35:17Z
date_updated: 2022-01-26T07:35:17Z
file_id: '10677'
file_name: iclr_2020.pdf
file_size: 249431
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:35:17Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=Bke61krFvS
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 8th International Conference on Learning Representations
publication_status: published
publisher: ICLR
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning representations for binary-classification without backpropagation
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8188'
abstract:
- lang: eng
text: "A natural approach to generative modeling of videos is to represent them
as a composition of moving objects. Recent works model a set of 2D sprites over
a slowly-varying background, but without considering the underlying 3D scene that\r\ngives
rise to them. We instead propose to model a video as the view seen while moving
through a scene with multiple 3D objects and a 3D background. Our model is trained
from monocular videos without any supervision, yet learns to\r\ngenerate coherent
3D scenes containing several moving objects. We conduct detailed experiments on
two datasets, going beyond the visual complexity supported by state-of-the-art
generative approaches. We evaluate our method on\r\ndepth-prediction and 3D object
detection---tasks which cannot be addressed by those earlier works---and show
it out-performs them even on 2D instance segmentation and tracking."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "This research was supported by the Scientific Service Units (SSU)
of IST Austria through resources\r\nprovided by Scientific Computing (SciComp).
PH is employed part-time by Blackford Analysis, but\r\nthey did not support this
project in any way."
article_processing_charge: No
author:
- first_name: Paul M
full_name: Henderson, Paul M
id: 13C09E74-18D9-11E9-8878-32CFE5697425
last_name: Henderson
orcid: 0000-0002-5198-7445
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Henderson PM, Lampert C. Unsupervised object-centric video generation and
decomposition in 3D. In: 34th Conference on Neural Information Processing Systems.
Vol 33. Curran Associates; 2020:3106–3117.'
apa: 'Henderson, P. M., & Lampert, C. (2020). Unsupervised object-centric video
generation and decomposition in 3D. In 34th Conference on Neural Information
Processing Systems (Vol. 33, pp. 3106–3117). Vancouver, Canada: Curran Associates.'
chicago: Henderson, Paul M, and Christoph Lampert. “Unsupervised Object-Centric
Video Generation and Decomposition in 3D.” In 34th Conference on Neural Information
Processing Systems, 33:3106–3117. Curran Associates, 2020.
ieee: P. M. Henderson and C. Lampert, “Unsupervised object-centric video generation
and decomposition in 3D,” in 34th Conference on Neural Information Processing
Systems, Vancouver, Canada, 2020, vol. 33, pp. 3106–3117.
ista: 'Henderson PM, Lampert C. 2020. Unsupervised object-centric video generation
and decomposition in 3D. 34th Conference on Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems vol. 33, 3106–3117.'
mla: Henderson, Paul M., and Christoph Lampert. “Unsupervised Object-Centric Video
Generation and Decomposition in 3D.” 34th Conference on Neural Information
Processing Systems, vol. 33, Curran Associates, 2020, pp. 3106–3117.
short: P.M. Henderson, C. Lampert, in:, 34th Conference on Neural Information Processing
Systems, Curran Associates, 2020, pp. 3106–3117.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2020-07-31T16:59:19Z
date_published: 2020-07-07T00:00:00Z
date_updated: 2023-04-25T09:49:58Z
day: '07'
department:
- _id: ChLa
external_id:
arxiv:
- '2007.06705'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2007.06705
month: '07'
oa: 1
oa_version: Preprint
page: 3106–3117
publication: 34th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
status: public
title: Unsupervised object-centric video generation and decomposition in 3D
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2020'
...
---
_id: '7474'
abstract:
- lang: eng
text: This booklet is a collection of abstracts presented at the AHPC conference.
article_processing_charge: No
citation:
ama: 'Schlögl A, Kiss J, Elefante S, eds. Austrian High-Performance-Computing
Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria; 2020. doi:10.15479/AT:ISTA:7474'
apa: 'Schlögl, A., Kiss, J., & Elefante, S. (Eds.). (2020). Austrian High-Performance-Computing
meeting (AHPC2020). Presented at the AHPC: Austrian High-Performance-Computing
Meeting, Klosterneuburg, Austria: IST Austria. https://doi.org/10.15479/AT:ISTA:7474'
chicago: 'Schlögl, Alois, Janos Kiss, and Stefano Elefante, eds. Austrian High-Performance-Computing
Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:7474.'
ieee: 'A. Schlögl, J. Kiss, and S. Elefante, Eds., Austrian High-Performance-Computing
meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020.'
ista: 'Schlögl A, Kiss J, Elefante S eds. 2020. Austrian High-Performance-Computing
meeting (AHPC2020), Klosterneuburg, Austria: IST Austria, 72p.'
mla: Schlögl, Alois, et al., editors. Austrian High-Performance-Computing Meeting
(AHPC2020). IST Austria, 2020, doi:10.15479/AT:ISTA:7474.
short: A. Schlögl, J. Kiss, S. Elefante, eds., Austrian High-Performance-Computing
Meeting (AHPC2020), IST Austria, Klosterneuburg, Austria, 2020.
conference:
end_date: 2020-02-21
location: Klosterneuburg, Austria
name: 'AHPC: Austrian High-Performance-Computing Meeting'
start_date: 2020-02-19
date_created: 2020-02-11T07:59:04Z
date_published: 2020-02-19T00:00:00Z
date_updated: 2023-05-16T07:48:28Z
day: '19'
ddc:
- '000'
department:
- _id: ScienComp
doi: 10.15479/AT:ISTA:7474
editor:
- 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: Janos
full_name: Kiss, Janos
id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87
last_name: Kiss
- first_name: Stefano
full_name: Elefante, Stefano
id: 490F40CE-F248-11E8-B48F-1D18A9856A87
last_name: Elefante
file:
- access_level: open_access
checksum: 49798edb9e57bbd6be18362d1d7b18a9
content_type: application/pdf
creator: schloegl
date_created: 2020-02-19T06:53:38Z
date_updated: 2020-07-14T12:47:59Z
file_id: '7504'
file_name: BOOKLET_AHPC2020.final.pdf
file_size: 90899507
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '72'
place: Klosterneuburg, Austria
publication_identifier:
isbn:
- 978-3-99078-004-6
publication_status: published
publisher: IST Austria
quality_controlled: '1'
status: public
title: Austrian High-Performance-Computing meeting (AHPC2020)
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: book_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7808'
abstract:
- lang: eng
text: Quantization converts neural networks into low-bit fixed-point computations
which can be carried out by efficient integer-only hardware, and is standard practice
for the deployment of neural networks on real-time embedded devices. However,
like their real-numbered counterpart, quantized networks are not immune to malicious
misclassification caused by adversarial attacks. We investigate how quantization
affects a network’s robustness to adversarial attacks, which is a formal verification
question. We show that neither robustness nor non-robustness are monotonic with
changing the number of bits for the representation and, also, neither are preserved
by quantization from a real-numbered network. For this reason, we introduce a
verification method for quantized neural networks which, using SMT solving over
bit-vectors, accounts for their exact, bit-precise semantics. We built a tool
and analyzed the effect of quantization on a classifier for the MNIST dataset.
We demonstrate that, compared to our method, existing methods for the analysis
of real-numbered networks often derive false conclusions about their quantizations,
both when determining robustness and when detecting attacks, and that existing
methods for quantized networks often miss attacks. Furthermore, we applied our
method beyond robustness, showing how the number of bits in quantization enlarges
the gender bias of a predictor for students’ grades.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
citation:
ama: 'Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize
your neural network? In: International Conference on Tools and Algorithms for
the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97.
doi:10.1007/978-3-030-45237-7_5'
apa: 'Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does
it take to quantize your neural network? In International Conference on Tools
and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp.
79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5'
chicago: Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits
Does It Take to Quantize Your Neural Network?” In International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97.
Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5.
ieee: M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take
to quantize your neural network?,” in International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, Dublin, Ireland,
2020, vol. 12079, pp. 79–97.
ista: 'Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to
quantize your neural network? International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.'
mla: Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural
Network?” International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.
short: M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on
Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature,
2020, pp. 79–97.
conference:
end_date: 2020-04-30
location: Dublin, Ireland
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2020-04-25
date_created: 2020-05-10T22:00:49Z
date_published: 2020-04-17T00:00:00Z
date_updated: 2023-06-23T07:01:11Z
day: '17'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-45237-7_5
file:
- access_level: open_access
checksum: f19905a42891fe5ce93d69143fa3f6fb
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T12:48:15Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7893'
file_name: 2020_TACAS_Giacobbe.pdf
file_size: 2744030
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 12079'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 79-97
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783030452360'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: How many bits does it take to quantize your neural network?
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: 12079
year: '2020'
...
---
_id: '7952'
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: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate
an isomanifold is to consider its Piecewise-Linear (PL) approximation based on
a triangulation \U0001D4AF of the ambient space ℝ^d. 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 fine triangulation \U0001D4AF. 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. "
alternative_title:
- LIPIcs
article_number: 20:1-20:18
article_processing_charge: No
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. In: 36th International Symposium on Computational Geometry.
Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.20'
apa: 'Boissonnat, J.-D., & Wintraecken, M. (2020). The topological correctness
of PL-approximations of isomanifolds. In 36th International Symposium on Computational
Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.20'
chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL-Approximations of Isomanifolds.” In 36th International Symposium on Computational
Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
https://doi.org/10.4230/LIPIcs.SoCG.2020.20.
ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL-approximations
of isomanifolds,” in 36th International Symposium on Computational Geometry,
Zürich, Switzerland, 2020, vol. 164.
ista: 'Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations
of isomanifolds. 36th International Symposium on Computational Geometry. SoCG:
Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18.'
mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL-Approximations of Isomanifolds.” 36th International Symposium on Computational
Geometry, vol. 164, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.SoCG.2020.20.
short: J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-09T07:24:11Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-02T06:49:16Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2020.20
ec_funded: 1
file:
- access_level: open_access
checksum: 38cbfa4f5d484d267a35d44d210df044
content_type: application/pdf
creator: dernst
date_created: 2020-06-17T10:13:34Z
date_updated: 2020-07-14T12:48:06Z
file_id: '7969'
file_name: 2020_LIPIcsSoCG_Boissonnat.pdf
file_size: 1009739
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- 978-3-95977-143-6
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9649'
relation: later_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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '7990'
abstract:
- lang: eng
text: 'Given a finite point set P in general position in the plane, a full triangulation
is a maximal straight-line embedded plane graph on P. A partial triangulation
on P is a full triangulation of some subset P'' of P containing all extreme points
in P. A bistellar flip on a partial triangulation either flips an edge, removes
a non-extreme point of degree 3, or adds a point in P ⧵ P'' as vertex of degree
3. The bistellar flip graph has all partial triangulations as vertices, and a
pair of partial triangulations is adjacent if they can be obtained from one another
by a bistellar flip. The goal of this paper is to investigate the structure of
this graph, with emphasis on its connectivity. For sets P of n points in general
position, we show that the bistellar flip graph is (n-3)-connected, thereby answering,
for sets in general position, an open questions raised in a book (by De Loera,
Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches
the situation for the subfamily of regular triangulations (i.e., partial triangulations
obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity
has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov,
Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results
(see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph
can be covered by graphs of polytopes of dimension n-3 (products of secondary
polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in
the Hasse diagram of the partial order of partial subdivisions from the trivial
subdivision. (iii) All partial triangulations are regular iff the trivial subdivision
has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily
large sets P with non-regular partial triangulations, while every proper subset
has only regular triangulations, i.e., there are no small certificates for the
existence of non-regular partial triangulations (answering a question by F. Santos
in the unexpected direction).'
alternative_title:
- LIPIcs
article_number: 67:1 - 67:16
article_processing_charge: No
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: 'Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane
(Part II: Bistellar flips). In: 36th International Symposium on Computational
Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020.
doi:10.4230/LIPIcs.SoCG.2020.67'
apa: 'Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs
in the plane (Part II: Bistellar flips). In 36th International Symposium on
Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl -
Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67'
chicago: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs
in the Plane (Part II: Bistellar Flips).” In 36th International Symposium on
Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.67.'
ieee: 'U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the
plane (Part II: Bistellar flips),” in 36th International Symposium on Computational
Geometry, Zürich, Switzerland, 2020, vol. 164.'
ista: 'Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the
plane (Part II: Bistellar flips). 36th International Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16.'
mla: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in
the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational
Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.SoCG.2020.67.'
short: U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zürich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-22
date_created: 2020-06-22T09:14:19Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-04T08:51:07Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2020.67
external_id:
arxiv:
- '2003.13557'
file:
- access_level: open_access
checksum: 3f6925be5f3dcdb3b14cab92f410edf7
content_type: application/pdf
creator: dernst
date_created: 2020-06-23T06:37:27Z
date_updated: 2020-07-14T12:48:06Z
file_id: '8003'
file_name: 2020_LIPIcsSoCG_Wagner.pdf
file_size: 793187
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 164'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '12129'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Connectivity of triangulation flip graphs in the plane (Part II: Bistellar
flips)'
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: 164
year: '2020'
...
---
_id: '7807'
abstract:
- lang: eng
text: "In a straight-line embedded triangulation of a point set P in the plane,
removing an inner edge and—provided the resulting quadrilateral is convex—adding
the other diagonal is called an edge flip. The (edge) flip graph has all triangulations
as vertices, and a pair of triangulations is adjacent if they can be obtained
from each other by an edge flip. The goal of this paper is to contribute to a
better understanding of the flip graph, with an emphasis on its connectivity.\r\nFor
sets in general position, it is known that every triangulation allows at least
edge flips (a tight bound) which gives the minimum degree of any flip graph for
n points. We show that for every point set P in general position, the flip graph
is at least -vertex connected. Somewhat more strongly, we show that the vertex
connectivity equals the minimum degree occurring in the flip graph, i.e. the minimum
number of flippable edges in any triangulation of P, provided P is large enough.
Finally, we exhibit some of the geometry of the flip graph by showing that the
flip graph can be covered by 1-skeletons of polytopes of dimension (products of
associahedra).\r\nA corresponding result ((n – 3)-vertex connectedness) can be
shown for the bistellar flip graph of partial triangulations, i.e. the set of
all triangulations of subsets of P which contain all extreme points of P. This
will be treated separately in a second part."
article_processing_charge: No
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: 'Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane
(Part I: Edge flips). In: Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms. Vol 2020-January. SIAM; 2020:2823-2841. doi:10.1137/1.9781611975994.172'
apa: 'Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs
in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City,
UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.172'
chicago: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs
in the Plane (Part I: Edge Flips).” In Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, 2020–January:2823–41. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.172.'
ieee: 'U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the
plane (Part I: Edge flips),” in Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January,
pp. 2823–2841.'
ista: 'Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the
plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 2823–2841.'
mla: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in
the Plane (Part I: Edge Flips).” Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.'
short: U. Wagner, E. Welzl, in:, Proceedings of the Annual ACM-SIAM Symposium on
Discrete Algorithms, SIAM, 2020, pp. 2823–2841.
conference:
end_date: 2020-01-08
location: Salt Lake City, UT, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2020-01-05
date_created: 2020-05-10T22:00:48Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-08-04T08:51:07Z
day: '01'
department:
- _id: UlWa
doi: 10.1137/1.9781611975994.172
external_id:
arxiv:
- '2003.13557'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611975994.172
month: '01'
oa: 1
oa_version: Submitted Version
page: 2823-2841
publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611975994'
publication_status: published
publisher: SIAM
quality_controlled: '1'
related_material:
record:
- id: '12129'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2020-January
year: '2020'
...
---
_id: '13073'
abstract:
- lang: eng
text: The Mytilus complex of marine mussel species forms a mosaic of hybrid zones,
found across temperate regions of the globe. This allows us to study "replicated"
instances of secondary contact between closely-related species. Previous work
on this complex has shown that local introgression is both widespread and highly
heterogeneous, and has identified SNPs that are outliers of differentiation between
lineages. Here, we developed an ancestry-informative panel of such SNPs. We then
compared their frequencies in newly-sampled populations, including samples from
within the hybrid zones, and parental populations at different distances from
the contact. Results show that close to the hybrid zones, some outlier loci are
near to fixation for the heterospecific allele, suggesting enhanced local introgression,
or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses,
treating local parental populations as the reference, reveal a globally high concordance
among loci, albeit with a few signals of asymmetric introgression. Enhanced local
introgression at specific loci is consistent with the early transfer of adaptive
variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller
incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having
escaped one barrier, however, these variants can be trapped or delayed at the
next barrier, confining the introgression locally. These results shed light on
the decay of species barriers during phases of contact.
article_processing_charge: No
author:
- first_name: Alexis
full_name: Simon, Alexis
last_name: Simon
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Tahani
full_name: El Ayari, Tahani
last_name: El Ayari
- first_name: Cathy
full_name: Liautard-Haag, Cathy
last_name: Liautard-Haag
- first_name: Petr
full_name: Strelkov, Petr
last_name: Strelkov
- first_name: John
full_name: Welch, John
last_name: Welch
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: Simon A, Fraisse C, El Ayari T, et al. How do species barriers decay? concordance
and local introgression in mosaic hybrid zones of mussels. 2020. doi:10.5061/DRYAD.R4XGXD29N
apa: Simon, A., Fraisse, C., El Ayari, T., Liautard-Haag, C., Strelkov, P., Welch,
J., & Bierne, N. (2020). How do species barriers decay? concordance and local
introgression in mosaic hybrid zones of mussels. Dryad. https://doi.org/10.5061/DRYAD.R4XGXD29N
chicago: Simon, Alexis, Christelle Fraisse, Tahani El Ayari, Cathy Liautard-Haag,
Petr Strelkov, John Welch, and Nicolas Bierne. “How Do Species Barriers Decay?
Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels.” Dryad,
2020. https://doi.org/10.5061/DRYAD.R4XGXD29N.
ieee: A. Simon et al., “How do species barriers decay? concordance and local
introgression in mosaic hybrid zones of mussels.” Dryad, 2020.
ista: Simon A, Fraisse C, El Ayari T, Liautard-Haag C, Strelkov P, Welch J, Bierne
N. 2020. How do species barriers decay? concordance and local introgression in
mosaic hybrid zones of mussels, Dryad, 10.5061/DRYAD.R4XGXD29N.
mla: Simon, Alexis, et al. How Do Species Barriers Decay? Concordance and Local
Introgression in Mosaic Hybrid Zones of Mussels. Dryad, 2020, doi:10.5061/DRYAD.R4XGXD29N.
short: A. Simon, C. Fraisse, T. El Ayari, C. Liautard-Haag, P. Strelkov, J. Welch,
N. Bierne, (2020).
date_created: 2023-05-23T16:48:27Z
date_published: 2020-09-22T00:00:00Z
date_updated: 2023-08-04T11:04:11Z
day: '22'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.R4XGXD29N
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.r4xgxd29n
month: '09'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '8708'
relation: used_in_publication
status: public
status: public
title: How do species barriers decay? concordance and local introgression in mosaic
hybrid zones of mussels
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13065'
abstract:
- lang: eng
text: Domestication is a human-induced selection process that imprints the genomes
of domesticated populations over a short evolutionary time scale, and that occurs
in a given demographic context. Reconstructing historical gene flow, effective
population size changes and their timing is therefore of fundamental interest
to understand how plant demography and human selection jointly shape genomic divergence
during domestication. Yet, the comparison under a single statistical framework
of independent domestication histories across different crop species has been
little evaluated so far. Thus, it is unclear whether domestication leads to convergent
demographic changes that similarly affect crop genomes. To address this question,
we used existing and new transcriptome data on three crop species of Solanaceae
(eggplant, pepper and tomato), together with their close wild relatives. We fitted
twelve demographic models of increasing complexity on the unfolded joint allele
frequency spectrum for each wild/crop pair, and we found evidence for both shared
and species-specific demographic processes between species. A convergent history
of domestication with gene-flow was inferred for all three species, along with
evidence of strong reduction in the effective population size during the cultivation
stage of tomato and pepper. The absence of any reduction in size of the crop in
eggplant stands out from the classical view of the domestication process; as does
the existence of a “protracted period” of management before cultivation. Our results
also suggest divergent management strategies of modern cultivars among species
as their current demography substantially differs. Finally, the timing of domestication
is species-specific and supported by the few historical records available.
article_processing_charge: No
author:
- first_name: Stephanie
full_name: Arnoux, Stephanie
last_name: Arnoux
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Christopher
full_name: Sauvage, Christopher
last_name: Sauvage
citation:
ama: 'Arnoux S, Fraisse C, Sauvage C. VCF files of synonymous SNPs related to: Genomic
inference of complex domestication histories in three Solanaceae species. 2020.
doi:10.5061/DRYAD.Q2BVQ83HD'
apa: 'Arnoux, S., Fraisse, C., & Sauvage, C. (2020). VCF files of synonymous
SNPs related to: Genomic inference of complex domestication histories in three
Solanaceae species. Dryad. https://doi.org/10.5061/DRYAD.Q2BVQ83HD'
chicago: 'Arnoux, Stephanie, Christelle Fraisse, and Christopher Sauvage. “VCF Files
of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories
in Three Solanaceae Species.” Dryad, 2020. https://doi.org/10.5061/DRYAD.Q2BVQ83HD.'
ieee: 'S. Arnoux, C. Fraisse, and C. Sauvage, “VCF files of synonymous SNPs related
to: Genomic inference of complex domestication histories in three Solanaceae species.”
Dryad, 2020.'
ista: 'Arnoux S, Fraisse C, Sauvage C. 2020. VCF files of synonymous SNPs related
to: Genomic inference of complex domestication histories in three Solanaceae species,
Dryad, 10.5061/DRYAD.Q2BVQ83HD.'
mla: 'Arnoux, Stephanie, et al. VCF Files of Synonymous SNPs Related to: Genomic
Inference of Complex Domestication Histories in Three Solanaceae Species.
Dryad, 2020, doi:10.5061/DRYAD.Q2BVQ83HD.'
short: S. Arnoux, C. Fraisse, C. Sauvage, (2020).
date_created: 2023-05-23T16:30:20Z
date_published: 2020-10-19T00:00:00Z
date_updated: 2023-08-04T11:19:26Z
day: '19'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.Q2BVQ83HD
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.q2bvq83hd
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
link:
- relation: software
url: https://github.com/starnoux/arnoux_et_al_2019
record:
- id: '8928'
relation: used_in_publication
status: public
status: public
title: 'VCF files of synonymous SNPs related to: Genomic inference of complex domestication
histories in three Solanaceae species'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8536'
abstract:
- lang: eng
text: This work analyzes the latency of the simplified successive cancellation (SSC)
decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It
is shown that, unlike conventional successive cancellation decoding, where latency
is linear in the block length, the latency of SSC decoding is sublinear. More
specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block
length and µ is the scaling exponent of the channel, which captures the speed
of convergence of the rate to capacity. Numerical results demonstrate the tightness
of the bound and show that most of the latency reduction arises from the parallel
decoding of subcodes of rate 0 and 1.
acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305,
IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral
Fellowship from the Natural Sciences and Engineering Research Council of Canada
(NSERC) and by Huawei.
article_number: 401-406
article_processing_charge: No
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation
decoding of polar codes has sublinear latency. In: IEEE International Symposium
on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141'
apa: 'Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified
successive cancellation decoding of polar codes has sublinear latency. In IEEE
International Symposium on Information Theory - Proceedings (Vol. 2020–June).
Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141'
chicago: Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith.
“Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.”
In IEEE International Symposium on Information Theory - Proceedings, Vol.
2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141.
ieee: M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive
cancellation decoding of polar codes has sublinear latency,” in IEEE International
Symposium on Information Theory - Proceedings, Los Angeles, CA, United States,
2020, vol. 2020–June.
ista: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive
cancellation decoding of polar codes has sublinear latency. IEEE International
Symposium on Information Theory - Proceedings. ISIT: Internation Symposium on
Information Theory vol. 2020–June, 401–406.'
mla: Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar
Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory
- Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141.
short: M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International
Symposium on Information Theory - Proceedings, IEEE, 2020.
conference:
end_date: 2020-06-26
location: Los Angeles, CA, United States
name: 'ISIT: Internation Symposium on Information Theory'
start_date: 2020-06-21
date_created: 2020-09-20T22:01:37Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-07T13:36:24Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT44484.2020.9174141
external_id:
arxiv:
- '1909.04892'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.04892
month: '06'
oa: 1
oa_version: Preprint
publication: IEEE International Symposium on Information Theory - Proceedings
publication_identifier:
isbn:
- '9781728164328'
issn:
- '21578095'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9047'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Simplified successive cancellation decoding of polar codes has sublinear latency
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2020-June
year: '2020'
...
---
_id: '9308'
acknowledgement: This research was carried out with the support of the Russian Foundation
for Basic Research(grant no. 19-01-00169)
article_processing_charge: No
article_type: original
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: A. B.
full_name: Skopenkov, A. B.
last_name: Skopenkov
citation:
ama: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity
intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158.
doi:10.1070/RM9943
apa: Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating
higher-multiplicity intersections, III. Codimension 2. Russian Mathematical
Surveys. IOP Publishing. https://doi.org/10.1070/RM9943
chicago: Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating
Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical
Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.
ieee: S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity
intersections, III. Codimension 2,” Russian Mathematical Surveys, vol.
75, no. 6. IOP Publishing, pp. 1156–1158, 2020.
ista: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity
intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.
mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III.
Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing,
2020, pp. 1156–58, doi:10.1070/RM9943.
short: S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical
Surveys 75 (2020) 1156–1158.
date_created: 2021-04-04T22:01:22Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2023-08-14T11:43:54Z
day: '01'
department:
- _id: UlWa
doi: 10.1070/RM9943
external_id:
arxiv:
- '1511.03501'
isi:
- '000625983100001'
intvolume: ' 75'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03501
month: '12'
oa: 1
oa_version: Preprint
page: 1156-1158
publication: Russian Mathematical Surveys
publication_identifier:
issn:
- 0036-0279
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
related_material:
record:
- id: '8183'
relation: earlier_version
status: public
- id: '10220'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Eliminating higher-multiplicity intersections, III. Codimension 2
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 75
year: '2020'
...
---
_id: '6358'
abstract:
- lang: eng
text: We study dynamical optimal transport metrics between density matricesassociated
to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative
differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral
gap estimates.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Eric A.
full_name: Carlen, Eric A.
last_name: Carlen
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional
inequalities in dissipative quantum systems. Journal of Statistical Physics.
2020;178(2):319-378. doi:10.1007/s10955-019-02434-w
apa: Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport
and functional inequalities in dissipative quantum systems. Journal of Statistical
Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w
chicago: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport
and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical
Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w.
ieee: E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and
functional inequalities in dissipative quantum systems,” Journal of Statistical
Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.
ista: Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional
inequalities in dissipative quantum systems. Journal of Statistical Physics.
178(2), 319–378.
mla: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport
and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical
Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w.
short: E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.
date_created: 2019-04-30T07:34:18Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-08-17T13:49:40Z
day: '01'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1007/s10955-019-02434-w
ec_funded: 1
external_id:
arxiv:
- '1811.04572'
isi:
- '000498933300001'
file:
- access_level: open_access
checksum: 7b04befbdc0d4982c0ee945d25d19872
content_type: application/pdf
creator: dernst
date_created: 2019-12-23T12:03:09Z
date_updated: 2020-07-14T12:47:28Z
file_id: '7209'
file_name: 2019_JourStatistPhysics_Carlen.pdf
file_size: 905538
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 178'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 319-378
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: ' F06504'
name: Taming Complexity in Partial Di erential Systems
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- '15729613'
issn:
- '00224715'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s10955-020-02671-4
scopus_import: '1'
status: public
title: Non-commutative calculus, optimal transport and functional inequalities in
dissipative quantum 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: 178
year: '2020'
...
---
_id: '74'
abstract:
- lang: eng
text: "We study the Gromov waist in the sense of t-neighborhoods for measures in
the Euclidean space, motivated by the famous theorem of Gromov about
\ the waist of radially symmetric Gaussian measures. In particular, it turns
our possible to extend Gromov’s original result to the case of not necessarily
\ radially symmetric Gaussian measure. We also provide examples of measures
having no t-neighborhood waist property, including a rather wide class\r\nof compactly
supported radially symmetric measures and their maps into the Euclidean space
of dimension at least 2.\r\nWe use a simpler form of Gromov’s pancake argument
\ to produce some estimates of t-neighborhoods of (weighted) volume-critical
submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic
manifolds in the complex projective space. In the appendix of this paper we provide
for reader’s convenience a more detailed explanation of the Caffarelli theorem
that we use to handle not necessarily radially symmetric Gaussian\r\nmeasures."
article_processing_charge: No
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: 'Akopyan A, Karasev R. Gromov’s waist of non-radial Gaussian measures and radial
non-Gaussian measures. In: Klartag B, Milman E, eds. Geometric Aspects of Functional
Analysis. Vol 2256. LNM. Springer Nature; 2020:1-27. doi:10.1007/978-3-030-36020-7_1'
apa: Akopyan, A., & Karasev, R. (2020). Gromov’s waist of non-radial Gaussian
measures and radial non-Gaussian measures. In B. Klartag & E. Milman (Eds.),
Geometric Aspects of Functional Analysis (Vol. 2256, pp. 1–27). Springer
Nature. https://doi.org/10.1007/978-3-030-36020-7_1
chicago: Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian
Measures and Radial Non-Gaussian Measures.” In Geometric Aspects of Functional
Analysis, edited by Bo’az Klartag and Emanuel Milman, 2256:1–27. LNM. Springer
Nature, 2020. https://doi.org/10.1007/978-3-030-36020-7_1.
ieee: A. Akopyan and R. Karasev, “Gromov’s waist of non-radial Gaussian measures
and radial non-Gaussian measures,” in Geometric Aspects of Functional Analysis,
vol. 2256, B. Klartag and E. Milman, Eds. Springer Nature, 2020, pp. 1–27.
ista: 'Akopyan A, Karasev R. 2020.Gromov’s waist of non-radial Gaussian measures
and radial non-Gaussian measures. In: Geometric Aspects of Functional Analysis.
vol. 2256, 1–27.'
mla: Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian
Measures and Radial Non-Gaussian Measures.” Geometric Aspects of Functional
Analysis, edited by Bo’az Klartag and Emanuel Milman, vol. 2256, Springer
Nature, 2020, pp. 1–27, doi:10.1007/978-3-030-36020-7_1.
short: A. Akopyan, R. Karasev, in:, B. Klartag, E. Milman (Eds.), Geometric Aspects
of Functional Analysis, Springer Nature, 2020, pp. 1–27.
date_created: 2018-12-11T11:44:29Z
date_published: 2020-06-21T00:00:00Z
date_updated: 2023-08-17T13:48:31Z
day: '21'
department:
- _id: HeEd
- _id: JaMa
doi: 10.1007/978-3-030-36020-7_1
ec_funded: 1
editor:
- first_name: Bo'az
full_name: Klartag, Bo'az
last_name: Klartag
- first_name: Emanuel
full_name: Milman, Emanuel
last_name: Milman
external_id:
arxiv:
- '1808.07350'
isi:
- '000557689300003'
intvolume: ' 2256'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.07350
month: '06'
oa: 1
oa_version: Preprint
page: 1-27
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Geometric Aspects of Functional Analysis
publication_identifier:
eisbn:
- '9783030360207'
eissn:
- '16179692'
isbn:
- '9783030360191'
issn:
- '00758434'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNM
status: public
title: Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures
type: book_chapter
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 2256
year: '2020'
...
---
_id: '177'
abstract:
- lang: eng
text: We develop a geometric version of the circle method and use it to compute
the compactly supported cohomology of the space of rational curves through a point
on a smooth affine hypersurface of sufficiently low degree.
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: Will
full_name: Sawin, Will
last_name: Sawin
citation:
ama: Browning TD, Sawin W. A geometric version of the circle method. Annals of
Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4
apa: Browning, T. D., & Sawin, W. (2020). A geometric version of the circle
method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4
chicago: Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle
Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4.
ieee: T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals
of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.
ista: Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals
of Mathematics. 191(3), 893–948.
mla: Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.”
Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp.
893–948, doi:10.4007/annals.2020.191.3.4.
short: T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.
date_created: 2018-12-11T11:45:02Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-08-17T07:12:37Z
day: '01'
department:
- _id: TiBr
doi: 10.4007/annals.2020.191.3.4
external_id:
arxiv:
- '1711.10451'
isi:
- '000526986300004'
intvolume: ' 191'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.10451
month: '05'
oa: 1
oa_version: Preprint
page: 893-948
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University
publist_id: '7744'
quality_controlled: '1'
status: public
title: A geometric version of the circle method
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 191
year: '2020'
...
---
_id: '6649'
abstract:
- lang: eng
text: "While Hartree–Fock theory is well established as a fundamental approximation
for interacting fermions, it has been unclear how to describe corrections to it
due to many-body correlations. In this paper we start from the Hartree–Fock state
given by plane waves and introduce collective particle–hole pair excitations.
These pairs can be approximately described by a bosonic quadratic Hamiltonian.
We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type
upper bound to the ground state energy. Our result justifies the random-phase
approximation in the mean-field scaling regime, for repulsive, regular interaction
potentials.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Phan Thành
full_name: Nam, Phan Thành
last_name: Nam
- first_name: Marcello
full_name: Porta, Marcello
last_name: Porta
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound
for the correlation energy of a Fermi gas in the mean-field regime. Communications
in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5
apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R.
(2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field
regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5
chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein,
and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi
Gas in the Mean-Field Regime.” Communications in Mathematical Physics.
Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5.
ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal
upper bound for the correlation energy of a Fermi gas in the mean-field regime,”
Communications in Mathematical Physics, vol. 374. Springer Nature, pp.
2097–2150, 2020.
ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper
bound for the correlation energy of a Fermi gas in the mean-field regime. Communications
in Mathematical Physics. 374, 2097–2150.
mla: Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy
of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics,
vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5.
short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications
in Mathematical Physics 374 (2020) 2097–2150.
date_created: 2019-07-18T13:30:04Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-08-17T13:51:50Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03505-5
ec_funded: 1
external_id:
arxiv:
- '1809.01902'
isi:
- '000527910700019'
file:
- access_level: open_access
checksum: f9dd6dd615a698f1d3636c4a092fed23
content_type: application/pdf
creator: dernst
date_created: 2019-07-24T07:19:10Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6668'
file_name: 2019_CommMathPhysics_Benedikter.pdf
file_size: 853289
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 374'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 2097–2150
project:
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal upper bound for the correlation energy of a Fermi gas in the mean-field
regime
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: 374
year: '2020'
...
---
_id: '6796'
abstract:
- lang: eng
text: Nearby grid cells have been observed to express a remarkable degree of long-rangeorder,
which is often idealized as extending potentially to infinity. Yet their strict
peri-odic firing and ensemble coherence are theoretically possible only in flat
environments, much unlike the burrows which rodents usually live in. Are the symmetrical,
coherent grid maps inferred in the lab relevant to chart their way in their natural
habitat? We consider spheres as simple models of curved environments and waiting
for the appropriate experiments to be performed, we use our adaptation model to
predict what grid maps would emerge in a network with the same type of recurrent
connections, which on the plane produce coherence among the units. We find that
on the sphere such connections distort the maps that single grid units would express
on their own, and aggregate them into clusters. When remapping to a different
spherical environment, units in each cluster maintain only partial coherence,
similar to what is observed in disordered materials, such as spin glasses.
article_processing_charge: No
article_type: original
author:
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Eugenio
full_name: Urdapilleta, Eugenio
last_name: Urdapilleta
- first_name: Yifan
full_name: Luo, Yifan
last_name: Luo
- first_name: Alessandro
full_name: Treves, Alessandro
last_name: Treves
citation:
ama: Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration
in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144
apa: Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence
and frustration in self-organizing spherical grids. Hippocampus. Wiley.
https://doi.org/10.1002/hipo.23144
chicago: Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves.
“Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus.
Wiley, 2020. https://doi.org/10.1002/hipo.23144.
ieee: F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration
in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley,
pp. 302–313, 2020.
ista: Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration
in self-organizing spherical grids. Hippocampus. 30(4), 302–313.
mla: Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing
Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13,
doi:10.1002/hipo.23144.
short: F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.
date_created: 2019-08-11T21:59:24Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T13:53:14Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1002/hipo.23144
external_id:
isi:
- '000477299600001'
pmid:
- '31339190'
file:
- access_level: open_access
checksum: 7b54d22bfbfc0d1188a9ea24d985bfb2
content_type: application/pdf
creator: dernst
date_created: 2019-08-12T07:53:33Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6800'
file_name: 2019_Hippocampus_Stella.pdf
file_size: 2370658
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 30'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 302-313
pmid: 1
publication: Hippocampus
publication_identifier:
eissn:
- '10981063'
issn:
- '10509631'
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial coherence and frustration in self-organizing spherical grids
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: 30
year: '2020'
...
---
_id: '6761'
abstract:
- lang: eng
text: In resource allocation games, selfish players share resources that are needed
in order to fulfill their objectives. The cost of using a resource depends on
the load on it. In the traditional setting, the players make their choices concurrently
and in one-shot. That is, a strategy for a player is a subset of the resources.
We introduce and study dynamic resource allocation games. In this setting, the
game proceeds in phases. In each phase each player chooses one resource. A scheduler
dictates the order in which the players proceed in a phase, possibly scheduling
several players to proceed concurrently. The game ends when each player has collected
a set of resources that fulfills his objective. The cost for each player then
depends on this set as well as on the load on the resources in it – we consider
both congestion and cost-sharing games. We argue that the dynamic setting is the
suitable setting for many applications in practice. We study the stability of
dynamic resource allocation games, where the appropriate notion of stability is
that of subgame perfect equilibrium, study the inefficiency incurred due to selfish
behavior, and also study problems that are particular to the dynamic setting,
like constraints on the order in which resources can be chosen or the problem
of finding a scheduler that achieves stability.
article_processing_charge: No
article_type: original
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
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical
Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
apa: Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation
games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031
chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation
Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.
ieee: G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,”
Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
ista: Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games.
Theoretical Computer Science. 807, 42–55.
mla: Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer
Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.
short: G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020)
42–55.
date_created: 2019-08-04T21:59:20Z
date_published: 2020-02-06T00:00:00Z
date_updated: 2023-08-17T13:52:49Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2019.06.031
external_id:
isi:
- '000512219400004'
file:
- access_level: open_access
checksum: e86635417f45eb2cd75778f91382f737
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:31:22Z
date_updated: 2020-10-09T06:31:22Z
file_id: '8639'
file_name: 2020_TheoreticalCS_Avni.pdf
file_size: 1413001
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:31:22Z
has_accepted_license: '1'
intvolume: ' 807'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 42-55
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Theoretical Computer Science
publication_identifier:
issn:
- '03043975'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '1341'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic resource allocation games
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 807
year: '2020'
...
---
_id: '6593'
abstract:
- lang: eng
text: 'We consider the monotone variational inequality problem in a Hilbert space
and describe a projection-type method with inertial terms under the following
properties: (a) The method generates a strongly convergent iteration sequence;
(b) The method requires, at each iteration, only one projection onto the feasible
set and two evaluations of the operator; (c) The method is designed for variational
inequality for which the underline operator is monotone and uniformly continuous;
(d) The method includes an inertial term. The latter is also shown to speed up
the convergence in our numerical results. A comparison with some related methods
is given and indicates that the new method is promising.'
acknowledgement: The research of this author is supported by the ERC grant at the
IST.
article_processing_charge: No
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Xiao-Huan
full_name: Li, Xiao-Huan
last_name: Li
- first_name: Qiao-Li
full_name: Dong, Qiao-Li
last_name: Dong
citation:
ama: Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone
variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388.
doi:10.1007/s11075-019-00758-y
apa: Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type
method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms.
Springer Nature. https://doi.org/10.1007/s11075-019-00758-y
chicago: Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type
Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical
Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y.
ieee: Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for
monotone variational inequalities in Hilbert spaces,” Numerical Algorithms,
vol. 84. Springer Nature, pp. 365–388, 2020.
ista: Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone
variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.
mla: Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational
Inequalities in Hilbert Spaces.” Numerical Algorithms, vol. 84, Springer
Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y.
short: Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.
date_created: 2019-06-27T20:09:33Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-08-17T13:51:18Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1007/s11075-019-00758-y
ec_funded: 1
external_id:
isi:
- '000528979000015'
file:
- access_level: open_access
checksum: bb1a1eb3ebb2df380863d0db594673ba
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T13:14:10Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6927'
file_name: ExtragradientMethodPaper.pdf
file_size: 359654
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 365-388
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Numerical Algorithms
publication_identifier:
eissn:
- 1572-9265
issn:
- 1017-1398
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An efficient projection-type method for monotone variational inequalities in
Hilbert spaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 84
year: '2020'
...
---
_id: '6808'
abstract:
- lang: eng
text: Super-resolution fluorescence microscopy has become an important catalyst
for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy,
a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling
off-state. Only emitters residing in a sub-diffraction volume around an intensity
minimum are allowed to fluoresce, rendering them distinguishable from the nearby,
but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers
range in biological samples and is suitable for live imaging. Here, we review
the working principle of STED and provide general guidelines for successful STED
imaging. The strive for ever higher resolution comes at the cost of increased
light burden. We discuss techniques to reduce light exposure and mitigate its
detrimental effects on the specimen. These include specialized illumination strategies
as well as protecting fluorophores from photobleaching mediated by high-intensity
STED light. This opens up the prospect of volumetric imaging in living cells and
tissues with diffraction-unlimited resolution in all three spatial dimensions.
article_processing_charge: No
article_type: original
author:
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated
Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41.
doi:10.1016/j.ymeth.2019.07.019
apa: Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance
in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods.
Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019
chicago: Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize
Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.”
Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.
ieee: W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance
in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods,
vol. 174, no. 3. Elsevier, pp. 27–41, 2020.
ista: Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated
Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3),
27–41.
mla: Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission
Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174,
no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019.
short: W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.
date_created: 2019-08-12T16:36:32Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-08-17T13:59:57Z
day: '01'
department:
- _id: JoDa
doi: 10.1016/j.ymeth.2019.07.019
external_id:
isi:
- '000525860400005'
pmid:
- '31344404'
intvolume: ' 174'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/
month: '03'
oa: 1
oa_version: Submitted Version
page: 27-41
pmid: 1
project:
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
- _id: 2668BFA0-B435-11E9-9278-68D0E5697425
grant_number: LT00057
name: High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration
publication: Methods
publication_identifier:
issn:
- 1046-2023
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategies to maximize performance in STimulated Emission Depletion (STED)
nanoscopy of biological specimens
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 174
year: '2020'
...
---
_id: '6563'
abstract:
- lang: eng
text: "This paper presents two algorithms. The first decides the existence of a
pointed homotopy between given simplicial maps \U0001D453,\U0001D454:\U0001D44B→\U0001D44C,
and the second computes the group [\U0001D6F4\U0001D44B,\U0001D44C]∗ of pointed
homotopy classes of maps from a suspension; in both cases, the target Y is assumed
simply connected. More generally, these algorithms work relative to \U0001D434⊆\U0001D44B."
article_processing_charge: No
article_type: original
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Lukas
full_name: Vokřínek, Lukas
last_name: Vokřínek
citation:
ama: Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint.
Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x
apa: Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An
algorithmic viewpoint. Foundations of Computational Mathematics. Springer
Nature. https://doi.org/10.1007/s10208-019-09419-x
chicago: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An
Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer
Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.
ieee: M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic
viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer
Nature, pp. 311–330, 2020.
ista: Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic
viewpoint. Foundations of Computational Mathematics. 20, 311–330.
mla: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic
Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer
Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
short: M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020)
311–330.
date_created: 2019-06-16T21:59:14Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T13:50:44Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s10208-019-09419-x
external_id:
arxiv:
- '1312.2337'
isi:
- '000522437400004'
intvolume: ' 20'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.2337
month: '04'
oa: 1
oa_version: Preprint
page: 311-330
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: Foundations of Computational Mathematics
publication_identifier:
eissn:
- '16153383'
issn:
- '16153375'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Are two given maps homotopic? An algorithmic viewpoint
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2020'
...
---
_id: '6952'
abstract:
- lang: eng
text: 'We present a unified framework tackling two problems: class-specific 3D reconstruction
from a single image, and generation of new 3D shape samples. These tasks have
received considerable attention recently; however, most existing approaches rely
on 3D supervision, annotation of 2D images with keypoints or poses, and/or training
with multiple views of each object instance. Our framework is very general: it
can be trained in similar settings to existing approaches, while also supporting
weaker supervision. Importantly, it can be trained purely from 2D images, without
pose annotations, and with only a single view per instance. We employ meshes as
an output representation, instead of voxels used in most prior work. This allows
us to reason over lighting parameters and exploit shading information during training,
which previous 2D-supervised methods cannot. Thus, our method can learn to generate
and reconstruct concave object classes. We evaluate our approach in various settings,
showing that: (i) it learns to disentangle shape from pose and lighting; (ii)
using shading in the loss improves performance compared to just silhouettes; (iii)
when using a standard single white light, our model outperforms state-of-the-art
2D-supervised methods, both with and without pose supervision, thanks to exploiting
shading cues; (iv) performance improves further when using multiple coloured lights,
even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced
by our model capture smooth surfaces and fine details better than voxel-based
approaches; and (vi) our approach supports concave classes such as bathtubs and
sofas, which methods based on silhouettes cannot learn.'
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Paul M
full_name: Henderson, Paul M
id: 13C09E74-18D9-11E9-8878-32CFE5697425
last_name: Henderson
orcid: 0000-0002-5198-7445
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
citation:
ama: Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative
modelling of shape, pose and shading. International Journal of Computer Vision.
2020;128:835-854. doi:10.1007/s11263-019-01219-8
apa: Henderson, P. M., & Ferrari, V. (2020). Learning single-image 3D reconstruction
by generative modelling of shape, pose and shading. International Journal of
Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01219-8
chicago: Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction
by Generative Modelling of Shape, Pose and Shading.” International Journal
of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01219-8.
ieee: P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by
generative modelling of shape, pose and shading,” International Journal of
Computer Vision, vol. 128. Springer Nature, pp. 835–854, 2020.
ista: Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by
generative modelling of shape, pose and shading. International Journal of Computer
Vision. 128, 835–854.
mla: Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction
by Generative Modelling of Shape, Pose and Shading.” International Journal
of Computer Vision, vol. 128, Springer Nature, 2020, pp. 835–54, doi:10.1007/s11263-019-01219-8.
short: P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128
(2020) 835–854.
date_created: 2019-10-17T13:38:20Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T14:01:16Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s11263-019-01219-8
external_id:
arxiv:
- '1901.06447'
isi:
- '000491042100002'
file:
- access_level: open_access
checksum: a0f05dd4f5f64e4f713d8d9d4b5b1e3f
content_type: application/pdf
creator: dernst
date_created: 2019-10-25T10:28:29Z
date_updated: 2020-07-14T12:47:46Z
file_id: '6973'
file_name: 2019_CompVision_Henderson.pdf
file_size: 2243134
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 128'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 835-854
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: International Journal of Computer Vision
publication_identifier:
eissn:
- 1573-1405
issn:
- 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning single-image 3D reconstruction by generative modelling of shape, pose
and shading
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: 128
year: '2020'
...
---
_id: '7033'
abstract:
- lang: eng
text: Removal of the Bax gene from mice completely protects the somas of retinal
ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes
BAX a promising therapeutic target to prevent neurodegeneration. In this study,
Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX
in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged
by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN,
and quantitative PCR were used to monitor the status of the BAX activation mechanism
in the months following injury. The apoptotic susceptibility of injured cells
was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury.
The competency of quiescent RGCs to reactivate their BAX activation mechanism
was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four
weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer
than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns
of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in
Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of
BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly,
cells deactivated their BAX activation mechanism between 7 and 12 weeks after
crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that
these cells had a nearly normal capacity to activate this protein, but this capacity
was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks
after crush, damaged cells no longer displayed increased susceptibility to BAX
activation relative to their naïve counterparts. In this same timeframe, retinal
glial activation and the signaling of the pro-apoptotic JNK pathway also abated.
Quiescent RGCs did not show a timely reactivation of their JNK pathway following
intravitreal injection with anisomycin. These findings demonstrate that lowering
the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs
enter a quiescent state months after injury and are no longer responsive to an
apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality.
acknowledgement: This work was supported by National Eye Institute grants R01 EY012223
(RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual
Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30
EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison),
an unrestricted funding grant from Research to Prevent Blindness (Department of
Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick
A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN).
article_processing_charge: No
article_type: original
author:
- first_name: RJ
full_name: Donahue, RJ
last_name: Donahue
- first_name: Margaret E
full_name: Maes, Margaret E
id: 3838F452-F248-11E8-B48F-1D18A9856A87
last_name: Maes
orcid: 0000-0001-9642-1085
- first_name: JA
full_name: Grosser, JA
last_name: Grosser
- first_name: RW
full_name: Nickells, RW
last_name: Nickells
citation:
ama: Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells
survive and become quiescent following optic nerve damage. Molecular Neurobiology.
2020;57(2):1070–1084. doi:10.1007/s12035-019-01783-7
apa: Donahue, R., Maes, M. E., Grosser, J., & Nickells, R. (2020). BAX-depleted
retinal ganglion cells survive and become quiescent following optic nerve damage.
Molecular Neurobiology. Springer Nature. https://doi.org/10.1007/s12035-019-01783-7
chicago: Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted
Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.”
Molecular Neurobiology. Springer Nature, 2020. https://doi.org/10.1007/s12035-019-01783-7.
ieee: R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal
ganglion cells survive and become quiescent following optic nerve damage,” Molecular
Neurobiology, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020.
ista: Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion
cells survive and become quiescent following optic nerve damage. Molecular Neurobiology.
57(2), 1070–1084.
mla: Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become
Quiescent Following Optic Nerve Damage.” Molecular Neurobiology, vol. 57,
no. 2, Springer Nature, 2020, pp. 1070–1084, doi:10.1007/s12035-019-01783-7.
short: R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57
(2020) 1070–1084.
date_created: 2019-11-18T14:18:39Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-17T14:05:48Z
day: '01'
department:
- _id: SaSi
doi: 10.1007/s12035-019-01783-7
external_id:
isi:
- '000493754200001'
pmid:
- '31673950'
intvolume: ' 57'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/
month: '02'
oa: 1
oa_version: Submitted Version
page: 1070–1084
pmid: 1
publication: Molecular Neurobiology
publication_identifier:
eissn:
- 1559-1182
issn:
- 0893-7648
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: BAX-depleted retinal ganglion cells survive and become quiescent following
optic nerve damage
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 57
year: '2020'
...
---
_id: '6997'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yuzhou
full_name: Zhang, Yuzhou
id: 3B6137F2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0003-2627-6956
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic
growth. New Phytologist. 2020;225(3):1049-1052. doi:10.1111/nph.16203
apa: Zhang, Y., & Friml, J. (2020). Auxin guides roots to avoid obstacles during
gravitropic growth. New Phytologist. Wiley. https://doi.org/10.1111/nph.16203
chicago: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during
Gravitropic Growth.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16203.
ieee: Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic
growth,” New Phytologist, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.
ista: Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic
growth. New Phytologist. 225(3), 1049–1052.
mla: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during
Gravitropic Growth.” New Phytologist, vol. 225, no. 3, Wiley, 2020, pp.
1049–52, doi:10.1111/nph.16203.
short: Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.
date_created: 2019-11-12T11:41:32Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-17T14:01:49Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/nph.16203
ec_funded: 1
external_id:
isi:
- '000489638800001'
pmid:
- '31603260'
file:
- access_level: open_access
checksum: cd42ffdb381fd52812b9583d4d407139
content_type: application/pdf
creator: dernst
date_created: 2020-11-18T16:42:48Z
date_updated: 2020-11-18T16:42:48Z
file_id: '8772'
file_name: 2020_NewPhytologist_Zhang.pdf
file_size: 717345
relation: main_file
success: 1
file_date_updated: 2020-11-18T16:42:48Z
has_accepted_license: '1'
intvolume: ' 225'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1049-1052
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
issn:
- 0028-646x
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin guides roots to avoid obstacles during gravitropic growth
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: 225
year: '2020'
...
---
_id: '7004'
abstract:
- lang: eng
text: We define an action of the (double of) Cohomological Hall algebra of Kontsevich
and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov.
We identify this action with the one of the affine Yangian of gl(1). Based on
that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák.
We conjecture that our approach works for a big class of Calabi–Yau categories,
including those associated with toric Calabi–Yau 3-folds.
article_processing_charge: No
article_type: original
author:
- first_name: Miroslav
full_name: Rapcak, Miroslav
last_name: Rapcak
- first_name: Yan
full_name: Soibelman, Yan
last_name: Soibelman
- 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: Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex
algebras and instantons. Communications in Mathematical Physics. 2020;376:1803-1873.
doi:10.1007/s00220-019-03575-5
apa: Rapcak, M., Soibelman, Y., Yang, Y., & Zhao, G. (2020). Cohomological Hall
algebras, vertex algebras and instantons. Communications in Mathematical Physics.
Springer Nature. https://doi.org/10.1007/s00220-019-03575-5
chicago: Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological
Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical
Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03575-5.
ieee: M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras,
vertex algebras and instantons,” Communications in Mathematical Physics,
vol. 376. Springer Nature, pp. 1803–1873, 2020.
ista: Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras,
vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.
mla: Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and
Instantons.” Communications in Mathematical Physics, vol. 376, Springer
Nature, 2020, pp. 1803–73, doi:10.1007/s00220-019-03575-5.
short: M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical
Physics 376 (2020) 1803–1873.
date_created: 2019-11-12T14:01:27Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-17T14:02:59Z
day: '01'
department:
- _id: TaHa
doi: 10.1007/s00220-019-03575-5
ec_funded: 1
external_id:
arxiv:
- '1810.10402'
isi:
- '000536255500004'
intvolume: ' 376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10402
month: '06'
oa: 1
oa_version: Preprint
page: 1803-1873
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cohomological Hall algebras, vertex algebras and instantons
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 376
year: '2020'
...
---
_id: '7204'
abstract:
- lang: eng
text: Plant root architecture dynamically adapts to various environmental conditions,
such as salt‐containing soil. The phytohormone abscisic acid (ABA) is involved
among others also in these developmental adaptations, but the underlying molecular
mechanism remains elusive. Here, a novel branch of the ABA signaling pathway in
Arabidopsis involving PYR/PYL/RCAR (abbreviated as PYLs) receptor‐protein phosphatase
2A (PP2A) complex that acts in parallel to the canonical PYLs‐protein phosphatase
2C (PP2C) mechanism is identified. The PYLs‐PP2A signaling modulates root gravitropism
and lateral root formation through regulating phytohormone auxin transport. In
optimal conditions, PYLs ABA receptor interacts with the catalytic subunits of
PP2A, increasing their phosphatase activity and thus counteracting PINOID (PID)
kinase‐mediated phosphorylation of PIN‐FORMED (PIN) auxin transporters. By contrast,
in salt and osmotic stress conditions, ABA binds to PYLs, inhibiting the PP2A
activity, which leads to increased PIN phosphorylation and consequently modulated
directional auxin transport leading to adapted root architecture. This work reveals
an adaptive mechanism that may flexibly adjust plant root growth to withstand
saline and osmotic stresses. It occurs via the cross‐talk between the stress hormone
ABA and the versatile developmental regulator auxin.
article_number: '1901455'
article_processing_charge: No
article_type: original
author:
- first_name: Yang
full_name: Li, Yang
last_name: Li
- first_name: Yaping
full_name: Wang, Yaping
last_name: Wang
- first_name: Shutang
full_name: Tan, Shutang
id: 2DE75584-F248-11E8-B48F-1D18A9856A87
last_name: Tan
orcid: 0000-0002-0471-8285
- first_name: Zhen
full_name: Li, Zhen
last_name: Li
- first_name: Zhi
full_name: Yuan, Zhi
last_name: Yuan
- first_name: Matous
full_name: Glanc, Matous
id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2
last_name: Glanc
orcid: 0000-0003-0619-7783
- first_name: David
full_name: Domjan, David
id: C684CD7A-257E-11EA-9B6F-D8588B4F947F
last_name: Domjan
orcid: 0000-0003-2267-106X
- first_name: Kai
full_name: Wang, Kai
last_name: Wang
- first_name: Wei
full_name: Xuan, Wei
last_name: Xuan
- first_name: Yan
full_name: Guo, Yan
last_name: Guo
- first_name: Zhizhong
full_name: Gong, Zhizhong
last_name: Gong
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Jing
full_name: Zhang, Jing
last_name: Zhang
citation:
ama: Li Y, Wang Y, Tan S, et al. Root growth adaptation is mediated by PYLs ABA
receptor-PP2A protein phosphatase complex. Advanced Science. 2020;7(3).
doi:10.1002/advs.201901455
apa: Li, Y., Wang, Y., Tan, S., Li, Z., Yuan, Z., Glanc, M., … Zhang, J. (2020).
Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase
complex. Advanced Science. Wiley. https://doi.org/10.1002/advs.201901455
chicago: Li, Yang, Yaping Wang, Shutang Tan, Zhen Li, Zhi Yuan, Matous Glanc, David
Domjan, et al. “Root Growth Adaptation Is Mediated by PYLs ABA Receptor-PP2A Protein
Phosphatase Complex.” Advanced Science. Wiley, 2020. https://doi.org/10.1002/advs.201901455.
ieee: Y. Li et al., “Root growth adaptation is mediated by PYLs ABA receptor-PP2A
protein phosphatase complex,” Advanced Science, vol. 7, no. 3. Wiley, 2020.
ista: Li Y, Wang Y, Tan S, Li Z, Yuan Z, Glanc M, Domjan D, Wang K, Xuan W, Guo
Y, Gong Z, Friml J, Zhang J. 2020. Root growth adaptation is mediated by PYLs
ABA receptor-PP2A protein phosphatase complex. Advanced Science. 7(3), 1901455.
mla: Li, Yang, et al. “Root Growth Adaptation Is Mediated by PYLs ABA Receptor-PP2A
Protein Phosphatase Complex.” Advanced Science, vol. 7, no. 3, 1901455,
Wiley, 2020, doi:10.1002/advs.201901455.
short: Y. Li, Y. Wang, S. Tan, Z. Li, Z. Yuan, M. Glanc, D. Domjan, K. Wang, W.
Xuan, Y. Guo, Z. Gong, J. Friml, J. Zhang, Advanced Science 7 (2020).
date_created: 2019-12-22T23:00:43Z
date_published: 2020-02-05T00:00:00Z
date_updated: 2023-08-17T14:13:17Z
day: '05'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1002/advs.201901455
external_id:
isi:
- '000501912800001'
pmid:
- '32042554'
file:
- access_level: open_access
checksum: 016eeab5860860af038e2da95ffe75c3
content_type: application/pdf
creator: dernst
date_created: 2020-02-24T14:29:54Z
date_updated: 2020-07-14T12:47:53Z
file_id: '7519'
file_name: 2020_AdvScience_Li.pdf
file_size: 3586924
relation: main_file
file_date_updated: 2020-07-14T12:47:53Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Advanced Science
publication_identifier:
eissn:
- 2198-3844
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase
complex
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: 7
year: '2020'
...
---
_id: '7166'
abstract:
- lang: eng
text: In the living cell, we encounter a large variety of motile processes such
as organelle transport and cytoskeleton remodeling. These processes are driven
by motor proteins that generate force by transducing chemical free energy into
mechanical work. In many cases, the molecular motors work in teams to collectively
generate larger forces. Recent optical trapping experiments on small teams of
cytoskeletal motors indicated that the collectively generated force increases
with the size of the motor team but that this increase depends on the motor type
and on whether the motors are studied in vitro or in vivo. Here, we use the theory
of stochastic processes to describe the motion of N motors in a stationary optical
trap and to compute the N-dependence of the collectively generated forces. We
consider six distinct motor types, two kinesins, two dyneins, and two myosins.
We show that the force increases always linearly with N but with a prefactor that
depends on the performance of the single motor. Surprisingly, this prefactor increases
for weaker motors with a lower stall force. This counter-intuitive behavior reflects
the increased probability with which stronger motors detach from the filament
during strain generation. Our theoretical results are in quantitative agreement
with experimental data on small teams of kinesin-1 motors.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Mehmet C
full_name: Ucar, Mehmet C
id: 50B2A802-6007-11E9-A42B-EB23E6697425
last_name: Ucar
orcid: 0000-0003-0506-4217
- first_name: Reinhard
full_name: Lipowsky, Reinhard
last_name: Lipowsky
citation:
ama: Ucar MC, Lipowsky R. Collective force generation by molecular motors is determined
by strain-induced unbinding. Nano Letters. 2020;20(1):669-676. doi:10.1021/acs.nanolett.9b04445
apa: Ucar, M. C., & Lipowsky, R. (2020). Collective force generation by molecular
motors is determined by strain-induced unbinding. Nano Letters. American
Chemical Society. https://doi.org/10.1021/acs.nanolett.9b04445
chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “Collective Force Generation by
Molecular Motors Is Determined by Strain-Induced Unbinding.” Nano Letters.
American Chemical Society, 2020. https://doi.org/10.1021/acs.nanolett.9b04445.
ieee: M. C. Ucar and R. Lipowsky, “Collective force generation by molecular motors
is determined by strain-induced unbinding,” Nano Letters, vol. 20, no.
1. American Chemical Society, pp. 669–676, 2020.
ista: Ucar MC, Lipowsky R. 2020. Collective force generation by molecular motors
is determined by strain-induced unbinding. Nano Letters. 20(1), 669–676.
mla: Ucar, Mehmet C., and Reinhard Lipowsky. “Collective Force Generation by Molecular
Motors Is Determined by Strain-Induced Unbinding.” Nano Letters, vol. 20,
no. 1, American Chemical Society, 2020, pp. 669–76, doi:10.1021/acs.nanolett.9b04445.
short: M.C. Ucar, R. Lipowsky, Nano Letters 20 (2020) 669–676.
date_created: 2019-12-10T15:36:05Z
date_published: 2020-01-08T00:00:00Z
date_updated: 2023-08-17T14:07:52Z
day: '08'
department:
- _id: EdHa
doi: 10.1021/acs.nanolett.9b04445
external_id:
isi:
- '000507151600087'
pmid:
- '31797672'
intvolume: ' 20'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.nanolett.9b04445
month: '01'
oa: 1
oa_version: Published Version
page: 669-676
pmid: 1
publication: Nano Letters
publication_identifier:
eissn:
- 1530-6992
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
related_material:
record:
- id: '9726'
relation: research_data
status: public
- id: '9885'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Collective force generation by molecular motors is determined by strain-induced
unbinding
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2020'
...
---
_id: '7234'
abstract:
- lang: eng
text: T lymphocytes utilize amoeboid migration to navigate effectively within complex
microenvironments. The precise rearrangement of the actin cytoskeleton required
for cellular forward propulsion is mediated by actin regulators, including the
actin‐related protein 2/3 (Arp2/3) complex, a macromolecular machine that nucleates
branched actin filaments at the leading edge. The consequences of modulating Arp2/3
activity on the biophysical properties of the actomyosin cortex and downstream
T cell function are incompletely understood. We report that even a moderate decrease
of Arp3 levels in T cells profoundly affects actin cortex integrity. Reduction
in total F‐actin content leads to reduced cortical tension and disrupted lamellipodia
formation. Instead, in Arp3‐knockdown cells, the motility mode is dominated by
blebbing migration characterized by transient, balloon‐like protrusions at the
leading edge. Although this migration mode seems to be compatible with interstitial
migration in three‐dimensional environments, diminished locomotion kinetics and
impaired cytotoxicity interfere with optimal T cell function. These findings define
the importance of finely tuned, Arp2/3‐dependent mechanophysical membrane integrity
in cytotoxic effector T lymphocyte activities.
article_processing_charge: No
article_type: original
author:
- first_name: Peyman
full_name: Obeidy, Peyman
last_name: Obeidy
- first_name: Lining A.
full_name: Ju, Lining A.
last_name: Ju
- first_name: Stefan H.
full_name: Oehlers, Stefan H.
last_name: Oehlers
- first_name: Nursafwana S.
full_name: Zulkhernain, Nursafwana S.
last_name: Zulkhernain
- first_name: Quintin
full_name: Lee, Quintin
last_name: Lee
- first_name: Jorge L.
full_name: Galeano Niño, Jorge L.
last_name: Galeano Niño
- first_name: Rain Y.Q.
full_name: Kwan, Rain Y.Q.
last_name: Kwan
- first_name: Shweta
full_name: Tikoo, Shweta
last_name: Tikoo
- first_name: Lois L.
full_name: Cavanagh, Lois L.
last_name: Cavanagh
- first_name: Paulus
full_name: Mrass, Paulus
last_name: Mrass
- first_name: Adam J.L.
full_name: Cook, Adam J.L.
last_name: Cook
- first_name: Shaun P.
full_name: Jackson, Shaun P.
last_name: Jackson
- first_name: Maté
full_name: Biro, Maté
last_name: Biro
- first_name: Ben
full_name: Roediger, Ben
last_name: Roediger
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Wolfgang
full_name: Weninger, Wolfgang
last_name: Weninger
citation:
ama: Obeidy P, Ju LA, Oehlers SH, et al. Partial loss of actin nucleator actin-related
protein 2/3 activity triggers blebbing in primary T lymphocytes. Immunology
and Cell Biology. 2020;98(2):93-113. doi:10.1111/imcb.12304
apa: Obeidy, P., Ju, L. A., Oehlers, S. H., Zulkhernain, N. S., Lee, Q., Galeano
Niño, J. L., … Weninger, W. (2020). Partial loss of actin nucleator actin-related
protein 2/3 activity triggers blebbing in primary T lymphocytes. Immunology
and Cell Biology. Wiley. https://doi.org/10.1111/imcb.12304
chicago: Obeidy, Peyman, Lining A. Ju, Stefan H. Oehlers, Nursafwana S. Zulkhernain,
Quintin Lee, Jorge L. Galeano Niño, Rain Y.Q. Kwan, et al. “Partial Loss of Actin
Nucleator Actin-Related Protein 2/3 Activity Triggers Blebbing in Primary T Lymphocytes.”
Immunology and Cell Biology. Wiley, 2020. https://doi.org/10.1111/imcb.12304.
ieee: P. Obeidy et al., “Partial loss of actin nucleator actin-related protein
2/3 activity triggers blebbing in primary T lymphocytes,” Immunology and Cell
Biology, vol. 98, no. 2. Wiley, pp. 93–113, 2020.
ista: Obeidy P, Ju LA, Oehlers SH, Zulkhernain NS, Lee Q, Galeano Niño JL, Kwan
RYQ, Tikoo S, Cavanagh LL, Mrass P, Cook AJL, Jackson SP, Biro M, Roediger B,
Sixt MK, Weninger W. 2020. Partial loss of actin nucleator actin-related protein
2/3 activity triggers blebbing in primary T lymphocytes. Immunology and Cell Biology.
98(2), 93–113.
mla: Obeidy, Peyman, et al. “Partial Loss of Actin Nucleator Actin-Related Protein
2/3 Activity Triggers Blebbing in Primary T Lymphocytes.” Immunology and Cell
Biology, vol. 98, no. 2, Wiley, 2020, pp. 93–113, doi:10.1111/imcb.12304.
short: P. Obeidy, L.A. Ju, S.H. Oehlers, N.S. Zulkhernain, Q. Lee, J.L. Galeano
Niño, R.Y.Q. Kwan, S. Tikoo, L.L. Cavanagh, P. Mrass, A.J.L. Cook, S.P. Jackson,
M. Biro, B. Roediger, M.K. Sixt, W. Weninger, Immunology and Cell Biology 98 (2020)
93–113.
date_created: 2020-01-05T23:00:48Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-17T14:21:12Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1111/imcb.12304
external_id:
isi:
- '000503885600001'
pmid:
- '31698518'
file:
- access_level: open_access
checksum: c389477b4b52172ef76afff8a06c6775
content_type: application/pdf
creator: dernst
date_created: 2020-11-19T11:22:33Z
date_updated: 2020-11-19T11:22:33Z
file_id: '8775'
file_name: 2020_ImmunologyCellBio_Obeidy.pdf
file_size: 8569945
relation: main_file
success: 1
file_date_updated: 2020-11-19T11:22:33Z
has_accepted_license: '1'
intvolume: ' 98'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 93-113
pmid: 1
publication: Immunology and Cell Biology
publication_identifier:
eissn:
- '14401711'
issn:
- '08189641'
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial loss of actin nucleator actin-related protein 2/3 activity triggers
blebbing in primary T lymphocytes
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: 98
year: '2020'
...
---
_id: '7253'
abstract:
- lang: eng
text: The cyclin-dependent kinase inhibitor p57KIP2 is encoded by the imprinted
Cdkn1c locus, exhibits maternal expression, and is essential for cerebral cortex
development. How Cdkn1c regulates corticogenesis is however not clear. To this
end we employ Mosaic Analysis with Double Markers (MADM) technology to genetically
dissect Cdkn1c gene function in corticogenesis at single cell resolution. We find
that the previously described growth-inhibitory Cdkn1c function is a non-cell-autonomous
one, acting on the whole organism. In contrast we reveal a growth-promoting cell-autonomous
Cdkn1c function which at the mechanistic level mediates radial glial progenitor
cell and nascent projection neuron survival. Strikingly, the growth-promoting
function of Cdkn1c is highly dosage sensitive but not subject to genomic imprinting.
Collectively, our results suggest that the Cdkn1c locus regulates cortical development
through distinct cell-autonomous and non-cell-autonomous mechanisms. More generally,
our study highlights the importance to probe the relative contributions of cell
intrinsic gene function and tissue-wide mechanisms to the overall phenotype.
acknowledged_ssus:
- _id: PreCl
article_number: '195'
article_processing_charge: No
article_type: original
author:
- first_name: Susanne
full_name: Laukoter, Susanne
id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87
last_name: Laukoter
orcid: 0000-0002-7903-3010
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
orcid: 0000-0002-7462-0048
- first_name: Nicole
full_name: Amberg, Nicole
id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
last_name: Amberg
orcid: 0000-0002-3183-8207
- first_name: Keiichi I.
full_name: Nakayama, Keiichi I.
last_name: Nakayama
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Laukoter S, Beattie RJ, Pauler F, Amberg N, Nakayama KI, Hippenmeyer S. Imprinted
Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex
development. Nature Communications. 2020;11. doi:10.1038/s41467-019-14077-2
apa: Laukoter, S., Beattie, R. J., Pauler, F., Amberg, N., Nakayama, K. I., &
Hippenmeyer, S. (2020). Imprinted Cdkn1c genomic locus cell-autonomously promotes
cell survival in cerebral cortex development. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-019-14077-2
chicago: Laukoter, Susanne, Robert J Beattie, Florian Pauler, Nicole Amberg, Keiichi
I. Nakayama, and Simon Hippenmeyer. “Imprinted Cdkn1c Genomic Locus Cell-Autonomously
Promotes Cell Survival in Cerebral Cortex Development.” Nature Communications.
Springer Nature, 2020. https://doi.org/10.1038/s41467-019-14077-2.
ieee: S. Laukoter, R. J. Beattie, F. Pauler, N. Amberg, K. I. Nakayama, and S. Hippenmeyer,
“Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral
cortex development,” Nature Communications, vol. 11. Springer Nature, 2020.
ista: Laukoter S, Beattie RJ, Pauler F, Amberg N, Nakayama KI, Hippenmeyer S. 2020.
Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral
cortex development. Nature Communications. 11, 195.
mla: Laukoter, Susanne, et al. “Imprinted Cdkn1c Genomic Locus Cell-Autonomously
Promotes Cell Survival in Cerebral Cortex Development.” Nature Communications,
vol. 11, 195, Springer Nature, 2020, doi:10.1038/s41467-019-14077-2.
short: S. Laukoter, R.J. Beattie, F. Pauler, N. Amberg, K.I. Nakayama, S. Hippenmeyer,
Nature Communications 11 (2020).
date_created: 2020-01-11T10:42:48Z
date_published: 2020-01-10T00:00:00Z
date_updated: 2023-08-17T14:23:41Z
day: '10'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1038/s41467-019-14077-2
ec_funded: 1
external_id:
isi:
- '000551459000005'
file:
- access_level: open_access
checksum: ebf1ed522f4e0be8d94c939c1806a709
content_type: application/pdf
creator: dernst
date_created: 2020-01-13T07:42:31Z
date_updated: 2020-07-14T12:47:54Z
file_id: '7261'
file_name: 2020_NatureComm_Laukoter.pdf
file_size: 8063333
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 268F8446-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T0101031
name: Role of Eed in neural stem cell lineage progression
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex
- _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: 25D92700-B435-11E9-9278-68D0E5697425
grant_number: LS13-002
name: Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-function-for-potential-tumour-suppressor-in-brain-development/
scopus_import: '1'
status: public
title: Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in
cerebral cortex development
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: 11
year: '2020'
...
---
_id: '7339'
abstract:
- lang: eng
text: Cytoskeletal filaments such as microtubules (MTs) and filamentous actin (F-actin)
dynamically support cell structure and functions. In central presynaptic terminals,
F-actin is expressed along the release edge and reportedly plays diverse functional
roles, but whether axonal MTs extend deep into terminals and play any physiological
role remains controversial. At the calyx of Held in rats of either sex, confocal
and high-resolution microscopy revealed that MTs enter deep into presynaptic terminal
swellings and partially colocalize with a subset of synaptic vesicles (SVs). Electrophysiological
analysis demonstrated that depolymerization of MTs specifically prolonged the
slow-recovery time component of EPSCs from short-term depression induced by a
train of high-frequency stimulation, whereas depolymerization of F-actin specifically
prolonged the fast-recovery component. In simultaneous presynaptic and postsynaptic
action potential recordings, depolymerization of MTs or F-actin significantly
impaired the fidelity of high-frequency neurotransmission. We conclude that MTs
and F-actin differentially contribute to slow and fast SV replenishment, thereby
maintaining high-frequency neurotransmission.
article_processing_charge: No
article_type: original
author:
- first_name: Lashmi
full_name: Piriya Ananda Babu, Lashmi
last_name: Piriya Ananda Babu
- first_name: Han Ying
full_name: Wang, Han Ying
last_name: Wang
- first_name: Kohgaku
full_name: Eguchi, Kohgaku
id: 2B7846DC-F248-11E8-B48F-1D18A9856A87
last_name: Eguchi
orcid: 0000-0002-6170-2546
- first_name: Laurent
full_name: Guillaud, Laurent
last_name: Guillaud
- first_name: Tomoyuki
full_name: Takahashi, Tomoyuki
last_name: Takahashi
citation:
ama: Piriya Ananda Babu L, Wang HY, Eguchi K, Guillaud L, Takahashi T. Microtubule
and actin differentially regulate synaptic vesicle cycling to maintain high-frequency
neurotransmission. Journal of neuroscience. 2020;40(1):131-142. doi:10.1523/JNEUROSCI.1571-19.2019
apa: Piriya Ananda Babu, L., Wang, H. Y., Eguchi, K., Guillaud, L., & Takahashi,
T. (2020). Microtubule and actin differentially regulate synaptic vesicle cycling
to maintain high-frequency neurotransmission. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1571-19.2019
chicago: Piriya Ananda Babu, Lashmi, Han Ying Wang, Kohgaku Eguchi, Laurent Guillaud,
and Tomoyuki Takahashi. “Microtubule and Actin Differentially Regulate Synaptic
Vesicle Cycling to Maintain High-Frequency Neurotransmission.” Journal of Neuroscience.
Society for Neuroscience, 2020. https://doi.org/10.1523/JNEUROSCI.1571-19.2019.
ieee: L. Piriya Ananda Babu, H. Y. Wang, K. Eguchi, L. Guillaud, and T. Takahashi,
“Microtubule and actin differentially regulate synaptic vesicle cycling to maintain
high-frequency neurotransmission,” Journal of neuroscience, vol. 40, no.
1. Society for Neuroscience, pp. 131–142, 2020.
ista: Piriya Ananda Babu L, Wang HY, Eguchi K, Guillaud L, Takahashi T. 2020. Microtubule
and actin differentially regulate synaptic vesicle cycling to maintain high-frequency
neurotransmission. Journal of neuroscience. 40(1), 131–142.
mla: Piriya Ananda Babu, Lashmi, et al. “Microtubule and Actin Differentially Regulate
Synaptic Vesicle Cycling to Maintain High-Frequency Neurotransmission.” Journal
of Neuroscience, vol. 40, no. 1, Society for Neuroscience, 2020, pp. 131–42,
doi:10.1523/JNEUROSCI.1571-19.2019.
short: L. Piriya Ananda Babu, H.Y. Wang, K. Eguchi, L. Guillaud, T. Takahashi, Journal
of Neuroscience 40 (2020) 131–142.
date_created: 2020-01-19T23:00:38Z
date_published: 2020-01-02T00:00:00Z
date_updated: 2023-08-17T14:25:23Z
day: '02'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1523/JNEUROSCI.1571-19.2019
external_id:
isi:
- '000505167600013'
pmid:
- '31767677'
file:
- access_level: open_access
checksum: 92f5e8a47f454fc131fb94cd7f106e60
content_type: application/pdf
creator: dernst
date_created: 2020-01-20T14:44:10Z
date_updated: 2020-07-14T12:47:56Z
file_id: '7345'
file_name: 2020_JourNeuroscience_Piriya.pdf
file_size: 4460781
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 131-142
pmid: 1
publication: Journal of neuroscience
publication_identifier:
eissn:
- '15292401'
publication_status: published
publisher: Society for Neuroscience
quality_controlled: '1'
scopus_import: '1'
status: public
title: Microtubule and actin differentially regulate synaptic vesicle cycling to maintain
high-frequency neurotransmission
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: 40
year: '2020'
...
---
_id: '7350'
abstract:
- lang: eng
text: The ability to sense environmental temperature and to coordinate growth and
development accordingly, is critical to the reproductive success of plants. Flowering
time is regulated at the level of gene expression by a complex network of factors
that integrate environmental and developmental cues. One of the main players,
involved in modulating flowering time in response to changes in ambient temperature
is FLOWERING LOCUS M (FLM). FLM transcripts can undergo extensive alternative
splicing producing multiple variants, of which FLM-β and FLM-δ are the most representative.
While FLM-β codes for the flowering repressor FLM protein, translation of FLM-δ
has the opposite effect on flowering. Here we show that the cyclin-dependent kinase
G2 (CDKG2), together with its cognate cyclin, CYCLYN L1 (CYCL1) affects the alternative
splicing of FLM, balancing the levels of FLM-β and FLM-δ across the ambient temperature
range. In the absence of the CDKG2/CYCL1 complex, FLM-β expression is reduced
while FLM-δ is increased in a temperature dependent manner and these changes are
associated with an early flowering phenotype in the cdkg2 mutant lines. In addition,
we found that transcript variants retaining the full FLM intron 1 are sequestered
in the cell nucleus. Strikingly, FLM intron 1 splicing is also regulated by CDKG2/CYCL1.
Our results provide evidence that temperature and CDKs regulate the alternative
splicing of FLM, contributing to flowering time definition.
article_number: '1680'
article_processing_charge: No
article_type: original
author:
- first_name: Candida
full_name: Nibau, Candida
last_name: Nibau
- first_name: Marçal
full_name: Gallemi, Marçal
id: 460C6802-F248-11E8-B48F-1D18A9856A87
last_name: Gallemi
orcid: 0000-0003-4675-6893
- first_name: Despoina
full_name: Dadarou, Despoina
last_name: Dadarou
- first_name: John H.
full_name: Doonan, John H.
last_name: Doonan
- first_name: Nicola
full_name: Cavallari, Nicola
id: 457160E6-F248-11E8-B48F-1D18A9856A87
last_name: Cavallari
citation:
ama: Nibau C, Gallemi M, Dadarou D, Doonan JH, Cavallari N. Thermo-sensitive alternative
splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2. Frontiers
in Plant Science. 2020;10. doi:10.3389/fpls.2019.01680
apa: Nibau, C., Gallemi, M., Dadarou, D., Doonan, J. H., & Cavallari, N. (2020).
Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent
kinase G2. Frontiers in Plant Science. Frontiers Media. https://doi.org/10.3389/fpls.2019.01680
chicago: Nibau, Candida, Marçal Gallemi, Despoina Dadarou, John H. Doonan, and Nicola
Cavallari. “Thermo-Sensitive Alternative Splicing of FLOWERING LOCUS M Is Modulated
by Cyclin-Dependent Kinase G2.” Frontiers in Plant Science. Frontiers Media,
2020. https://doi.org/10.3389/fpls.2019.01680.
ieee: C. Nibau, M. Gallemi, D. Dadarou, J. H. Doonan, and N. Cavallari, “Thermo-sensitive
alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase
G2,” Frontiers in Plant Science, vol. 10. Frontiers Media, 2020.
ista: Nibau C, Gallemi M, Dadarou D, Doonan JH, Cavallari N. 2020. Thermo-sensitive
alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase
G2. Frontiers in Plant Science. 10, 1680.
mla: Nibau, Candida, et al. “Thermo-Sensitive Alternative Splicing of FLOWERING
LOCUS M Is Modulated by Cyclin-Dependent Kinase G2.” Frontiers in Plant Science,
vol. 10, 1680, Frontiers Media, 2020, doi:10.3389/fpls.2019.01680.
short: C. Nibau, M. Gallemi, D. Dadarou, J.H. Doonan, N. Cavallari, Frontiers in
Plant Science 10 (2020).
date_created: 2020-01-22T15:23:57Z
date_published: 2020-01-22T00:00:00Z
date_updated: 2023-08-17T14:21:45Z
day: '22'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.3389/fpls.2019.01680
external_id:
isi:
- '000511376000001'
file:
- access_level: open_access
checksum: d1f92e60a713fbd15097ce895e5c7ccb
content_type: application/pdf
creator: dernst
date_created: 2020-01-27T09:07:02Z
date_updated: 2020-07-14T12:47:56Z
file_id: '7366'
file_name: 2020_FrontiersPlantScience_Nibau.pdf
file_size: 1951438
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Frontiers in Plant Science
publication_identifier:
issn:
- 1664-462X
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by
cyclin-dependent kinase G2
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: 10
year: '2020'
...