---
_id: '6759'
abstract:
- lang: eng
text: "We consider the graph class Grounded-L corresponding to graphs that admit
an intersection representation by L-shaped curves, where additionally the topmost
points of each curve are assumed to belong to a common horizontal line. We prove
that Grounded-L graphs admit an equivalent characterisation in terms of vertex
ordering with forbidden patterns. \r\nWe also compare this class to related intersection
classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max
point-tolerance graphs), or the outer-1-string graphs. We give constructions showing
that these classes are all distinct and satisfy only trivial or previously known
inclusions."
article_number: P3.17
article_processing_charge: No
article_type: original
author:
- first_name: Vít
full_name: Jelínek, Vít
last_name: Jelínek
- first_name: Martin
full_name: Töpfer, Martin
id: 4B865388-F248-11E8-B48F-1D18A9856A87
last_name: Töpfer
citation:
ama: Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic
Journal of Combinatorics. 2019;26(3). doi:10.37236/8096
apa: Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives.
Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.
https://doi.org/10.37236/8096
chicago: Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”
Electronic Journal of Combinatorics. Electronic Journal of Combinatorics,
2019. https://doi.org/10.37236/8096.
ieee: V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic
Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics,
2019.
ista: Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic
Journal of Combinatorics. 26(3), P3.17.
mla: Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.”
Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic
Journal of Combinatorics, 2019, doi:10.37236/8096.
short: V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).
date_created: 2019-08-04T21:59:20Z
date_published: 2019-07-19T00:00:00Z
date_updated: 2022-03-18T12:32:02Z
day: '19'
ddc:
- '510'
department:
- _id: DaAl
doi: 10.37236/8096
ec_funded: 1
external_id:
arxiv:
- '1808.04148'
file:
- access_level: open_access
checksum: 20fc366fc6683ef0b074a019b73a663a
content_type: application/pdf
creator: dernst
date_created: 2019-08-05T06:46:55Z
date_updated: 2020-07-14T12:47:39Z
file_id: '6764'
file_name: 2019_eJourCombinatorics_Jelinek.pdf
file_size: 533697
relation: main_file
file_date_updated: 2020-07-14T12:47:39Z
has_accepted_license: '1'
intvolume: ' 26'
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Electronic Journal of Combinatorics
publication_identifier:
eissn:
- '10778926'
publication_status: published
publisher: Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: On grounded L-graphs and their relatives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2019'
...
---
_id: '6822'
abstract:
- lang: eng
text: "In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the qualitative winner or quantitative
payoff of the game. In bidding games, in each turn, we hold an auction between
the two players to determine which player moves the token. Bidding games have
largely been studied with concrete bidding mechanisms that are variants of a first-price
auction: in each turn both players simultaneously submit bids, the higher\r\nbidder
moves the token, and pays his bid to the lower bidder in Richman bidding, to the
bank in poorman bidding, and in taxman bidding, the bid is split between the other
player and the bank according to a predefined constant factor. Bidding games are
deterministic games. They have an intriguing connection with a fragment of stochastic
games called \r\n randomturn games. We study, for the first time, a combination
of bidding games with probabilistic behavior; namely, we study bidding games that
are played on Markov decision processes, where the players bid for the right to
choose the next action, which determines the probability distribution according
to which the next vertex is chosen. We study parity and meanpayoff bidding games
on MDPs and extend results from the deterministic bidding setting to the probabilistic
one."
alternative_title:
- LNCS
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Petr
full_name: Novotny, Petr
last_name: Novotny
citation:
ama: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision
processes. In: Proceedings of the 13th International Conference of Reachability
Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1'
apa: 'Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding
games on Markov decision processes. In Proceedings of the 13th International
Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium:
Springer. https://doi.org/10.1007/978-3-030-30806-3_1'
chicago: Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding
Games on Markov Decision Processes.” In Proceedings of the 13th International
Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.
ieee: G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games
on Markov decision processes,” in Proceedings of the 13th International Conference
of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
ista: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov
decision processes. Proceedings of the 13th International Conference of Reachability
Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.'
mla: Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings
of the 13th International Conference of Reachability Problems, vol. 11674,
Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.
short: G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of
the 13th International Conference of Reachability Problems, Springer, 2019, pp.
1–12.
conference:
end_date: 2019-09-13
location: Brussels, Belgium
name: 'RP: Reachability Problems'
start_date: 2019-09-11
date_created: 2019-08-19T07:58:10Z
date_published: 2019-09-06T00:00:00Z
date_updated: 2021-01-12T08:09:12Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-30806-3_1
file:
- access_level: open_access
checksum: 45ebbc709af2b247d28c7c293c01504b
content_type: application/pdf
creator: gavni
date_created: 2019-08-19T07:56:40Z
date_updated: 2020-07-14T12:47:41Z
file_id: '6823'
file_name: prob.pdf
file_size: 436635
relation: main_file
file_date_updated: 2020-07-14T12:47:41Z
has_accepted_license: '1'
intvolume: ' 11674'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 1-12
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _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: ' Proceedings of the 13th International Conference of Reachability Problems'
publication_identifier:
isbn:
- 978-303030805-6
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: 1
status: public
title: Bidding games on Markov decision processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11674
year: '2019'
...
---
_id: '6887'
abstract:
- lang: eng
text: 'The fundamental model-checking problem, given as input a model and a specification,
asks for the algorithmic verification of whether the model satisfies the specification.
Two classical models for reactive systems are graphs and Markov decision processes
(MDPs). A basic specification formalism in the verification of reactive systems
is the strong fairness (aka Streett) objective, where given different types of
requests and corresponding grants, the requirement is that for each type, if the
request event happens infinitely often, then the corresponding grant event must
also happen infinitely often. All omega-regular objectives can be expressed as
Streett objectives and hence they are canonical in verification. Consider graphs/MDPs
with n vertices, m edges, and a Streett objectives with k pairs, and let b denote
the size of the description of the Streett objective for the sets of requests
and grants. The current best-known algorithm for the problem requires time O(min(n^2,
m sqrt{m log n}) + b log n). In this work we present randomized near-linear time
algorithms, with expected running time O~(m + b), where the O~ notation hides
poly-log factors. Our randomized algorithms are near-linear in the size of the
input, and hence optimal up to poly-log factors. '
alternative_title:
- LIPIcs
article_number: '7'
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: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms
for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings
in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.7'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear
time algorithms for Streett objectives in graphs and MDPs. In Leibniz International
Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander
Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”
In Leibniz International Proceedings in Informatics, Vol. 140. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.
ieee: K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time
algorithms for Streett objectives in graphs and MDPs,” in Leibniz International
Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms
for Streett objectives in graphs and MDPs. Leibniz International Proceedings in
Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol.
140, 7.'
mla: Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives
in Graphs and MDPs.” Leibniz International Proceedings in Informatics,
vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International
Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:07:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2022-08-12T10:54:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.7
ec_funded: 1
file:
- access_level: open_access
checksum: e1f0e4061212454574f34a1368d018ec
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T08:20:30Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6922'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 730112
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Near-linear time algorithms for Streett objectives in graphs and MDPs
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: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 140
year: '2019'
...
---
_id: '6888'
abstract:
- lang: eng
text: In this paper, we design novel liquid time-constant recurrent neural networks
for robotic control, inspired by the brain of the nematode, C. elegans. In the
worm's nervous system, neurons communicate through nonlinear time-varying synaptic
links established amongst them by their particular wiring structure. This property
enables neurons to express liquid time-constants dynamics and therefore allows
the network to originate complex behaviors with a small number of neurons. We
identify neuron-pair communication motifs as design operators and use them to
configure compact neuronal network structures to govern sequential robotic tasks.
The networks are systematically designed to map the environmental observations
to motor actions, by their hierarchical topology from sensory neurons, through
recurrently-wired interneurons, to motor neurons. The networks are then parametrized
in a supervised-learning scheme by a search-based algorithm. We demonstrate that
obtained networks realize interpretable dynamics. We evaluate their performance
in controlling mobile and arm robots, and compare their attributes to other artificial
neural network-based control agents. Finally, we experimentally show their superior
resilience to environmental noise, compared to the existing machine learning-based
methods.
alternative_title:
- ICRA
article_number: '8793840'
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Manuel
full_name: Zimmer, Manuel
last_name: Zimmer
- 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: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired
neural networks for interpretable robotic control. In: Proceedings - IEEE International
Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840'
apa: 'Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019).
Designing worm-inspired neural networks for interpretable robotic control. In
Proceedings - IEEE International Conference on Robotics and Automation
(Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840'
chicago: Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and
Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic
Control.” In Proceedings - IEEE International Conference on Robotics and Automation,
Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840.
ieee: M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing
worm-inspired neural networks for interpretable robotic control,” in Proceedings
- IEEE International Conference on Robotics and Automation, Montreal, QC,
Canada, 2019, vol. 2019–May.
ista: 'Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired
neural networks for interpretable robotic control. Proceedings - IEEE International
Conference on Robotics and Automation. ICRA: International Conference on Robotics
and Automation, ICRA, vol. 2019–May, 8793840.'
mla: Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable
Robotic Control.” Proceedings - IEEE International Conference on Robotics and
Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.
short: M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings
- IEEE International Conference on Robotics and Automation, IEEE, 2019.
conference:
end_date: 2019-05-24
location: Montreal, QC, Canada
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2019-05-20
date_created: 2019-09-18T08:09:51Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2021-01-12T08:09:28Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/icra.2019.8793840
file:
- access_level: open_access
checksum: f5545a6b60c3ffd01feb3613f81d03b6
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T17:30:38Z
date_updated: 2020-10-08T17:30:38Z
file_id: '8636'
file_name: 2019_ICRA_Lechner.pdf
file_size: 3265107
relation: main_file
success: 1
file_date_updated: 2020-10-08T17:30:38Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings - IEEE International Conference on Robotics and Automation
publication_identifier:
isbn:
- '9781538660270'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Designing worm-inspired neural networks for interpretable robotic control
type: conference
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 2019-May
year: '2019'
...
---
_id: '6886'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a non-terminating
system and its environment. In bidding games the players bid for the right to
move the token: in each round, the players simultaneously submit bids, and the
higher bidder moves the token and pays the other player. Bidding games are known
to have a clean and elegant mathematical structure that relies on the ability
of the players to submit arbitrarily small bids. Many applications, however, require
a fixed granularity for the bids, which can represent, for example, the monetary
value expressed in cents. We study, for the first time, the combination of discrete-bidding
and infinite-duration games. Our most important result proves that these games
form a large determined subclass of concurrent games, where determinacy is the
strong property that there always exists exactly one player who can guarantee
winning the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets. '
alternative_title:
- LIPIcs
article_number: '20'
article_processing_charge: No
author:
- first_name: Milad
full_name: Aghajohari, Milad
last_name: Aghajohari
- 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: 'Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration
games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20'
apa: 'Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding
infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference
on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20'
chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding
Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20.
ieee: 'M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding
infinite-duration games,” presented at the CONCUR: International Conference on
Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding
infinite-duration games. CONCUR: International Conference on Concurrency Theory,
LIPIcs, vol. 140, 20.'
mla: Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration
Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019,
doi:10.4230/LIPICS.CONCUR.2019.20.
short: M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:06:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2022-01-26T08:27:10Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.CONCUR.2019.20
external_id:
arxiv:
- '1905.03588'
file:
- access_level: open_access
checksum: 4df6d3575c506edb17215adada03cc8e
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T12:21:38Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6915'
file_name: 2019_LIPIcs_Aghajohari.pdf
file_size: 741425
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determinacy in discrete-bidding infinite-duration games
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 140
year: '2019'
...
---
_id: '6885'
abstract:
- lang: eng
text: 'A vector addition system with states (VASS) consists of a finite set of states
and counters. A configuration is a state and a value for each counter; a transition
changes the state and each counter is incremented, decremented, or left unchanged.
While qualitative properties such as state and configuration reachability have
been studied for VASS, we consider the long-run average cost of infinite computations
of VASS. The cost of a configuration is for each state, a linear combination of
the counter values. In the special case of uniform cost functions, the linear
combination is the same for all states. The (regular) long-run emptiness problem
is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped)
computation such that the long-run average value of the cost function does not
exceed the threshold. For uniform cost functions, we show that the regular long-run
emptiness problem is (a) decidable in polynomial time for integer-valued VASS,
and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative
counters). For general cost functions, we show that the problem is (c) NP-complete
for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most
interesting result is for (c) integer-valued VASS with general cost functions,
where we establish a connection between the regular long-run emptiness problem
and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness
problem is equally hard as the regular problem in all cases except (c), where
it remains open. '
alternative_title:
- LIPIcs
article_number: '27'
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
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition
systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.27'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average
behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR:
International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average
Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.
ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of
vector addition systems with states,” presented at the CONCUR: International Conference
on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector
addition systems with states. CONCUR: International Conference on Concurrency
Theory, LIPIcs, vol. 140, 27.'
mla: Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition
Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:06:14Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2021-01-12T08:09:27Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.27
file:
- access_level: open_access
checksum: 4985e26e1572d1575d64d38acabd71d6
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T12:09:35Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6914'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 538120
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Long-run average behavior of vector addition systems with states
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2019'
...
---
_id: '6889'
abstract:
- lang: eng
text: 'We study Markov decision processes and turn-based stochastic games with parity
conditions. There are three qualitative winning criteria, namely, sure winning,
which requires all paths to satisfy the condition, almost-sure winning, which
requires the condition to be satisfied with probability 1, and limit-sure winning,
which requires the condition to be satisfied with probability arbitrarily close
to 1. We study the combination of two of these criteria for parity conditions,
e.g., there are two parity conditions one of which must be won surely, and the
other almost-surely. The problem has been studied recently by Berthon et al. for
MDPs with combination of sure and almost-sure winning, under infinite-memory strategies,
and the problem has been established to be in NP cap co-NP. Even in MDPs there
is a difference between finite-memory and infinite-memory strategies. Our main
results for combination of sure and almost-sure winning are as follows: (a) we
show that for MDPs with finite-memory strategies the problem is in NP cap co-NP;
(b) we show that for turn-based stochastic games the problem is co-NP-complete,
both for finite-memory and infinite-memory strategies; and (c) we present algorithmic
results for the finite-memory case, both for MDPs and turn-based stochastic games,
by reduction to non-stochastic parity games. In addition we show that all the
above complexity results also carry over to combination of sure and limit-sure
winning, and results for all other combinations can be derived from existing results
in the literature. Thus we present a complete picture for the study of combinations
of two qualitative winning criteria for parity conditions in MDPs and turn-based
stochastic games. '
alternative_title:
- LIPIcs
article_number: '6'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic
Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.6'
apa: 'Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning
for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International
Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6'
chicago: Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative
Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.
ieee: 'K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic
Parity Games,” presented at the CONCUR: International Conference on Concurrency
Theory, Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic
Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs,
vol. 140, 6.'
mla: Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning
for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.
short: K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:11:43Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2021-01-12T08:09:28Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.6
file:
- access_level: open_access
checksum: 7b2ecfd4d9d02360308c0ca986fc10a7
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T08:49:45Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6923'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 509163
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Combinations of Qualitative Winning for Stochastic Parity Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2019'
...
---
_id: '6931'
abstract:
- lang: eng
text: "Consider a distributed system with n processors out of which f can be Byzantine
faulty. In the\r\napproximate agreement task, each processor i receives an input
value xi and has to decide on an\r\noutput value yi such that\r\n1. the output
values are in the convex hull of the non-faulty processors’ input values,\r\n2.
the output values are within distance d of each other.\r\n\r\n\r\nClassically,
the values are assumed to be from an m-dimensional Euclidean space, where m ≥
1.\r\nIn this work, we study the task in a discrete setting, where input values
with some structure\r\nexpressible as a graph. Namely, the input values are vertices
of a finite graph G and the goal is to\r\noutput vertices that are within distance
d of each other in G, but still remain in the graph-induced\r\nconvex hull of
the input values. For d = 0, the task reduces to consensus and cannot be solved
with\r\na deterministic algorithm in an asynchronous system even with a single
crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous
systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of
G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant
of lattice agreement. For synchronous systems, we show tight resilience bounds
for the exact\r\nvariants of these and related tasks over a large class of combinatorial
structures."
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Thomas
full_name: Nowak, Thomas
last_name: Nowak
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
citation:
ama: 'Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd
International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29'
apa: 'Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs.
In 33rd International Symposium on Distributed Computing (Vol. 146, p.
29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.DISC.2019.29'
chicago: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”
In 33rd International Symposium on Distributed Computing, 146:29:1--29:17.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.
ieee: T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd
International Symposium on Distributed Computing, Budapest, Hungary, 2019,
vol. 146, p. 29:1--29:17.
ista: 'Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd
International Symposium on Distributed Computing. DISC: International Symposium
on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.'
mla: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”
33rd International Symposium on Distributed Computing, vol. 146, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
short: T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.
conference:
end_date: 2019-10-18
location: Budapest, Hungary
name: 'DISC: International Symposium on Distributed Computing'
start_date: 2019-10-14
date_created: 2019-10-08T12:41:38Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2021-01-12T08:09:38Z
ddc:
- '004'
department:
- _id: DaAl
doi: 10.4230/LIPICS.DISC.2019.29
ec_funded: 1
external_id:
arxiv:
- '1908.02743'
file:
- access_level: open_access
checksum: 2d2202f90c6ac991e50876451627c4b5
content_type: application/pdf
creator: jrybicki
date_created: 2019-10-08T12:47:19Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6934'
file_name: LIPIcs-DISC-2019-29.pdf
file_size: 639378
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 146'
keyword:
- consensus
- approximate agreement
- Byzantine faults
- chordal graphs
- lattice agreement
language:
- iso: eng
oa: 1
oa_version: Published Version
page: 29:1--29:17
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 33rd International Symposium on Distributed Computing
publication_identifier:
eisbn:
- 978-3-95977-126-9
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Byzantine approximate agreement on graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2019'
...
---
_id: '6985'
abstract:
- lang: eng
text: In this paper, we introduce a novel method to interpret recurrent neural networks
(RNNs), particularly long short-term memory networks (LSTMs) at the cellular level.
We propose a systematic pipeline for interpreting individual hidden state dynamics
within the network using response characterization methods. The ranked contribution
of individual cells to the network's output is computed by analyzing a set of
interpretable metrics of their decoupled step and sinusoidal responses. As a result,
our method is able to uniquely identify neurons with insightful dynamics, quantify
relationships between dynamical properties and test accuracy through ablation
analysis, and interpret the impact of network capacity on a network's dynamical
distribution. Finally, we demonstrate the generalizability and scalability of
our method by evaluating a series of different benchmark sequential datasets.
article_number: '8851954'
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Felix
full_name: Naser, Felix
last_name: Naser
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
citation:
ama: 'Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization
for auditing cell dynamics in long short-term memory networks. In: Proceedings
of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954'
apa: 'Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019).
Response characterization for auditing cell dynamics in long short-term memory
networks. In Proceedings of the International Joint Conference on Neural Networks.
Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954'
chicago: Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu,
and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long
Short-Term Memory Networks.” In Proceedings of the International Joint Conference
on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.
ieee: R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response
characterization for auditing cell dynamics in long short-term memory networks,”
in Proceedings of the International Joint Conference on Neural Networks,
Budapest, Hungary, 2019.
ista: 'Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization
for auditing cell dynamics in long short-term memory networks. Proceedings of
the International Joint Conference on Neural Networks. IJCNN: International Joint
Conference on Neural Networks, 8851954.'
mla: Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics
in Long Short-Term Memory Networks.” Proceedings of the International Joint
Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.
short: R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings
of the International Joint Conference on Neural Networks, IEEE, 2019.
conference:
end_date: 2019-07-19
location: Budapest, Hungary
name: 'IJCNN: International Joint Conference on Neural Networks'
start_date: 2019-07-14
date_created: 2019-11-04T15:59:58Z
date_published: 2019-09-30T00:00:00Z
date_updated: 2021-01-12T08:11:19Z
day: '30'
department:
- _id: ToHe
doi: 10.1109/ijcnn.2019.8851954
external_id:
arxiv:
- '1809.03864'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.03864
month: '09'
oa: 1
oa_version: Preprint
publication: Proceedings of the International Joint Conference on Neural Networks
publication_identifier:
isbn:
- '9781728119854'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: 1
status: public
title: Response characterization for auditing cell dynamics in long short-term memory
networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '7007'
abstract:
- lang: eng
text: 'We consider the primitive relay channel, where the source sends a message
to the relay and to the destination, and the relay helps the communication by
transmitting an additional message to the destination via a separate channel.
Two well-known coding techniques have been introduced for this setting: decode-and-forward
and compress-and-forward. In decode-and-forward, the relay completely decodes
the message and sends some information to the destination; in compress-and-forward,
the relay does not decode, and it sends a compressed version of the received signal
to the destination using Wyner–Ziv coding. In this paper, we present a novel coding
paradigm that provides an improved achievable rate for the primitive relay channel.
The idea is to combine compress-and-forward and decode-and-forward via a chaining
construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward;
and, in the second block, we use decode-and-forward. More specifically, in the
first block, the relay does not decode, it compresses the received signal via
Wyner–Ziv, and it sends only part of the compression to the destination. In the
second block, the relay completely decodes the message, it sends some information
to the destination, and it also sends the remaining part of the compression coming
from the first block. By doing so, we are able to strictly outperform both compress-and-forward
and decode-and-forward. Note that the proposed coding scheme can be implemented
with polar codes. As such, it has the typical attractive properties of polar coding
schemes, namely, quasi-linear encoding and decoding complexity, and error probability
that decays at super-polynomial speed. As a running example, we take into account
the special case of the erasure relay channel, and we provide a comparison between
the rates achievable by our proposed scheme and the existing upper and lower bounds.'
article_number: '218'
article_type: original
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: S. Hamed
full_name: Hassani, S. Hamed
last_name: Hassani
- first_name: Rüdiger
full_name: Urbanke, Rüdiger
last_name: Urbanke
citation:
ama: Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive
relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218
apa: Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm
for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218
chicago: Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm
for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218.
ieee: M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the
primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.
ista: Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive
relay channel. Algorithms. 12(10), 218.
mla: Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.”
Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.
short: M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019).
date_created: 2019-11-12T14:46:19Z
date_published: 2019-10-18T00:00:00Z
date_updated: 2023-02-23T12:49:28Z
day: '18'
ddc:
- '510'
department:
- _id: MaMo
doi: 10.3390/a12100218
external_id:
arxiv:
- '1801.03153'
file:
- access_level: open_access
checksum: 267756d8f9db572f496cd1663c89d59a
content_type: application/pdf
creator: dernst
date_created: 2019-11-12T14:48:45Z
date_updated: 2020-07-14T12:47:47Z
file_id: '7008'
file_name: 2019_Algorithms_Mondelli.pdf
file_size: 696791
relation: main_file
file_date_updated: 2020-07-14T12:47:47Z
has_accepted_license: '1'
intvolume: ' 12'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Algorithms
publication_identifier:
issn:
- 1999-4893
publication_status: published
publisher: MDPI
quality_controlled: '1'
related_material:
record:
- id: '6675'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: A new coding paradigm for the primitive relay channel
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: 12
year: '2019'
...
---
_id: '7035'
abstract:
- lang: eng
text: 'The aim of this short note is to expound one particular issue that was discussed
during the talk [10] given at the symposium ”Researches on isometries as preserver
problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses
by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new
results.From an isometric point of view, in some cases, metric spaces of measures
are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations
of the underlying space. Of course, it depends on the particular choice of the metric how nice these
transformations should be. Sometimes, as we will see, being a homeomorphism is
enough to generate an isometry. But sometimes we need more: the transformation
must preserve the underlying distance as well. Statements claiming that isometries
in questions are necessarily induced by homeomorphisms are called Banach-Stone-type
results, while results asserting that the underlying transformation is necessarily
an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural
question arises:Is it enough to understand how an isometry acts on the set of
Dirac masses? Does this action extend uniquely to all measures?In what follows,
we will thoroughly investigate this question.'
article_processing_charge: No
author:
- first_name: Gyorgy Pal
full_name: Geher, Gyorgy Pal
last_name: Geher
- first_name: Tamas
full_name: Titkos, Tamas
last_name: Titkos
- first_name: Daniel
full_name: Virosztek, Daniel
id: 48DB45DA-F248-11E8-B48F-1D18A9856A87
last_name: Virosztek
orcid: 0000-0003-1109-5511
citation:
ama: 'Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In:
Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences,
Kyoto University; 2019:34-41.'
apa: 'Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric
rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan:
Research Institute for Mathematical Sciences, Kyoto University.'
chicago: Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and
Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute
for Mathematical Sciences, Kyoto University, 2019.
ieee: G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,”
in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.
ista: Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity.
Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related
topics vol. 2125, 34–41.
mla: Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS
Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto
University, 2019, pp. 34–41.
short: G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research
Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.
conference:
end_date: 2019-01-30
location: Kyoto, Japan
name: Research on isometries as preserver problems and related topics
start_date: 2019-01-28
date_created: 2019-11-18T15:39:53Z
date_published: 2019-01-30T00:00:00Z
date_updated: 2021-01-12T08:11:33Z
day: '30'
department:
- _id: LaEr
intvolume: ' 2125'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html
month: '01'
oa: 1
oa_version: Submitted Version
page: 34-41
publication: Kyoto RIMS Kôkyûroku
publication_status: published
publisher: Research Institute for Mathematical Sciences, Kyoto University
quality_controlled: '1'
status: public
title: Dirac masses and isometric rigidity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2125
year: '2019'
...
---
_id: '7171'
abstract:
- lang: ger
text: "Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen
verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte
Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens.
Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert
Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin
Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung
der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten
möchten. Auch für Schülerinnen und Schüler geeignet!"
article_processing_charge: No
citation:
ama: 'Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche
Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019.
doi:10.1007/978-3-658-26763-6'
apa: 'Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen
Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden:
Springer Nature. https://doi.org/10.1007/978-3-658-26763-6'
chicago: 'Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie
Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden:
Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6.'
ieee: 'K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen:
Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature,
2019.'
ista: 'Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche
Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.'
mla: 'Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz
Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.'
short: 'K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche
Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.'
date_created: 2019-12-11T14:15:56Z
date_published: 2019-10-30T00:00:00Z
date_updated: 2021-12-22T14:40:58Z
day: '30'
department:
- _id: ChLa
doi: 10.1007/978-3-658-26763-6
edition: '1'
editor:
- first_name: Kristian
full_name: Kersting, Kristian
last_name: Kersting
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Constantin
full_name: Rothkopf, Constantin
last_name: Rothkopf
language:
- iso: ger
month: '10'
oa_version: None
page: XIV, 245
place: Wiesbaden
publication_identifier:
eisbn:
- 978-3-658-26763-6
isbn:
- 978-3-658-26762-9
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Website
relation: press_release
url: https://ist.ac.at/en/news/book-release-how-machines-learn/
status: public
title: 'Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt'
type: book_editor
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
_id: '7401'
abstract:
- lang: eng
text: 'The genus g(G) of a graph G is the minimum g such that G has an embedding
on the orientable surface M_g of genus g. A drawing of a graph on a surface is
independently even if every pair of nonadjacent edges in the drawing crosses an
even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum
g such that G has an independently even drawing on M_g. By a result of Battle,
Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected
blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph
is additive over 2-connected blocks as well, and asked whether this result can
be extended to so-called 2-amalgamations, as an analogue of results by Decker,
Glover, Huneke, and Stahl for the genus. We give the following partial answer.
If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has
k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1.
For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n).
Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus
of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem
that might be of independent interest. '
alternative_title:
- LIPIcs
article_number: '39'
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kyncl, Jan
last_name: Kyncl
citation:
ama: 'Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric
matrices. In: 35th International Symposium on Computational Geometry (SoCG
2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39'
apa: 'Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of
partial symmetric matrices. In 35th International Symposium on Computational
Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39'
chicago: Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of
Partial Symmetric Matrices.” In 35th International Symposium on Computational
Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.
ieee: R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric
matrices,” in 35th International Symposium on Computational Geometry (SoCG
2019), Portland, OR, United States, 2019, vol. 129.
ista: 'Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric
matrices. 35th International Symposium on Computational Geometry (SoCG 2019).
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.'
mla: Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial
Symmetric Matrices.” 35th International Symposium on Computational Geometry
(SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019, doi:10.4230/LIPICS.SOCG.2019.39.
short: R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry
(SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-06-21
location: Portland, OR, United States
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2019-06-18
date_created: 2020-01-29T16:17:05Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2021-01-12T08:13:24Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPICS.SOCG.2019.39
external_id:
arxiv:
- '1903.08637'
file:
- access_level: open_access
checksum: aac37b09118cc0ab58cf77129e691f8c
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T09:14:31Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7445'
file_name: 2019_LIPIcs_Fulek.pdf
file_size: 628347
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 129'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: 35th International Symposium on Computational Geometry (SoCG 2019)
publication_identifier:
isbn:
- 978-3-95977-104-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Z_2-Genus of graphs and minimum rank of partial symmetric matrices
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2019'
...
---
_id: '7453'
abstract:
- lang: eng
text: We illustrate the ingredients of the state-of-the-art of model-based approach
for the formal design and verification of cyber-physical systems. To capture the
interaction between a discrete controller and its continuously evolving environment,
we use the formal models of timed and hybrid automata. We explain the steps of
modeling and verification in the tools Uppaal and SpaceEx using a case study based
on a dual-chamber implantable pacemaker monitoring a human heart. We show how
to design a model as a composition of components, how to construct models at varying
levels of detail, how to establish that one model is an abstraction of another,
how to specify correctness requirements using temporal logic, and how to verify
that a model satisfies a logical requirement.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This
research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS,
funded by the Danish National Research Foundation and the National Science Foundation,
China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant
LASSO.
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- 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: Kim G.
full_name: Larsen, Kim G.
last_name: Larsen
- first_name: Marius
full_name: Mikučionis, Marius
last_name: Mikučionis
citation:
ama: 'Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time
models for system design and analysis. In: Steffen B, Woeginger G, eds. Computing
and Software Science. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:10.1007/978-3-319-91908-9_22'
apa: Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., & Mikučionis,
M. (2019). Continuous-time models for system design and analysis. In B. Steffen
& G. Woeginger (Eds.), Computing and Software Science (Vol. 10000,
pp. 452–477). Springer Nature. https://doi.org/10.1007/978-3-319-91908-9_22
chicago: Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius
Mikučionis. “Continuous-Time Models for System Design and Analysis.” In Computing
and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77.
LNCS. Springer Nature, 2019. https://doi.org/10.1007/978-3-319-91908-9_22.
ieee: R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time
models for system design and analysis,” in Computing and Software Science,
vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.
ista: 'Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time
models for system design and analysis. In: Computing and Software Science. Lecture
Notes in Computer Science, vol. 10000, 452–477.'
mla: Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.”
Computing and Software Science, edited by Bernhard Steffen and Gerhard
Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.
short: R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B.
Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature,
2019, pp. 452–477.
date_created: 2020-02-05T10:51:44Z
date_published: 2019-10-05T00:00:00Z
date_updated: 2022-09-06T08:25:52Z
day: '05'
department:
- _id: ToHe
doi: 10.1007/978-3-319-91908-9_22
editor:
- first_name: Bernhard
full_name: Steffen, Bernhard
last_name: Steffen
- first_name: Gerhard
full_name: Woeginger, Gerhard
last_name: Woeginger
intvolume: ' 10000'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-319-91908-9_22
month: '10'
oa: 1
oa_version: Published Version
page: 452-477
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
publication: Computing and Software Science
publication_identifier:
eisbn:
- '9783319919089'
eissn:
- 0302-9743
isbn:
- '9783319919072'
issn:
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Continuous-time models for system design and analysis
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10000
year: '2019'
...
---
_id: '7550'
abstract:
- lang: eng
text: 'We consider an optimal control problem for an abstract nonlinear dissipative
evolution equation. The differential constraint is penalized by augmenting the
target functional by a nonnegative global-in-time functional which is null-minimized
in the evolution equation is satisfied. Different variational settings are presented,
leading to the convergence of the penalization method for gradient flows, noncyclic
and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. '
acknowledgement: This work is supported by Vienna Science and Technology Fund (WWTF)
through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and
I 2375.
article_processing_charge: No
article_type: original
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
- first_name: Ulisse
full_name: Stefanelli, Ulisse
last_name: Stefanelli
citation:
ama: Portinale L, Stefanelli U. Penalization via global functionals of optimal-control
problems for dissipative evolution. Advances in Mathematical Sciences and Applications.
2019;28(2):425-447.
apa: Portinale, L., & Stefanelli, U. (2019). Penalization via global functionals
of optimal-control problems for dissipative evolution. Advances in Mathematical
Sciences and Applications. Gakko Tosho.
chicago: Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals
of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical
Sciences and Applications. Gakko Tosho, 2019.
ieee: L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control
problems for dissipative evolution,” Advances in Mathematical Sciences and
Applications, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.
ista: Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control
problems for dissipative evolution. Advances in Mathematical Sciences and Applications.
28(2), 425–447.
mla: Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals
of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical
Sciences and Applications, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.
short: L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications
28 (2019) 425–447.
date_created: 2020-02-28T10:54:41Z
date_published: 2019-10-22T00:00:00Z
date_updated: 2022-06-17T07:52:41Z
day: '22'
department:
- _id: JaMa
external_id:
arxiv:
- '1910.10050'
intvolume: ' 28'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1910.10050'
month: '10'
oa: 1
oa_version: Preprint
page: 425-447
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: Advances in Mathematical Sciences and Applications
publication_identifier:
issn:
- 1343-4373
publication_status: published
publisher: Gakko Tosho
quality_controlled: '1'
status: public
title: Penalization via global functionals of optimal-control problems for dissipative
evolution
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2019'
...
---
_id: '7552'
abstract:
- lang: eng
text: 'There is increasing evidence that protein binding to specific sites along
DNA can activate the reading out of genetic information without coming into direct
physical contact with the gene. There also is evidence that these distant but
interacting sites are embedded in a liquid droplet of proteins which condenses
out of the surrounding solution. We argue that droplet-mediated interactions can
account for crucial features of gene regulation only if the droplet is poised
at a non-generic point in its phase diagram. We explore a minimal model that embodies
this idea, show that this model has a natural mechanism for self-tuning, and suggest
direct experimental tests. '
article_processing_charge: No
author:
- first_name: William
full_name: Bialek, William
last_name: Bialek
- first_name: Thomas
full_name: Gregor, Thomas
last_name: Gregor
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation.
arXiv:191208579.
apa: Bialek, W., Gregor, T., & Tkačik, G. (n.d.). Action at a distance in transcriptional
regulation. arXiv:1912.08579. ArXiv.
chicago: Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance
in Transcriptional Regulation.” ArXiv:1912.08579. ArXiv, n.d.
ieee: W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional
regulation,” arXiv:1912.08579. ArXiv.
ista: Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation.
arXiv:1912.08579, .
mla: Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.”
ArXiv:1912.08579, ArXiv.
short: W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).
date_created: 2020-02-28T10:57:08Z
date_published: 2019-12-18T00:00:00Z
date_updated: 2021-01-12T08:14:09Z
day: '18'
department:
- _id: GaTk
external_id:
arxiv:
- '1912.08579'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.08579
month: '12'
oa: 1
oa_version: Preprint
page: '5'
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: arXiv:1912.08579
publication_status: submitted
publisher: ArXiv
status: public
title: Action at a distance in transcriptional regulation
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '7576'
abstract:
- lang: eng
text: We present the results of a friendly competition for formal verification of
continuous and hybrid systems with nonlinear continuous dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex,
Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are
applied to solve reachability analysis problems on four benchmark problems, one
of them with hybrid dynamics. We do not rank the tools based on the results, but
show the current status and discover the potential advantages of different tools.
article_processing_charge: No
author:
- first_name: Fabian
full_name: Immler, Fabian
last_name: Immler
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
- first_name: Luis
full_name: Benet, Luis
last_name: Benet
- first_name: Alexandre
full_name: Chapoutot, Alexandre
last_name: Chapoutot
- first_name: Xin
full_name: Chen, Xin
last_name: Chen
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Luca
full_name: Geretti, Luca
last_name: Geretti
- first_name: Niklas
full_name: Kochdumper, Niklas
last_name: Kochdumper
- first_name: David P.
full_name: Sanders, David P.
last_name: Sanders
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous
and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing.
Vol 61. EasyChair Publications; 2019:41-61. doi:10.29007/m75b'
apa: 'Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., …
Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems
with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61).
Montreal, Canada: EasyChair Publications. https://doi.org/10.29007/m75b'
chicago: 'Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin
Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian
Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear
Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair Publications,
2019. https://doi.org/10.29007/m75b.'
ieee: 'F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid
systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal,
Canada, 2019, vol. 61, pp. 41–61.'
ista: 'Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper
N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and
hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International
Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.'
mla: 'Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid
Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair
Publications, 2019, pp. 41–61, doi:10.29007/m75b.'
short: F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti,
N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair
Publications, 2019, pp. 41–61.
conference:
end_date: 2019-04-15
location: Montreal, Canada
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2019-04-15
date_created: 2020-03-08T23:00:49Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2021-01-12T08:14:17Z
day: '25'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.29007/m75b
file:
- access_level: open_access
checksum: 9138977a06fcd6a95976eb4bca875f0c
content_type: application/pdf
creator: dernst
date_created: 2020-03-24T07:36:36Z
date_updated: 2020-07-14T12:48:00Z
file_id: '7617'
file_name: 2019_ARCH19_Immler.pdf
file_size: 1934830
relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: ' 61'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 41-61
publication: EPiC Series in Computing
publication_identifier:
eissn:
- '23987340'
publication_status: published
publisher: EasyChair Publications
quality_controlled: '1'
scopus_import: 1
status: public
title: 'ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear
dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2019'
...
---
_id: '8175'
abstract:
- lang: eng
text: We study edge asymptotics of poissonized Plancherel-type measures on skew
Young diagrams (integer partitions). These measures can be seen as generalizations
of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's
problem on longest increasing subsequences of random permutations and the last
passage percolation (corner growth) discrete versions thereof. Moreover they interpolate
between said measures and the uniform measure on partitions. In the new KPZ-like
1/3 exponent edge scaling limit with logarithmic corrections, we find new probability
distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions
from the theory of random matrices.
acknowledgement: "D.B. is especially grateful to Patrik Ferrari for suggesting simplifications
in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models
of Section 2.\r\n"
article_number: '34'
article_processing_charge: No
author:
- first_name: Dan
full_name: Betea, Dan
last_name: Betea
- first_name: Jérémie
full_name: Bouttier, Jérémie
last_name: Bouttier
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
- first_name: Mirjana
full_name: Vuletíc, Mirjana
last_name: Vuletíc
citation:
ama: 'Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young
diagrams via free boundaries. In: Proceedings on the 31st International Conference
on Formal Power Series and Algebraic Combinatorics. Formal Power Series and
Algebraic Combinatorics; 2019.'
apa: 'Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics
of skew Young diagrams via free boundaries. In Proceedings on the 31st International
Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana,
Slovenia: Formal Power Series and Algebraic Combinatorics.'
chicago: Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge
Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on
the 31st International Conference on Formal Power Series and Algebraic Combinatorics.
Formal Power Series and Algebraic Combinatorics, 2019.
ieee: D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of
skew Young diagrams via free boundaries,” in Proceedings on the 31st International
Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana,
Slovenia, 2019.
ista: 'Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew
Young diagrams via free boundaries. Proceedings on the 31st International Conference
on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference
on Formal Power Series and Algebraic Combinatorics, 34.'
mla: Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.”
Proceedings on the 31st International Conference on Formal Power Series and
Algebraic Combinatorics, 34, Formal Power Series and Algebraic Combinatorics,
2019.
short: D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st
International Conference on Formal Power Series and Algebraic Combinatorics, Formal
Power Series and Algebraic Combinatorics, 2019.
conference:
end_date: 2019-07-05
location: Ljubljana, Slovenia
name: 'FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics'
start_date: 2019-07-01
date_created: 2020-07-26T22:01:04Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:17:18Z
day: '01'
department:
- _id: LaEr
ec_funded: 1
external_id:
arxiv:
- '1902.08750'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.08750
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Proceedings on the 31st International Conference on Formal Power Series
and Algebraic Combinatorics
publication_status: published
publisher: Formal Power Series and Algebraic Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: New edge asymptotics of skew Young diagrams via free boundaries
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8570'
abstract:
- lang: eng
text: 'This report presents the results of a friendly competition for formal verification
of continuous and hybrid systems with linear continuous dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been
applied to solve six different benchmark problems in the category for linear continuous
dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx,
and XSpeed. This report is a snapshot of the current landscape of tools and the
types of benchmarks they are particularly suited for. Due to the diversity of
problems, we are not ranking tools, yet the presented results provide one of the
most complete assessments of tools for the safety verification of continuous and
hybrid systems with linear continuous dynamics up to this date.'
article_processing_charge: No
author:
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
- first_name: Stanley
full_name: Bak, Stanley
last_name: Bak
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Niklas
full_name: Kochdumper, Niklas
last_name: Kochdumper
- first_name: Rajarshi
full_name: Ray, Rajarshi
last_name: Ray
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Stefan
full_name: Schupp, Stefan
last_name: Schupp
citation:
ama: 'Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous
and hybrid systems with linear continuous dynamics. In: EPiC Series in Computing.
Vol 61. EasyChair; 2019:14-40. doi:10.29007/bj1w'
apa: 'Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp,
S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear
continuous dynamics. In EPiC Series in Computing (Vol. 61, pp. 14–40).
Montreal, Canada: EasyChair. https://doi.org/10.29007/bj1w'
chicago: 'Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper,
Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report:
Continuous and Hybrid Systems with Linear Continuous Dynamics.” In EPiC Series
in Computing, 61:14–40. EasyChair, 2019. https://doi.org/10.29007/bj1w.'
ieee: 'M. Althoff et al., “ARCH-COMP19 Category Report: Continuous and hybrid
systems with linear continuous dynamics,” in EPiC Series in Computing,
Montreal, Canada, 2019, vol. 61, pp. 14–40.'
ista: 'Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp
S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear
continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on
Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.'
mla: 'Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid
Systems with Linear Continuous Dynamics.” EPiC Series in Computing, vol.
61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.'
short: M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling,
S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.
conference:
end_date: 2019-04-15
location: Montreal, Canada
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2019-04-15
date_created: 2020-09-26T14:23:54Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2021-01-12T08:20:05Z
day: '25'
department:
- _id: ToHe
doi: 10.29007/bj1w
intvolume: ' 61'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://easychair.org/publications/open/1gbP
month: '05'
oa: 1
oa_version: Published Version
page: 14-40
publication: EPiC Series in Computing
publication_identifier:
eissn:
- '23987340'
publication_status: published
publisher: EasyChair
quality_controlled: '1'
status: public
title: 'ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous
dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2019'
...
---
_id: '6819'
abstract:
- lang: eng
text: Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations
have been shown to exert toxicity via various mechanisms. It has been asserted
that glyphosate substitutes for glycine in polypeptide chains leading to protein
misfolding and toxicity. However, as no direct evidence exists for glycine to
glyphosate substitution in proteins, including in mammalian organisms, we tested
this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer
cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts
from three treated and three untreated cell cultures were analysed as one TMT-6plex
labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities
for peptides bearing true glyphosate treatment induced-post translational modifications
as well as allowing an investigation of the total proteome.
article_number: '494'
article_processing_charge: No
author:
- first_name: Michael N.
full_name: Antoniou, Michael N.
last_name: Antoniou
- first_name: Armel
full_name: Nicolas, Armel
id: 2A103192-F248-11E8-B48F-1D18A9856A87
last_name: Nicolas
- first_name: Robin
full_name: Mesnage, Robin
last_name: Mesnage
- first_name: Martina
full_name: Biserni, Martina
last_name: Biserni
- first_name: Francesco V.
full_name: Rao, Francesco V.
last_name: Rao
- first_name: Cristina Vazquez
full_name: Martin, Cristina Vazquez
last_name: Martin
citation:
ama: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. Glyphosate
does not substitute for glycine in proteins of actively dividing mammalian cells.
BMC Research Notes. 2019;12. doi:10.1186/s13104-019-4534-3
apa: Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin,
C. V. (2019). Glyphosate does not substitute for glycine in proteins of actively
dividing mammalian cells. BMC Research Notes. BioMed Central. https://doi.org/10.1186/s13104-019-4534-3
chicago: Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco
V. Rao, and Cristina Vazquez Martin. “Glyphosate Does Not Substitute for Glycine
in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes.
BioMed Central, 2019. https://doi.org/10.1186/s13104-019-4534-3.
ieee: M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin,
“Glyphosate does not substitute for glycine in proteins of actively dividing mammalian
cells,” BMC Research Notes, vol. 12. BioMed Central, 2019.
ista: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. Glyphosate
does not substitute for glycine in proteins of actively dividing mammalian cells.
BMC Research Notes. 12, 494.
mla: Antoniou, Michael N., et al. “Glyphosate Does Not Substitute for Glycine in
Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes, vol.
12, 494, BioMed Central, 2019, doi:10.1186/s13104-019-4534-3.
short: M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin,
BMC Research Notes 12 (2019).
date_created: 2019-08-18T22:00:39Z
date_published: 2019-08-08T00:00:00Z
date_updated: 2023-02-23T14:08:14Z
day: '08'
ddc:
- '570'
department:
- _id: LifeSc
doi: 10.1186/s13104-019-4534-3
external_id:
pmid:
- '31395095'
file:
- access_level: open_access
checksum: 4a2bb7994b7f2c432bf44f5127ea3102
content_type: application/pdf
creator: dernst
date_created: 2019-08-23T11:10:35Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6829'
file_name: 2019_BMC_Antoniou.pdf
file_size: 1177482
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 12'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: BMC Research Notes
publication_identifier:
eissn:
- 1756-0500
publication_status: published
publisher: BioMed Central
quality_controlled: '1'
related_material:
record:
- id: '9784'
relation: research_data
status: public
scopus_import: 1
status: public
title: Glyphosate does not substitute for glycine in proteins of actively dividing
mammalian cells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2019'
...
---
_id: '9784'
abstract:
- lang: eng
text: 'Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either
the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1
of seeding flasks and following 6-days of continuous culture. Note: no differences
in cell numbers were observed between negative control and glyphosate treated
cultures.'
article_processing_charge: No
author:
- first_name: Michael N.
full_name: Antoniou, Michael N.
last_name: Antoniou
- first_name: Armel
full_name: Nicolas, Armel
id: 2A103192-F248-11E8-B48F-1D18A9856A87
last_name: Nicolas
- first_name: Robin
full_name: Mesnage, Robin
last_name: Mesnage
- first_name: Martina
full_name: Biserni, Martina
last_name: Biserni
- first_name: Francesco V.
full_name: Rao, Francesco V.
last_name: Rao
- first_name: Cristina Vazquez
full_name: Martin, Cristina Vazquez
last_name: Martin
citation:
ama: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. MOESM1 of
Glyphosate does not substitute for glycine in proteins of actively dividing mammalian
cells. 2019. doi:10.6084/m9.figshare.9411761.v1
apa: Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin,
C. V. (2019). MOESM1 of Glyphosate does not substitute for glycine in proteins
of actively dividing mammalian cells. Springer Nature. https://doi.org/10.6084/m9.figshare.9411761.v1
chicago: Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco
V. Rao, and Cristina Vazquez Martin. “MOESM1 of Glyphosate Does Not Substitute
for Glycine in Proteins of Actively Dividing Mammalian Cells.” Springer Nature,
2019. https://doi.org/10.6084/m9.figshare.9411761.v1.
ieee: M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin,
“MOESM1 of Glyphosate does not substitute for glycine in proteins of actively
dividing mammalian cells.” Springer Nature, 2019.
ista: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. MOESM1
of Glyphosate does not substitute for glycine in proteins of actively dividing
mammalian cells, Springer Nature, 10.6084/m9.figshare.9411761.v1.
mla: Antoniou, Michael N., et al. MOESM1 of Glyphosate Does Not Substitute for
Glycine in Proteins of Actively Dividing Mammalian Cells. Springer Nature,
2019, doi:10.6084/m9.figshare.9411761.v1.
short: M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin,
(2019).
date_created: 2021-08-06T08:14:05Z
date_published: 2019-08-09T00:00:00Z
date_updated: 2023-02-23T12:52:29Z
day: '09'
department:
- _id: LifeSc
doi: 10.6084/m9.figshare.9411761.v1
main_file_link:
- open_access: '1'
url: https://doi.org/10.6084/m9.figshare.9411761.v1
month: '08'
oa: 1
oa_version: Published Version
publisher: Springer Nature
related_material:
record:
- id: '6819'
relation: used_in_publication
status: public
status: public
title: MOESM1 of Glyphosate does not substitute for glycine in proteins of actively
dividing mammalian cells
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '9839'
abstract:
- lang: eng
text: 'More than 100 years after Grigg’s influential analysis of species’ borders,
the causes of limits to species’ ranges still represent a puzzle that has never
been understood with clarity. The topic has become especially important recently
as many scientists have become interested in the potential for species’ ranges
to shift in response to climate change—and yet nearly all of those studies fail
to recognise or incorporate evolutionary genetics in a way that relates to theoretical
developments. I show that range margins can be understood based on just two measurable
parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and
(ii) the strength of genetic drift, which reduces genetic diversity. Together,
these two parameters define an ‘expansion threshold’: adaptation fails when genetic
drift reduces genetic diversity below that required for adaptation to a heterogeneous
environment. When the key parameters drop below this expansion threshold locally,
a sharp range margin forms. When they drop below this threshold throughout the
species’ range, adaptation collapses everywhere, resulting in either extinction
or formation of a fragmented metapopulation. Because the effects of dispersal
differ fundamentally with dimension, the second parameter—the strength of genetic
drift—is qualitatively different compared to a linear habitat. In two-dimensional
habitats, genetic drift becomes effectively independent of selection. It decreases
with ‘neighbourhood size’—the number of individuals accessible by dispersal within
one generation. Moreover, in contrast to earlier predictions, which neglected
evolution of genetic variance and/or stochasticity in two dimensions, dispersal
into small marginal populations aids adaptation. This is because the reduction
of both genetic and demographic stochasticity has a stronger effect than the cost
of dispersal through increased maladaptation. The expansion threshold thus provides
a novel, theoretically justified, and testable prediction for formation of the
range margin and collapse of the species’ range.'
article_processing_charge: No
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
citation:
ama: 'Polechova J. Data from: Is the sky the limit? On the expansion threshold of
a species’ range. 2019. doi:10.5061/dryad.5vv37'
apa: 'Polechova, J. (2019). Data from: Is the sky the limit? On the expansion threshold
of a species’ range. Dryad. https://doi.org/10.5061/dryad.5vv37'
chicago: 'Polechova, Jitka. “Data from: Is the Sky the Limit? On the Expansion Threshold
of a Species’ Range.” Dryad, 2019. https://doi.org/10.5061/dryad.5vv37.'
ieee: 'J. Polechova, “Data from: Is the sky the limit? On the expansion threshold
of a species’ range.” Dryad, 2019.'
ista: 'Polechova J. 2019. Data from: Is the sky the limit? On the expansion threshold
of a species’ range, Dryad, 10.5061/dryad.5vv37.'
mla: 'Polechova, Jitka. Data from: Is the Sky the Limit? On the Expansion Threshold
of a Species’ Range. Dryad, 2019, doi:10.5061/dryad.5vv37.'
short: J. Polechova, (2019).
date_created: 2021-08-09T13:07:28Z
date_published: 2019-06-22T00:00:00Z
date_updated: 2023-02-23T11:14:30Z
day: '22'
department:
- _id: NiBa
doi: 10.5061/dryad.5vv37
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.5vv37
month: '06'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '315'
relation: used_in_publication
status: public
status: public
title: 'Data from: Is the sky the limit? On the expansion threshold of a species''
range'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '8305'
abstract:
- lang: eng
text: In this paper, we present the first fully asynchronous distributed key generation
(ADKG) algorithm as well as the first distributed key generation algorithm that
can create keys with a dual (f,2f+1)−threshold that are necessary for scalable
consensus (which so far needs a trusted dealer assumption). In order to create
a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open
question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds
f+1Cryptology
ePrint Archive.'
apa: 'Kokoris Kogias, E., Spiegelman, A., Malkhi, D., & Abraham, I. (n.d.).
Bootstrapping consensus without trusted setup: fully asynchronous distributed
key generation. Cryptology ePrint Archive.'
chicago: 'Kokoris Kogias, Eleftherios, Alexander Spiegelman, Dahlia Malkhi, and
Ittai Abraham. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous
Distributed Key Generation.” Cryptology EPrint Archive, n.d.'
ieee: 'E. Kokoris Kogias, A. Spiegelman, D. Malkhi, and I. Abraham, “Bootstrapping
consensus without trusted setup: fully asynchronous distributed key generation,”
Cryptology ePrint Archive. .'
ista: 'Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus
without trusted setup: fully asynchronous distributed key generation. Cryptology
ePrint Archive, 2019/1015.'
mla: 'Kokoris Kogias, Eleftherios, et al. “Bootstrapping Consensus without Trusted
Setup: Fully Asynchronous Distributed Key Generation.” Cryptology EPrint Archive,
2019/1015.'
short: E. Kokoris Kogias, A. Spiegelman, D. Malkhi, I. Abraham, Cryptology EPrint
Archive (n.d.).
date_created: 2020-08-26T12:18:00Z
date_published: 2019-09-10T00:00:00Z
date_updated: 2023-05-10T09:27:54Z
day: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1015
month: '09'
oa: 1
oa_version: Preprint
publication: Cryptology ePrint Archive
publication_status: submitted
status: public
title: 'Bootstrapping consensus without trusted setup: fully asynchronous distributed
key generation'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '12901'
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: 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
citation:
ama: 'Schlögl A, Kiss J, Elefante S. Is Debian suitable for running an HPC Cluster?
In: AHPC19 - Austrian HPC Meeting 2019 . Institut für Mathematik und wissenschaftliches
Rechnen der Universität Graz; 2019:25.'
apa: 'Schlögl, A., Kiss, J., & Elefante, S. (2019). Is Debian suitable for running
an HPC Cluster? In AHPC19 - Austrian HPC Meeting 2019 (p. 25). Grundlsee,
Austria: Institut für Mathematik und wissenschaftliches Rechnen der Universität
Graz.'
chicago: Schlögl, Alois, Janos Kiss, and Stefano Elefante. “Is Debian Suitable for
Running an HPC Cluster?” In AHPC19 - Austrian HPC Meeting 2019 , 25. Institut
für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019.
ieee: A. Schlögl, J. Kiss, and S. Elefante, “Is Debian suitable for running an HPC
Cluster?,” in AHPC19 - Austrian HPC Meeting 2019 , Grundlsee, Austria,
2019, p. 25.
ista: 'Schlögl A, Kiss J, Elefante S. 2019. Is Debian suitable for running an HPC
Cluster? AHPC19 - Austrian HPC Meeting 2019 . AHPC: Austrian HPC Meeting, 25.'
mla: Schlögl, Alois, et al. “Is Debian Suitable for Running an HPC Cluster?” AHPC19
- Austrian HPC Meeting 2019 , Institut für Mathematik und wissenschaftliches
Rechnen der Universität Graz, 2019, p. 25.
short: A. Schlögl, J. Kiss, S. Elefante, in:, AHPC19 - Austrian HPC Meeting 2019
, Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz,
2019, p. 25.
conference:
end_date: 2019-02-27
location: Grundlsee, Austria
name: 'AHPC: Austrian HPC Meeting'
start_date: 2019-02-25
date_created: 2023-05-05T12:48:48Z
date_published: 2019-02-27T00:00:00Z
date_updated: 2023-05-16T07:29:32Z
day: '27'
ddc:
- '000'
department:
- _id: ScienComp
file:
- access_level: open_access
checksum: acc8272027faaf30709c51ac5c58ffa4
content_type: application/pdf
creator: dernst
date_created: 2023-05-16T07:27:09Z
date_updated: 2023-05-16T07:27:09Z
file_id: '12970'
file_name: 2019_AHPC_Schloegl.pdf
file_size: 1097603
relation: main_file
success: 1
file_date_updated: 2023-05-16T07:27:09Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc19/BOOKLET_AHPC19.pdf
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication: 'AHPC19 - Austrian HPC Meeting 2019 '
publication_status: published
publisher: Institut für Mathematik und wissenschaftliches Rechnen der Universität
Graz
status: public
title: Is Debian suitable for running an HPC Cluster?
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6989'
abstract:
- lang: eng
text: 'When can a polyomino piece of paper be folded into a unit cube? Prior work
studied tree-like polyominoes, but polyominoes with holes remain an intriguing
open problem. We present sufficient conditions for a polyomino with hole(s) to
fold into a cube, and conditions under which cube folding is impossible. In particular,
we show that all but five special simple holes guarantee foldability. '
acknowledgement: This research was performed in part at the 33rd BellairsWinter Workshop on Computational Geometry. Wethank
all other participants for a fruitful atmosphere.
article_processing_charge: No
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Hugo A
full_name: Akitaya, Hugo A
last_name: Akitaya
- first_name: Kenneth C
full_name: Cheung, Kenneth C
last_name: Cheung
- first_name: Erik D
full_name: Demaine, Erik D
last_name: Demaine
- first_name: Martin L
full_name: Demaine, Martin L
last_name: Demaine
- first_name: Sandor P
full_name: Fekete, Sandor P
last_name: Fekete
- first_name: Linda
full_name: Kleist, Linda
last_name: Kleist
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Maarten
full_name: Löffler, Maarten
last_name: Löffler
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Klara
full_name: Mundilova, Klara
last_name: Mundilova
- first_name: Christiane
full_name: Schmidt, Christiane
last_name: Schmidt
citation:
ama: 'Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes
into a cube. In: Proceedings of the 31st Canadian Conference on Computational
Geometry. Canadian Conference on Computational Geometry; 2019:164-170.'
apa: 'Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M.
L., Fekete, S. P., … Schmidt, C. (2019). Folding polyominoes with holes into a
cube. In Proceedings of the 31st Canadian Conference on Computational Geometry
(pp. 164–170). Edmonton, Canada: Canadian Conference on Computational Geometry.'
chicago: Aichholzer, Oswin, Hugo A Akitaya, Kenneth C Cheung, Erik D Demaine, Martin
L Demaine, Sandor P Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes
into a Cube.” In Proceedings of the 31st Canadian Conference on Computational
Geometry, 164–70. Canadian Conference on Computational Geometry, 2019.
ieee: O. Aichholzer et al., “Folding polyominoes with holes into a cube,”
in Proceedings of the 31st Canadian Conference on Computational Geometry,
Edmonton, Canada, 2019, pp. 164–170.
ista: 'Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist
L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2019. Folding
polyominoes with holes into a cube. Proceedings of the 31st Canadian Conference
on Computational Geometry. CCCG: Canadian Conference in Computational Geometry,
164–170.'
mla: Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Proceedings
of the 31st Canadian Conference on Computational Geometry, Canadian Conference
on Computational Geometry, 2019, pp. 164–70.
short: O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P.
Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt,
in:, Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian
Conference on Computational Geometry, 2019, pp. 164–170.
conference:
end_date: 2019-08-10
location: Edmonton, Canada
name: 'CCCG: Canadian Conference in Computational Geometry'
start_date: 2019-08-08
date_created: 2019-11-04T16:46:11Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-08-04T10:57:42Z
day: '01'
department:
- _id: HeEd
external_id:
arxiv:
- '1910.09917'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://cccg.ca/proceedings/2019/proceedings.pdf
month: '08'
oa: 1
oa_version: Published Version
page: 164-170
publication: Proceedings of the 31st Canadian Conference on Computational Geometry
publication_status: published
publisher: Canadian Conference on Computational Geometry
quality_controlled: '1'
related_material:
record:
- id: '8317'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Folding polyominoes with holes into a cube
type: conference
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
year: '2019'
...
---
_id: '6884'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce a finite or infinite path, which determines the qualitative winner or
quantitative payoff of the game. We study bidding games in which the players bid
for the right to move the token. Several bidding rules were studied previously.
In Richman bidding, in each round, the players simultaneously submit bids, and
the higher bidder moves the token and pays the other player. Poorman bidding is
similar except that the winner of the bidding pays the "bank" rather than the
other player. Taxman bidding spans the spectrum between Richman and poorman bidding.
They are parameterized by a constant tau in [0,1]: portion tau of the winning
bid is paid to the other player, and portion 1-tau to the bank. While finite-duration
(reachability) taxman games have been studied before, we present, for the first
time, results on infinite-duration taxman games. It was previously shown that
both Richman and poorman infinite-duration games with qualitative objectives reduce
to reachability games, and we show a similar result here. Our most interesting
results concern quantitative taxman games, namely mean-payoff games, where poorman
and Richman bidding differ significantly. A central quantity in these games is
the ratio between the two players'' initial budgets. While in poorman mean-payoff
games, the optimal payoff of a player depends on the initial ratio, in Richman
bidding, the payoff depends only on the structure of the game. In both games the
optimal payoffs can be found using (different) probabilistic connections with
random-turn games in which in each turn, instead of bidding, a coin is tossed
to determine which player moves. While the value with Richman bidding equals the
value of a random-turn game with an un-biased coin, with poorman bidding, the
bias in the coin is the initial ratio of the budgets. We give a complete classification
of mean-payoff taxman games that is based on a probabilistic connection: the value
of a taxman bidding game with parameter tau and initial ratio r, equals the value
of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau).
Thus, we show that Richman bidding is the exception; namely, for every tau <1,
the value of the game depends on the initial ratio. Our proof technique simplifies
and unifies the previous proof techniques for both Richman and poorman bidding. '
alternative_title:
- LIPIcs
article_number: '11'
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: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
citation:
ama: 'Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol
138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11'
apa: 'Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in
graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical
Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11'
chicago: Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in
Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
https://doi.org/10.4230/LIPICS.MFCS.2019.11.
ieee: 'G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,”
presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer
Science, Aachen, Germany, 2019, vol. 138.'
ista: 'Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games.
MFCS: nternational Symposium on Mathematical Foundations of Computer Science,
LIPIcs, vol. 138, 11.'
mla: Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.
short: G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Aachen, Germany
name: 'MFCS: nternational Symposium on Mathematical Foundations of Computer Science'
start_date: 2019-08-26
date_created: 2019-09-18T08:04:26Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-08-07T14:08:34Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPICS.MFCS.2019.11
ec_funded: 1
external_id:
arxiv:
- '1905.03835'
file:
- access_level: open_access
checksum: 6346e116a4f4ed1414174d96d2c4fbd7
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T11:45:15Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6913'
file_name: 2019_LIPIcs_Avni.pdf
file_size: 554457
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 138'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9239'
relation: later_version
status: public
scopus_import: 1
status: public
title: Bidding mechanisms in graph games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 138
year: '2019'
...
---
_id: '9726'
abstract:
- lang: eng
text: A detailed description of the two stochastic models, table of parameters,
supplementary data for Figures 4 and 5, parameter dependence of the results, and
an analysis on motors with different force–velocity functions (PDF)
article_processing_charge: No
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. Supplementary information - Collective force generation
by molecular motors is determined by strain-induced unbinding. 2019. doi:10.1021/acs.nanolett.9b04445.s001
apa: Ucar, M. C., & Lipowsky, R. (2019). Supplementary information - Collective
force generation by molecular motors is determined by strain-induced unbinding.
American Chemical Society . https://doi.org/10.1021/acs.nanolett.9b04445.s001
chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “Supplementary Information - Collective
Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.”
American Chemical Society , 2019. https://doi.org/10.1021/acs.nanolett.9b04445.s001.
ieee: M. C. Ucar and R. Lipowsky, “Supplementary information - Collective force
generation by molecular motors is determined by strain-induced unbinding.” American
Chemical Society , 2019.
ista: Ucar MC, Lipowsky R. 2019. Supplementary information - Collective force generation
by molecular motors is determined by strain-induced unbinding, American Chemical
Society , 10.1021/acs.nanolett.9b04445.s001.
mla: Ucar, Mehmet C., and Reinhard Lipowsky. Supplementary Information - Collective
Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.
American Chemical Society , 2019, doi:10.1021/acs.nanolett.9b04445.s001.
short: M.C. Ucar, R. Lipowsky, (2019).
date_created: 2021-07-27T09:51:46Z
date_published: 2019-12-19T00:00:00Z
date_updated: 2023-08-17T14:07:52Z
day: '19'
department:
- _id: EdHa
doi: 10.1021/acs.nanolett.9b04445.s001
month: '12'
oa_version: Published Version
publisher: 'American Chemical Society '
related_material:
record:
- id: '7166'
relation: used_in_publication
status: public
status: public
title: Supplementary information - Collective force generation by molecular motors
is determined by strain-induced unbinding
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2019'
...
---
_id: '6671'
abstract:
- lang: eng
text: 'In this paper we discuss three results. The first two concern general sets
of positive reach: we first characterize the reach of a closed set by means of
a bound on the metric distortion between the distance measured in the ambient
Euclidean space and the shortest path distance measured in the set. Secondly,
we prove that the intersection of a ball with radius less than the reach with
the set is geodesically convex, meaning that the shortest path between any two
points in the intersection lies itself in the intersection. For our third result
we focus on manifolds with positive reach and give a bound on the angle between
tangent spaces at two different points in terms of the reach and the distance
between the two points.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: André
full_name: Lieutier, André
last_name: Lieutier
- 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, Lieutier A, Wintraecken M. The reach, metric distortion, geodesic
convexity and the variation of tangent spaces. Journal of Applied and Computational
Topology. 2019;3(1-2):29–58. doi:10.1007/s41468-019-00029-8
apa: Boissonnat, J.-D., Lieutier, A., & Wintraecken, M. (2019). The reach, metric
distortion, geodesic convexity and the variation of tangent spaces. Journal
of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-019-00029-8
chicago: Boissonnat, Jean-Daniel, André Lieutier, and Mathijs Wintraecken. “The
Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.”
Journal of Applied and Computational Topology. Springer Nature, 2019. https://doi.org/10.1007/s41468-019-00029-8.
ieee: J.-D. Boissonnat, A. Lieutier, and M. Wintraecken, “The reach, metric distortion,
geodesic convexity and the variation of tangent spaces,” Journal of Applied
and Computational Topology, vol. 3, no. 1–2. Springer Nature, pp. 29–58, 2019.
ista: Boissonnat J-D, Lieutier A, Wintraecken M. 2019. The reach, metric distortion,
geodesic convexity and the variation of tangent spaces. Journal of Applied and
Computational Topology. 3(1–2), 29–58.
mla: Boissonnat, Jean-Daniel, et al. “The Reach, Metric Distortion, Geodesic Convexity
and the Variation of Tangent Spaces.” Journal of Applied and Computational
Topology, vol. 3, no. 1–2, Springer Nature, 2019, pp. 29–58, doi:10.1007/s41468-019-00029-8.
short: J.-D. Boissonnat, A. Lieutier, M. Wintraecken, Journal of Applied and Computational
Topology 3 (2019) 29–58.
date_created: 2019-07-24T08:37:29Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-08-22T12:37:47Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s41468-019-00029-8
ec_funded: 1
file:
- access_level: open_access
checksum: a5b244db9f751221409cf09c97ee0935
content_type: application/pdf
creator: dernst
date_created: 2019-07-31T08:09:56Z
date_updated: 2020-07-14T12:47:36Z
file_id: '6741'
file_name: 2019_JournAppliedComputTopol_Boissonnat.pdf
file_size: 2215157
relation: main_file
file_date_updated: 2020-07-14T12:47:36Z
has_accepted_license: '1'
intvolume: ' 3'
issue: 1-2
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 29–58
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: The reach, metric distortion, geodesic convexity and the variation of tangent
spaces
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: 3
year: '2019'
...
---
_id: '301'
abstract:
- lang: eng
text: A representation formula for solutions of stochastic partial differential
equations with Dirichlet boundary conditions is proved. The scope of our setting
is wide enough to cover the general situation when the backward characteristics
that appear in the usual formulation are not even defined in the Itô sense.
article_processing_charge: No
article_type: original
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: István
full_name: Gyöngy, István
last_name: Gyöngy
citation:
ama: Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems.
Stochastic Processes and their Applications. 2019;129(3):995-1012. doi:10.1016/j.spa.2018.04.003
apa: Gerencser, M., & Gyöngy, I. (2019). A Feynman–Kac formula for stochastic
Dirichlet problems. Stochastic Processes and Their Applications. Elsevier.
https://doi.org/10.1016/j.spa.2018.04.003
chicago: Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic
Dirichlet Problems.” Stochastic Processes and Their Applications. Elsevier,
2019. https://doi.org/10.1016/j.spa.2018.04.003.
ieee: M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet
problems,” Stochastic Processes and their Applications, vol. 129, no. 3.
Elsevier, pp. 995–1012, 2019.
ista: Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet
problems. Stochastic Processes and their Applications. 129(3), 995–1012.
mla: Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet
Problems.” Stochastic Processes and Their Applications, vol. 129, no. 3,
Elsevier, 2019, pp. 995–1012, doi:10.1016/j.spa.2018.04.003.
short: M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129
(2019) 995–1012.
date_created: 2018-12-11T11:45:42Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2023-08-24T14:20:49Z
day: '01'
department:
- _id: JaMa
doi: 10.1016/j.spa.2018.04.003
external_id:
arxiv:
- '1611.04177'
isi:
- '000458945300012'
intvolume: ' 129'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.04177
month: '03'
oa: 1
oa_version: Preprint
page: 995-1012
publication: Stochastic Processes and their Applications
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Feynman–Kac formula for stochastic Dirichlet problems
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 129
year: '2019'
...
---
_id: '80'
abstract:
- lang: eng
text: 'We consider an interacting, dilute Bose gas trapped in a harmonic potential
at a positive temperature. The system is analyzed in a combination of a thermodynamic
and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature
T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering
length is so small that the interaction energy per particle around the center
of the trap is of the same order of magnitude as the spectral gap in the trap.
We prove that the difference between the canonical free energy of the interacting
gas and the one of the noninteracting system can be obtained by minimizing the
GP energy functional. We also prove Bose–Einstein condensation in the following
sense: The one-particle density matrix of any approximate minimizer of the canonical
free energy functional is to leading order given by that of the noninteracting
gas but with the free condensate wavefunction replaced by the GP minimizer.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jakob
full_name: Yngvason, Jakob
last_name: Yngvason
citation:
ama: Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute,
trapped gas at positive temperature. Communications in Mathematical Physics.
2019;368(2):723-776. doi:10.1007/s00220-018-3239-0
apa: Deuchert, A., Seiringer, R., & Yngvason, J. (2019). Bose–Einstein condensation
in a dilute, trapped gas at positive temperature. Communications in Mathematical
Physics. Springer. https://doi.org/10.1007/s00220-018-3239-0
chicago: Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein
Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications
in Mathematical Physics. Springer, 2019. https://doi.org/10.1007/s00220-018-3239-0.
ieee: A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in
a dilute, trapped gas at positive temperature,” Communications in Mathematical
Physics, vol. 368, no. 2. Springer, pp. 723–776, 2019.
ista: Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a
dilute, trapped gas at positive temperature. Communications in Mathematical Physics.
368(2), 723–776.
mla: Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped
Gas at Positive Temperature.” Communications in Mathematical Physics, vol.
368, no. 2, Springer, 2019, pp. 723–76, doi:10.1007/s00220-018-3239-0.
short: A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics
368 (2019) 723–776.
date_created: 2018-12-11T11:44:31Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-08-24T14:27:51Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00220-018-3239-0
ec_funded: 1
external_id:
isi:
- '000467796800007'
file:
- access_level: open_access
checksum: c7e9880b43ac726712c1365e9f2f73a6
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:34:06Z
date_updated: 2020-07-14T12:48:07Z
file_id: '5688'
file_name: 2018_CommunMathPhys_Deuchert.pdf
file_size: 893902
relation: main_file
file_date_updated: 2020-07-14T12:48:07Z
has_accepted_license: '1'
intvolume: ' 368'
isi: 1
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 723-776
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '7974'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bose–Einstein condensation in a dilute, trapped gas at positive temperature
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: 368
year: '2019'
...
---
_id: '5911'
abstract:
- lang: eng
text: Empirical data suggest that inversions in many species contain genes important
for intraspecific divergence and speciation, yet mechanisms of evolution remain
unclear. While genes inside an inversion are tightly linked, inversions are not
static but evolve separately from the rest of the genome by new mutations, recombination
within arrangements, and gene flux between arrangements. Inversion polymorphisms
are maintained by different processes, for example, divergent or balancing selection,
or a mix of multiple processes. Moreover, the relative roles of selection, drift,
mutation, and recombination will change over the lifetime of an inversion and
within its area of distribution. We believe inversions are central to the evolution
of many species, but we need many more data and new models to understand the complex
mechanisms involved.
article_processing_charge: No
article_type: original
author:
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
citation:
ama: Faria R, Johannesson K, Butlin RK, Westram AM. Evolving inversions. Trends
in Ecology and Evolution. 2019;34(3):239-248. doi:10.1016/j.tree.2018.12.005
apa: Faria, R., Johannesson, K., Butlin, R. K., & Westram, A. M. (2019). Evolving
inversions. Trends in Ecology and Evolution. Elsevier. https://doi.org/10.1016/j.tree.2018.12.005
chicago: Faria, Rui, Kerstin Johannesson, Roger K. Butlin, and Anja M Westram. “Evolving
Inversions.” Trends in Ecology and Evolution. Elsevier, 2019. https://doi.org/10.1016/j.tree.2018.12.005.
ieee: R. Faria, K. Johannesson, R. K. Butlin, and A. M. Westram, “Evolving inversions,”
Trends in Ecology and Evolution, vol. 34, no. 3. Elsevier, pp. 239–248,
2019.
ista: Faria R, Johannesson K, Butlin RK, Westram AM. 2019. Evolving inversions.
Trends in Ecology and Evolution. 34(3), 239–248.
mla: Faria, Rui, et al. “Evolving Inversions.” Trends in Ecology and Evolution,
vol. 34, no. 3, Elsevier, 2019, pp. 239–48, doi:10.1016/j.tree.2018.12.005.
short: R. Faria, K. Johannesson, R.K. Butlin, A.M. Westram, Trends in Ecology and
Evolution 34 (2019) 239–248.
date_created: 2019-02-03T22:59:15Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2023-08-24T14:29:48Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tree.2018.12.005
ec_funded: 1
external_id:
isi:
- '000459899000013'
file:
- access_level: open_access
checksum: ef24572d6ebcc1452c067e05410cc4a2
content_type: application/pdf
creator: cziletti
date_created: 2020-01-09T10:55:58Z
date_updated: 2020-07-14T12:47:13Z
file_id: '7245'
file_name: 2019_Trends_Evolution_Faria.pdf
file_size: 1946795
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 34'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 239-248
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Trends in Ecology and Evolution
publication_identifier:
issn:
- '01695347'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolving inversions
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 34
year: '2019'
...
---
_id: '439'
abstract:
- lang: eng
text: "We count points over a finite field on wild character varieties,of Riemann
surfaces for singularities with regular semisimple leading term. The new feature
in our counting formulas is the appearance of characters of Yokonuma–Hecke algebras.
Our result leads to the conjecture that the mixed Hodge polynomials of these character
varieties agree with previously conjectured perverse Hodge polynomials of certain
twisted parabolic Higgs moduli spaces, indicating the\r\npossibility of a P =
W conjecture for a suitable wild Hitchin system."
article_processing_charge: No
article_type: original
author:
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Martin
full_name: Mereb, Martin
id: 43D735EE-F248-11E8-B48F-1D18A9856A87
last_name: Mereb
- first_name: Michael
full_name: Wong, Michael
last_name: Wong
citation:
ama: Hausel T, Mereb M, Wong M. Arithmetic and representation theory of wild character
varieties. Journal of the European Mathematical Society. 2019;21(10):2995-3052.
doi:10.4171/JEMS/896
apa: Hausel, T., Mereb, M., & Wong, M. (2019). Arithmetic and representation
theory of wild character varieties. Journal of the European Mathematical Society.
European Mathematical Society. https://doi.org/10.4171/JEMS/896
chicago: Hausel, Tamás, Martin Mereb, and Michael Wong. “Arithmetic and Representation
Theory of Wild Character Varieties.” Journal of the European Mathematical Society.
European Mathematical Society, 2019. https://doi.org/10.4171/JEMS/896.
ieee: T. Hausel, M. Mereb, and M. Wong, “Arithmetic and representation theory of
wild character varieties,” Journal of the European Mathematical Society,
vol. 21, no. 10. European Mathematical Society, pp. 2995–3052, 2019.
ista: Hausel T, Mereb M, Wong M. 2019. Arithmetic and representation theory of wild
character varieties. Journal of the European Mathematical Society. 21(10), 2995–3052.
mla: Hausel, Tamás, et al. “Arithmetic and Representation Theory of Wild Character
Varieties.” Journal of the European Mathematical Society, vol. 21, no.
10, European Mathematical Society, 2019, pp. 2995–3052, doi:10.4171/JEMS/896.
short: T. Hausel, M. Mereb, M. Wong, Journal of the European Mathematical Society
21 (2019) 2995–3052.
date_created: 2018-12-11T11:46:29Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2023-08-24T14:24:49Z
day: '01'
department:
- _id: TaHa
doi: 10.4171/JEMS/896
ec_funded: 1
external_id:
arxiv:
- '1604.03382'
isi:
- '000480413600002'
intvolume: ' 21'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.03382
month: '10'
oa: 1
oa_version: Preprint
page: 2995-3052
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Journal of the European Mathematical Society
publication_identifier:
eissn:
- 1435-9855
publication_status: published
publisher: European Mathematical Society
publist_id: '7384'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arithmetic and representation theory of wild character varieties
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 21
year: '2019'
...
---
_id: '105'
abstract:
- lang: eng
text: 'Clinical Utility Gene Card. 1. Name of Disease (Synonyms): Pontocerebellar
hypoplasia type 9 (PCH9) and spastic paraplegia-63 (SPG63). 2. OMIM# of the Disease:
615809 and 615686. 3. Name of the Analysed Genes or DNA/Chromosome Segments: AMPD2
at 1p13.3. 4. OMIM# of the Gene(s): 102771.'
acknowledgement: 'This work was supported by EuroGentest2 (Unit 2: “Genetic testing
as part of health care”), a Coordination Action under FP7 (Grant Agreement Number
261469) and the European Society of Human Genetics. We acknowledge the participation
of the patients and their families in these studies, as well as the generous financial
support of the Lefroy and Handbury families. APLM was supported by an Australian
Postgraduate Award. PJL is supported by an NHMRC Career Development Fellowship (GNT1032364).
RJL is supported by a Melbourne Children’s Clinician Scientist Fellowship.'
article_processing_charge: No
article_type: original
author:
- first_name: Ashley
full_name: Marsh, Ashley
last_name: Marsh
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Paul
full_name: Lockhart, Paul
last_name: Lockhart
- first_name: Richard
full_name: Leventer, Richard
last_name: Leventer
citation:
ama: Marsh A, Novarino G, Lockhart P, Leventer R. CUGC for pontocerebellar hypoplasia
type 9 and spastic paraplegia-63. European Journal of Human Genetics. 2019;27:161-166.
doi:10.1038/s41431-018-0231-2
apa: Marsh, A., Novarino, G., Lockhart, P., & Leventer, R. (2019). CUGC for
pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal
of Human Genetics. Springer Nature. https://doi.org/10.1038/s41431-018-0231-2
chicago: Marsh, Ashley, Gaia Novarino, Paul Lockhart, and Richard Leventer. “CUGC
for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” European
Journal of Human Genetics. Springer Nature, 2019. https://doi.org/10.1038/s41431-018-0231-2.
ieee: A. Marsh, G. Novarino, P. Lockhart, and R. Leventer, “CUGC for pontocerebellar
hypoplasia type 9 and spastic paraplegia-63,” European Journal of Human Genetics,
vol. 27. Springer Nature, pp. 161–166, 2019.
ista: Marsh A, Novarino G, Lockhart P, Leventer R. 2019. CUGC for pontocerebellar
hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics.
27, 161–166.
mla: Marsh, Ashley, et al. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic
Paraplegia-63.” European Journal of Human Genetics, vol. 27, Springer Nature,
2019, pp. 161–66, doi:10.1038/s41431-018-0231-2.
short: A. Marsh, G. Novarino, P. Lockhart, R. Leventer, European Journal of Human
Genetics 27 (2019) 161–166.
date_created: 2018-12-11T11:44:39Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-08-24T14:28:24Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s41431-018-0231-2
external_id:
isi:
- '000454111500019'
pmid:
- '30089829'
intvolume: ' 27'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41431-018-0231-2
month: '01'
oa: 1
oa_version: Published Version
page: 161-166
pmid: 1
publication: European Journal of Human Genetics
publication_status: published
publisher: Springer Nature
publist_id: '7949'
quality_controlled: '1'
scopus_import: '1'
status: public
title: CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 27
year: '2019'
...
---
_id: '65'
abstract:
- lang: eng
text: We provide an entropy formulation for porous medium-type equations with a
stochastic, non-linear, spatially inhomogeneous forcing. Well-posedness and L1-contraction
is obtained in the class of entropy solutions. Our scope allows for porous medium
operators Δ(|u|m−1u) for all m∈(1,∞), and Hölder continuous diffusion nonlinearity
with exponent 1/2.
article_processing_charge: No
article_type: original
author:
- first_name: Konstantinos
full_name: Dareiotis, Konstantinos
last_name: Dareiotis
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: Benjamin
full_name: Gess, Benjamin
last_name: Gess
citation:
ama: Dareiotis K, Gerencser M, Gess B. Entropy solutions for stochastic porous media
equations. Journal of Differential Equations. 2019;266(6):3732-3763. doi:10.1016/j.jde.2018.09.012
apa: Dareiotis, K., Gerencser, M., & Gess, B. (2019). Entropy solutions for
stochastic porous media equations. Journal of Differential Equations. Elsevier.
https://doi.org/10.1016/j.jde.2018.09.012
chicago: Dareiotis, Konstantinos, Mate Gerencser, and Benjamin Gess. “Entropy Solutions
for Stochastic Porous Media Equations.” Journal of Differential Equations.
Elsevier, 2019. https://doi.org/10.1016/j.jde.2018.09.012.
ieee: K. Dareiotis, M. Gerencser, and B. Gess, “Entropy solutions for stochastic
porous media equations,” Journal of Differential Equations, vol. 266, no.
6. Elsevier, pp. 3732–3763, 2019.
ista: Dareiotis K, Gerencser M, Gess B. 2019. Entropy solutions for stochastic porous
media equations. Journal of Differential Equations. 266(6), 3732–3763.
mla: Dareiotis, Konstantinos, et al. “Entropy Solutions for Stochastic Porous Media
Equations.” Journal of Differential Equations, vol. 266, no. 6, Elsevier,
2019, pp. 3732–63, doi:10.1016/j.jde.2018.09.012.
short: K. Dareiotis, M. Gerencser, B. Gess, Journal of Differential Equations 266
(2019) 3732–3763.
date_created: 2018-12-11T11:44:26Z
date_published: 2019-03-05T00:00:00Z
date_updated: 2023-08-24T14:30:16Z
day: '5'
department:
- _id: JaMa
doi: 10.1016/j.jde.2018.09.012
external_id:
arxiv:
- '1803.06953'
isi:
- '000456332500026'
intvolume: ' 266'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1803.06953
month: '03'
oa: 1
oa_version: Preprint
page: 3732-3763
publication: Journal of Differential Equations
publication_status: published
publisher: Elsevier
publist_id: '7989'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Entropy solutions for stochastic porous media equations
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 266
year: '2019'
...
---
_id: '5907'
abstract:
- lang: eng
text: Microalgae of the genus Chlorella vulgaris are candidates for the production
of lipids for biofuel production. Besides that, Chlorella vulgaris is marketed
as protein and vitamin rich food additive. Its potential as a novel expression
system for recombinant proteins inspired us to study its asparagine-linked oligosaccharides
(N-glycans) by mass spectrometry, chromatography and gas chromatography. Oligomannosidic
N-glycans with up to nine mannoses were the structures found in culture collection
strains as well as several commercial products. These glycans co-eluted with plant
N-glycans in the highly shape selective porous graphitic carbon chromatography.
Thus, Chlorella vulgaris generates oligomannosidic N-glycans of the structural
type known from land plants and animals. In fact, Man5 (Man5GlcNAc2) served as
substrate for GlcNAc-transferase I and a trace of an endogenous structure with
terminal GlcNAc was seen. The unusual more linear Man5 structure recently found
on glycoproteins of Chlamydomonas reinhardtii occurred - if at all - in traces
only. Notably, a majority of the oligomannosidic glycans was multiply O-methylated
with 3-O-methyl and 3,6-di-O-methyl mannoses at the non-reducing termini. This
modification has so far been neither found on plant nor vertebrate N-glycans.
It’s possible immunogenicity raises concerns as to the use of C. vulgaris for
production of pharmaceutical glycoproteins.
article_number: '331'
article_processing_charge: No
author:
- first_name: Réka
full_name: Mócsai, Réka
last_name: Mócsai
- first_name: Rudolf
full_name: Figl, Rudolf
last_name: Figl
- first_name: Clemens
full_name: Troschl, Clemens
last_name: Troschl
- first_name: Richard
full_name: Strasser, Richard
last_name: Strasser
- first_name: Elisabeth
full_name: Svehla, Elisabeth
last_name: Svehla
- first_name: Markus
full_name: Windwarder, Markus
last_name: Windwarder
- first_name: Andreas
full_name: Thader, Andreas
id: 3A18A7B8-F248-11E8-B48F-1D18A9856A87
last_name: Thader
- first_name: Friedrich
full_name: Altmann, Friedrich
last_name: Altmann
citation:
ama: Mócsai R, Figl R, Troschl C, et al. N-glycans of the microalga Chlorella vulgaris
are of the oligomannosidic type but highly methylated. Scientific Reports.
2019;9(1). doi:10.1038/s41598-018-36884-1
apa: Mócsai, R., Figl, R., Troschl, C., Strasser, R., Svehla, E., Windwarder, M.,
… Altmann, F. (2019). N-glycans of the microalga Chlorella vulgaris are of the
oligomannosidic type but highly methylated. Scientific Reports. Nature
Publishing Group. https://doi.org/10.1038/s41598-018-36884-1
chicago: Mócsai, Réka, Rudolf Figl, Clemens Troschl, Richard Strasser, Elisabeth
Svehla, Markus Windwarder, Andreas Thader, and Friedrich Altmann. “N-Glycans of
the Microalga Chlorella Vulgaris Are of the Oligomannosidic Type but Highly Methylated.”
Scientific Reports. Nature Publishing Group, 2019. https://doi.org/10.1038/s41598-018-36884-1.
ieee: R. Mócsai et al., “N-glycans of the microalga Chlorella vulgaris are
of the oligomannosidic type but highly methylated,” Scientific Reports,
vol. 9, no. 1. Nature Publishing Group, 2019.
ista: Mócsai R, Figl R, Troschl C, Strasser R, Svehla E, Windwarder M, Thader A,
Altmann F. 2019. N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic
type but highly methylated. Scientific Reports. 9(1), 331.
mla: Mócsai, Réka, et al. “N-Glycans of the Microalga Chlorella Vulgaris Are of
the Oligomannosidic Type but Highly Methylated.” Scientific Reports, vol.
9, no. 1, 331, Nature Publishing Group, 2019, doi:10.1038/s41598-018-36884-1.
short: R. Mócsai, R. Figl, C. Troschl, R. Strasser, E. Svehla, M. Windwarder, A.
Thader, F. Altmann, Scientific Reports 9 (2019).
date_created: 2019-02-03T22:59:13Z
date_published: 2019-01-23T00:00:00Z
date_updated: 2023-08-24T14:33:16Z
day: '23'
ddc:
- '580'
department:
- _id: FlSc
doi: 10.1038/s41598-018-36884-1
external_id:
isi:
- '000456392400012'
file:
- access_level: open_access
checksum: 4129c7d7663d1f8a1edf8c4232372f66
content_type: application/pdf
creator: dernst
date_created: 2019-02-05T13:10:02Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5923'
file_name: 2019_ScientificReports_Mocsai.pdf
file_size: 2124292
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
quality_controlled: '1'
scopus_import: '1'
status: public
title: N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type
but highly methylated
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: 9
year: '2019'
...
---
_id: '5908'
abstract:
- lang: eng
text: The interorganelle communication mediated by membrane contact sites (MCSs)
is an evolutionary hallmark of eukaryotic cells. MCS connections enable the nonvesicular
exchange of information between organelles and allow them to coordinate responses
to changing cellular environments. In plants, the importance of MCS components
in the responses to environmental stress has been widely established, but the
molecular mechanisms regulating interorganelle connectivity during stress still
remain opaque. In this report, we use the model plant Arabidopsis thaliana to
show that ionic stress increases endoplasmic reticulum (ER)–plasma membrane (PM)
connectivity by promoting the cortical expansion of synaptotagmin 1 (SYT1)-enriched
ER–PM contact sites (S-EPCSs). We define differential roles for the cortical cytoskeleton
in the regulation of S-EPCS dynamics and ER–PM connectivity, and we identify the
accumulation of phosphatidylinositol 4,5-bisphosphate [PI(4,5)P2] at the PM as
a molecular signal associated with the ER–PM connectivity changes. Our study highlights
the functional conservation of EPCS components and PM phosphoinositides as modulators
of ER–PM connectivity in eukaryotes, and uncovers unique aspects of the spatiotemporal
regulation of ER–PM connectivity in plants.
article_processing_charge: No
article_type: original
author:
- first_name: Eunkyoung
full_name: Lee, Eunkyoung
last_name: Lee
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Jessica
full_name: Pérez-Sancho, Jessica
last_name: Pérez-Sancho
- first_name: Francisco
full_name: Benitez-Fuente, Francisco
last_name: Benitez-Fuente
- first_name: Matthew
full_name: Strelau, Matthew
last_name: Strelau
- first_name: Alberto P.
full_name: Macho, Alberto P.
last_name: Macho
- first_name: Miguel A.
full_name: Botella, Miguel A.
last_name: Botella
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Abel
full_name: Rosado, Abel
last_name: Rosado
citation:
ama: Lee E, Vanneste S, Pérez-Sancho J, et al. Ionic stress enhances ER–PM connectivity
via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis. Proceedings
of the National Academy of Sciences of the United States of America. 2019;116(4):1420-1429.
doi:10.1073/pnas.1818099116
apa: Lee, E., Vanneste, S., Pérez-Sancho, J., Benitez-Fuente, F., Strelau, M., Macho,
A. P., … Rosado, A. (2019). Ionic stress enhances ER–PM connectivity via phosphoinositide-associated
SYT1 contact site expansion in Arabidopsis. Proceedings of the National Academy
of Sciences of the United States of America. National Academy of Sciences.
https://doi.org/10.1073/pnas.1818099116
chicago: Lee, Eunkyoung, Steffen Vanneste, Jessica Pérez-Sancho, Francisco Benitez-Fuente,
Matthew Strelau, Alberto P. Macho, Miguel A. Botella, Jiří Friml, and Abel Rosado.
“Ionic Stress Enhances ER–PM Connectivity via Phosphoinositide-Associated SYT1
Contact Site Expansion in Arabidopsis.” Proceedings of the National Academy
of Sciences of the United States of America. National Academy of Sciences,
2019. https://doi.org/10.1073/pnas.1818099116.
ieee: E. Lee et al., “Ionic stress enhances ER–PM connectivity via phosphoinositide-associated
SYT1 contact site expansion in Arabidopsis,” Proceedings of the National Academy
of Sciences of the United States of America, vol. 116, no. 4. National Academy
of Sciences, pp. 1420–1429, 2019.
ista: Lee E, Vanneste S, Pérez-Sancho J, Benitez-Fuente F, Strelau M, Macho AP,
Botella MA, Friml J, Rosado A. 2019. Ionic stress enhances ER–PM connectivity
via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis. Proceedings
of the National Academy of Sciences of the United States of America. 116(4), 1420–1429.
mla: Lee, Eunkyoung, et al. “Ionic Stress Enhances ER–PM Connectivity via Phosphoinositide-Associated
SYT1 Contact Site Expansion in Arabidopsis.” Proceedings of the National Academy
of Sciences of the United States of America, vol. 116, no. 4, National Academy
of Sciences, 2019, pp. 1420–29, doi:10.1073/pnas.1818099116.
short: E. Lee, S. Vanneste, J. Pérez-Sancho, F. Benitez-Fuente, M. Strelau, A.P.
Macho, M.A. Botella, J. Friml, A. Rosado, Proceedings of the National Academy
of Sciences of the United States of America 116 (2019) 1420–1429.
date_created: 2019-02-03T22:59:14Z
date_published: 2019-01-22T00:00:00Z
date_updated: 2023-08-24T14:31:09Z
day: '22'
department:
- _id: JiFr
doi: 10.1073/pnas.1818099116
external_id:
isi:
- '000456336100050'
pmid:
- '30610176'
intvolume: ' 116'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1818099116
month: '01'
oa: 1
oa_version: Published Version
page: 1420-1429
pmid: 1
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1
contact site expansion in Arabidopsis
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 116
year: '2019'
...
---
_id: '5680'
abstract:
- lang: eng
text: Pollinators display a remarkable diversity of foraging strategies with flowering
plants, from primarily mutualistic interactions to cheating through nectar robbery.
Despite numerous studies on the effect of nectar robbing on components of plant
fitness, its contribution to reproductive isolation is unclear. We experimentally
tested the impact of different pollinator strategies in a natural hybrid zone
between two subspecies of Antirrhinum majus with alternate flower colour guides.
On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus
(magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral
visitors at different time points during the flowering season. Using long-run
camera surveys, we quantify the impact of nectar robbing on the number of flowers
visited per inflorescence and the flower probing time. We further experimentally
tested the effect of nectar robbing on female reproductive success by manipulating
the intensity of robbing. While robbing increased over time the number of legitimate
visitors tended to decrease concomitantly. We found that the number of flowers
pollinated on a focal inflorescence decreased with the number of prior robbing
events. However, in the manipulative experiment, fruit set and fruit volume did
not vary significantly between low robbing and control treatments. Our findings
challenge the idea that robbers have a negative impact on plant fitness through
female function. This study also adds to our understanding of the components of
pollinator-mediated reproductive isolation and the maintenance of Antirrhinum
hybrid zones.
article_processing_charge: No
author:
- first_name: Christophe
full_name: Andalo, Christophe
last_name: Andalo
- first_name: Monique
full_name: Burrus, Monique
last_name: Burrus
- first_name: Sandrine
full_name: Paute, Sandrine
last_name: Paute
- first_name: Christine
full_name: Lauzeral, Christine
last_name: Lauzeral
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: Andalo C, Burrus M, Paute S, Lauzeral C, Field D. Prevalence of legitimate
pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum
majus hybrid zone. Botany Letters. 2019;166(1):80-92. doi:10.1080/23818107.2018.1545142
apa: Andalo, C., Burrus, M., Paute, S., Lauzeral, C., & Field, D. (2019). Prevalence
of legitimate pollinators and nectar robbers and the consequences for fruit set
in an Antirrhinum majus hybrid zone. Botany Letters. Taylor and Francis.
https://doi.org/10.1080/23818107.2018.1545142
chicago: Andalo, Christophe, Monique Burrus, Sandrine Paute, Christine Lauzeral,
and David Field. “Prevalence of Legitimate Pollinators and Nectar Robbers and
the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” Botany
Letters. Taylor and Francis, 2019. https://doi.org/10.1080/23818107.2018.1545142.
ieee: C. Andalo, M. Burrus, S. Paute, C. Lauzeral, and D. Field, “Prevalence of
legitimate pollinators and nectar robbers and the consequences for fruit set in
an Antirrhinum majus hybrid zone,” Botany Letters, vol. 166, no. 1. Taylor
and Francis, pp. 80–92, 2019.
ista: Andalo C, Burrus M, Paute S, Lauzeral C, Field D. 2019. Prevalence of legitimate
pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum
majus hybrid zone. Botany Letters. 166(1), 80–92.
mla: Andalo, Christophe, et al. “Prevalence of Legitimate Pollinators and Nectar
Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.”
Botany Letters, vol. 166, no. 1, Taylor and Francis, 2019, pp. 80–92, doi:10.1080/23818107.2018.1545142.
short: C. Andalo, M. Burrus, S. Paute, C. Lauzeral, D. Field, Botany Letters 166
(2019) 80–92.
date_created: 2018-12-16T22:59:20Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-08-24T14:34:12Z
day: '01'
department:
- _id: NiBa
doi: 10.1080/23818107.2018.1545142
external_id:
isi:
- '000463802800009'
intvolume: ' 166'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 80-92
publication: Botany Letters
publication_identifier:
eissn:
- '23818115'
issn:
- '23818107'
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Prevalence of legitimate pollinators and nectar robbers and the consequences
for fruit set in an Antirrhinum majus hybrid zone
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 166
year: '2019'
...
---
_id: '5790'
abstract:
- lang: eng
text: The partial representation extension problem is a recently introduced generalization
of the recognition problem. A circle graph is an intersection graph of chords
of a circle. We study the partial representation extension problem for circle
graphs, where the input consists of a graph G and a partial representation R′
giving some predrawn chords that represent an induced subgraph of G. The question
is whether one can extend R′ to a representation R of the entire graph G, that
is, whether one can draw the remaining chords into a partially predrawn representation
to obtain a representation of G. Our main result is an O(n3) time algorithm for
partial representation extension of circle graphs, where n is the number of vertices.
To show this, we describe the structure of all representations of a circle graph
using split decomposition. This can be of independent interest.
article_processing_charge: No
article_type: original
author:
- first_name: Steven
full_name: Chaplick, Steven
last_name: Chaplick
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Pavel
full_name: Klavík, Pavel
last_name: Klavík
citation:
ama: Chaplick S, Fulek R, Klavík P. Extending partial representations of circle
graphs. Journal of Graph Theory. 2019;91(4):365-394. doi:10.1002/jgt.22436
apa: Chaplick, S., Fulek, R., & Klavík, P. (2019). Extending partial representations
of circle graphs. Journal of Graph Theory. Wiley. https://doi.org/10.1002/jgt.22436
chicago: Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial
Representations of Circle Graphs.” Journal of Graph Theory. Wiley, 2019.
https://doi.org/10.1002/jgt.22436.
ieee: S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of
circle graphs,” Journal of Graph Theory, vol. 91, no. 4. Wiley, pp. 365–394,
2019.
ista: Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of
circle graphs. Journal of Graph Theory. 91(4), 365–394.
mla: Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.”
Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
short: S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.
date_created: 2018-12-30T22:59:15Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-08-24T14:30:43Z
day: '01'
department:
- _id: UlWa
doi: 10.1002/jgt.22436
ec_funded: 1
external_id:
arxiv:
- '1309.2399'
isi:
- '000485392800004'
intvolume: ' 91'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2399
month: '08'
oa: 1
oa_version: Preprint
page: 365-394
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Graph Theory
publication_identifier:
issn:
- '03649024'
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extending partial representations of circle graphs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 91
year: '2019'
...
---
_id: '405'
abstract:
- lang: eng
text: We investigate the quantum Jensen divergences from the viewpoint of joint
convexity. It turns out that the set of the functions which generate jointly convex
quantum Jensen divergences on positive matrices coincides with the Matrix Entropy
Class which has been introduced by Chen and Tropp quite recently.
acknowledgement: The author was supported by the ISTFELLOW program of the Institute
of Science and Technology Austria (project code IC1027FELL01) and partially supported
by the Hungarian National Research, Development and Innovation Office – NKFIH (grant
no. K124152)
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Virosztek, Daniel
id: 48DB45DA-F248-11E8-B48F-1D18A9856A87
last_name: Virosztek
orcid: 0000-0003-1109-5511
citation:
ama: Virosztek D. Jointly convex quantum Jensen divergences. Linear Algebra and
Its Applications. 2019;576:67-78. doi:10.1016/j.laa.2018.03.002
apa: Virosztek, D. (2019). Jointly convex quantum Jensen divergences. Linear
Algebra and Its Applications. Elsevier. https://doi.org/10.1016/j.laa.2018.03.002
chicago: Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear
Algebra and Its Applications. Elsevier, 2019. https://doi.org/10.1016/j.laa.2018.03.002.
ieee: D. Virosztek, “Jointly convex quantum Jensen divergences,” Linear Algebra
and Its Applications, vol. 576. Elsevier, pp. 67–78, 2019.
ista: Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra
and Its Applications. 576, 67–78.
mla: Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra
and Its Applications, vol. 576, Elsevier, 2019, pp. 67–78, doi:10.1016/j.laa.2018.03.002.
short: D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78.
date_created: 2018-12-11T11:46:17Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2023-08-24T14:31:47Z
day: '01'
department:
- _id: LaEr
doi: 10.1016/j.laa.2018.03.002
ec_funded: 1
external_id:
arxiv:
- '1712.05324'
isi:
- '000470955300005'
intvolume: ' 576'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.05324
month: '09'
oa: 1
oa_version: Preprint
page: 67-78
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Linear Algebra and Its Applications
publication_status: published
publisher: Elsevier
publist_id: '7424'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Jointly convex quantum Jensen divergences
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 576
year: '2019'
...
---
_id: '175'
abstract:
- lang: eng
text: An upper bound sieve for rational points on suitable varieties isdeveloped,
together with applications tocounting rational points in thin sets,to local solubility
in families, and to the notion of “friable” rational pointswith respect to divisors.
In the special case of quadrics, sharper estimates areobtained by developing a
version of the Selberg sieve for rational points.
article_processing_charge: No
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: Daniel
full_name: Loughran, Daniel
last_name: Loughran
citation:
ama: Browning TD, Loughran D. Sieving rational points on varieties. Transactions
of the American Mathematical Society. 2019;371(8):5757-5785. doi:10.1090/tran/7514
apa: Browning, T. D., & Loughran, D. (2019). Sieving rational points on varieties.
Transactions of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/tran/7514
chicago: Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.”
Transactions of the American Mathematical Society. American Mathematical
Society, 2019. https://doi.org/10.1090/tran/7514.
ieee: T. D. Browning and D. Loughran, “Sieving rational points on varieties,” Transactions
of the American Mathematical Society, vol. 371, no. 8. American Mathematical
Society, pp. 5757–5785, 2019.
ista: Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions
of the American Mathematical Society. 371(8), 5757–5785.
mla: Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.”
Transactions of the American Mathematical Society, vol. 371, no. 8, American
Mathematical Society, 2019, pp. 5757–85, doi:10.1090/tran/7514.
short: T.D. Browning, D. Loughran, Transactions of the American Mathematical Society
371 (2019) 5757–5785.
date_created: 2018-12-11T11:45:01Z
date_published: 2019-04-15T00:00:00Z
date_updated: 2023-08-24T14:34:56Z
day: '15'
department:
- _id: TiBr
doi: 10.1090/tran/7514
external_id:
arxiv:
- '1705.01999'
isi:
- '000464034200019'
intvolume: ' 371'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.01999
month: '04'
oa: 1
oa_version: Preprint
page: 5757-5785
publication: Transactions of the American Mathematical Society
publication_identifier:
eissn:
- '10886850'
issn:
- '00029947'
publication_status: published
publisher: American Mathematical Society
publist_id: '7746'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sieving rational points on varieties
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 371
year: '2019'
...
---
_id: '319'
abstract:
- lang: eng
text: We study spaces of modelled distributions with singular behaviour near the
boundary of a domain that, in the context of the theory of regularity structures,
allow one to give robust solution theories for singular stochastic PDEs with boundary
conditions. The calculus of modelled distributions established in Hairer (Invent
Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended
to this setting. We formulate and solve fixed point problems in these spaces with
a class of kernels that is sufficiently large to cover in particular the Dirichlet
and Neumann heat kernels. These results are then used to provide solution theories
for the KPZ equation with Dirichlet and Neumann boundary conditions and for the
2D generalised parabolic Anderson model with Dirichlet boundary conditions. In
the case of the KPZ equation with Neumann boundary conditions, we show that, depending
on the class of mollifiers one considers, a “boundary renormalisation” takes place.
In other words, there are situations in which a certain boundary condition is
applied to an approximation to the KPZ equation, but the limiting process is the
Hopf–Cole solution to the KPZ equation with a different boundary condition.
acknowledgement: "MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n"
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: Martin
full_name: Hairer, Martin
last_name: Hairer
citation:
ama: Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. Probability
Theory and Related Fields. 2019;173(3-4):697–758. doi:10.1007/s00440-018-0841-1
apa: Gerencser, M., & Hairer, M. (2019). Singular SPDEs in domains with boundaries.
Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0841-1
chicago: Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.”
Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0841-1.
ieee: M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” Probability
Theory and Related Fields, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.
ista: Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability
Theory and Related Fields. 173(3–4), 697–758.
mla: Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.”
Probability Theory and Related Fields, vol. 173, no. 3–4, Springer, 2019,
pp. 697–758, doi:10.1007/s00440-018-0841-1.
short: M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019)
697–758.
date_created: 2018-12-11T11:45:48Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2023-08-24T14:38:32Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00440-018-0841-1
external_id:
isi:
- '000463613800001'
file:
- access_level: open_access
checksum: 288d16ef7291242f485a9660979486e3
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:25:24Z
date_updated: 2020-07-14T12:46:03Z
file_id: '5722'
file_name: 2018_ProbTheory_Gerencser.pdf
file_size: 893182
relation: main_file
file_date_updated: 2020-07-14T12:46:03Z
has_accepted_license: '1'
intvolume: ' 173'
isi: 1
issue: 3-4
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 697–758
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Probability Theory and Related Fields
publication_identifier:
eissn:
- '14322064'
issn:
- '01788051'
publication_status: published
publisher: Springer
publist_id: '7546'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Singular SPDEs in domains with boundaries
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: 173
year: '2019'
...
---
_id: '429'
abstract:
- lang: eng
text: We consider real symmetric or complex hermitian random matrices with correlated
entries. We prove local laws for the resolvent and universality of the local eigenvalue
statistics in the bulk of the spectrum. The correlations have fast decay but are
otherwise of general form. The key novelty is the detailed stability analysis
of the corresponding matrix valued Dyson equation whose solution is the deterministic
limit of the resolvent.
acknowledgement: "Open access funding provided by Institute of Science and Technology
(IST Austria).\r\n"
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random
matrices with correlations. Probability Theory and Related Fields. 2019;173(1-2):293–373.
doi:10.1007/s00440-018-0835-z
apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2019). Stability of the matrix
Dyson equation and random matrices with correlations. Probability Theory and
Related Fields. Springer. https://doi.org/10.1007/s00440-018-0835-z
chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the
Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory
and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0835-z.
ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation
and random matrices with correlations,” Probability Theory and Related Fields,
vol. 173, no. 1–2. Springer, pp. 293–373, 2019.
ista: Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation
and random matrices with correlations. Probability Theory and Related Fields.
173(1–2), 293–373.
mla: Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random
Matrices with Correlations.” Probability Theory and Related Fields, vol.
173, no. 1–2, Springer, 2019, pp. 293–373, doi:10.1007/s00440-018-0835-z.
short: O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields
173 (2019) 293–373.
date_created: 2018-12-11T11:46:25Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2023-08-24T14:39:00Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1007/s00440-018-0835-z
ec_funded: 1
external_id:
isi:
- '000459396500007'
file:
- access_level: open_access
checksum: f9354fa5c71f9edd17132588f0dc7d01
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:12:08Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5720'
file_name: 2018_ProbTheory_Ajanki.pdf
file_size: 1201840
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
intvolume: ' 173'
isi: 1
issue: 1-2
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 293–373
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Probability Theory and Related Fields
publication_identifier:
eissn:
- '14322064'
issn:
- '01788051'
publication_status: published
publisher: Springer
publist_id: '7394'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stability of the matrix Dyson equation and random matrices with correlations
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: 173
year: '2019'
...
---
_id: '5947'
abstract:
- lang: eng
text: Graph algorithms applied in many applications, including social networks,
communication networks, VLSI design, graphics, and several others, require dynamic
modifications - addition and removal of vertices and/or edges - in the graph.
This paper presents a novel concurrent non-blocking algorithm to implement a dynamic
unbounded directed graph in a shared-memory machine. The addition and removal
operations of vertices and edges are lock-free. For a finite sized graph, the
lookup operations are wait-free. Most significant component of the presented algorithm
is the reachability query in a concurrent graph. The reachability queries in our
algorithm are obstruction-free and thus impose minimal additional synchronization
cost over other operations. We prove that each of the data structure operations
are linearizable. We extensively evaluate a sample C/C++ implementation of the
algorithm through a number of micro-benchmarks. The experimental results show
that the proposed algorithm scales well with the number of threads and on an average
provides 5 to 7x performance improvement over a concurrent graph implementation
using coarse-grained locking.
article_processing_charge: No
author:
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Sathya
full_name: Peri, Sathya
last_name: Peri
- first_name: Muktikanta
full_name: Sa, Muktikanta
last_name: Sa
- first_name: Nandini
full_name: Singhal, Nandini
last_name: Singhal
citation:
ama: 'Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking
unbounded graph with linearizable reachability queries. In: ACM International
Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617'
apa: 'Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical
concurrent non-blocking unbounded graph with linearizable reachability queries.
In ACM International Conference Proceeding Series (pp. 168–177). Bangalore,
India: ACM. https://doi.org/10.1145/3288599.3288617'
chicago: Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple
and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability
Queries.” In ACM International Conference Proceeding Series, 168–77. ACM,
2019. https://doi.org/10.1145/3288599.3288617.
ieee: B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent
non-blocking unbounded graph with linearizable reachability queries,” in ACM
International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
ista: 'Chatterjee B, Peri S, Sa M, Singhal N. 2019. A simple and practical concurrent
non-blocking unbounded graph with linearizable reachability queries. ACM International
Conference Proceeding Series. ICDCN: Conference on Distributed Computing and Networking,
168–177.'
mla: Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded
Graph with Linearizable Reachability Queries.” ACM International Conference
Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
short: B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference
Proceeding Series, ACM, 2019, pp. 168–177.
conference:
end_date: 2019-01-07
location: Bangalore, India
name: 'ICDCN: Conference on Distributed Computing and Networking'
start_date: 2019-01-04
date_created: 2019-02-10T22:59:17Z
date_published: 2019-01-04T00:00:00Z
date_updated: 2023-08-24T14:41:53Z
day: '04'
department:
- _id: DaAl
doi: 10.1145/3288599.3288617
external_id:
arxiv:
- '1809.00896'
isi:
- '000484491600019'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.00896
month: '01'
oa: 1
oa_version: Preprint
page: 168-177
publication: ACM International Conference Proceeding Series
publication_identifier:
isbn:
- '978-1-4503-6094-4 '
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple and practical concurrent non-blocking unbounded graph with linearizable
reachability queries
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '5857'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1),
and that this bound is best possible for infinitely many values of n.'
article_processing_charge: No
article_type: original
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics.
2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025'
apa: 'Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete
Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”
Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied
Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.'
ista: 'Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied
Mathematics. 259(4), 266–231.'
mla: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete
Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.'
short: R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.
date_created: 2019-01-20T22:59:17Z
date_published: 2019-04-30T00:00:00Z
date_updated: 2023-08-24T14:39:33Z
day: '30'
department:
- _id: UlWa
doi: 10.1016/j.dam.2018.12.025
external_id:
arxiv:
- '1708.08037'
isi:
- '000466061100020'
intvolume: ' 259'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '04'
oa: 1
oa_version: Preprint
page: 266-231
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166218X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '433'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Thrackles: An improved upper bound'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 259
year: '2019'
...
---
_id: '5944'
abstract:
- lang: eng
text: Understanding the thermodynamics of the duplication process is a fundamental
step towards a comprehensive physical theory of biological systems. However, the
immense complexity of real cells obscures the fundamental tensions between energy
gradients and entropic contributions that underlie duplication. The study of synthetic,
feasible systems reproducing part of the key ingredients of living entities but
overcoming major sources of biological complexity is of great relevance to deepen
the comprehension of the fundamental thermodynamic processes underlying life and
its prevalence. In this paper an abstract—yet realistic—synthetic system made
of small synthetic protocell aggregates is studied in detail. A fundamental relation
between free energy and entropic gradients is derived for a general, non-equilibrium
scenario, setting the thermodynamic conditions for the occurrence and prevalence
of duplication phenomena. This relation sets explicitly how the energy gradients
invested in creating and maintaining structural—and eventually, functional—elements
of the system must always compensate the entropic gradients, whose contributions
come from changes in the translational, configurational, and macrostate entropies,
as well as from dissipation due to irreversible transitions. Work/energy relations
are also derived, defining lower bounds on the energy required for the duplication
event to take place. A specific example including real ternary emulsions is provided
in order to grasp the orders of magnitude involved in the problem. It is found
that the minimal work invested over the system to trigger a duplication event
is around ~ 10−13J , which results, in the case of duplication of all the vesicles
contained in a liter of emulsion, in an amount of energy around ~ 1kJ . Without
aiming to describe a truly biological process of duplication, this theoretical
contribution seeks to explicitly define and identify the key actors that participate
in it.
article_number: '9'
article_processing_charge: No
author:
- first_name: Bernat
full_name: Corominas-Murtra, Bernat
id: 43BE2298-F248-11E8-B48F-1D18A9856A87
last_name: Corominas-Murtra
orcid: 0000-0001-9806-5643
citation:
ama: Corominas-Murtra B. Thermodynamics of duplication thresholds in synthetic protocell
systems. Life. 2019;9(1). doi:10.3390/life9010009
apa: Corominas-Murtra, B. (2019). Thermodynamics of duplication thresholds in synthetic
protocell systems. Life. MDPI. https://doi.org/10.3390/life9010009
chicago: Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in
Synthetic Protocell Systems.” Life. MDPI, 2019. https://doi.org/10.3390/life9010009.
ieee: B. Corominas-Murtra, “Thermodynamics of duplication thresholds in synthetic
protocell systems,” Life, vol. 9, no. 1. MDPI, 2019.
ista: Corominas-Murtra B. 2019. Thermodynamics of duplication thresholds in synthetic
protocell systems. Life. 9(1), 9.
mla: Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in Synthetic
Protocell Systems.” Life, vol. 9, no. 1, 9, MDPI, 2019, doi:10.3390/life9010009.
short: B. Corominas-Murtra, Life 9 (2019).
date_created: 2019-02-10T22:59:15Z
date_published: 2019-01-15T00:00:00Z
date_updated: 2023-08-24T14:43:41Z
day: '15'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.3390/life9010009
external_id:
isi:
- '000464125500001'
file:
- access_level: open_access
checksum: 7d2322cd96ace41959909b66702d5cf4
content_type: application/pdf
creator: dernst
date_created: 2019-02-11T10:45:27Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5951'
file_name: 2019_Life_Corominas.pdf
file_size: 963454
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Life
publication_identifier:
eissn:
- '20751729'
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thermodynamics of duplication thresholds in synthetic protocell 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: 9
year: '2019'
...
---
_id: '6029'
abstract:
- lang: eng
text: Protein micropatterning has become an important tool for many biomedical applications
as well as in academic research. Current techniques that allow to reduce the feature
size of patterns below 1 μm are, however, often costly and require sophisticated
equipment. We present here a straightforward and convenient method to generate
highly condensed nanopatterns of proteins without the need for clean room facilities
or expensive equipment. Our approach is based on nanocontact printing and allows
for the fabrication of protein patterns with feature sizes of 80 nm and periodicities
down to 140 nm. This was made possible by the use of the material X-poly(dimethylsiloxane)
(X-PDMS) in a two-layer stamp layout for protein printing. In a proof of principle,
different proteins at various scales were printed and the pattern quality was
evaluated by atomic force microscopy (AFM) and super-resolution fluorescence microscopy.
article_number: '655'
article_processing_charge: No
author:
- first_name: Marco
full_name: Lindner, Marco
last_name: Lindner
- first_name: Aliz
full_name: Tresztenyak, Aliz
last_name: Tresztenyak
- first_name: Gergö
full_name: Fülöp, Gergö
last_name: Fülöp
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
- first_name: Adrian
full_name: Prinz, Adrian
last_name: Prinz
- first_name: Iris
full_name: Prinz, Iris
last_name: Prinz
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Gerhard J.
full_name: Schütz, Gerhard J.
last_name: Schütz
- first_name: Eva
full_name: Sevcsik, Eva
last_name: Sevcsik
citation:
ama: Lindner M, Tresztenyak A, Fülöp G, et al. A fast and simple contact printing
approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 2019;6.
doi:10.3389/fchem.2018.00655
apa: Lindner, M., Tresztenyak, A., Fülöp, G., Jahr, W., Prinz, A., Prinz, I., …
Sevcsik, E. (2019). A fast and simple contact printing approach to generate 2D
protein nanopatterns. Frontiers in Chemistry. Frontiers Media S.A. https://doi.org/10.3389/fchem.2018.00655
chicago: Lindner, Marco, Aliz Tresztenyak, Gergö Fülöp, Wiebke Jahr, Adrian Prinz,
Iris Prinz, Johann G Danzl, Gerhard J. Schütz, and Eva Sevcsik. “A Fast and Simple
Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in
Chemistry. Frontiers Media S.A., 2019. https://doi.org/10.3389/fchem.2018.00655.
ieee: M. Lindner et al., “A fast and simple contact printing approach to
generate 2D protein nanopatterns,” Frontiers in Chemistry, vol. 6. Frontiers
Media S.A., 2019.
ista: Lindner M, Tresztenyak A, Fülöp G, Jahr W, Prinz A, Prinz I, Danzl JG, Schütz
GJ, Sevcsik E. 2019. A fast and simple contact printing approach to generate 2D
protein nanopatterns. Frontiers in Chemistry. 6, 655.
mla: Lindner, Marco, et al. “A Fast and Simple Contact Printing Approach to Generate
2D Protein Nanopatterns.” Frontiers in Chemistry, vol. 6, 655, Frontiers
Media S.A., 2019, doi:10.3389/fchem.2018.00655.
short: M. Lindner, A. Tresztenyak, G. Fülöp, W. Jahr, A. Prinz, I. Prinz, J.G. Danzl,
G.J. Schütz, E. Sevcsik, Frontiers in Chemistry 6 (2019).
date_created: 2019-02-17T22:59:24Z
date_published: 2019-01-24T00:00:00Z
date_updated: 2023-08-24T14:45:38Z
day: '24'
ddc:
- '540'
department:
- _id: JoDa
doi: 10.3389/fchem.2018.00655
external_id:
isi:
- '000456718000001'
file:
- access_level: open_access
checksum: 7841301d7c53b56ef873791b4b6f7b24
content_type: application/pdf
creator: dernst
date_created: 2019-02-18T15:10:34Z
date_updated: 2020-07-14T12:47:17Z
file_id: '6039'
file_name: 2019_frontiers_Lindner.pdf
file_size: 1766820
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Frontiers in Chemistry
publication_identifier:
eissn:
- '22962646'
publication_status: published
publisher: Frontiers Media S.A.
quality_controlled: '1'
scopus_import: '1'
status: public
title: A fast and simple contact printing approach to generate 2D protein nanopatterns
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: 6
year: '2019'
...
---
_id: '6028'
abstract:
- lang: eng
text: We give a construction allowing us to build local renormalized solutions to
general quasilinear stochastic PDEs within the theory of regularity structures,
thus greatly generalizing the recent results of [1, 5, 11]. Loosely speaking,
our construction covers quasilinear variants of all classes of equations for which
the general construction of [3, 4, 7] applies, including in particular one‐dimensional
systems with KPZ‐type nonlinearities driven by space‐time white noise. In a less
singular and more specific case, we furthermore show that the counterterms introduced
by the renormalization procedure are given by local functionals of the solution.
The main feature of our construction is that it allows exploitation of a number
of existing results developed for the semilinear case, so that the number of additional
arguments it requires is relatively small.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: Martin
full_name: Hairer, Martin
last_name: Hairer
citation:
ama: Gerencser M, Hairer M. A solution theory for quasilinear singular SPDEs. Communications
on Pure and Applied Mathematics. 2019;72(9):1983-2005. doi:10.1002/cpa.21816
apa: Gerencser, M., & Hairer, M. (2019). A solution theory for quasilinear singular
SPDEs. Communications on Pure and Applied Mathematics. Wiley. https://doi.org/10.1002/cpa.21816
chicago: Gerencser, Mate, and Martin Hairer. “A Solution Theory for Quasilinear
Singular SPDEs.” Communications on Pure and Applied Mathematics. Wiley,
2019. https://doi.org/10.1002/cpa.21816.
ieee: M. Gerencser and M. Hairer, “A solution theory for quasilinear singular SPDEs,”
Communications on Pure and Applied Mathematics, vol. 72, no. 9. Wiley,
pp. 1983–2005, 2019.
ista: Gerencser M, Hairer M. 2019. A solution theory for quasilinear singular SPDEs.
Communications on Pure and Applied Mathematics. 72(9), 1983–2005.
mla: Gerencser, Mate, and Martin Hairer. “A Solution Theory for Quasilinear Singular
SPDEs.” Communications on Pure and Applied Mathematics, vol. 72, no. 9,
Wiley, 2019, pp. 1983–2005, doi:10.1002/cpa.21816.
short: M. Gerencser, M. Hairer, Communications on Pure and Applied Mathematics 72
(2019) 1983–2005.
date_created: 2019-02-17T22:59:24Z
date_published: 2019-02-08T00:00:00Z
date_updated: 2023-08-24T14:44:31Z
day: '08'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1002/cpa.21816
external_id:
isi:
- '000475465000003'
file:
- access_level: open_access
checksum: 09aec427eb48c0f96a1cce9ff53f013b
content_type: application/pdf
creator: kschuh
date_created: 2020-01-07T13:25:55Z
date_updated: 2020-07-14T12:47:17Z
file_id: '7237'
file_name: 2019_Wiley_Gerencser.pdf
file_size: 381350
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
has_accepted_license: '1'
intvolume: ' 72'
isi: 1
issue: '9'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1983-2005
publication: Communications on Pure and Applied Mathematics
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: A solution theory for quasilinear singular SPDEs
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: 72
year: '2019'
...
---
_id: '5948'
abstract:
- lang: eng
text: We study the termination problem for nondeterministic probabilistic programs.
We consider the bounded termination problem that asks whether the supremum of
the expected termination time over all schedulers is bounded. First, we show that
ranking supermartingales (RSMs) are both sound and complete for proving bounded
termination over nondeterministic probabilistic programs. For nondeterministic
probabilistic programs a previous result claimed that RSMs are not complete for
bounded termination, whereas our result corrects the previous flaw and establishes
completeness with a rigorous proof. Second, we present the first sound approach
to establish lower bounds on expected termination time through RSMs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs.
In: International Conference on Verification, Model Checking, and Abstract
Interpretation. Vol 11388. Springer Nature; 2019:468-490. doi:10.1007/978-3-030-11245-5_22'
apa: 'Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic
programs. In International Conference on Verification, Model Checking, and
Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer
Nature. https://doi.org/10.1007/978-3-030-11245-5_22'
chicago: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic
Probabilistic Programs.” In International Conference on Verification, Model
Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019.
https://doi.org/10.1007/978-3-030-11245-5_22.
ieee: H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,”
in International Conference on Verification, Model Checking, and Abstract Interpretation,
Cascais, Portugal, 2019, vol. 11388, pp. 468–490.
ista: 'Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs.
International Conference on Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388,
468–490.'
mla: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic
Programs.” International Conference on Verification, Model Checking, and Abstract
Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
short: H. Fu, K. Chatterjee, in:, International Conference on Verification, Model
Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.
conference:
end_date: 2019-01-15
location: Cascais, Portugal
name: 'VMCAI: Verification, Model Checking, and Abstract Interpretation'
start_date: 2019-01-13
date_created: 2019-02-10T22:59:17Z
date_published: 2019-01-11T00:00:00Z
date_updated: 2023-08-24T14:42:22Z
day: '11'
department:
- _id: KrCh
doi: 10.1007/978-3-030-11245-5_22
external_id:
arxiv:
- '1701.02944'
isi:
- '000931943000022'
intvolume: ' 11388'
isi: 1
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1701.02944
month: '01'
oa_version: Preprint
page: 468-490
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: International Conference on Verification, Model Checking, and Abstract
Interpretation
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Termination of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11388
year: '2019'
...
---
_id: '5945'
abstract:
- lang: eng
text: In developing organisms, spatially prescribed cell identities are thought
to be determined by the expression levels of multiple genes. Quantitative tests
of this idea, however, require a theoretical framework capable of exposing the
rules and precision of cell specification over developmental time. We use the
gap gene network in the early fly embryo as an example to show how expression
levels of the four gap genes can be jointly decoded into an optimal specification
of position with 1% accuracy. The decoder correctly predicts, with no free parameters,
the dynamics of pair-rule expression patterns at different developmental time
points and in various mutant backgrounds. Precise cellular identities are thus
available at the earliest stages of development, contrasting the prevailing view
of positional information being slowly refined across successive layers of the
patterning network. Our results suggest that developmental enhancers closely approximate
a mathematically optimal decoding strategy.
article_processing_charge: No
article_type: original
author:
- first_name: Mariela D.
full_name: Petkova, Mariela D.
last_name: Petkova
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: William
full_name: Bialek, William
last_name: Bialek
- first_name: Eric F.
full_name: Wieschaus, Eric F.
last_name: Wieschaus
- first_name: Thomas
full_name: Gregor, Thomas
last_name: Gregor
citation:
ama: Petkova MD, Tkačik G, Bialek W, Wieschaus EF, Gregor T. Optimal decoding of
cellular identities in a genetic network. Cell. 2019;176(4):844-855.e15.
doi:10.1016/j.cell.2019.01.007
apa: Petkova, M. D., Tkačik, G., Bialek, W., Wieschaus, E. F., & Gregor, T.
(2019). Optimal decoding of cellular identities in a genetic network. Cell.
Cell Press. https://doi.org/10.1016/j.cell.2019.01.007
chicago: Petkova, Mariela D., Gašper Tkačik, William Bialek, Eric F. Wieschaus,
and Thomas Gregor. “Optimal Decoding of Cellular Identities in a Genetic Network.”
Cell. Cell Press, 2019. https://doi.org/10.1016/j.cell.2019.01.007.
ieee: M. D. Petkova, G. Tkačik, W. Bialek, E. F. Wieschaus, and T. Gregor, “Optimal
decoding of cellular identities in a genetic network,” Cell, vol. 176,
no. 4. Cell Press, p. 844–855.e15, 2019.
ista: Petkova MD, Tkačik G, Bialek W, Wieschaus EF, Gregor T. 2019. Optimal decoding
of cellular identities in a genetic network. Cell. 176(4), 844–855.e15.
mla: Petkova, Mariela D., et al. “Optimal Decoding of Cellular Identities in a Genetic
Network.” Cell, vol. 176, no. 4, Cell Press, 2019, p. 844–855.e15, doi:10.1016/j.cell.2019.01.007.
short: M.D. Petkova, G. Tkačik, W. Bialek, E.F. Wieschaus, T. Gregor, Cell 176 (2019)
844–855.e15.
date_created: 2019-02-10T22:59:16Z
date_published: 2019-02-07T00:00:00Z
date_updated: 2023-08-24T14:42:47Z
day: '07'
department:
- _id: GaTk
doi: 10.1016/j.cell.2019.01.007
external_id:
isi:
- '000457969200015'
pmid:
- '30712870'
intvolume: ' 176'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cell.2019.01.007
month: '02'
oa: 1
oa_version: Published Version
page: 844-855.e15
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: Cell
publication_status: published
publisher: Cell Press
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/cells-find-their-identity-using-a-mathematically-optimal-strategy/
scopus_import: '1'
status: public
title: Optimal decoding of cellular identities in a genetic network
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 176
year: '2019'
...
---
_id: '5943'
abstract:
- lang: eng
text: The hairpin instability of a jet in a crossflow (JICF) for a low jet-to-crossflow
velocity ratio is investigated experimentally for a velocity ratio range of R
∈ (0.14, 0.75) and crossflow Reynolds numbers ReD ∈ (260, 640). From spectral
analysis we characterize the Strouhal number and amplitude of the hairpin instability
as a function of R and ReD. We demonstrate that the dynamics of the hairpins is
well described by the Landau model, and, hence, that the instability occurs through
Hopf bifurcation, similarly to other hydrodynamical oscillators such as wake behind
different bluff bodies. Using the Landau model, we determine the precise threshold
values of hairpin shedding. We also study the spatial dependence of this hydrodynamical
instability, which shows a global behaviour.
article_processing_charge: No
article_type: original
author:
- first_name: Lukasz
full_name: Klotz, Lukasz
id: 2C9AF1C2-F248-11E8-B48F-1D18A9856A87
last_name: Klotz
orcid: 0000-0003-1740-7635
- first_name: Konrad
full_name: Gumowski, Konrad
last_name: Gumowski
- first_name: José Eduardo
full_name: Wesfreid, José Eduardo
last_name: Wesfreid
citation:
ama: Klotz L, Gumowski K, Wesfreid JE. Experiments on a jet in a crossflow in the
low-velocity-ratio regime. Journal of Fluid Mechanics. 2019;863:386-406.
doi:10.1017/jfm.2018.974
apa: Klotz, L., Gumowski, K., & Wesfreid, J. E. (2019). Experiments on a jet
in a crossflow in the low-velocity-ratio regime. Journal of Fluid Mechanics.
Cambridge University Press. https://doi.org/10.1017/jfm.2018.974
chicago: Klotz, Lukasz, Konrad Gumowski, and José Eduardo Wesfreid. “Experiments
on a Jet in a Crossflow in the Low-Velocity-Ratio Regime.” Journal of Fluid
Mechanics. Cambridge University Press, 2019. https://doi.org/10.1017/jfm.2018.974.
ieee: L. Klotz, K. Gumowski, and J. E. Wesfreid, “Experiments on a jet in a crossflow
in the low-velocity-ratio regime,” Journal of Fluid Mechanics, vol. 863.
Cambridge University Press, pp. 386–406, 2019.
ista: Klotz L, Gumowski K, Wesfreid JE. 2019. Experiments on a jet in a crossflow
in the low-velocity-ratio regime. Journal of Fluid Mechanics. 863, 386–406.
mla: Klotz, Lukasz, et al. “Experiments on a Jet in a Crossflow in the Low-Velocity-Ratio
Regime.” Journal of Fluid Mechanics, vol. 863, Cambridge University Press,
2019, pp. 386–406, doi:10.1017/jfm.2018.974.
short: L. Klotz, K. Gumowski, J.E. Wesfreid, Journal of Fluid Mechanics 863 (2019)
386–406.
date_created: 2019-02-10T22:59:15Z
date_published: 2019-03-25T00:00:00Z
date_updated: 2023-08-24T14:43:13Z
day: '25'
department:
- _id: BjHo
doi: 10.1017/jfm.2018.974
ec_funded: 1
external_id:
arxiv:
- '1902.07931'
isi:
- '000526029100016'
intvolume: ' 863'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.07931
month: '03'
oa: 1
oa_version: Preprint
page: 386-406
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Experiments on a jet in a crossflow in the low-velocity-ratio regime
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 863
year: '2019'
...