---
_id: '1435'
abstract:
- lang: eng
text: ATP released from neurons and astrocytes during neuronal activity or under
pathophysiological circumstances is able to influence information flow in neuronal
circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent
modulation of cellular excitability, synaptic strength, and plasticity. In the
present paper we review cellular and network effects of P2Y receptors in the brain.
We show that P2Y receptors inhibit the release of neurotransmitters, modulate
voltage- and ligand-gated ion channels, and differentially influence the induction
of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum.
The findings discussed here may explain how P2Y1 receptor activation during brain
injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to
an impairment of cognitive processes. Hence, it is suggested that the blockade
of P2Y1 receptors may have therapeutic potential against cognitive disturbances
in these states.
article_number: '1207393'
author:
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
- first_name: Zoltan
full_name: Gerevich, Zoltan
last_name: Gerevich
citation:
ama: 'Guzmán J, Gerevich Z. P2Y receptors in synaptic transmission and plasticity:
Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016;2016.
doi:10.1155/2016/1207393'
apa: 'Guzmán, J., & Gerevich, Z. (2016). P2Y receptors in synaptic transmission
and plasticity: Therapeutic potential in cognitive dysfunction. Neural Plasticity.
Hindawi Publishing Corporation. https://doi.org/10.1155/2016/1207393'
chicago: 'Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission
and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” Neural Plasticity.
Hindawi Publishing Corporation, 2016. https://doi.org/10.1155/2016/1207393.'
ieee: 'J. Guzmán and Z. Gerevich, “P2Y receptors in synaptic transmission and plasticity:
Therapeutic potential in cognitive dysfunction,” Neural Plasticity, vol.
2016. Hindawi Publishing Corporation, 2016.'
ista: 'Guzmán J, Gerevich Z. 2016. P2Y receptors in synaptic transmission and plasticity:
Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016, 1207393.'
mla: 'Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission
and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” Neural Plasticity,
vol. 2016, 1207393, Hindawi Publishing Corporation, 2016, doi:10.1155/2016/1207393.'
short: J. Guzmán, Z. Gerevich, Neural Plasticity 2016 (2016).
date_created: 2018-12-11T11:52:00Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:43Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1155/2016/1207393
file:
- access_level: open_access
checksum: 8dc5c2f3d44d4775a6e7e3edb0d7a0da
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:17Z
date_updated: 2020-07-14T12:44:54Z
file_id: '4740'
file_name: IST-2016-580-v1+1_1207393.pdf
file_size: 1395180
relation: main_file
file_date_updated: 2020-07-14T12:44:54Z
has_accepted_license: '1'
intvolume: ' 2016'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
publication: Neural Plasticity
publication_status: published
publisher: Hindawi Publishing Corporation
publist_id: '5762'
pubrep_id: '580'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'P2Y receptors in synaptic transmission and plasticity: Therapeutic potential
in cognitive dysfunction'
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: 2016
year: '2016'
...
---
_id: '1436'
abstract:
- lang: eng
text: We study the time evolution of a system of N spinless fermions in R3 which
interact through a pair potential, e.g., the Coulomb potential. We compare the
dynamics given by the solution to Schrödinger's equation with the time-dependent
Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation
in terms of the kinetic energy of the system. This leads, in turn, to bounds in
terms of the initial total energy of the system.
author:
- first_name: Volker
full_name: Bach, Volker
last_name: Bach
- first_name: Sébastien
full_name: Breteaux, Sébastien
last_name: Breteaux
- first_name: Sören P
full_name: Petrat, Sören P
id: 40AC02DC-F248-11E8-B48F-1D18A9856A87
last_name: Petrat
orcid: 0000-0002-9166-5889
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
- first_name: Tim
full_name: Tzaneteas, Tim
last_name: Tzaneteas
citation:
ama: Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. Kinetic energy estimates
for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb
interaction. Journal de Mathématiques Pures et Appliquées. 2016;105(1):1-30.
doi:10.1016/j.matpur.2015.09.003
apa: Bach, V., Breteaux, S., Petrat, S. P., Pickl, P., & Tzaneteas, T. (2016).
Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation
with Coulomb interaction. Journal de Mathématiques Pures et Appliquées.
Elsevier. https://doi.org/10.1016/j.matpur.2015.09.003
chicago: Bach, Volker, Sébastien Breteaux, Sören P Petrat, Peter Pickl, and Tim
Tzaneteas. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock
Approximation with Coulomb Interaction.” Journal de Mathématiques Pures et
Appliquées. Elsevier, 2016. https://doi.org/10.1016/j.matpur.2015.09.003.
ieee: V. Bach, S. Breteaux, S. P. Petrat, P. Pickl, and T. Tzaneteas, “Kinetic energy
estimates for the accuracy of the time-dependent Hartree-Fock approximation with
Coulomb interaction,” Journal de Mathématiques Pures et Appliquées, vol.
105, no. 1. Elsevier, pp. 1–30, 2016.
ista: Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. 2016. Kinetic energy
estimates for the accuracy of the time-dependent Hartree-Fock approximation with
Coulomb interaction. Journal de Mathématiques Pures et Appliquées. 105(1), 1–30.
mla: Bach, Volker, et al. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent
Hartree-Fock Approximation with Coulomb Interaction.” Journal de Mathématiques
Pures et Appliquées, vol. 105, no. 1, Elsevier, 2016, pp. 1–30, doi:10.1016/j.matpur.2015.09.003.
short: V. Bach, S. Breteaux, S.P. Petrat, P. Pickl, T. Tzaneteas, Journal de Mathématiques
Pures et Appliquées 105 (2016) 1–30.
date_created: 2018-12-11T11:52:00Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:43Z
day: '01'
ddc:
- '510'
- '530'
department:
- _id: RoSe
doi: 10.1016/j.matpur.2015.09.003
ec_funded: 1
file:
- access_level: open_access
checksum: c5afe1f6935bc7f2b546adbde1d31a35
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:36Z
date_updated: 2020-07-14T12:44:54Z
file_id: '4825'
file_name: IST-2016-581-v1+1_1-s2.0-S0021782415001191-main.pdf
file_size: 658491
relation: main_file
file_date_updated: 2020-07-14T12:44:54Z
has_accepted_license: '1'
intvolume: ' 105'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 1 - 30
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal de Mathématiques Pures et Appliquées
publication_status: published
publisher: Elsevier
publist_id: '5763'
pubrep_id: '581'
quality_controlled: '1'
scopus_import: 1
status: public
title: Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock
approximation with Coulomb interaction
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 105
year: '2016'
...
---
_id: '1437'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
alternative_title:
- POPL
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- 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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for
algebraic path properties in concurrent systems of constant treewidth components.
In: Vol 20-22. ACM; 2016:733-747. doi:10.1145/2837614.2837624'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A.
(2016). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles
of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,”
presented at the POPL: Principles of Programming Languages, St. Petersburg, FL,
USA, 2016, vol. 20–22, pp. 733–747.'
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.'
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016,
pp. 733–47, doi:10.1145/2837614.2837624.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM,
2016, pp. 733–747.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2024-03-25T23:30:18Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/2837614.2837624
ec_funded: 1
external_id:
arxiv:
- '1510.07565'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.07565
month: '01'
oa: 1
oa_version: Preprint
page: 733 - 747
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: ACM
publist_id: '5761'
quality_controlled: '1'
related_material:
record:
- id: '5441'
relation: earlier_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '821'
relation: dissertation_contains
status: public
- id: '6009'
relation: later_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1438'
abstract:
- lang: eng
text: 'In this paper, we consider termination of probabilistic programs with real-valued
variables. The questions concerned are: (a) qualitative ones that ask (i) whether
the program terminates with probability 1 (almost-sure termination) and (ii) whether
the expected termination time is finite (finite termination); (b) quantitative
ones that ask (i) to approximate the expected termination time (expectation problem)
and (ii) to compute a bound B such that the probability to terminate after B steps
decreases exponentially (concentration problem). To solve these questions, we
utilize the notion of ranking supermartingales which is a powerful approach for
proving termination of probabilistic programs. In detail, we focus on algorithmic
synthesis of linear ranking-supermartingales over affine probabilistic programs
(APP''s) with both angelic and demonic non-determinism. An important subclass
of APP''s is LRAPP which is defined as the class of all APP''s over which a linear
ranking-supermartingale exists. Our main contributions are as follows. Firstly,
we show that the membership problem of LRAPP (i) can be decided in polynomial
time for APP''s with at most demonic non-determinism, and (ii) is NP-hard and
in PSPACE for APP''s with angelic non-determinism; moreover, the NP-hardness result
holds already for APP''s without probability and demonic non-determinism. Secondly,
we show that the concentration problem over LRAPP can be solved in the same complexity
as for the membership problem of LRAPP. Finally, we show that the expectation
problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP''s
without probability and non-determinism (i.e., deterministic programs). Our experimental
results demonstrate the effectiveness of our approach to answer the qualitative
and quantitative questions over APP''s with at most demonic non-determinism.'
acknowledgement: 'Supported by the Natural Science Foundation of China (NSFC) under
Grant No. 61532019 '
alternative_title:
- POPL
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Rouzbeh
full_name: Hasheminezhad, Rouzbeh
last_name: Hasheminezhad
citation:
ama: 'Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative
and quantitative termination problems for affine probabilistic programs. In: Vol
20-22. ACM; 2016:327-342. doi:10.1145/2837614.2837639'
apa: 'Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic
analysis of qualitative and quantitative termination problems for affine probabilistic
programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming
Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639'
chicago: Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad.
“Algorithmic Analysis of Qualitative and Quantitative Termination Problems for
Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. https://doi.org/10.1145/2837614.2837639.
ieee: 'K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis
of qualitative and quantitative termination problems for affine probabilistic
programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg,
FL, USA, 2016, vol. 20–22, pp. 327–342.'
ista: 'Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis
of qualitative and quantitative termination problems for affine probabilistic
programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.'
mla: Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative
Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016,
pp. 327–42, doi:10.1145/2837614.2837639.
short: K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2023-09-19T14:38:41Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/2837614.2837639
ec_funded: 1
external_id:
arxiv:
- '1510.08517'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.08517
month: '01'
oa: 1
oa_version: Preprint
page: 327 - 342
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: ACM
publist_id: '5760'
quality_controlled: '1'
related_material:
record:
- id: '5993'
relation: later_version
status: public
scopus_import: 1
status: public
title: Algorithmic analysis of qualitative and quantitative termination problems for
affine probabilistic programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1439'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly,
due to asynchronous communication and the occurrence of faults, such as the network
dropping messages or computers crashing. We introduce PSYNC, a domain specific
language based on the Heard-Of model, which views asynchronous faulty systems
as synchronous ones with an adversarial environment that simulates asynchrony
and faults by dropping messages. We define a runtime system for PSYNC that efficiently
executes on asynchronous networks. We formalize the relation between the runtime
system and PSYNC in terms of observational refinement. The high-level lockstep
abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant
distributed algorithms and enables automated formal verification. We have implemented
an embedding of PSYNC in the SCALA programming language with a runtime system
for asynchronous networks. We show the applicability of PSYNC by implementing
several important fault-tolerant distributed algorithms and we compare the implementation
of consensus algorithms in PSYNC against implementations in other languages in
terms of code size, runtime efficiency, and verification.
acknowledgement: 'Damien Zufferey was supported by DARPA (Grants FA8650-11-C-7192
and FA8650-15-C-7564) and NSF (Grant CCF-1138967). '
alternative_title:
- ACM SIGPLAN Notices
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- 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: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Dragoi C, Henzinger TA, Zufferey D. PSYNC: A partially synchronous language
for fault-tolerant distributed algorithms. In: Vol 20-22. ACM; 2016:400-415. doi:10.1145/2837614.2837650'
apa: 'Dragoi, C., Henzinger, T. A., & Zufferey, D. (2016). PSYNC: A partially
synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp.
400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg,
FL, USA: ACM. https://doi.org/10.1145/2837614.2837650'
chicago: 'Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially
Synchronous Language for Fault-Tolerant Distributed Algorithms,” 20–22:400–415.
ACM, 2016. https://doi.org/10.1145/2837614.2837650.'
ieee: 'C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous
language for fault-tolerant distributed algorithms,” presented at the POPL: Principles
of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415.'
ista: 'Dragoi C, Henzinger TA, Zufferey D. 2016. PSYNC: A partially synchronous
language for fault-tolerant distributed algorithms. POPL: Principles of Programming
Languages, ACM SIGPLAN Notices, vol. 20–22, 400–415.'
mla: 'Dragoi, Cezara, et al. PSYNC: A Partially Synchronous Language for Fault-Tolerant
Distributed Algorithms. Vol. 20–22, ACM, 2016, pp. 400–15, doi:10.1145/2837614.2837650.'
short: C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2021-01-12T06:50:45Z
day: '11'
department:
- _id: ToHe
doi: 10.1145/2837614.2837650
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.inria.fr/hal-01251199/
month: '01'
oa: 1
oa_version: Preprint
page: 400 - 415
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: ACM
publist_id: '5759'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'PSYNC: A partially synchronous language for fault-tolerant distributed algorithms'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1440'
acknowledgement: The author thanks Banerjee et al. (2016) for providing coordinates
prior to public release and apologizes to colleagues whose work was not cited or
discussed due to the limited space available. The author is supported by grants
from EU FP7 (CIG-303564), HFSP (RGY0084_2012), and FWF (W1232).
author:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: 'Janovjak HL. Light at the end of the protein: Crystal structure of a C-terminal
light-sensing domain. Structure. 2016;24(2):213-215. doi:10.1016/j.str.2016.01.002'
apa: 'Janovjak, H. L. (2016). Light at the end of the protein: Crystal structure
of a C-terminal light-sensing domain. Structure. Cell Press. https://doi.org/10.1016/j.str.2016.01.002'
chicago: 'Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure
of a C-Terminal Light-Sensing Domain.” Structure. Cell Press, 2016. https://doi.org/10.1016/j.str.2016.01.002.'
ieee: 'H. L. Janovjak, “Light at the end of the protein: Crystal structure of a
C-terminal light-sensing domain,” Structure, vol. 24, no. 2. Cell Press,
pp. 213–215, 2016.'
ista: 'Janovjak HL. 2016. Light at the end of the protein: Crystal structure of
a C-terminal light-sensing domain. Structure. 24(2), 213–215.'
mla: 'Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of
a C-Terminal Light-Sensing Domain.” Structure, vol. 24, no. 2, Cell Press,
2016, pp. 213–15, doi:10.1016/j.str.2016.01.002.'
short: H.L. Janovjak, Structure 24 (2016) 213–215.
date_created: 2018-12-11T11:52:02Z
date_published: 2016-02-02T00:00:00Z
date_updated: 2021-01-12T06:50:46Z
day: '02'
department:
- _id: HaJa
doi: 10.1016/j.str.2016.01.002
ec_funded: 1
intvolume: ' 24'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 213 - 215
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors (HFSP Young Investigator)
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255A6082-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Structure
publication_status: published
publisher: Cell Press
publist_id: '5756'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Light at the end of the protein: Crystal structure of a C-terminal light-sensing
domain'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2016'
...
---
_id: '1441'
abstract:
- lang: eng
text: 'Optogenetics and photopharmacology enable the spatio-temporal control of
cell and animal behavior by light. Although red light offers deep-tissue penetration
and minimal phototoxicity, very few red-light-sensitive optogenetic methods are
currently available. We have now developed a red-light-induced homodimerization
domain. We first showed that an optimized sensory domain of the cyanobacterial
phytochrome 1 can be expressed robustly and without cytotoxicity in human cells.
We then applied this domain to induce the dimerization of two receptor tyrosine
kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor
trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway
non-invasively in mammalian tissue and in multicolor cell-signaling experiments.
The light-controlled dimerizer and red-light-activated receptor tyrosine kinases
will prove useful to regulate a variety of cellular processes with light. Go deep
with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was
repurposed to induce the homodimerization of proteins in living cells by red light.
By using this domain, light-activated protein kinases were engineered that can
be activated orthogonally from many fluorescent proteins and through mammalian
tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1.'
acknowledgement: 'A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by
the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W1232) and
a FemTech fellowship (Austrian Research Promotion Agency: 3580812).'
author:
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Alexandra-Madelaine
full_name: Tichy, Alexandra-Madelaine
id: 29D8BB2C-F248-11E8-B48F-1D18A9856A87
last_name: Tichy
- first_name: Catherine
full_name: Mckenzie, Catherine
id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87
last_name: Mckenzie
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL.
A phytochrome sensory domain permits receptor activation by red light. Angewandte
Chemie - International Edition. 2016;55(21):6339-6342. doi:10.1002/anie.201601736
apa: Gschaider-Reichhart, E., Inglés Prieto, Á., Tichy, A.-M., Mckenzie, C., &
Janovjak, H. L. (2016). A phytochrome sensory domain permits receptor activation
by red light. Angewandte Chemie - International Edition. Wiley. https://doi.org/10.1002/anie.201601736
chicago: Gschaider-Reichhart, Eva, Álvaro Inglés Prieto, Alexandra-Madelaine Tichy,
Catherine Mckenzie, and Harald L Janovjak. “A Phytochrome Sensory Domain Permits
Receptor Activation by Red Light.” Angewandte Chemie - International Edition.
Wiley, 2016. https://doi.org/10.1002/anie.201601736.
ieee: E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, and H.
L. Janovjak, “A phytochrome sensory domain permits receptor activation by red
light,” Angewandte Chemie - International Edition, vol. 55, no. 21. Wiley,
pp. 6339–6342, 2016.
ista: Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL.
2016. A phytochrome sensory domain permits receptor activation by red light. Angewandte
Chemie - International Edition. 55(21), 6339–6342.
mla: Gschaider-Reichhart, Eva, et al. “A Phytochrome Sensory Domain Permits Receptor
Activation by Red Light.” Angewandte Chemie - International Edition, vol.
55, no. 21, Wiley, 2016, pp. 6339–42, doi:10.1002/anie.201601736.
short: E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, H.L.
Janovjak, Angewandte Chemie - International Edition 55 (2016) 6339–6342.
date_created: 2018-12-11T11:52:02Z
date_published: 2016-05-17T00:00:00Z
date_updated: 2023-09-07T12:49:08Z
day: '17'
ddc:
- '571'
- '576'
department:
- _id: HaJa
doi: 10.1002/anie.201601736
ec_funded: 1
file:
- access_level: open_access
checksum: 26da07960e57ac4750b54179197ce57f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:03Z
date_updated: 2020-07-14T12:44:55Z
file_id: '5255'
file_name: IST-2017-840-v1+1_reichhart.pdf
file_size: 1268662
relation: main_file
file_date_updated: 2020-07-14T12:44:55Z
has_accepted_license: '1'
intvolume: ' 55'
issue: '21'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 6339 - 6342
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255A6082-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Angewandte Chemie - International Edition
publication_status: published
publisher: Wiley
publist_id: '5755'
pubrep_id: '840'
quality_controlled: '1'
related_material:
record:
- id: '418'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: A phytochrome sensory domain permits receptor activation by red light
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1446'
abstract:
- lang: eng
text: The accuracy of interdisciplinarity measurements is directly related to the
quality of the underlying bibliographic data. Existing indicators of interdisciplinarity
are not capable of reflecting the inaccuracies introduced by incorrect and incomplete
records because correct and complete bibliographic data can rarely be obtained.
This is the case for the Rao–Stirling index, which cannot handle references that
are not categorized into disciplinary fields. We introduce a method that addresses
this problem. It extends the Rao–Stirling index to acknowledge missing data by
calculating its interval of uncertainty using computational optimization. The
evaluation of our method indicates that the uncertainty interval is not only useful
for estimating the inaccuracy of interdisciplinarity measurements, but it also
delivers slightly more accurate aggregated interdisciplinarity measurements than
the Rao–Stirling index.
article_processing_charge: No
author:
- first_name: Maria
full_name: Calatrava Moreno, Maria
last_name: Calatrava Moreno
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Hannes
full_name: Werthner, Hannes
last_name: Werthner
citation:
ama: Calatrava Moreno M, Auzinger T, Werthner H. On the uncertainty of interdisciplinarity
measurements due to incomplete bibliographic data. Scientometrics. 2016;107(1):213-232.
doi:10.1007/s11192-016-1842-4
apa: Calatrava Moreno, M., Auzinger, T., & Werthner, H. (2016). On the uncertainty
of interdisciplinarity measurements due to incomplete bibliographic data. Scientometrics.
Springer. https://doi.org/10.1007/s11192-016-1842-4
chicago: Calatrava Moreno, Maria, Thomas Auzinger, and Hannes Werthner. “On the
Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic
Data.” Scientometrics. Springer, 2016. https://doi.org/10.1007/s11192-016-1842-4.
ieee: M. Calatrava Moreno, T. Auzinger, and H. Werthner, “On the uncertainty of
interdisciplinarity measurements due to incomplete bibliographic data,” Scientometrics,
vol. 107, no. 1. Springer, pp. 213–232, 2016.
ista: Calatrava Moreno M, Auzinger T, Werthner H. 2016. On the uncertainty of interdisciplinarity
measurements due to incomplete bibliographic data. Scientometrics. 107(1), 213–232.
mla: Calatrava Moreno, Maria, et al. “On the Uncertainty of Interdisciplinarity
Measurements Due to Incomplete Bibliographic Data.” Scientometrics, vol.
107, no. 1, Springer, 2016, pp. 213–32, doi:10.1007/s11192-016-1842-4.
short: M. Calatrava Moreno, T. Auzinger, H. Werthner, Scientometrics 107 (2016)
213–232.
date_created: 2018-12-11T11:52:04Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2021-11-16T08:29:11Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1007/s11192-016-1842-4
file:
- access_level: open_access
checksum: 32d46268588b87d9b686492018e6a2b2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:56Z
date_updated: 2020-07-14T12:44:55Z
file_id: '4848'
file_name: IST-2016-530-v1+1_s11192-016-1842-4.pdf
file_size: 806035
relation: main_file
file_date_updated: 2020-07-14T12:44:55Z
has_accepted_license: '1'
intvolume: ' 107'
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 213 - 232
publication: Scientometrics
publication_status: published
publisher: Springer
publist_id: '5750'
pubrep_id: '530'
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s11192-016-1902-9
scopus_import: '1'
status: public
title: On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic
data
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 107
year: '2016'
...
---
_id: '1448'
abstract:
- lang: eng
text: We develop a new and systematic method for proving entropic Ricci curvature
lower bounds for Markov chains on discrete sets. Using different methods, such
bounds have recently been obtained in several examples (e.g., 1-dimensional birth
and death chains, product chains, Bernoulli–Laplace models, and random transposition
models). However, a general method to obtain discrete Ricci bounds had been lacking.
Our method covers all of the examples above. In addition we obtain new Ricci curvature
bounds for zero-range processes on the complete graph. The method is inspired
by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities.
acknowledgement: "Supported by the German Research Foundation through the Collaborative
Research Center 1060\r\nThe Mathematics of Emergent Effects and the Hausdorff Center
for Mathematics. Part of this work has been done while M. Fathi visited J. Maas
at the University of Bonn in July 2014.We would like to thank the referees for their
careful reading of the manuscript. "
author:
- first_name: Max
full_name: Fathi, Max
last_name: Fathi
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Fathi M, Maas J. Entropic Ricci curvature bounds for discrete interacting systems.
The Annals of Applied Probability. 2016;26(3):1774-1806. doi:10.1214/15-AAP1133
apa: Fathi, M., & Maas, J. (2016). Entropic Ricci curvature bounds for discrete
interacting systems. The Annals of Applied Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/15-AAP1133
chicago: Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete
Interacting Systems.” The Annals of Applied Probability. Institute of Mathematical
Statistics, 2016. https://doi.org/10.1214/15-AAP1133.
ieee: M. Fathi and J. Maas, “Entropic Ricci curvature bounds for discrete interacting
systems,” The Annals of Applied Probability, vol. 26, no. 3. Institute
of Mathematical Statistics, pp. 1774–1806, 2016.
ista: Fathi M, Maas J. 2016. Entropic Ricci curvature bounds for discrete interacting
systems. The Annals of Applied Probability. 26(3), 1774–1806.
mla: Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting
Systems.” The Annals of Applied Probability, vol. 26, no. 3, Institute
of Mathematical Statistics, 2016, pp. 1774–806, doi:10.1214/15-AAP1133.
short: M. Fathi, J. Maas, The Annals of Applied Probability 26 (2016) 1774–1806.
date_created: 2018-12-11T11:52:05Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2021-01-12T06:50:49Z
day: '01'
department:
- _id: JaMa
doi: 10.1214/15-AAP1133
intvolume: ' 26'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.00562
month: '06'
oa: 1
oa_version: Preprint
page: 1774 - 1806
publication: The Annals of Applied Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5748'
quality_controlled: '1'
scopus_import: 1
status: public
title: Entropic Ricci curvature bounds for discrete interacting systems
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2016'
...
---
_id: '1475'
abstract:
- lang: eng
text: The actin cytoskeleton plays important roles in the formation and internalization
of endocytic vesicles. In yeast, endocytic vesicles move towards early endosomes
along actin cables, however, the molecular machinery regulating interaction between
endocytic vesicles and actin cables is poorly understood. The Eps15-like protein
Pan1p plays a key role in actin-mediated endocytosis and is negatively regulated
by Ark1 and Prk1 kinases. Here we show that pan1 mutated to prevent phosphorylation
at all 18 threonines, pan1-18TA, displayed almost the same endocytic defect as
ark1Δ prk1Δ cells, and contained abnormal actin concentrations including several
endocytic compartments. Early endosomes were highly localized in the actin concentrations
and displayed movement along actin cables. The dephosphorylated form of Pan1p
also caused stable associations between endocytic vesicles and actin cables, and
between endocytic vesicles and endosomes. Thus Pan1 phosphorylation is part of
a novel mechanism that regulates endocytic compartment interactions with each
other and with actin cables.
article_number: e10276
author:
- first_name: Junko
full_name: Toshima, Junko
last_name: Toshima
- first_name: Eri
full_name: Furuya, Eri
last_name: Furuya
- first_name: Makoto
full_name: Nagano, Makoto
last_name: Nagano
- first_name: Chisa
full_name: Kanno, Chisa
last_name: Kanno
- first_name: Yuta
full_name: Sakamoto, Yuta
last_name: Sakamoto
- first_name: Masashi
full_name: Ebihara, Masashi
last_name: Ebihara
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Jiro
full_name: Toshima, Jiro
last_name: Toshima
citation:
ama: Toshima J, Furuya E, Nagano M, et al. Yeast Eps15-like endocytic protein Pan1p
regulates the interaction between endocytic vesicles, endosomes and the actin
cytoskeleton. eLife. 2016;5(February 2016). doi:10.7554/eLife.10276
apa: Toshima, J., Furuya, E., Nagano, M., Kanno, C., Sakamoto, Y., Ebihara, M.,
… Toshima, J. (2016). Yeast Eps15-like endocytic protein Pan1p regulates the interaction
between endocytic vesicles, endosomes and the actin cytoskeleton. ELife.
eLife Sciences Publications. https://doi.org/10.7554/eLife.10276
chicago: Toshima, Junko, Eri Furuya, Makoto Nagano, Chisa Kanno, Yuta Sakamoto,
Masashi Ebihara, Daria E Siekhaus, and Jiro Toshima. “Yeast Eps15-like Endocytic
Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes
and the Actin Cytoskeleton.” ELife. eLife Sciences Publications, 2016.
https://doi.org/10.7554/eLife.10276.
ieee: J. Toshima et al., “Yeast Eps15-like endocytic protein Pan1p regulates
the interaction between endocytic vesicles, endosomes and the actin cytoskeleton,”
eLife, vol. 5, no. February 2016. eLife Sciences Publications, 2016.
ista: Toshima J, Furuya E, Nagano M, Kanno C, Sakamoto Y, Ebihara M, Siekhaus DE,
Toshima J. 2016. Yeast Eps15-like endocytic protein Pan1p regulates the interaction
between endocytic vesicles, endosomes and the actin cytoskeleton. eLife. 5(February
2016), e10276.
mla: Toshima, Junko, et al. “Yeast Eps15-like Endocytic Protein Pan1p Regulates
the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.”
ELife, vol. 5, no. February 2016, e10276, eLife Sciences Publications,
2016, doi:10.7554/eLife.10276.
short: J. Toshima, E. Furuya, M. Nagano, C. Kanno, Y. Sakamoto, M. Ebihara, D.E.
Siekhaus, J. Toshima, ELife 5 (2016).
date_created: 2018-12-11T11:52:14Z
date_published: 2016-02-25T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '25'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.7554/eLife.10276
ec_funded: 1
file:
- access_level: open_access
checksum: d1cc44870580756ba8badd8e41adfdb5
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:08Z
date_updated: 2020-07-14T12:44:56Z
file_id: '4793'
file_name: IST-2016-529-v1+1_elife-10276-v1.pdf
file_size: 5198001
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 5'
issue: February 2016
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '5721'
pubrep_id: '529'
quality_controlled: '1'
scopus_import: 1
status: public
title: Yeast Eps15-like endocytic protein Pan1p regulates the interaction between
endocytic vesicles, endosomes and the actin cytoskeleton
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: 5
year: '2016'
...
---
_id: '1476'
abstract:
- lang: eng
text: The dynamic assembly and disassembly of actin filaments is essential for the
formation and transport of vesicles during endocytosis. In yeast, two types of
actin structures, namely cortical patches and cytoplasmic cables, play a direct
role in endocytosis, but how their interaction is regulated remains unclear. Here,
we show that Srv2/CAP, an evolutionarily conserved actin regulator, is required
for efficient endocytosis owing to its role in the formation of the actin patches
that aid initial vesicle invagination and of the actin cables that these move
along. Deletion of the SRV2 gene resulted in the appearance of aberrant fragmented
actin cables that frequently moved past actin patches, the sites of endocytosis.
We find that the C-terminal CARP domain of Srv2p is vitally important for the
proper assembly of actin patches and cables; we also demonstrate that the N-terminal
helical folded domain of Srv2 is required for its localization to actin patches,
specifically to the ADP-actin rich region through an interaction with cofilin.
These results demonstrate the in vivo roles of Srv2p in the regulation of the
actin cytoskeleton during clathrin-mediated endocytosis
acknowledgement: We are grateful to Anthony Bretscher (Cornell University, NY) for
providing the bni1-12 bnr1Δ (Y4135) strain. J.Y.T. was supported by a Japan Society
for the Promotion of Science (JSPS) KAKENHI grant [grant number 26440067]; the Takeda
Science Foundation; and the Novartis Foundation (Japan). J.T. was supported by a
JSPS KAKENHI grant [grant number 25440054]; the Takeda Science Foundation; and the
Kurata Memorial Hitachi Science and Technology Foundation. D.E.S. was supported
by the European Union [grant number PCIG12-GA-2012-334077].
author:
- first_name: Junko
full_name: Toshima, Junko
last_name: Toshima
- first_name: Chika
full_name: Horikomi, Chika
last_name: Horikomi
- first_name: Asuka
full_name: Okada, Asuka
last_name: Okada
- first_name: Makiko
full_name: Hatori, Makiko
last_name: Hatori
- first_name: Makoto
full_name: Nagano, Makoto
last_name: Nagano
- first_name: Atsushi
full_name: Masuda, Atsushi
last_name: Masuda
- first_name: Wataru
full_name: Yamamoto, Wataru
last_name: Yamamoto
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Jiro
full_name: Toshima, Jiro
last_name: Toshima
citation:
ama: Toshima J, Horikomi C, Okada A, et al. Srv2/CAP is required for polarized actin
cable assembly and patch internalization during clathrin-mediated endocytosis.
Journal of Cell Science. 2016;129(2):367-379. doi:10.1242/jcs.176651
apa: Toshima, J., Horikomi, C., Okada, A., Hatori, M., Nagano, M., Masuda, A., …
Toshima, J. (2016). Srv2/CAP is required for polarized actin cable assembly and
patch internalization during clathrin-mediated endocytosis. Journal of Cell
Science. Company of Biologists. https://doi.org/10.1242/jcs.176651
chicago: Toshima, Junko, Chika Horikomi, Asuka Okada, Makiko Hatori, Makoto Nagano,
Atsushi Masuda, Wataru Yamamoto, Daria E Siekhaus, and Jiro Toshima. “Srv2/CAP
Is Required for Polarized Actin Cable Assembly and Patch Internalization during
Clathrin-Mediated Endocytosis.” Journal of Cell Science. Company of Biologists,
2016. https://doi.org/10.1242/jcs.176651.
ieee: J. Toshima et al., “Srv2/CAP is required for polarized actin cable
assembly and patch internalization during clathrin-mediated endocytosis,” Journal
of Cell Science, vol. 129, no. 2. Company of Biologists, pp. 367–379, 2016.
ista: Toshima J, Horikomi C, Okada A, Hatori M, Nagano M, Masuda A, Yamamoto W,
Siekhaus DE, Toshima J. 2016. Srv2/CAP is required for polarized actin cable assembly
and patch internalization during clathrin-mediated endocytosis. Journal of Cell
Science. 129(2), 367–379.
mla: Toshima, Junko, et al. “Srv2/CAP Is Required for Polarized Actin Cable Assembly
and Patch Internalization during Clathrin-Mediated Endocytosis.” Journal of
Cell Science, vol. 129, no. 2, Company of Biologists, 2016, pp. 367–79, doi:10.1242/jcs.176651.
short: J. Toshima, C. Horikomi, A. Okada, M. Hatori, M. Nagano, A. Masuda, W. Yamamoto,
D.E. Siekhaus, J. Toshima, Journal of Cell Science 129 (2016) 367–379.
date_created: 2018-12-11T11:52:14Z
date_published: 2016-01-15T00:00:00Z
date_updated: 2021-01-12T06:51:00Z
day: '15'
ddc:
- '570'
- '576'
department:
- _id: DaSi
doi: 10.1242/jcs.176651
ec_funded: 1
file:
- access_level: open_access
checksum: 2da0a09149a9ed956cdf79a95c17f08a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:08Z
date_updated: 2020-07-14T12:44:56Z
file_id: '4861'
file_name: IST-2017-767-v1+1_367.full.pdf
file_size: 7176912
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 129'
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 367 - 379
project:
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: Journal of Cell Science
publication_status: published
publisher: Company of Biologists
publist_id: '5720'
pubrep_id: '767'
quality_controlled: '1'
scopus_import: 1
status: public
title: Srv2/CAP is required for polarized actin cable assembly and patch internalization
during clathrin-mediated endocytosis
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2016'
...
---
_id: '1477'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs) with ω-regular
conditions specified as parity objectives. The class of ω-regular languages provides
a robust specification language to express properties in verification, and parity
objectives are canonical forms to express them. The qualitative analysis problem
given a POMDP and a parity objective asks whether there is a strategy to ensure
that the objective is satisfied with probability 1 (resp. positive probability).
While the qualitative analysis problems are undecidable even for special cases
of parity objectives, we establish decidability (with optimal complexity) for
POMDPs with all parity objectives under finite-memory strategies. We establish
optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative
analysis problems under finite-memory strategies for POMDPs with parity objectives.
We also present a practical approach, where we design heuristics to deal with
the exponential complexity, and have applied our implementation on a number of
POMDP examples.
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable
Markov decision processes with ω-regular objectives. Journal of Computer and
System Sciences. 2016;82(5):878-911. doi:10.1016/j.jcss.2016.02.009
apa: Chatterjee, K., Chmelik, M., & Tracol, M. (2016). What is decidable about
partially observable Markov decision processes with ω-regular objectives. Journal
of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2016.02.009
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable
about Partially Observable Markov Decision Processes with ω-Regular Objectives.”
Journal of Computer and System Sciences. Elsevier, 2016. https://doi.org/10.1016/j.jcss.2016.02.009.
ieee: K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially
observable Markov decision processes with ω-regular objectives,” Journal of
Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.
ista: Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially
observable Markov decision processes with ω-regular objectives. Journal of Computer
and System Sciences. 82(5), 878–911.
mla: Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable
Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and
System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009.
short: K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences
82 (2016) 878–911.
date_created: 2018-12-11T11:52:15Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-02-23T12:24:38Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.jcss.2016.02.009
ec_funded: 1
external_id:
arxiv:
- '1309.2802'
intvolume: ' 82'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2802
month: '08'
oa: 1
oa_version: Preprint
page: 878 - 911
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of Computer and System Sciences
publication_status: published
publisher: Elsevier
publist_id: '5718'
quality_controlled: '1'
related_material:
record:
- id: '2295'
relation: earlier_version
status: public
- id: '5400'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: What is decidable about partially observable Markov decision processes with
ω-regular objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2016'
...
---
_id: '1478'
abstract:
- lang: eng
text: We consider the Tonks-Girardeau gas subject to a random external potential.
If the disorder is such that the underlying one-particle Hamiltonian displays
localization (which is known to be generically the case), we show that there is
exponential decay of correlations in the many-body eigenstates. Moreover, there
is no Bose-Einstein condensation and no superfluidity, even at zero temperature.
article_number: '035002'
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Simone
full_name: Warzel, Simone
last_name: Warzel
citation:
ama: Seiringer R, Warzel S. Decay of correlations and absence of superfluidity in
the disordered Tonks-Girardeau gas. New Journal of Physics. 2016;18(3).
doi:10.1088/1367-2630/18/3/035002
apa: Seiringer, R., & Warzel, S. (2016). Decay of correlations and absence of
superfluidity in the disordered Tonks-Girardeau gas. New Journal of Physics.
IOP Publishing Ltd. https://doi.org/10.1088/1367-2630/18/3/035002
chicago: Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence
of Superfluidity in the Disordered Tonks-Girardeau Gas.” New Journal of Physics.
IOP Publishing Ltd., 2016. https://doi.org/10.1088/1367-2630/18/3/035002.
ieee: R. Seiringer and S. Warzel, “Decay of correlations and absence of superfluidity
in the disordered Tonks-Girardeau gas,” New Journal of Physics, vol. 18,
no. 3. IOP Publishing Ltd., 2016.
ista: Seiringer R, Warzel S. 2016. Decay of correlations and absence of superfluidity
in the disordered Tonks-Girardeau gas. New Journal of Physics. 18(3), 035002.
mla: Seiringer, Robert, and Simone Warzel. “Decay of Correlations and Absence of
Superfluidity in the Disordered Tonks-Girardeau Gas.” New Journal of Physics,
vol. 18, no. 3, 035002, IOP Publishing Ltd., 2016, doi:10.1088/1367-2630/18/3/035002.
short: R. Seiringer, S. Warzel, New Journal of Physics 18 (2016).
date_created: 2018-12-11T11:52:15Z
date_published: 2016-02-29T00:00:00Z
date_updated: 2021-01-12T06:51:01Z
day: '29'
ddc:
- '510'
- '530'
department:
- _id: RoSe
doi: 10.1088/1367-2630/18/3/035002
file:
- access_level: open_access
checksum: 4f959eabc19d2a2f518318a450a4d424
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:22Z
date_updated: 2020-07-14T12:44:56Z
file_id: '5276'
file_name: IST-2016-579-v1+1_njp_18_3_035002.pdf
file_size: 965607
relation: main_file
file_date_updated: 2020-07-14T12:44:56Z
has_accepted_license: '1'
intvolume: ' 18'
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _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: New Journal of Physics
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '5716'
pubrep_id: '579'
quality_controlled: '1'
scopus_import: 1
status: public
title: Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau
gas
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: 18
year: '2016'
...
---
_id: '5445'
abstract:
- lang: eng
text: 'We consider the quantitative analysis problem for interprocedural control-flow
graphs (ICFGs). The input consists of an ICFG, a positive weight function that
assigns every transition a positive integer-valued number, and a labelling of
the transitions (events) as good, bad, and neutral events. The weight function
assigns to each transition a numerical value that represents ameasure of how good
or bad an event is. The quantitative analysis problem asks whether there is a
run of the ICFG where the ratio of the sum of the numerical weights of good events
versus the sum of weights of bad events in the long-run is at least a given threshold
(or equivalently, to compute the maximal ratio among all valid paths in the ICFG).
The quantitative analysis problem for ICFGs can be solved in polynomial time,
and we present an efficient and practical algorithm for the problem. We show that
several problems relevant for static program analysis, such as estimating the
worst-case execution time of a program or the average energy consumption of a
mobile application, can be modeled in our framework. We have implemented our algorithm
as a tool in the Java Soot framework. We demonstrate the effectiveness of our
approach with two case studies. First, we show that our framework provides a sound
approach (no false positives) for the analysis of inefficiently-used containers.
Second, we show that our approach can also be used for static profiling of programs
which reasons about methods that are frequently invoked. Our experimental results
show that our tool scales to relatively large benchmarks, and discovers relevant
and useful information that can be used to optimize performance of the programs. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis.
IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
apa: Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative
interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative
Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
ieee: K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural
analysis. IST Austria, 2016.
ista: Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural
analysis, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis.
IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.
short: K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis,
IST Austria, 2016.
date_created: 2018-12-12T11:39:22Z
date_published: 2016-03-31T00:00:00Z
date_updated: 2023-02-23T10:06:22Z
day: '31'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-523-v1-1
file:
- access_level: open_access
checksum: cef516fa091925b5868813e355268fb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:52Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5513'
file_name: IST-2016-523-v1+1_main.pdf
file_size: 1012204
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '523'
related_material:
record:
- id: '1604'
relation: later_version
status: public
status: public
title: Quantitative interprocedural analysis
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5446'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving termination
of recursive programs with one-dimensional arrays. Ranking functions serve as
a sound and complete approach for proving termination of non-recursive programs
without array operations. First, we generalize ranking functions to the notion
of measure functions, and prove that measure functions (i) provide a sound method
to prove termination of recursive programs (with one-dimensional arrays), and
(ii) is both sound and complete over recursive programs without array operations.
Our second contribution is the synthesis of measure functions of specific forms
in polynomial time. More precisely, we prove that (i) polynomial measure functions
over recursive programs can be synthesized in polynomial time through Farkas’
Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm
and exponentiation can be synthesized in polynomial time through abstraction of
logarithmic or exponential terms and Handelman’s Theorem. A key application of
our method is the worst-case analysis of recursive programs. While previous methods
obtain worst-case polynomial bounds of the form O(n^k), where k is an integer,
our polynomial time methods can synthesize bounds of the form O(n log n), as well
as O(n^x), where x is not an integer. We show the applicability of our automated
technique to obtain worst-case complexity of classical recursive algorithms such
as (i) Merge-Sort, the divideand-\r\nconquer algorithm for the Closest-Pair problem,
where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for
polynomial multiplication and Strassen’s algorithm for matrix multiplication,
where we obtain O(n^x) bound, where x is not an integer and close to the best-known
bounds for the respective algorithms. Finally, we present experimental results
to demonstrate the\r\neffectiveness of our approach."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3. Termination and Worst-Case Analysis
of Recursive Programs. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Termination and
worst-case analysis of recursive programs. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, and 3 Anonymous. Termination and Worst-Case
Analysis of Recursive Programs. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, and 3 Anonymous, Termination and worst-case analysis
of recursive programs. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3. 2016. Termination and worst-case analysis
of recursive programs, IST Austria, 26p.
mla: Anonymous, 1, et al. Termination and Worst-Case Analysis of Recursive Programs.
IST Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis
of Recursive Programs, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:05Z
day: '15'
ddc:
- '000'
file:
- access_level: open_access
checksum: 689069a7abbb34b21516164cbee9e0df
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:27:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6403'
file_name: popl2017a.pdf
file_size: 686241
relation: main_file
- access_level: closed
checksum: fc08022bfbaac07bac047a9407c0bbb3
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:27:31Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6404'
file_name: author_names.txt
file_size: 258
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '26'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '618'
status: public
title: Termination and worst-case analysis of recursive programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5447'
abstract:
- lang: eng
text: "We consider the problem of developing automated techniques to aid the average-case
complexity analysis of programs. Several classical textbook algorithms have quite
efficient average-case complexity, whereas the corresponding worst-case bounds
are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR).
Since the main focus of average-case analysis is to obtain efficient bounds, we
consider bounds that are either logarithmic,\r\nlinear, or almost-linear (O(log
n), O(n), O(n · log n),\r\nrespectively, where n represents the size of the input).
Our main contribution is a sound approach for deriving such average-case bounds
for randomized recursive programs. Our approach is efficient (a simple linear-time
algorithm), and it is based on (a) the analysis of recurrence relations induced
by randomized algorithms, and (b) a guess-and-check technique. Our approach can
infer the asymptotically optimal average-case bounds for classical randomized
algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR,
where the worstcase\r\nbounds are either inefficient (such as linear as compared
to logarithmic of average-case, or quadratic as compared to linear or almost-linear
of average-case), or ineffective. We have implemented our approach, and the experimental
results show that we obtain the bounds efficiently for various classical algorithms."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: 'Anonymous 1, Anonymous 2, Anonymous 3. Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria; 2016.'
apa: 'Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Average-case analysis
of programs: Automated recurrence analysis for almost-linear bounds. IST Austria.'
chicago: 'Anonymous, 1, 2 Anonymous, and 3 Anonymous. Average-Case Analysis of
Programs: Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria,
2016.'
ieee: '1 Anonymous, 2 Anonymous, and 3 Anonymous, Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds. IST Austria, 2016.'
ista: 'Anonymous 1, Anonymous 2, Anonymous 3. 2016. Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds, IST Austria, 20p.'
mla: 'Anonymous, 1, et al. Average-Case Analysis of Programs: Automated Recurrence
Analysis for Almost-Linear Bounds. IST Austria, 2016.'
short: '1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.'
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:06Z
day: '15'
ddc:
- '000'
file:
- access_level: closed
checksum: cf53cdb6d092e68db0b4a0a1506ef8fb
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6406'
file_name: listofauthors.txt
file_size: 281
relation: main_file
- access_level: open_access
checksum: 7bdd94ba13aa0dec9c46887fcf13870b
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6407'
file_name: popl2017b.pdf
file_size: 563642
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '619'
status: public
title: 'Average-case analysis of programs: Automated recurrence analysis for almost-linear
bounds'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5448'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1.
For acyclic architectures, our algorithm is guaranteed to explore exactly one
representative trace from each observation class, while spending polynomial time
per class. Hence, our algorithm is optimal wrt the observation equivalence, and
in several cases explores exponentially fewer traces than any enumerative method
based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider
an equivalence between traces which is finer than the observation equivalence;
but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially
coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
\r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based
DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show
a significant reduction in both running time and the number of explored equivalence
classes."
alternative_title:
- IST Austria Technical Report
arxiv: 1
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Data-Centric Dynamic
Partial Order Reduction. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2016). Data-centric
dynamic partial order reduction. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Data-Centric
Dynamic Partial Order Reduction. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Data-centric dynamic
partial order reduction. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2016. Data-centric dynamic
partial order reduction, IST Austria, 20p.
mla: Anonymous, 1, et al. Data-Centric Dynamic Partial Order Reduction. IST
Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic
Partial Order Reduction, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2023-02-23T12:27:16Z
day: '15'
ddc:
- '000'
external_id:
arxiv:
- '1610.01188'
file:
- access_level: open_access
checksum: 1d69252d66bcdf782615ddfb911d2957
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:45Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5506'
file_name: IST-2016-620-v1+1_main.pdf
file_size: 538881
relation: main_file
- access_level: closed
checksum: deabb0eb8f237cae4f9542b28b0b6eb2
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:30:40Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6405'
file_name: authornames.txt
file_size: 121
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '620'
related_material:
record:
- id: '10417'
relation: later_version
status: public
- id: '5456'
relation: later_version
status: public
status: public
title: Data-centric dynamic partial order reduction
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5449'
abstract:
- lang: eng
text: "The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population.\r\nThe
fixation probability is a fundamental quantity of natural selection, and known
to depend on the population structure.\r\nAmplifiers of natural selection are
population structures which increase the fixation probability of advantageous
mutants, as compared to the baseline case of well-mixed populations. In this work
we focus on symmetric population structures represented as undirected graphs.
In the regime of undirected graphs, the strongest amplifier known has been the
Star graph, and the existence of undirected graphs with stronger amplification
properties has remained open for over a decade.\r\nIn this work we present the
Comet and Comet-swarm families of undirected graphs. We show that for a range
of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation
probability strictly larger than the fixation probability of the Star graph, for
fixed population size and at the limit of large populations, respectively."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected
Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification
on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Amplification on Undirected Population Structures: Comets Beat Stars.
IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification
on undirected population structures: Comets beat stars. IST Austria, 2016.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on
undirected population structures: Comets beat stars, IST Austria, 22p.'
mla: 'Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures:
Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.'
short: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected
Population Structures: Comets Beat Stars, IST Austria, 2016.'
date_created: 2018-12-12T11:39:24Z
date_published: 2016-11-09T00:00:00Z
date_updated: 2023-02-23T12:22:21Z
day: '09'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-648-v1-1
file:
- access_level: open_access
checksum: 8345a8c1e7d7f0cd92516d182b7fc59e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:07Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5529'
file_name: IST-2016-648-v1+1_tr.pdf
file_size: 1264221
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Updated Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '648'
related_material:
record:
- id: '512'
relation: later_version
status: public
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5451'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural
Selection. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong
amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers
of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers
of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2016-728-v1-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of
Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:24Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2023-02-23T12:27:05Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-728-v1-1
file:
- access_level: open_access
checksum: 7b8bb17c322c0556acba6ac169fa71c1
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:04Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5465'
file_name: IST-2016-728-v1+1_main.pdf
file_size: 1014732
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '728'
status: public
title: Strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5452'
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 32p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2024-02-21T13:48:42Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-728-v2-1
ec_funded: 1
file:
- access_level: open_access
checksum: 58e895f26c82f560c0f0989bf8b08599
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:59Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5460'
file_name: IST-2017-728-v2+1_main.pdf
file_size: 811558
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '32'
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '750'
related_material:
record:
- id: '5453'
relation: later_version
status: public
- id: '5559'
relation: popular_science
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...