---
_id: '5405'
abstract:
- lang: eng
text: "The theory of graph games is the foundation for modeling and synthesizing
reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player
games where some transitions of the game graph are controlled by two adversarial
players, the System and the Environment, and the other transitions are determined
probabilistically. We consider 2-1/2-player games where the objective of the System
is the conjunction of a qualitative objective (specified as a parity condition)
and a quantitative objective (specified as a mean-payoff condition). We establish
that the problem of deciding whether the System can ensure that the probability
to satisfy the mean-payoff parity objective is at least a given threshold is in
NP ∩ coNP, matching the best known bound in the special case of 2-player games
(where all transitions are deterministic) with only parity objectives, or with
only mean-payoff objectives. We present an algorithm running\r\nin time O(d ·
n^{2d}·MeanGame) to compute the set of almost-sure winning states from which the
objective\r\ncan be ensured with probability 1, where n is the number of states
of the game, d the number of priorities\r\nof the parity objective, and MeanGame
is the complexity to compute the set of almost-sure winning states\r\nin 2-1/2-player
mean-payoff games. Our results are useful in the synthesis of stochastic reactive
systems\r\nwith both functional requirement (given as a qualitative objective)
and performance requirement (given\r\nas a quantitative objective)."
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- first_name: Youssouf
full_name: Oualhadj, Youssouf
last_name: Oualhadj
citation:
ama: Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-Information Stochastic
Mean-Payoff Parity Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-128-v1-1
apa: Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information
stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj.
Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013.
https://doi.org/10.15479/AT:IST-2013-128-v1-1.
ieee: K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information
stochastic mean-payoff parity games. IST Austria, 2013.
ista: Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic
mean-payoff parity games, IST Austria, 22p.
mla: Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff
Parity Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-128-v1-1.
short: K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic
Mean-Payoff Parity Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-08T00:00:00Z
date_updated: 2023-02-23T10:33:08Z
day: '08'
ddc:
- '000'
- '005'
- '510'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-128-v1-1
file:
- access_level: open_access
checksum: ede787a10e74e4f7db302fab8f12f3ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:54Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5516'
file_name: IST-2013-128-v1+1_full_stoch_mpp.pdf
file_size: 387467
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '128'
related_material:
record:
- id: '2212'
relation: later_version
status: public
status: public
title: Perfect-information stochastic mean-payoff parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5406'
abstract:
- lang: eng
text: 'We consider the distributed synthesis problem fortemporal logic specifications.
Traditionally, the problem has been studied for LTL, and the previous results
show that the problem is decidable iff there is no information fork in the architecture.
We consider the problem for fragments of LTLand our main results are as follows:
(1) We show that the problem is undecidable for architectures with information
forks even for the fragment of LTL with temporal operators restricted to next
and eventually. (2) For specifications restricted to globally along with non-nested
next operators, we establish decidability (in EXPSPACE) for star architectures
where the processes receive disjoint inputs, whereas we establish undecidability
for architectures containing an information fork-meet structure. (3)Finally, we
consider LTL without the next operator, and establish decidability (NEXPTIME-complete)
for all architectures for a fragment that consists of a set of safety assumptions,
and a set of guarantees where each guarantee is a safety, reachability, or liveness
condition.'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- 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, Henzinger TA, Otop J, Pavlogiannis A. Distributed Synthesis
for LTL Fragments. IST Austria; 2013. doi:10.15479/AT:IST-2013-130-v1-1
apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013).
Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis.
Distributed Synthesis for LTL Fragments. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-130-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed
synthesis for LTL Fragments. IST Austria, 2013.
ista: Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis
for LTL Fragments, IST Austria, 11p.
mla: Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments.
IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.
short: K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis
for LTL Fragments, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-08T00:00:00Z
date_updated: 2023-02-21T17:01:26Z
day: '08'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2013-130-v1-1
file:
- access_level: open_access
checksum: 855513ebaf6f72228800c5fdb522f93c
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:18Z
date_updated: 2020-07-14T12:46:45Z
file_id: '5540'
file_name: IST-2013-130-v1+1_Distributed_Synthesis.pdf
file_size: 467895
relation: main_file
file_date_updated: 2020-07-14T12:46:45Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '11'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '130'
related_material:
record:
- id: '1376'
relation: later_version
status: public
status: public
title: Distributed synthesis for LTL Fragments
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5407'
abstract:
- lang: eng
text: This document is created as a part of the project “Repository for Research
Data at IST Austria”. It summarises the mandatory features, which need to be fulfilled
to provide an institutional repository as a platform and also a service to the
scientists at the institute. It also includes optional features, which would be
of strong benefit for the scientists and would increase the usage of the repository,
and hence the visibility of research at IST Austria.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Technical Requirements and Features. IST Austria; 2013.
apa: Porsche, J. (2013). Technical requirements and features. IST Austria.
chicago: Porsche, Jana. Technical Requirements and Features. IST Austria,
2013.
ieee: J. Porsche, Technical requirements and features. IST Austria, 2013.
ista: Porsche J. 2013. Technical requirements and features, IST Austria,p.
mla: Porsche, Jana. Technical Requirements and Features. IST Austria, 2013.
short: J. Porsche, Technical Requirements and Features, IST Austria, 2013.
date_created: 2018-12-12T11:39:09Z
date_published: 2013-07-13T00:00:00Z
date_updated: 2020-07-14T23:07:51Z
day: '13'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: 9e4f9abf79a56f651f0012a34909880f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:02Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5463'
file_name: IST-2013-135-v1+1_Features.pdf
file_size: 90311
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
pubrep_id: '135'
status: public
title: Technical requirements and features
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5408'
abstract:
- lang: eng
text: "We consider two-player partial-observation stochastic games where player
1 has partial observation and player 2 has perfect observation. The winning condition
we study are omega-regular conditions specified as parity objectives. The qualitative
analysis problem given a partial-observation stochastic game 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 known to be undecidable even for very special cases of parity objectives,
they were shown to be decidable in 2EXPTIME under finite-memory strategies. We
improve the complexity and show that the qualitative analysis problems for partial-observation
stochastic parity games under finite-memory strategies are \r\nEXPTIME-complete;
and also establish optimal (exponential) memory bounds for finite-memory strategies
required for qualitative analysis. "
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Sumit
full_name: Nain, Sumit
last_name: Nain
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: Chatterjee K, Doyen L, Nain S, Vardi M. The Complexity of Partial-Observation
Stochastic Parity Games with Finite-Memory Strategies. IST Austria; 2013.
doi:10.15479/AT:IST-2013-141-v1-1
apa: Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2013). The complexity
of partial-observation stochastic parity games with finite-memory strategies.
IST Austria. https://doi.org/10.15479/AT:IST-2013-141-v1-1
chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The
Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.
IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-141-v1-1.
ieee: K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation
stochastic parity games with finite-memory strategies. IST Austria, 2013.
ista: Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation
stochastic parity games with finite-memory strategies, IST Austria, 17p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic
Parity Games with Finite-Memory Strategies. IST Austria, 2013, doi:10.15479/AT:IST-2013-141-v1-1.
short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation
Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-09-12T00:00:00Z
date_updated: 2023-02-23T10:33:11Z
day: '12'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-141-v1-1
file:
- access_level: open_access
checksum: 226bc791124f8d3138379778ce834e86
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:16Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5477'
file_name: IST-2013-141-v1+1_main-tech-rpt.pdf
file_size: 300481
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '141'
related_material:
record:
- id: '2213'
relation: later_version
status: public
status: public
title: The complexity of partial-observation stochastic parity games with finite-memory
strategies
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5409'
abstract:
- lang: eng
text: "The edit distance between two (untimed) traces is the minimum cost of a sequence
of edit operations (insertion, deletion, or substitution) needed to transform
one trace to the other. Edit distances have been extensively studied in the untimed
setting, and form the basis for approximate matching of sequences in different
domains such as coding theory, parsing, and speech recognition. \r\nIn this paper,
we lift the study of edit distances from untimed languages to the timed setting.
We define an edit distance between timed words which incorporates both the edit
distance between the untimed words and the absolute difference in timestamps.
Our edit distance between two timed words is computable in polynomial time. Further,
we show that the edit distance between a timed word and a timed language generated
by a timed automaton, defined as the edit distance between the word and the closest
word in the language, is PSPACE-complete. While computing the edit distance between
two timed automata is undecidable, we show that the approximate version, where
we decide if the edit distance between two timed automata is either less than
a given parameter or more than delta away from the parameter, for delta>0, can
be solved in exponential space and is EXPSPACE-hard. Our definitions and techniques
can be generalized to the setting of hybrid systems, and we show analogous decidability
results for rectangular automata."
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
citation:
ama: Chatterjee K, Ibsen-Jensen R, Majumdar R. Edit Distance for Timed Automata.
IST Austria; 2013. doi:10.15479/AT:IST-2013-144-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Majumdar, R. (2013). Edit distance
for timed automata. IST Austria. https://doi.org/10.15479/AT:IST-2013-144-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit
Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed
automata. IST Austria, 2013.
ista: Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata,
IST Austria, 12p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Timed Automata. IST
Austria, 2013, doi:10.15479/AT:IST-2013-144-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata,
IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-10-30T00:00:00Z
date_updated: 2023-02-23T10:33:18Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-144-v1-1
file:
- access_level: open_access
checksum: 0f7633081ba8299c543322f0ad08571f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:08Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5469'
file_name: IST-2013-144-v1+1_main.pdf
file_size: 336377
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '12'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '144'
related_material:
record:
- id: '2216'
relation: later_version
status: public
status: public
title: Edit distance for timed automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5410'
abstract:
- lang: eng
text: "Board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only
in development of mathematical and logical skills, but also in emotional and social
development. In this paper, we address the problem of generating targeted starting
positions for such games. This can facilitate new approaches for bringing novice
players to mastery, and also leads to discovery of interesting game variants.
\r\nOur approach generates starting states of varying hardness levels for player
1 in a two-player board game, given rules of the board game, the desired number
of steps required for player 1 to win, and the expertise levels of the two players.
Our approach leverages symbolic methods and iterative simulation to efficiently
search the extremely large state space. We present experimental results that include
discovery of states of varying hardness levels for several simple grid-based board
games. Also, the presence of such states for standard game variants like Tic-Tac-Toe
on board size 4x4 opens up new games to be played that have not been played for
ages since the default start state is heavily biased. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: Ahmed U, Chatterjee K, Gulwani S. Automatic Generation of Alternative Starting
Positions for Traditional Board Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-146-v1-1
apa: Ahmed, U., Chatterjee, K., & Gulwani, S. (2013). Automatic generation
of alternative starting positions for traditional board games. IST Austria.
https://doi.org/10.15479/AT:IST-2013-146-v1-1
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation
of Alternative Starting Positions for Traditional Board Games. IST Austria,
2013. https://doi.org/10.15479/AT:IST-2013-146-v1-1.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative
starting positions for traditional board games. IST Austria, 2013.
ista: Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative
starting positions for traditional board games, IST Austria, 13p.
mla: Ahmed, Umair, et al. Automatic Generation of Alternative Starting Positions
for Traditional Board Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-146-v1-1.
short: U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative
Starting Positions for Traditional Board Games, IST Austria, 2013.
date_created: 2018-12-12T11:39:10Z
date_published: 2013-12-03T00:00:00Z
date_updated: 2023-02-23T10:00:50Z
day: '03'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2013-146-v1-1
file:
- access_level: open_access
checksum: 409f3aaaf1184e4057b89cbb449dac80
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:06Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5528'
file_name: IST-2013-146-v1+1_main.pdf
file_size: 818189
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '13'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '146'
related_material:
record:
- id: '1481'
relation: later_version
status: public
status: public
title: Automatic generation of alternative starting positions for traditional board
games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '5747'
article_processing_charge: No
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: 'Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent
Objects with Cooperating Updates. In: Computer Aided Verification. Vol
8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:10.1007/978-3-642-39799-8_11'
apa: 'Dragoi, C., Gupta, A., & Henzinger, T. A. (2013). Automatic Linearizability
Proofs of Concurrent Objects with Cooperating Updates. In Computer Aided Verification
(Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-39799-8_11'
chicago: 'Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability
Proofs of Concurrent Objects with Cooperating Updates.” In Computer Aided Verification,
8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39799-8_11.'
ieee: 'C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs
of Concurrent Objects with Cooperating Updates,” in Computer Aided Verification,
vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.'
ista: 'Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of
Concurrent Objects with Cooperating Updates. In: Computer Aided Verification.
vol. 8044, 174–190.'
mla: Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects
with Cooperating Updates.” Computer Aided Verification, vol. 8044, Springer
Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.
short: C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.
conference:
end_date: 2013-07-19
location: Saint Petersburg, Russia
name: CAV 2013
start_date: 2013-07-13
date_created: 2018-12-18T13:10:21Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-09-05T14:16:07Z
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39799-8_11
ec_funded: 1
file:
- access_level: open_access
checksum: a901cc6b71db08b61c0d4c0cbacc6287
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:13:33Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5748'
file_name: 2013_CAV_Dragoi.pdf
file_size: 236480
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 8044'
language:
- iso: eng
oa: 1
oa_version: None
page: 174-190
place: Berlin, Heidelberg
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783642397981'
- '9783642397998'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
pubrep_id: '195'
quality_controlled: '1'
scopus_import: '1'
series_title: CAV
status: public
title: Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8044
year: '2013'
...
---
_id: '590'
abstract:
- lang: eng
text: We present two methods of creating two orthogonally-polarized focal points
at customizable relative locations. These schemes may be critical for enhancing
entanglement sources and other applications.
alternative_title:
- Optics InfoBase Conference Papers
author:
- first_name: David
full_name: Schmid, David
last_name: Schmid
- first_name: Ting
full_name: Huang, Ting-Yu
last_name: Huang
- first_name: Radhika
full_name: Dirks, Radhika
last_name: Dirks
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Paul
full_name: Kwiat, Paul G
last_name: Kwiat
citation:
ama: 'Schmid D, Huang T, Dirks R, Hosten O, Kwiat P. Polarization dependent focusing.
In: OSA; 2013. doi:10.1364/QIM.2013.W6.23'
apa: 'Schmid, D., Huang, T., Dirks, R., Hosten, O., & Kwiat, P. (2013). Polarization
dependent focusing. Presented at the QIM: Quantum Information and Measurement,
OSA. https://doi.org/10.1364/QIM.2013.W6.23'
chicago: Schmid, David, Ting Huang, Radhika Dirks, Onur Hosten, and Paul Kwiat.
“Polarization Dependent Focusing.” OSA, 2013. https://doi.org/10.1364/QIM.2013.W6.23.
ieee: 'D. Schmid, T. Huang, R. Dirks, O. Hosten, and P. Kwiat, “Polarization dependent
focusing,” presented at the QIM: Quantum Information and Measurement, 2013.'
ista: 'Schmid D, Huang T, Dirks R, Hosten O, Kwiat P. 2013. Polarization dependent
focusing. QIM: Quantum Information and Measurement, Optics InfoBase Conference
Papers, .'
mla: Schmid, David, et al. Polarization Dependent Focusing. OSA, 2013, doi:10.1364/QIM.2013.W6.23.
short: D. Schmid, T. Huang, R. Dirks, O. Hosten, P. Kwiat, in:, OSA, 2013.
conference:
name: 'QIM: Quantum Information and Measurement'
date_created: 2018-12-11T11:47:22Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T08:05:10Z
day: '01'
doi: 10.1364/QIM.2013.W6.23
extern: 1
month: '01'
publication_status: published
publisher: OSA
publist_id: '7217'
quality_controlled: 0
status: public
title: Polarization dependent focusing
type: conference
year: '2013'
...
---
_id: '591'
abstract:
- lang: eng
text: We present two methods for the precise independent focusing of orthogonal
linear polarizations of light at arbitrary relative locations. Our first scheme
uses a displaced lens in a polarization Sagnac interferometer to provide adjustable
longitudinal and lateral focal displacements via simple geometry; the second uses
uniaxial crystals to achieve the same effect in a compact collinear setup. We
develop the theoretical applications and limitations of our schemes, and provide
experimental confirmation of our calculations.
author:
- first_name: David
full_name: Schmid, David
last_name: Schmid
- first_name: Ting
full_name: Huang, Ting-Yu
last_name: Huang
- first_name: Shiraz
full_name: Hazrat, Shiraz
last_name: Hazrat
- first_name: Radhika
full_name: Dirks, Radhika
last_name: Dirks
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Stephan
full_name: Quint, Stephan
last_name: Quint
- first_name: Dickson
full_name: Thian, Dickson
last_name: Thian
- first_name: Paul
full_name: Kwiat, Paul G
last_name: Kwiat
citation:
ama: Schmid D, Huang T, Hazrat S, et al. Adjustable and robust methods for polarization-dependent
focusing. Optics Express. 2013;21(13):15538-15552. doi:10.1364/OE.21.015538
apa: Schmid, D., Huang, T., Hazrat, S., Dirks, R., Hosten, O., Quint, S., … Kwiat,
P. (2013). Adjustable and robust methods for polarization-dependent focusing.
Optics Express. Optical Society of America. https://doi.org/10.1364/OE.21.015538
chicago: Schmid, David, Ting Huang, Shiraz Hazrat, Radhika Dirks, Onur Hosten, Stephan
Quint, Dickson Thian, and Paul Kwiat. “Adjustable and Robust Methods for Polarization-Dependent
Focusing.” Optics Express. Optical Society of America, 2013. https://doi.org/10.1364/OE.21.015538.
ieee: D. Schmid et al., “Adjustable and robust methods for polarization-dependent
focusing,” Optics Express, vol. 21, no. 13. Optical Society of America,
pp. 15538–15552, 2013.
ista: Schmid D, Huang T, Hazrat S, Dirks R, Hosten O, Quint S, Thian D, Kwiat P.
2013. Adjustable and robust methods for polarization-dependent focusing. Optics
Express. 21(13), 15538–15552.
mla: Schmid, David, et al. “Adjustable and Robust Methods for Polarization-Dependent
Focusing.” Optics Express, vol. 21, no. 13, Optical Society of America,
2013, pp. 15538–52, doi:10.1364/OE.21.015538.
short: D. Schmid, T. Huang, S. Hazrat, R. Dirks, O. Hosten, S. Quint, D. Thian,
P. Kwiat, Optics Express 21 (2013) 15538–15552.
date_created: 2018-12-11T11:47:22Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2021-01-12T08:05:12Z
day: '01'
doi: 10.1364/OE.21.015538
extern: 1
intvolume: ' 21'
issue: '13'
month: '07'
page: 15538 - 15552
publication: Optics Express
publication_status: published
publisher: Optical Society of America
publist_id: '7218'
quality_controlled: 0
status: public
title: Adjustable and robust methods for polarization-dependent focusing
type: journal_article
volume: 21
year: '2013'
...
---
_id: '5920'
abstract:
- lang: eng
text: We study chains of lattice ideals that are invariant under a symmetric group
action. In our setting, the ambient rings for these ideals are polynomial rings
which are increasing in (Krull) dimension. Thus, these chains will fail to stabilize
in the traditional commutative algebra sense. However, we prove a theorem which
says that “up to the action of the group”, these chains locally stabilize. We
also give an algorithm, which we have implemented in software, for explicitly
constructing these stabilization generators for a family of Laurent toric ideals
involved in applications to algebraic statistics. We close with several open problems
and conjectures arising from our theoretical and computational investigations.
article_processing_charge: No
article_type: original
author:
- first_name: Christopher J.
full_name: Hillar, Christopher J.
last_name: Hillar
- first_name: Abraham
full_name: Martin del Campo Sanchez, Abraham
id: 4CF47F6A-F248-11E8-B48F-1D18A9856A87
last_name: Martin del Campo Sanchez
citation:
ama: Hillar CJ, Martin del Campo Sanchez A. Finiteness theorems and algorithms for
permutation invariant chains of Laurent lattice ideals. Journal of Symbolic
Computation. 2013;50:314-334. doi:10.1016/j.jsc.2012.06.006
apa: Hillar, C. J., & Martin del Campo Sanchez, A. (2013). Finiteness theorems
and algorithms for permutation invariant chains of Laurent lattice ideals. Journal
of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2012.06.006
chicago: Hillar, Christopher J., and Abraham Martin del Campo Sanchez. “Finiteness
Theorems and Algorithms for Permutation Invariant Chains of Laurent Lattice Ideals.”
Journal of Symbolic Computation. Elsevier, 2013. https://doi.org/10.1016/j.jsc.2012.06.006.
ieee: C. J. Hillar and A. Martin del Campo Sanchez, “Finiteness theorems and algorithms
for permutation invariant chains of Laurent lattice ideals,” Journal of Symbolic
Computation, vol. 50. Elsevier, pp. 314–334, 2013.
ista: Hillar CJ, Martin del Campo Sanchez A. 2013. Finiteness theorems and algorithms
for permutation invariant chains of Laurent lattice ideals. Journal of Symbolic
Computation. 50, 314–334.
mla: Hillar, Christopher J., and Abraham Martin del Campo Sanchez. “Finiteness Theorems
and Algorithms for Permutation Invariant Chains of Laurent Lattice Ideals.” Journal
of Symbolic Computation, vol. 50, Elsevier, 2013, pp. 314–34, doi:10.1016/j.jsc.2012.06.006.
short: C.J. Hillar, A. Martin del Campo Sanchez, Journal of Symbolic Computation
50 (2013) 314–334.
date_created: 2019-02-05T08:48:24Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2021-01-12T08:05:15Z
day: '01'
doi: 10.1016/j.jsc.2012.06.006
extern: '1'
intvolume: ' 50'
language:
- iso: eng
month: '03'
oa_version: None
page: 314-334
publication: Journal of Symbolic Computation
publication_identifier:
issn:
- 0747-7171
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1016/j.jsc.2015.09.002
status: public
title: Finiteness theorems and algorithms for permutation invariant chains of Laurent
lattice ideals
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2013'
...
---
_id: '595'
article_processing_charge: No
author:
- first_name: Carrie A
full_name: Bernecky, Carrie A
id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87
last_name: Bernecky
orcid: 0000-0003-0893-7036
- first_name: Patrick
full_name: Cramer, Patrick
last_name: Cramer
citation:
ama: 'Bernecky C, Cramer P. Struggling to let go: A non-coding RNA directs its own
extension and destruction. EMBO Journal. 2013;32(6):771-772. doi:10.1038/emboj.2013.36'
apa: 'Bernecky, C., & Cramer, P. (2013). Struggling to let go: A non-coding
RNA directs its own extension and destruction. EMBO Journal. Wiley-Blackwell.
https://doi.org/10.1038/emboj.2013.36'
chicago: 'Bernecky, Carrie, and Patrick Cramer. “Struggling to Let Go: A Non-Coding
RNA Directs Its Own Extension and Destruction.” EMBO Journal. Wiley-Blackwell,
2013. https://doi.org/10.1038/emboj.2013.36.'
ieee: 'C. Bernecky and P. Cramer, “Struggling to let go: A non-coding RNA directs
its own extension and destruction,” EMBO Journal, vol. 32, no. 6. Wiley-Blackwell,
pp. 771–772, 2013.'
ista: 'Bernecky C, Cramer P. 2013. Struggling to let go: A non-coding RNA directs
its own extension and destruction. EMBO Journal. 32(6), 771–772.'
mla: 'Bernecky, Carrie, and Patrick Cramer. “Struggling to Let Go: A Non-Coding
RNA Directs Its Own Extension and Destruction.” EMBO Journal, vol. 32,
no. 6, Wiley-Blackwell, 2013, pp. 771–72, doi:10.1038/emboj.2013.36.'
short: C. Bernecky, P. Cramer, EMBO Journal 32 (2013) 771–772.
date_created: 2018-12-11T11:47:23Z
date_published: 2013-03-20T00:00:00Z
date_updated: 2021-01-12T08:05:20Z
day: '20'
doi: 10.1038/emboj.2013.36
extern: '1'
intvolume: ' 32'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3604726/
month: '03'
oa: 1
oa_version: None
page: 771 - 772
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7207'
status: public
title: 'Struggling to let go: A non-coding RNA directs its own extension and destruction'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
_id: '6128'
abstract:
- lang: eng
text: Different interoceptive systems must be integrated to ensure that multiple
homeostatic insults evoke appropriate behavioral and physiological responses.
Little is known about how this is achieved. Using C. elegans, we dissect cross-modulation
between systems that monitor temperature, O2 and CO2. CO2 is less aversive to
animals acclimated to 15°C than those grown at 22°C. This difference requires
the AFD neurons, which respond to both temperature and CO2 changes. CO2 evokes
distinct AFD Ca2+ responses in animals acclimated at 15°C or 22°C. Mutants defective
in synaptic transmission can reprogram AFD CO2 responses according to temperature
experience, suggesting reprogramming occurs cell autonomously. AFD is exquisitely
sensitive to CO2. Surprisingly, gradients of 0.01% CO2/second evoke very different
Ca2+ responses from gradients of 0.04% CO2/second. Ambient O2 provides further
contextual modulation of CO2 avoidance. At 21% O2 tonic signalling from the O2-sensing
neuron URX inhibits CO2 avoidance. This inhibition can be graded according to
O2 levels. In a natural wild isolate, a switch from 21% to 19% O2 is sufficient
to convert CO2 from a neutral to an aversive cue. This sharp tuning is conferred
partly by the neuroglobin GLB-5. The modulatory effects of O2 on CO2 avoidance
involve the RIA interneurons, which are post-synaptic to URX and exhibit CO2-evoked
Ca2+ responses. Ambient O2 and acclimation temperature act combinatorially to
modulate CO2 responsiveness. Our work highlights the integrated architecture of
homeostatic responses in C. elegans.
article_number: e1004011
author:
- first_name: Eiji
full_name: Kodama-Namba, Eiji
last_name: Kodama-Namba
- first_name: Lorenz A.
full_name: Fenk, Lorenz A.
last_name: Fenk
- first_name: Andrew J.
full_name: Bretscher, Andrew J.
last_name: Bretscher
- first_name: Einav
full_name: Gross, Einav
last_name: Gross
- first_name: K. Emanuel
full_name: Busch, K. Emanuel
last_name: Busch
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Kodama-Namba E, Fenk LA, Bretscher AJ, Gross E, Busch KE, de Bono M. Cross-modulation
of homeostatic responses to temperature, oxygen and carbon dioxide in C. elegans.
PLoS Genetics. 2013;9(12). doi:10.1371/journal.pgen.1004011
apa: Kodama-Namba, E., Fenk, L. A., Bretscher, A. J., Gross, E., Busch, K. E., &
de Bono, M. (2013). Cross-modulation of homeostatic responses to temperature,
oxygen and carbon dioxide in C. elegans. PLoS Genetics. Public Library
of Science (PLoS). https://doi.org/10.1371/journal.pgen.1004011
chicago: Kodama-Namba, Eiji, Lorenz A. Fenk, Andrew J. Bretscher, Einav Gross, K.
Emanuel Busch, and Mario de Bono. “Cross-Modulation of Homeostatic Responses to
Temperature, Oxygen and Carbon Dioxide in C. Elegans.” PLoS Genetics. Public
Library of Science (PLoS), 2013. https://doi.org/10.1371/journal.pgen.1004011.
ieee: E. Kodama-Namba, L. A. Fenk, A. J. Bretscher, E. Gross, K. E. Busch, and M.
de Bono, “Cross-modulation of homeostatic responses to temperature, oxygen and
carbon dioxide in C. elegans,” PLoS Genetics, vol. 9, no. 12. Public Library
of Science (PLoS), 2013.
ista: Kodama-Namba E, Fenk LA, Bretscher AJ, Gross E, Busch KE, de Bono M. 2013.
Cross-modulation of homeostatic responses to temperature, oxygen and carbon dioxide
in C. elegans. PLoS Genetics. 9(12), e1004011.
mla: Kodama-Namba, Eiji, et al. “Cross-Modulation of Homeostatic Responses to Temperature,
Oxygen and Carbon Dioxide in C. Elegans.” PLoS Genetics, vol. 9, no. 12,
e1004011, Public Library of Science (PLoS), 2013, doi:10.1371/journal.pgen.1004011.
short: E. Kodama-Namba, L.A. Fenk, A.J. Bretscher, E. Gross, K.E. Busch, M. de Bono,
PLoS Genetics 9 (2013).
date_created: 2019-03-19T14:58:51Z
date_published: 2013-12-19T00:00:00Z
date_updated: 2021-01-12T08:06:15Z
day: '19'
ddc:
- '570'
doi: 10.1371/journal.pgen.1004011
extern: '1'
external_id:
pmid:
- '24385919'
file:
- access_level: open_access
checksum: 299b6321be79931c7c17c5db6e69c711
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T15:14:51Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6129'
file_name: 2013_PLOS_Kodama-Namba.PDF
file_size: 4499039
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Genetics
publication_identifier:
issn:
- 1553-7404
publication_status: published
publisher: Public Library of Science (PLoS)
quality_controlled: '1'
status: public
title: Cross-modulation of homeostatic responses to temperature, oxygen and carbon
dioxide in C. elegans
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: 9
year: '2013'
...
---
_id: '6130'
abstract:
- lang: eng
text: 'Cas9 is an RNA-guided double-stranded DNA nuclease that participates in clustered
regularly interspaced short palindromic repeats (CRISPR)-mediated adaptive immunity
in prokaryotes. CRISPR–Cas9 has recently been used to generate insertion and deletion
mutations in Caenorhabditis elegans, but not to create tailored changes (knock-ins).
We show that the CRISPR–CRISPR-associated (Cas) system can be adapted for efficient
and precise editing of the C. elegans genome. The targeted double-strand breaks
generated by CRISPR are substrates for transgene-instructed gene conversion. This
allows customized changes in the C. elegans genome by homologous recombination:
sequences contained in the repair template (the transgene) are copied by gene
conversion into the genome. The possibility to edit the C. elegans genome at selected
locations will facilitate the systematic study of gene function in this widely
used model organism.'
article_number: e193
author:
- first_name: Changchun
full_name: Chen, Changchun
last_name: Chen
- first_name: Lorenz A.
full_name: Fenk, Lorenz A.
last_name: Fenk
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Chen C, Fenk LA, de Bono M. Efficient genome editing in Caenorhabditis elegans
by CRISPR-targeted homologous recombination. Nucleic Acids Research. 2013;41(20).
doi:10.1093/nar/gkt805
apa: Chen, C., Fenk, L. A., & de Bono, M. (2013). Efficient genome editing in
Caenorhabditis elegans by CRISPR-targeted homologous recombination. Nucleic
Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gkt805
chicago: Chen, Changchun, Lorenz A. Fenk, and Mario de Bono. “Efficient Genome Editing
in Caenorhabditis Elegans by CRISPR-Targeted Homologous Recombination.” Nucleic
Acids Research. Oxford University Press, 2013. https://doi.org/10.1093/nar/gkt805.
ieee: C. Chen, L. A. Fenk, and M. de Bono, “Efficient genome editing in Caenorhabditis
elegans by CRISPR-targeted homologous recombination,” Nucleic Acids Research,
vol. 41, no. 20. Oxford University Press, 2013.
ista: Chen C, Fenk LA, de Bono M. 2013. Efficient genome editing in Caenorhabditis
elegans by CRISPR-targeted homologous recombination. Nucleic Acids Research. 41(20),
e193.
mla: Chen, Changchun, et al. “Efficient Genome Editing in Caenorhabditis Elegans
by CRISPR-Targeted Homologous Recombination.” Nucleic Acids Research, vol.
41, no. 20, e193, Oxford University Press, 2013, doi:10.1093/nar/gkt805.
short: C. Chen, L.A. Fenk, M. de Bono, Nucleic Acids Research 41 (2013).
date_created: 2019-03-19T15:17:40Z
date_published: 2013-11-01T00:00:00Z
date_updated: 2021-01-12T08:06:16Z
day: '01'
ddc:
- '570'
doi: 10.1093/nar/gkt805
extern: '1'
external_id:
pmid:
- '24013562'
file:
- access_level: open_access
checksum: 0f1f127cefd043cb922b292e1cd16f02
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T15:25:42Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6131'
file_name: 2013_OUP_Chen.pdf
file_size: 340225
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 41'
issue: '20'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nucleic Acids Research
publication_identifier:
issn:
- 1362-4962
- 0305-1048
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
status: public
title: Efficient genome editing in Caenorhabditis elegans by CRISPR-targeted homologous
recombination
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2013'
...
---
_id: '6132'
author:
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: W.R.
full_name: Schafer, W.R.
last_name: Schafer
- first_name: A.
full_name: Gottschalk, A.
last_name: Gottschalk
citation:
ama: 'de Bono M, Schafer WR, Gottschalk A. Optogenetic actuation, inhibition, modulation
and readout for neuronal networks generating behavior in the nematode Caenorhabditis
elegans. In: Hegemann P, Sigrist S, eds. Optogenetics. Walter de Gruyter;
2013:61-78.'
apa: de Bono, M., Schafer, W. R., & Gottschalk, A. (2013). Optogenetic actuation,
inhibition, modulation and readout for neuronal networks generating behavior in
the nematode Caenorhabditis elegans. In P. Hegemann & S. Sigrist (Eds.), Optogenetics
(pp. 61–78). Walter de Gruyter.
chicago: Bono, Mario de, W.R. Schafer, and A. Gottschalk. “Optogenetic Actuation,
Inhibition, Modulation and Readout for Neuronal Networks Generating Behavior in
the Nematode Caenorhabditis Elegans.” In Optogenetics, edited by Peter
Hegemann and Stephan Sigrist, 61–78. Walter de Gruyter, 2013.
ieee: M. de Bono, W. R. Schafer, and A. Gottschalk, “Optogenetic actuation, inhibition,
modulation and readout for neuronal networks generating behavior in the nematode
Caenorhabditis elegans,” in Optogenetics, P. Hegemann and S. Sigrist, Eds.
Walter de Gruyter, 2013, pp. 61–78.
ista: 'de Bono M, Schafer WR, Gottschalk A. 2013.Optogenetic actuation, inhibition,
modulation and readout for neuronal networks generating behavior in the nematode
Caenorhabditis elegans. In: Optogenetics. , 61–78.'
mla: de Bono, Mario, et al. “Optogenetic Actuation, Inhibition, Modulation and Readout
for Neuronal Networks Generating Behavior in the Nematode Caenorhabditis Elegans.”
Optogenetics, edited by Peter Hegemann and Stephan Sigrist, Walter de Gruyter,
2013, pp. 61–78.
short: M. de Bono, W.R. Schafer, A. Gottschalk, in:, P. Hegemann, S. Sigrist (Eds.),
Optogenetics, Walter de Gruyter, 2013, pp. 61–78.
date_created: 2019-03-20T13:54:05Z
date_published: 2013-08-28T00:00:00Z
date_updated: 2021-01-12T08:06:16Z
day: '28'
editor:
- first_name: Peter
full_name: Hegemann, Peter
last_name: Hegemann
- first_name: Stephan
full_name: Sigrist, Stephan
last_name: Sigrist
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 61-78
publication: Optogenetics
publication_identifier:
isbn:
- 9783110270723; 9783110270716
publication_status: published
publisher: Walter de Gruyter
quality_controlled: '1'
status: public
title: Optogenetic actuation, inhibition, modulation and readout for neuronal networks
generating behavior in the nematode Caenorhabditis elegans
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '6133'
abstract:
- lang: eng
text: cGMP signaling is widespread in the nervous system. However, it has proved
difficult to visualize and genetically probe endogenously evoked cGMP dynamics
in neurons in vivo. Here, we combine cGMP and Ca2+ biosensors to image and dissect
a cGMP signaling network in a Caenorhabditis elegans oxygen-sensing neuron. We
show that a rise in O2 can evoke a tonic increase in cGMP that requires an atypical
O2-binding soluble guanylate cyclase and that is sustained until oxygen levels
fall. Increased cGMP leads to a sustained Ca2+ response in the neuron that depends
on cGMP-gated ion channels. Elevated levels of cGMP and Ca2+ stimulate competing
negative feedback loops that shape cGMP dynamics. Ca2+-dependent negative feedback
loops, including activation of phosphodiesterase-1 (PDE-1), dampen the rise of
cGMP. A different negative feedback loop, mediated by phosphodiesterase-2 (PDE-2)
and stimulated by cGMP-dependent kinase (PKG), unexpectedly promotes cGMP accumulation
following a rise in O2, apparently by keeping in check gating of cGMP channels
and limiting activation of Ca2+-dependent negative feedback loops. Simultaneous
imaging of Ca2+ and cGMP suggests that cGMP levels can rise close to cGMP channels
while falling elsewhere. O2-evoked cGMP and Ca2+ responses are highly reproducible
when the same neuron in an individual animal is stimulated repeatedly, suggesting
that cGMP transduction has high intrinsic reliability. However, responses vary
substantially across individuals, despite animals being genetically identical
and similarly reared. This variability may reflect stochastic differences in expression
of cGMP signaling components. Our work provides in vivo insights into the architecture
of neuronal cGMP signaling.
author:
- first_name: A.
full_name: Couto, A.
last_name: Couto
- first_name: S.
full_name: Oda, S.
last_name: Oda
- first_name: V. O.
full_name: Nikolaev, V. O.
last_name: Nikolaev
- first_name: Z.
full_name: Soltesz, Z.
last_name: Soltesz
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Couto A, Oda S, Nikolaev VO, Soltesz Z, de Bono M. In vivo genetic dissection
of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor. Proceedings
of the National Academy of Sciences. 2013;110(35):E3301-E3310. doi:10.1073/pnas.1217428110
apa: Couto, A., Oda, S., Nikolaev, V. O., Soltesz, Z., & de Bono, M. (2013).
In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans
gas sensor. Proceedings of the National Academy of Sciences. Proceedings
of the National Academy of Sciences. https://doi.org/10.1073/pnas.1217428110
chicago: Couto, A., S. Oda, V. O. Nikolaev, Z. Soltesz, and Mario de Bono. “In Vivo
Genetic Dissection of O2-Evoked CGMP Dynamics in a Caenorhabditis Elegans Gas
Sensor.” Proceedings of the National Academy of Sciences. Proceedings of
the National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1217428110.
ieee: A. Couto, S. Oda, V. O. Nikolaev, Z. Soltesz, and M. de Bono, “In vivo genetic
dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor,”
Proceedings of the National Academy of Sciences, vol. 110, no. 35. Proceedings
of the National Academy of Sciences, pp. E3301–E3310, 2013.
ista: Couto A, Oda S, Nikolaev VO, Soltesz Z, de Bono M. 2013. In vivo genetic dissection
of O2-evoked cGMP dynamics in a Caenorhabditis elegans gas sensor. Proceedings
of the National Academy of Sciences. 110(35), E3301–E3310.
mla: Couto, A., et al. “In Vivo Genetic Dissection of O2-Evoked CGMP Dynamics in
a Caenorhabditis Elegans Gas Sensor.” Proceedings of the National Academy of
Sciences, vol. 110, no. 35, Proceedings of the National Academy of Sciences,
2013, pp. E3301–10, doi:10.1073/pnas.1217428110.
short: A. Couto, S. Oda, V.O. Nikolaev, Z. Soltesz, M. de Bono, Proceedings of the
National Academy of Sciences 110 (2013) E3301–E3310.
date_created: 2019-03-20T14:05:06Z
date_published: 2013-08-27T00:00:00Z
date_updated: 2021-01-12T08:06:16Z
day: '27'
ddc:
- '570'
doi: 10.1073/pnas.1217428110
extern: '1'
external_id:
pmid:
- '23940325'
file:
- access_level: open_access
checksum: 3ee28a694f74a49f0d098970ae391a91
content_type: application/pdf
creator: kschuh
date_created: 2019-03-20T14:07:53Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6134'
file_name: 2013_PNAS_Couto.pdf
file_size: 2198763
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 110'
issue: '35'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: E3301-E3310
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
issn:
- 0027-8424
- 1091-6490
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
status: public
title: In vivo genetic dissection of O2-evoked cGMP dynamics in a Caenorhabditis elegans
gas sensor
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 110
year: '2013'
...
---
_id: '6135'
abstract:
- lang: eng
text: Many organisms have stress response pathways, components of which share homology
with players in complex human disease pathways. Research on stress response in
the nematode worm Caenorhabditis elegans has provided detailed insights into the
genetic and molecular mechanisms underlying complex human diseases. In this review
we focus on four different types of environmental stress responses – heat shock,
oxidative stress, hypoxia, and osmotic stress – and on how these can be used to
study the genetics of complex human diseases. All four types of responses involve
the genetic machineries that underlie a number of complex human diseases such
as cancer and neurodegenerative diseases, including Alzheimer's and Parkinson's.
We highlight the types of stress response experiments required to detect the genes
and pathways underlying human disease and suggest that studying stress biology
in worms can be translated to understanding human disease and provide potential
targets for drug discovery.
author:
- first_name: Miriam
full_name: Rodriguez, Miriam
last_name: Rodriguez
- first_name: L. Basten
full_name: Snoek, L. Basten
last_name: Snoek
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: Jan E.
full_name: Kammenga, Jan E.
last_name: Kammenga
citation:
ama: 'Rodriguez M, Snoek LB, de Bono M, Kammenga JE. Worms under stress: C. elegans
stress response and its relevance to complex human disease and aging. Trends
in Genetics. 2013;29(6):367-374. doi:10.1016/j.tig.2013.01.010'
apa: 'Rodriguez, M., Snoek, L. B., de Bono, M., & Kammenga, J. E. (2013). Worms
under stress: C. elegans stress response and its relevance to complex human disease
and aging. Trends in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2013.01.010'
chicago: 'Rodriguez, Miriam, L. Basten Snoek, Mario de Bono, and Jan E. Kammenga.
“Worms under Stress: C. Elegans Stress Response and Its Relevance to Complex Human
Disease and Aging.” Trends in Genetics. Elsevier, 2013. https://doi.org/10.1016/j.tig.2013.01.010.'
ieee: 'M. Rodriguez, L. B. Snoek, M. de Bono, and J. E. Kammenga, “Worms under stress:
C. elegans stress response and its relevance to complex human disease and aging,”
Trends in Genetics, vol. 29, no. 6. Elsevier, pp. 367–374, 2013.'
ista: 'Rodriguez M, Snoek LB, de Bono M, Kammenga JE. 2013. Worms under stress:
C. elegans stress response and its relevance to complex human disease and aging.
Trends in Genetics. 29(6), 367–374.'
mla: 'Rodriguez, Miriam, et al. “Worms under Stress: C. Elegans Stress Response
and Its Relevance to Complex Human Disease and Aging.” Trends in Genetics,
vol. 29, no. 6, Elsevier, 2013, pp. 367–74, doi:10.1016/j.tig.2013.01.010.'
short: M. Rodriguez, L.B. Snoek, M. de Bono, J.E. Kammenga, Trends in Genetics 29
(2013) 367–374.
date_created: 2019-03-20T14:17:42Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2021-01-12T08:06:17Z
day: '01'
doi: 10.1016/j.tig.2013.01.010
extern: '1'
intvolume: ' 29'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 367-374
publication: Trends in Genetics
publication_identifier:
issn:
- 0168-9525
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'Worms under stress: C. elegans stress response and its relevance to complex
human disease and aging'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2013'
...
---
_id: '6370'
abstract:
- lang: eng
text: 'The molecular and supramolecular origins of the superior nonlinear optical
(NLO) properties observed in the organic phenolic triene material, OH1 (2-(3-(4-hydroxystyryl)-5,5-dimethylcyclohex-2-enylidene)malononitrile),
are presented. The molecular charge-transfer distribution is topographically mapped,
demonstrating that a uniformly delocalized passive electronic medium facilitates
the charge-transfer between the phenolic electron donor and the cyano electron
acceptors which lie at opposite ends of the molecule. Its ability to act as a
“push–pull” π-conjugated molecule is quantified, relative to similar materials,
by supporting empirical calculations; these include bond-length alternation and
harmonic-oscillator stabilization energy (HOSE) tests. Such tests, together with
frontier molecular orbital considerations, reveal that OH1 can exist readily in
its aromatic (neutral) or quinoidal (charge-separated) state, thereby overcoming
the “nonlinearity-thermal stability trade-off”. The HOSE calculation also reveals
a correlation between the quinoidal resonance contribution to the overall structure
of OH1 and the UV–vis absorption peak wavelength in the wider family of configurationally
locked polyene framework materials. Solid-state tensorial coefficients of the
molecular dipole, polarizability, and the first hyperpolarizability for OH1 are
derived from the first-, second-, and third-order electronic moments of the experimental
charge-density distribution. The overall solid-state molecular dipole moment is
compared with those from gas-phase calculations, revealing that crystal field
effects are very significant in OH1. The solid-state hyperpolarizability derived
from this charge-density study affords good agreement with gas-phase calculations
as well as optical measurements based on hyper-Rayleigh scattering (HRS) and electric-field-induced
second harmonic (EFISH) generation. This lends support to the further use of charge-density
studies to calculate solid-state hyperpolarizability coefficients in other organic
NLO materials. Finally, this charge-density study is also employed to provide
an advanced classification of hydrogen bonds in OH1, which requires more stringent
criteria than those from conventional structure analysis. As a result, only the
strongest OH···NC interaction is so classified as a true hydrogen bond. Indeed,
it is this electrostatic interaction that influences the molecular charge transfer:
the other four, weaker, nonbonded contacts nonetheless affect the crystal packing.
Overall, the establishment of these structure–property relationships lays a blueprint
for designing further, more NLO efficient, materials in this industrially leading
organic family of compounds.'
author:
- first_name: Tze-Chia
full_name: Lin, Tze-Chia
last_name: Lin
- first_name: Jacqueline M.
full_name: Cole, Jacqueline M.
last_name: Cole
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
- first_name: Alison J.
full_name: Edwards, Alison J.
last_name: Edwards
- first_name: Ross O.
full_name: Piltz, Ross O.
last_name: Piltz
- first_name: Javier
full_name: Pérez-Moreno, Javier
last_name: Pérez-Moreno
- first_name: Ji-Youn
full_name: Seo, Ji-Youn
last_name: Seo
- first_name: Seung-Chul
full_name: Lee, Seung-Chul
last_name: Lee
- first_name: Koen
full_name: Clays, Koen
last_name: Clays
- first_name: O-Pil
full_name: Kwon, O-Pil
last_name: Kwon
citation:
ama: 'Lin T-C, Cole JM, Higginbotham AP, et al. Molecular origins of the high-performance
nonlinear optical susceptibility in a phenolic polyene chromophore: Electron density
distributions, hydrogen bonding, and ab initio calculations. The Journal of
Physical Chemistry C. 2013;117(18):9416-9430. doi:10.1021/jp400648q'
apa: 'Lin, T.-C., Cole, J. M., Higginbotham, A. P., Edwards, A. J., Piltz, R. O.,
Pérez-Moreno, J., … Kwon, O.-P. (2013). Molecular origins of the high-performance
nonlinear optical susceptibility in a phenolic polyene chromophore: Electron density
distributions, hydrogen bonding, and ab initio calculations. The Journal of
Physical Chemistry C. American Chemical Society (ACS). https://doi.org/10.1021/jp400648q'
chicago: 'Lin, Tze-Chia, Jacqueline M. Cole, Andrew P Higginbotham, Alison J. Edwards,
Ross O. Piltz, Javier Pérez-Moreno, Ji-Youn Seo, Seung-Chul Lee, Koen Clays, and
O-Pil Kwon. “Molecular Origins of the High-Performance Nonlinear Optical Susceptibility
in a Phenolic Polyene Chromophore: Electron Density Distributions, Hydrogen Bonding,
and Ab Initio Calculations.” The Journal of Physical Chemistry C. American
Chemical Society (ACS), 2013. https://doi.org/10.1021/jp400648q.'
ieee: 'T.-C. Lin et al., “Molecular origins of the high-performance nonlinear
optical susceptibility in a phenolic polyene chromophore: Electron density distributions,
hydrogen bonding, and ab initio calculations,” The Journal of Physical Chemistry
C, vol. 117, no. 18. American Chemical Society (ACS), pp. 9416–9430, 2013.'
ista: 'Lin T-C, Cole JM, Higginbotham AP, Edwards AJ, Piltz RO, Pérez-Moreno J,
Seo J-Y, Lee S-C, Clays K, Kwon O-P. 2013. Molecular origins of the high-performance
nonlinear optical susceptibility in a phenolic polyene chromophore: Electron density
distributions, hydrogen bonding, and ab initio calculations. The Journal of Physical
Chemistry C. 117(18), 9416–9430.'
mla: 'Lin, Tze-Chia, et al. “Molecular Origins of the High-Performance Nonlinear
Optical Susceptibility in a Phenolic Polyene Chromophore: Electron Density Distributions,
Hydrogen Bonding, and Ab Initio Calculations.” The Journal of Physical Chemistry
C, vol. 117, no. 18, American Chemical Society (ACS), 2013, pp. 9416–30, doi:10.1021/jp400648q.'
short: T.-C. Lin, J.M. Cole, A.P. Higginbotham, A.J. Edwards, R.O. Piltz, J. Pérez-Moreno,
J.-Y. Seo, S.-C. Lee, K. Clays, O.-P. Kwon, The Journal of Physical Chemistry
C 117 (2013) 9416–9430.
date_created: 2019-05-03T09:40:31Z
date_published: 2013-05-09T00:00:00Z
date_updated: 2021-01-12T08:07:17Z
day: '09'
doi: 10.1021/jp400648q
extern: '1'
intvolume: ' 117'
issue: '18'
language:
- iso: eng
month: '05'
oa_version: None
page: 9416-9430
publication: The Journal of Physical Chemistry C
publication_identifier:
issn:
- 1932-7447
- 1932-7455
publication_status: published
publisher: American Chemical Society (ACS)
quality_controlled: '1'
status: public
title: 'Molecular origins of the high-performance nonlinear optical susceptibility
in a phenolic polyene chromophore: Electron density distributions, hydrogen bonding,
and ab initio calculations'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 117
year: '2013'
...
---
_id: '6440'
abstract:
- lang: eng
text: In order to guarantee that each method of a data structure updates the logical
state exactly once, al-most all non-blocking implementations employ Compare-And-Swap
(CAS) based synchronization. For FIFO queue implementations this translates into concurrent enqueue or dequeue methods
competing among themselves to update the same variable, the tail or the head,
respectively, leading to high contention and poor scalability. Recent non-blocking
queue implementations try to alleviate high contentionby increasing the number
of contention points, all the while using CAS-based synchronization. Furthermore,
obtaining a wait-free implementation with competition is achieved by additional
synchronization which leads to further degradation of performance.In this paper
we formalize the notion of competitiveness of a synchronizing statement which
can beused as a measure for the scalability of concurrent implementations. We
present a new queue implementation, the Speculative Pairing (SP) queue, which,
as we show, decreases competitiveness by using Fetch-And-Increment (FAI) instead
of CAS. We prove that the SP queue is linearizable and lock-free.We also show
that replacing CAS with FAI leads to wait-freedom for dequeue methods without
an adverse effect on performance. In fact, our experiments suggest that the SP
queue can perform and scale better than the state-of-the-art queue implementations.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: Henzinger TA, Payer H, Sezgin A. Replacing Competition with Cooperation
to Achieve Scalable Lock-Free FIFO Queues . IST Austria; 2013. doi:10.15479/AT:IST-2013-124-v1-1
apa: Henzinger, T. A., Payer, H., & Sezgin, A. (2013). Replacing competition
with cooperation to achieve scalable lock-free FIFO queues . IST Austria.
https://doi.org/10.15479/AT:IST-2013-124-v1-1
chicago: Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. Replacing Competition
with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria,
2013. https://doi.org/10.15479/AT:IST-2013-124-v1-1.
ieee: T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation
to achieve scalable lock-free FIFO queues . IST Austria, 2013.
ista: Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation
to achieve scalable lock-free FIFO queues , IST Austria, 23p.
mla: Henzinger, Thomas A., et al. Replacing Competition with Cooperation to Achieve
Scalable Lock-Free FIFO Queues . IST Austria, 2013, doi:10.15479/AT:IST-2013-124-v1-1.
short: T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation
to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
date_created: 2019-05-13T14:13:27Z
date_published: 2013-06-13T00:00:00Z
date_updated: 2020-07-14T23:06:19Z
day: '13'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2013-124-v1-1
file:
- access_level: open_access
checksum: a219ba4eada6cd62befed52262ee15d4
content_type: application/pdf
creator: dernst
date_created: 2019-05-13T14:11:39Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6441'
file_name: 2013_TechRep_Henzinger.pdf
file_size: 549684
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '23'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '124'
status: public
title: 'Replacing competition with cooperation to achieve scalable lock-free FIFO
queues '
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '1442'
abstract:
- lang: eng
text: We give a cohomological interpretation of both the Kac polynomial and the
refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof
of a conjecture of Kac from 1982 and gives a new perspective on recent work of
Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier
transform, the dimensions of the isotypical components of the cohomology of associated
Nakajima quiver varieties under the action of a Weyl group. The generating function
of the corresponding Poincare polynomials is an extension of Hua's formula for
Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The
resulting formulae contain a wide range of information on the geometry of the
quiver varieties.
acknowledgement: |-
The first author thanks the Royal Society for funding his research 2005-2012 in the form of a Royal Society University Research Fellowship as well as the Mathematical Institute and Wadham College in Oxford for a very productive environment. The second author is supported by Agence Nationale de la Recherche grant
ANR-09-JCJC-0102-01. The third author is supported by the NSF grant DMS-1101484 and a Research Scholarship from the Clay Mathematical Institute.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Emmanuel
full_name: Letellier, Emmanuel
last_name: Letellier
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: Hausel T, Letellier E, Rodríguez Villegas F. Positivity for Kac polynomials
and DT-invariants of quivers. Annals of Mathematics. 2013;177(3):1147-1168.
doi:10.4007/annals.2013.177.3.8
apa: Hausel, T., Letellier, E., & Rodríguez Villegas, F. (2013). Positivity
for Kac polynomials and DT-invariants of quivers. Annals of Mathematics.
Princeton University Press. https://doi.org/10.4007/annals.2013.177.3.8
chicago: Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Positivity
for Kac Polynomials and DT-Invariants of Quivers.” Annals of Mathematics.
Princeton University Press, 2013. https://doi.org/10.4007/annals.2013.177.3.8.
ieee: T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Positivity for Kac polynomials
and DT-invariants of quivers,” Annals of Mathematics, vol. 177, no. 3.
Princeton University Press, pp. 1147–1168, 2013.
ista: Hausel T, Letellier E, Rodríguez Villegas F. 2013. Positivity for Kac polynomials
and DT-invariants of quivers. Annals of Mathematics. 177(3), 1147–1168.
mla: Hausel, Tamás, et al. “Positivity for Kac Polynomials and DT-Invariants of
Quivers.” Annals of Mathematics, vol. 177, no. 3, Princeton University
Press, 2013, pp. 1147–68, doi:10.4007/annals.2013.177.3.8.
short: T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177
(2013) 1147–1168.
date_created: 2018-12-11T11:52:02Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:47Z
day: '01'
doi: 10.4007/annals.2013.177.3.8
extern: 1
intvolume: ' 177'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1204.2375
month: '01'
oa: 1
page: 1147 - 1168
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University Press
publist_id: '5754'
quality_controlled: 0
status: public
title: Positivity for Kac polynomials and DT-invariants of quivers
type: journal_article
volume: 177
year: '2013'
...
---
_id: '1443'
abstract:
- lang: eng
text: 'Here we survey several results and conjectures on the cohomology of the total
space of the Hitchin system: the moduli space of semi-stable rank n and degree
d Higgs bundles on a complex algebraic curve C. The picture emerging is a dynamic
mixture of ideas originating in theoretical physics such as gauge theory and mirror
symmetry, Weil conjectures in arithmetic algebraic geometry, representation theory
of finite groups of Lie type and Langlands duality in number theory.'
alternative_title:
- Advanced Lectures in Mathematics
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: 'Hausel T. Global topology of the Hitchin system. In: Handbook of Moduli:
Volume II. Vol 25. International Press; 2013:29-70.'
apa: 'Hausel, T. (2013). Global topology of the Hitchin system. In Handbook of
Moduli: Volume II (Vol. 25, pp. 29–70). International Press.'
chicago: 'Hausel, Tamás. “Global Topology of the Hitchin System.” In Handbook
of Moduli: Volume II, 25:29–70. International Press, 2013.'
ieee: 'T. Hausel, “Global topology of the Hitchin system,” in Handbook of Moduli:
Volume II, vol. 25, International Press, 2013, pp. 29–70.'
ista: 'Hausel T. 2013.Global topology of the Hitchin system. In: Handbook of Moduli:
Volume II. Advanced Lectures in Mathematics, vol. 25, 29–70.'
mla: 'Hausel, Tamás. “Global Topology of the Hitchin System.” Handbook of Moduli:
Volume II, vol. 25, International Press, 2013, pp. 29–70.'
short: 'T. Hausel, in:, Handbook of Moduli: Volume II, International Press, 2013,
pp. 29–70.'
date_created: 2018-12-11T11:52:03Z
date_published: 2013-03-15T00:00:00Z
date_updated: 2021-01-12T06:50:47Z
day: '15'
extern: 1
intvolume: ' 25'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.1717
month: '03'
oa: 1
page: 29 - 70
publication: 'Handbook of Moduli: Volume II'
publication_status: published
publisher: International Press
publist_id: '5753'
quality_controlled: 0
status: public
title: Global topology of the Hitchin system
type: book_chapter
volume: 25
year: '2013'
...