---
_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
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'
...