---
_id: '5417'
abstract:
- lang: eng
text: "We define the model-measuring problem: given a model M and specification
φ, what is the maximal distance ρ such that all models M'within distance ρ from
M satisfy (or violate)φ. The model measuring problem presupposes a distance function
on models. We concentrate on automatic distance functions, which are defined by
weighted automata.\r\nThe model-measuring problem subsumes several generalizations
of the classical model-checking problem, in particular, quantitative model-checking
problems that measure the degree of satisfaction of a specification, and robustness
problems that measure how much a model can be perturbed without violating the
specification.\r\nWe show that for automatic distance functions, and ω-regular
linear-time and branching-time specifications, the model-measuring problem can
be solved.\r\nWe use automata-theoretic model-checking methods for model measuring,
replacing the emptiness question for standard word and tree automata by the optimal-weight
question for the weighted versions of these automata. We consider weighted automata
that accumulate weights by maximizing, summing, discounting, and limit averaging.
\r\nWe give several examples of using the model-measuring problem to compute various
notions of robustness and quantitative satisfaction for temporal specifications."
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Henzinger TA, Otop J. From Model Checking to Model Measuring. IST Austria;
2014. doi:10.15479/AT:IST-2014-172-v1-1
apa: Henzinger, T. A., & Otop, J. (2014). From model checking to model measuring.
IST Austria. https://doi.org/10.15479/AT:IST-2014-172-v1-1
chicago: Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-172-v1-1.
ieee: T. A. Henzinger and J. Otop, From model checking to model measuring.
IST Austria, 2014.
ista: Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria,
14p.
mla: Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring.
IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.
short: T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria,
2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2023-02-23T10:38:10Z
day: '19'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-172-v1-1
file:
- access_level: open_access
checksum: fcc3eab903cfcd3778b338d2d0d44d18
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:20Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5481'
file_name: IST-2014-172-v1+1_report.pdf
file_size: 383052
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '14'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '175'
related_material:
record:
- id: '2327'
relation: later_version
status: public
status: public
title: From model checking to model measuring
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5418'
abstract:
- lang: eng
text: We consider multi-player graph games with partial-observation and parity objective.
While the decision problem for three-player games with a coalition of the first
and second players against the third player is undecidable, we present a decidability
result for partial-observation games where the first and third player are in a
coalition against the second player, thus where the second player is adversarial
but weaker due to partial-observation. We establish tight complexity bounds in
the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness
for parity objectives. The symmetric case of player 1 more informed than player
2 is much more complicated, and we show that already in the case where player
1 has perfect observation, memory of size non-elementary is necessary in general
for reachability objectives, and the problem is decidable for safety and reachability
objectives. Our results have tight connections with partial-observation stochastic
games for which we derive new complexity results.
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
citation:
ama: Chatterjee K, Doyen L. Games with a Weak Adversary. IST Austria; 2014.
doi:10.15479/AT:IST-2014-176-v1-1
apa: Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary.
IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1
chicago: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1.
ieee: K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria,
2014.
ista: Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
mla: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary.
IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1.
short: K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-03-22T00:00:00Z
date_updated: 2023-02-23T10:30:58Z
day: '22'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-176-v1-1
file:
- access_level: open_access
checksum: 1d6958aa60050e1c3e932c6e5f34c39f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:07Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5468'
file_name: IST-2014-176-v1+1_icalp_14.pdf
file_size: 328253
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '176'
related_material:
record:
- id: '2163'
relation: later_version
status: public
status: public
title: Games with a weak adversary
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5419'
abstract:
- lang: eng
text: "We consider the reachability and shortest path problems on low tree-width
graphs, with n nodes, m edges, and tree-width t, on a standard RAM with wordsize
W. We use O to hide polynomial factors of the inverse of the Ackermann function.
Our main contributions are three fold:\r\n1. For reachability, we present an algorithm
that requires O(n·t2·log(n/t)) preprocessing time, O(n·(t·log(n/t))/W) space,
and O(t/W) time for pair queries and O((n·t)/W) time for single-source queries.
Note that for constant t our algorithm uses O(n·logn) time for preprocessing;
and O(n/W) time for single-source queries, which is faster than depth first search/breath
first search (after the preprocessing).\r\n2. We present an algorithm for shortest
path that requires O(n·t2) preprocessing time, O(n·t) space, and O(t2) time for
pair queries and O(n·t) time single-source queries.\r\n3. We give a space versus
query time trade-off algorithm for shortest path that, given any constant >0,
requires O(n·t2) preprocessing time, O(n·t2) space, and O(n1−·t2) time for pair
queries.\r\nOur algorithms improve all existing results, and use very simple data
structures."
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Improved Algorithms for Reachability
and Shortest Path on Low Tree-Width Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-187-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Improved
algorithms for reachability and shortest path on low tree-width graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2014-187-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms
for reachability and shortest path on low tree-width graphs. IST Austria,
2014.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for
reachability and shortest path on low tree-width graphs, IST Austria, 34p.
mla: Chatterjee, Krishnendu, et al. Improved Algorithms for Reachability and
Shortest Path on Low Tree-Width Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-187-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for
Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-04-14T00:00:00Z
date_updated: 2021-01-12T08:02:03Z
day: '14'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-187-v1-1
file:
- access_level: open_access
checksum: c608e66030a4bf51d2d99b451f539b99
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:25Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5548'
file_name: IST-2014-187-v1+1_main_full_tech.pdf
file_size: 670031
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '187'
status: public
title: Improved algorithms for reachability and shortest path on low tree-width graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5420'
abstract:
- lang: eng
text: 'We consider concurrent mean-payoff games, a very well-studied class of two-player
(player 1 vs player 2) zero-sum games on finite-state graphs where every transition
is assigned a reward between 0 and 1, and the payoff function is the long-run
average of the rewards. The value is the maximal expected payoff that player 1
can guarantee against all strategies of player 2. We consider the computation
of the set of states with value 1 under finite-memory strategies for player 1,
and our main results for the problem are as follows: (1) we present a polynomial-time
algorithm; (2) we show that whenever there is a finite-memory strategy, there
is a stationary strategy that does not need memory at all; and (3) we present
an optimal bound (which is double exponential) on the patience of stationary strategies
(where patience of a distribution is the inverse of the smallest positive probability
and represents a complexity measure of a stationary strategy).'
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
citation:
ama: Chatterjee K, Ibsen-Jensen R. The Value 1 Problem for Concurrent Mean-Payoff
Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-191-v1-1
apa: Chatterjee, K., & Ibsen-Jensen, R. (2014). The value 1 problem for concurrent
mean-payoff games. IST Austria. https://doi.org/10.15479/AT:IST-2014-191-v1-1
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem
for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
ieee: K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff
games. IST Austria, 2014.
ista: Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff
games, IST Austria, 49p.
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for
Concurrent Mean-Payoff Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-191-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff
Games, IST Austria, 2014.
date_created: 2018-12-12T11:39:14Z
date_published: 2014-04-14T00:00:00Z
date_updated: 2021-01-12T08:02:05Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-191-v1-1
file:
- access_level: open_access
checksum: 49e0fd3e62650346daf7dc04604f7a0a
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:58Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5520'
file_name: IST-2014-191-v1+1_main_full.pdf
file_size: 584368
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '49'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '191'
status: public
title: The value 1 problem for concurrent mean-payoff games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5421'
abstract:
- lang: eng
text: 'Evolution occurs in populations of reproducing individuals. The structure
of the population affects the outcome of the evolutionary process. Evolutionary
graph theory is a powerful approach to study this phenomenon. There are two graphs.
The interaction graph specifies who interacts with whom in the context of evolution.
The replacement graph specifies who competes with whom for reproduction. The vertices
of the two graphs are the same, and each vertex corresponds to an individual.
A key quantity is the fixation probability of a new mutant. It is defined as the
probability that a newly introduced mutant (on a single vertex) generates a lineage
of offspring which eventually takes over the entire population of resident individuals.
The basic computational questions are as follows: (i) the qualitative question
asks whether the fixation probability is positive; and (ii) the quantitative approximation
question asks for an approximation of the fixation probability. Our main results
are: (1) We show that the qualitative question is NP-complete and the quantitative
approximation question is #P-hard in the special case when the interaction and
the replacement graphs coincide and even with the restriction that the resident
individuals do not reproduce (which corresponds to an invading population taking
over an empty structure). (2) We show that in general the qualitative question
is PSPACE-complete and the quantitative approximation question is PSPACE-hard
and can be solved in exponential time.'
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: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolution on Graphs.
IST Austria; 2014. doi:10.15479/AT:IST-2014-190-v2-2
apa: Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2014). The complexity
of evolution on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2014-190-v2-2
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity
of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution
on graphs. IST Austria, 2014.
ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on
graphs, IST Austria, 27p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Evolution on Graphs.
IST Austria, 2014, doi:10.15479/AT:IST-2014-190-v2-2.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on
Graphs, IST Austria, 2014.
date_created: 2018-12-12T11:39:14Z
date_published: 2014-04-18T00:00:00Z
date_updated: 2023-02-23T12:26:33Z
day: '18'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-190-v2-2
file:
- access_level: open_access
checksum: 42f3d8b563286eb0d903832bd9a848d3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:16Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5538'
file_name: IST-2014-190-v2+2_main_full.pdf
file_size: 443529
relation: main_file
- access_level: open_access
checksum: 0c9a2fd822309719634495a35957e34d
content_type: application/pdf
creator: kschuh
date_created: 2019-09-06T07:30:20Z
date_updated: 2020-07-14T12:46:50Z
file_id: '6852'
file_name: IST-2014-190-v1+1_main_full.pdf
file_size: 440911
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '190'
related_material:
record:
- id: '5432'
relation: later_version
status: public
- id: '5440'
relation: later_version
status: public
status: public
title: The complexity of evolution on graphs
type: technical_report
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5422'
abstract:
- lang: eng
text: Notes from the Third Plenary for the Research Data Alliance in Dublin, Ireland
on March 26 to 28, 2014 with focus on starting an institutional research data
repository.
author:
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: Porsche J. Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland. none; 2014.
apa: Porsche, J. (2014). Notes from Research Data Alliance Plenary Meeting in
Dublin, Ireland. none.
chicago: Porsche, Jana. Notes from Research Data Alliance Plenary Meeting in
Dublin, Ireland. none, 2014.
ieee: J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland. none, 2014.
ista: Porsche J. 2014. Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland, none,p.
mla: Porsche, Jana. Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland. none, 2014.
short: J. Porsche, Notes from Research Data Alliance Plenary Meeting in Dublin,
Ireland, none, 2014.
date_created: 2018-12-12T11:39:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2020-07-14T23:04:56Z
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: 3954896648ce8afa8f7c4425e71cff08
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:40Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5501'
file_name: IST-2014-254-v1+1_Dublin_Day_3.pdf
file_size: 648585
relation: main_file
- access_level: open_access
checksum: 9a0d42b0b832dfe7e4b22fb6816bcbba
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:41Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5502'
file_name: IST-2014-254-v1+2_Dublin_Day_1.pdf
file_size: 221339
relation: main_file
- access_level: open_access
checksum: 498b8d629fb1bd17bff1dc43700a93e6
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:42Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5503'
file_name: IST-2014-254-v1+3_Dublin_Day_2.pdf
file_size: 187778
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: 1
oa_version: None
publisher: none
pubrep_id: '254'
status: public
title: Notes from Research Data Alliance Plenary Meeting in Dublin, Ireland
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5423'
abstract:
- lang: eng
text: 'We present a flexible framework for the automated competitive analysis of
on-line scheduling algorithms for firm- deadline real-time tasks based on multi-objective
graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled
transition system, along with some optional safety, liveness, and/or limit-average
constraints for the adversary, we automatically compute the competitive ratio
of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility
and power of our approach by comparing the competitive ratio of several on-line
algorithms, including D(over), that have been proposed in the past, for various
tasksets. Our experimental results reveal that none of these algorithms is universally
optimal, in the sense that there are tasksets where other schedulers provide better
performance. Our framework is hence a very useful design tool for selecting optimal
algorithms for a given application. '
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: Alexander
full_name: Kössler, Alexander
last_name: Kössler
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. A Framework for Automated
Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria;
2014. doi:10.15479/AT:IST-2014-300-v1-1
apa: Chatterjee, K., Kössler, A., Pavlogiannis, A., & Schmid, U. (2014). A
framework for automated competitive analysis of on-line scheduling of firm-deadline
tasks. IST Austria. https://doi.org/10.15479/AT:IST-2014-300-v1-1
chicago: Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich
Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling
of Firm-Deadline Tasks. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-300-v1-1.
ieee: K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework
for automated competitive analysis of on-line scheduling of firm-deadline tasks.
IST Austria, 2014.
ista: Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated
competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria,
14p.
mla: Chatterjee, Krishnendu, et al. A Framework for Automated Competitive Analysis
of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014, doi:10.15479/AT:IST-2014-300-v1-1.
short: K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated
Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria,
2014.
date_created: 2018-12-12T11:39:15Z
date_published: 2014-07-29T00:00:00Z
date_updated: 2023-02-23T10:11:15Z
day: '29'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-300-v1-1
file:
- access_level: open_access
checksum: 4b8fde4d9ef6653837f6803921d83032
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:53Z
date_updated: 2020-07-14T12:46:50Z
file_id: '5514'
file_name: IST-2014-300-v1+1_main.pdf
file_size: 1270021
relation: main_file
file_date_updated: 2020-07-14T12:46:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '14'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '300'
related_material:
record:
- id: '1714'
relation: later_version
status: public
status: public
title: A framework for automated competitive analysis of on-line scheduling of firm-deadline
tasks
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5424'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs), that
are a standard framework for robotics applications to model uncertainties present
in the real world, with temporal logic specifications. All temporal logic specifications
in linear-time temporal logic (LTL) can be expressed as parity objectives. We
study the qualitative analysis problem for POMDPs with parity objectives that
asks whether there is a controller (policy) to ensure that the objective holds
with probability 1 (almost-surely). While the qualitative analysis of POMDPs with
parity objectives is undecidable, recent results show that when restricted to
finite-memory policies the problem is EXPTIME-complete. While the problem is intractable
in theory, we present a practical approach to solve the qualitative analysis problem.
We designed several heuristics to deal with the exponential complexity, and have
used our implementation on a number of well-known POMDP examples for robotics
applications. Our results provide the first practical approach to solve the qualitative
analysis of robot motion planning with LTL properties in the presence of uncertainty.
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs
with Temporal Logic Specifications for Robotics Applications. IST Austria;
2014. doi:10.15479/AT:IST-2014-305-v1-1
apa: Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative
analysis of POMDPs with temporal logic specifications for robotics applications.
IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v1-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics
Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v1-1.
ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis
of POMDPs with temporal logic specifications for robotics applications. IST
Austria, 2014.
ista: Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of
POMDPs with temporal logic specifications for robotics applications, IST Austria,
12p.
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal
Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v1-1.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of
POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria,
2014.
date_created: 2018-12-12T11:39:15Z
date_published: 2014-09-09T00:00:00Z
date_updated: 2023-02-23T12:25:52Z
day: '09'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-305-v1-1
file:
- access_level: open_access
checksum: 35009d5fad01198341e6c1a3353481b7
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:51Z
date_updated: 2020-07-14T12:46:51Z
file_id: '5512'
file_name: IST-2014-305-v1+1_main.pdf
file_size: 655774
relation: main_file
file_date_updated: 2020-07-14T12:46:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '12'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '305'
related_material:
record:
- id: '1732'
relation: later_version
status: public
- id: '5426'
relation: later_version
status: public
status: public
title: Qualitative analysis of POMDPs with temporal logic specifications for robotics
applications
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5425'
abstract:
- lang: eng
text: ' We consider partially observable Markov decision processes (POMDPs) with
a set of target states and every transition is associated with an integer cost.
The optimization objective we study asks to minimize the expected total cost till
the target set is reached, while ensuring that the target set is reached almost-surely
(with probability 1). We show that for integer costs approximating the optimal
cost is undecidable. For positive costs, our results are as follows: (i) we establish
matching lower and upper bounds for the optimal cost and the bound is double exponential;
(ii) we show that the problem of approximating the optimal cost is decidable and
present approximation algorithms developing on the existing algorithms for POMDPs
with finite-horizon objectives. While the worst-case running time of our algorithm
is double exponential, we also present efficient stopping criteria for the algorithm
and show experimentally that it performs well in many examples of interest.'
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
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Optimal Cost Almost-Sure
Reachability in POMDPs. IST Austria; 2014.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2014). Optimal
cost almost-sure reachability in POMDPs. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Optimal Cost
Almost-Sure Reachability in POMDPs. IST Austria, 2014.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Optimal cost almost-sure
reachability in POMDPs. IST Austria, 2014.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2014. Optimal cost almost-sure
reachability in POMDPs, IST Austria, 22p.
mla: Anonymous, 1, et al. Optimal Cost Almost-Sure Reachability in POMDPs.
IST Austria, 2014.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Optimal Cost Almost-Sure
Reachability in POMDPs, IST Austria, 2014.
date_created: 2018-12-12T11:39:15Z
date_published: 2014-09-09T00:00:00Z
date_updated: 2023-02-23T10:02:57Z
day: '09'
ddc:
- '000'
file:
- access_level: open_access
checksum: b9668a70d53c550b3cd64f0c77451c3d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:17Z
date_updated: 2020-07-14T12:46:51Z
file_id: '5478'
file_name: IST-2014-307-v1+1_main.pdf
file_size: 2725429
relation: main_file
- access_level: closed
checksum: 808ada1dddecc48ca041526fcc6a9efd
content_type: text/plain
creator: dernst
date_created: 2019-04-16T14:16:12Z
date_updated: 2020-07-14T12:46:51Z
file_id: '6322'
file_name: IST-2014-307-v1+2_authors.txt
file_size: 117
relation: main_file
file_date_updated: 2020-07-14T12:46:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '307'
related_material:
record:
- id: '1529'
relation: later_version
status: public
scopus_import: 1
status: public
title: Optimal cost almost-sure reachability in POMDPs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5426'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs), that
are a standard framework for robotics applications to model uncertainties present
in the real world, with temporal logic specifications. All temporal logic specifications
in linear-time temporal logic (LTL) can be expressed as parity objectives. We
study the qualitative analysis problem for POMDPs with parity objectives that
asks whether there is a controller (policy) to ensure that the objective holds
with probability 1 (almost-surely). While the qualitative analysis of POMDPs with
parity objectives is undecidable, recent results show that when restricted to
finite-memory policies the problem is EXPTIME-complete. While the problem is intractable
in theory, we present a practical approach to solve the qualitative analysis problem.
We designed several heuristics to deal with the exponential complexity, and have
used our implementation on a number of well-known POMDP examples for robotics
applications. Our results provide the first practical approach to solve the qualitative
analysis of robot motion planning with LTL properties in the presence of uncertainty.
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative Analysis of POMDPs
with Temporal Logic Specifications for Robotics Applications. IST Austria;
2014. doi:10.15479/AT:IST-2014-305-v2-1
apa: Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2014). Qualitative
analysis of POMDPs with temporal logic specifications for robotics applications.
IST Austria. https://doi.org/10.15479/AT:IST-2014-305-v2-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics
Applications. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-305-v2-1.
ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis
of POMDPs with temporal logic specifications for robotics applications. IST
Austria, 2014.
ista: Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of
POMDPs with temporal logic specifications for robotics applications, IST Austria,
10p.
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal
Logic Specifications for Robotics Applications. IST Austria, 2014, doi:10.15479/AT:IST-2014-305-v2-1.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of
POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria,
2014.
date_created: 2018-12-12T11:39:16Z
date_published: 2014-09-29T00:00:00Z
date_updated: 2023-02-23T12:25:47Z
day: '29'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-305-v2-1
file:
- access_level: open_access
checksum: 730c0a8e97cf2712a884b2cc423f3919
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:15Z
date_updated: 2020-07-14T12:46:51Z
file_id: '5537'
file_name: IST-2014-305-v2+1_main2.pdf
file_size: 656019
relation: main_file
file_date_updated: 2020-07-14T12:46:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '10'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '311'
related_material:
record:
- id: '1732'
relation: later_version
status: public
- id: '5424'
relation: earlier_version
status: public
status: public
title: Qualitative analysis of POMDPs with temporal logic specifications for robotics
applications
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5427'
abstract:
- lang: eng
text: 'We consider graphs with n nodes together with their tree-decomposition that
has b = O ( n ) bags and width t , on the standard RAM computational model with
wordsize W = Θ (log n ) . Our contributions are two-fold: Our first contribution
is an algorithm that given a graph and its tree-decomposition as input, computes
a binary and balanced tree-decomposition of width at most 4 · t + 3 of the graph
in O ( b ) time and space, improving a long-standing (from 1992) bound of O (
n · log n ) time for constant treewidth graphs. Our second contribution is on
reachability queries for low treewidth graphs. We build on our tree-balancing
algorithm and present a data-structure for graph reachability that requires O
( n · t 2 ) preprocessing time, O ( n · t ) space, and O ( d t/ log n e ) time
for pair queries, and O ( n · t · log t/ log n ) time for single-source queries.
For constant t our data-structure uses O ( n ) time for preprocessing, O (1) time
for pair queries, and O ( n/ log n ) time for single-source queries. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries.'
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal Tree-Decomposition
Balancing and Reachability on Low Treewidth Graphs. IST Austria; 2014. doi:10.15479/AT:IST-2014-314-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2014). Optimal
tree-decomposition balancing and reachability on low treewidth graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2014-314-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition
balancing and reachability on low treewidth graphs. IST Austria, 2014.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition
balancing and reachability on low treewidth graphs, IST Austria, 24p.
mla: Chatterjee, Krishnendu, et al. Optimal Tree-Decomposition Balancing and
Reachability on Low Treewidth Graphs. IST Austria, 2014, doi:10.15479/AT:IST-2014-314-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition
Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
date_created: 2018-12-12T11:39:16Z
date_published: 2014-11-05T00:00:00Z
date_updated: 2021-01-12T08:02:09Z
day: '05'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-314-v1-1
file:
- access_level: open_access
checksum: 9d3b90bf4fff74664f182f2d95ef727a
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:10Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5471'
file_name: IST-2014-314-v1+1_long.pdf
file_size: 405561
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '24'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '314'
status: public
title: Optimal tree-decomposition balancing and reachability on low treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5428'
abstract:
- lang: eng
text: "Simulation is an attractive alternative for language inclusion for automata
as it is an under-approximation of language inclusion, but usually has much lower
complexity. For non-deterministic automata, while language inclusion is PSPACE-complete,
simulation can be computed in polynomial time. Simulation has also been extended
in two orthogonal directions, namely, (1) fair simulation, for simulation over
specified set of infinite runs; and (2) quantitative simulation, for simulation
between weighted automata. Again, while fair trace inclusion is PSPACE-complete,
fair simulation can be computed in polynomial time. For weighted automata, the
(quantitative) language inclusion problem is undecidable for mean-payoff automata
and the decidability is open for discounted-sum automata, whereas the (quantitative)
simulation reduce to mean-payoff games and discounted-sum games, which admit pseudo-polynomial
time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted
automata with Büchi acceptance conditions, i.e., we generalize fair simulation
from non-weighted automata to weighted automata. We show that imposing Büchi acceptance
conditions on weighted automata changes many fundamental properties of the simulation
games. For example, whereas for mean-payoff and discounted-sum games, the players
do not need memory to play optimally; we show in contrast that for simulation
games with Büchi acceptance conditions, (i) for mean-payoff objectives, optimal
strategies for both players require infinite memory in general, and (ii) for discounted-sum
objectives, optimal strategies need not exist for both players. While the simulation
games with Büchi acceptance conditions are more complicated (e.g., due to infinite-memory
requirements for mean-payoff objectives) as compared to their counterpart without
Büchi acceptance conditions, we still present pseudo-polynomial time algorithms
to solve simulation games with Büchi acceptance conditions for both weighted mean-payoff
and weighted discounted-sum 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: 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: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative Fair Simulation
Games. IST Austria; 2014. doi:10.15479/AT:IST-2014-315-v1-1
apa: Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative
fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner.
Quantitative Fair Simulation Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-315-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair
simulation games. IST Austria, 2014.
ista: Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation
games, IST Austria, 26p.
mla: Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST
Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation
Games, IST Austria, 2014.
date_created: 2018-12-12T11:39:16Z
date_published: 2014-12-05T00:00:00Z
date_updated: 2023-09-20T12:07:48Z
day: '05'
ddc:
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.15479/AT:IST-2014-315-v1-1
file:
- access_level: open_access
checksum: b1d573bc04365625ff9974880c0aa807
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:59Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5521'
file_name: IST-2014-315-v1+1_report.pdf
file_size: 531046
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '26'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '315'
related_material:
record:
- id: '1066'
relation: later_version
status: public
status: public
title: Quantitative fair simulation games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5813'
abstract:
- lang: eng
text: We consider homogeneous Bose gas in a large cubic box with periodic boundary
conditions, at zero temperature. We analyze its excitation spectrum in a certain
kind of a mean-field infinite-volume limit. We prove that under appropriate conditions
the excitation spectrum has the form predicted by the Bogoliubov approximation.
Our result can be viewed as an extension of the result of Seiringer (Commun. Math.
Phys.306:565–578, 2011) to large volumes.
article_processing_charge: No
author:
- first_name: Jan
full_name: Dereziński, Jan
last_name: Dereziński
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
citation:
ama: Dereziński J, Napiórkowski MM. Excitation spectrum of interacting bosons in
the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. 2014;15(12):2409-2439.
doi:10.1007/s00023-013-0302-4
apa: Dereziński, J., & Napiórkowski, M. M. (2014). Excitation spectrum of interacting
bosons in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré.
Springer Nature. https://doi.org/10.1007/s00023-013-0302-4
chicago: Dereziński, Jan, and Marcin M Napiórkowski. “Excitation Spectrum of Interacting
Bosons in the Mean-Field Infinite-Volume Limit.” Annales Henri Poincaré.
Springer Nature, 2014. https://doi.org/10.1007/s00023-013-0302-4.
ieee: J. Dereziński and M. M. Napiórkowski, “Excitation spectrum of interacting
bosons in the Mean-Field Infinite-Volume limit,” Annales Henri Poincaré,
vol. 15, no. 12. Springer Nature, pp. 2409–2439, 2014.
ista: Dereziński J, Napiórkowski MM. 2014. Excitation spectrum of interacting bosons
in the Mean-Field Infinite-Volume limit. Annales Henri Poincaré. 15(12), 2409–2439.
mla: Dereziński, Jan, and Marcin M. Napiórkowski. “Excitation Spectrum of Interacting
Bosons in the Mean-Field Infinite-Volume Limit.” Annales Henri Poincaré,
vol. 15, no. 12, Springer Nature, 2014, pp. 2409–39, doi:10.1007/s00023-013-0302-4.
short: J. Dereziński, M.M. Napiórkowski, Annales Henri Poincaré 15 (2014) 2409–2439.
date_created: 2019-01-10T09:02:58Z
date_published: 2014-01-10T00:00:00Z
date_updated: 2021-11-16T08:13:24Z
day: '10'
ddc:
- '530'
doi: 10.1007/s00023-013-0302-4
extern: '1'
file:
- access_level: open_access
checksum: 1f6c32c5d6ec90cdb0718c7f0103342e
content_type: application/pdf
creator: dernst
date_created: 2019-01-10T09:04:45Z
date_updated: 2020-07-14T12:47:11Z
file_id: '5814'
file_name: 2014_Annales_Derezinski.pdf
file_size: 865230
relation: main_file
file_date_updated: 2020-07-14T12:47:11Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '12'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 2409-2439
publication: Annales Henri Poincaré
publication_identifier:
issn:
- 1424-0637
- 1424-0661
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s00023-014-0390-9
status: public
title: Excitation spectrum of interacting bosons in the Mean-Field Infinite-Volume
limit
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: 15
year: '2014'
...
---
_id: '589'
abstract:
- lang: eng
text: We demonstrate a many-atom-cavity system with a high-finesse dual-wavelength
standing wave cavity in which all participating rubidium atoms are nearly identically
coupled to a 780-nm cavity mode. This homogeneous coupling is enforced by a one-dimensional
optical lattice formed by the field of a 1560-nm cavity mode.
author:
- first_name: Jongmin
full_name: Lee, Jongmin
last_name: Lee
- first_name: Geert
full_name: Vrijsen, Geert
last_name: Vrijsen
- first_name: Igor
full_name: Teper, Igor
last_name: Teper
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Mark
full_name: Kasevich, Mark A
last_name: Kasevich
citation:
ama: Lee J, Vrijsen G, Teper I, Hosten O, Kasevich M. Many-atom-cavity QED system
with homogeneous atom-cavity coupling. Optics Letters. 2014;39(13):4005-4008.
doi:10.1364/OL.39.004005
apa: Lee, J., Vrijsen, G., Teper, I., Hosten, O., & Kasevich, M. (2014). Many-atom-cavity
QED system with homogeneous atom-cavity coupling. Optics Letters. OSA.
https://doi.org/10.1364/OL.39.004005
chicago: Lee, Jongmin, Geert Vrijsen, Igor Teper, Onur Hosten, and Mark Kasevich.
“Many-Atom-Cavity QED System with Homogeneous Atom-Cavity Coupling.” Optics
Letters. OSA, 2014. https://doi.org/10.1364/OL.39.004005.
ieee: J. Lee, G. Vrijsen, I. Teper, O. Hosten, and M. Kasevich, “Many-atom-cavity
QED system with homogeneous atom-cavity coupling,” Optics Letters, vol.
39, no. 13. OSA, pp. 4005–4008, 2014.
ista: Lee J, Vrijsen G, Teper I, Hosten O, Kasevich M. 2014. Many-atom-cavity QED
system with homogeneous atom-cavity coupling. Optics Letters. 39(13), 4005–4008.
mla: Lee, Jongmin, et al. “Many-Atom-Cavity QED System with Homogeneous Atom-Cavity
Coupling.” Optics Letters, vol. 39, no. 13, OSA, 2014, pp. 4005–08, doi:10.1364/OL.39.004005.
short: J. Lee, G. Vrijsen, I. Teper, O. Hosten, M. Kasevich, Optics Letters 39 (2014)
4005–4008.
date_created: 2018-12-11T11:47:21Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T08:05:09Z
day: '01'
doi: 10.1364/OL.39.004005
extern: 1
intvolume: ' 39'
issue: '13'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.1805
month: '07'
oa: 1
page: 4005 - 4008
publication: Optics Letters
publication_status: published
publisher: OSA
publist_id: '7216'
quality_controlled: 0
status: public
title: Many-atom-cavity QED system with homogeneous atom-cavity coupling
type: journal_article
volume: 39
year: '2014'
...
---
_id: '6122'
author:
- first_name: Gerit A.
full_name: Linneweber, Gerit A.
last_name: Linneweber
- first_name: Jake
full_name: Jacobson, Jake
last_name: Jacobson
- first_name: Karl Emanuel
full_name: Busch, Karl Emanuel
last_name: Busch
- first_name: Bruno
full_name: Hudry, Bruno
last_name: Hudry
- first_name: Christo P.
full_name: Christov, Christo P.
last_name: Christov
- first_name: Dirk
full_name: Dormann, Dirk
last_name: Dormann
- first_name: Michaela
full_name: Yuan, Michaela
last_name: Yuan
- first_name: Tomoki
full_name: Otani, Tomoki
last_name: Otani
- first_name: Elisabeth
full_name: Knust, Elisabeth
last_name: Knust
- 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: Irene
full_name: Miguel-Aliaga, Irene
last_name: Miguel-Aliaga
citation:
ama: Linneweber GA, Jacobson J, Busch KE, et al. Neuronal control of metabolism
through nutrient-dependent modulation of tracheal branching. Cell. 2014;156(1-2):69-83.
doi:10.1016/j.cell.2013.12.008
apa: Linneweber, G. A., Jacobson, J., Busch, K. E., Hudry, B., Christov, C. P.,
Dormann, D., … Miguel-Aliaga, I. (2014). Neuronal control of metabolism through
nutrient-dependent modulation of tracheal branching. Cell. Elsevier. https://doi.org/10.1016/j.cell.2013.12.008
chicago: Linneweber, Gerit A., Jake Jacobson, Karl Emanuel Busch, Bruno Hudry, Christo P.
Christov, Dirk Dormann, Michaela Yuan, et al. “Neuronal Control of Metabolism
through Nutrient-Dependent Modulation of Tracheal Branching.” Cell. Elsevier,
2014. https://doi.org/10.1016/j.cell.2013.12.008.
ieee: G. A. Linneweber et al., “Neuronal control of metabolism through nutrient-dependent
modulation of tracheal branching,” Cell, vol. 156, no. 1–2. Elsevier, pp.
69–83, 2014.
ista: Linneweber GA, Jacobson J, Busch KE, Hudry B, Christov CP, Dormann D, Yuan
M, Otani T, Knust E, de Bono M, Miguel-Aliaga I. 2014. Neuronal control of metabolism
through nutrient-dependent modulation of tracheal branching. Cell. 156(1–2), 69–83.
mla: Linneweber, Gerit A., et al. “Neuronal Control of Metabolism through Nutrient-Dependent
Modulation of Tracheal Branching.” Cell, vol. 156, no. 1–2, Elsevier, 2014,
pp. 69–83, doi:10.1016/j.cell.2013.12.008.
short: G.A. Linneweber, J. Jacobson, K.E. Busch, B. Hudry, C.P. Christov, D. Dormann,
M. Yuan, T. Otani, E. Knust, M. de Bono, I. Miguel-Aliaga, Cell 156 (2014) 69–83.
date_created: 2019-03-19T14:35:30Z
date_published: 2014-01-16T00:00:00Z
date_updated: 2021-01-12T08:06:13Z
day: '16'
ddc:
- '570'
doi: 10.1016/j.cell.2013.12.008
extern: '1'
external_id:
pmid:
- '24439370'
file:
- access_level: open_access
checksum: ad6ef68f37fb711d9abcd97fc06ad316
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:40:38Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6123'
file_name: 2014_Elsevier_Linneweber.pdf
file_size: 5020084
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 156'
issue: 1-2
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 69-83
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Neuronal control of metabolism through nutrient-dependent modulation of tracheal
branching
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: 156
year: '2014'
...
---
_id: '6124'
abstract:
- lang: eng
text: Despite the importance of G-protein coupled receptors (GPCRs) their biogenesis
is poorly understood. Like vertebrates, C. elegans uses a large family of GPCRs
as chemoreceptors. A subset of these receptors, such as ODR-10, requires the odr-4
and odr-8 genes to be appropriately localized to sensory cilia. The odr-4 gene
encodes a conserved tail-anchored transmembrane protein; the molecular identity
of odr-8 is unknown. Here, we show that odr-8 encodes the C. elegans ortholog
of Ufm1-specific protease 2 (UfSP2). UfSPs are cysteine proteases identified biochemically
by their ability to liberate the ubiquitin-like modifier Ufm1 from its pro-form
and protein conjugates. ODR-8/UfSP2 and ODR-4 are expressed in the same set of
twelve chemosensory neurons, and physically interact at the ER membrane. ODR-4
also binds ODR-10, suggesting that an ODR-4/ODR-8 complex promotes GPCR folding,
maturation, or export from the ER. The physical interaction between human ODR4
and UfSP2 suggests that this complex's role in GPCR biogenesis may be evolutionarily
conserved. Unexpectedly, mutant versions of ODR-8/UfSP2 lacking catalytic residues
required for protease activity can rescue all odr-8 mutant phenotypes tested.
Moreover, deleting C. elegans ufm-1 does not alter chemoreceptor traffic to cilia,
either in wild type or in odr-8 mutants. Thus, UfSP2 proteins have protease- and
Ufm1-independent functions in GPCR biogenesis.
article_number: e1004082
author:
- first_name: Changchun
full_name: Chen, Changchun
last_name: Chen
- first_name: Eisuke
full_name: Itakura, Eisuke
last_name: Itakura
- first_name: Katherine P.
full_name: Weber, Katherine P.
last_name: Weber
- first_name: Ramanujan S.
full_name: Hegde, Ramanujan S.
last_name: Hegde
- 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, Itakura E, Weber KP, Hegde RS, de Bono M. An ER complex of ODR-4 and
ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent
mechanism. PLoS Genetics. 2014;10(3). doi:10.1371/journal.pgen.1004082
apa: Chen, C., Itakura, E., Weber, K. P., Hegde, R. S., & de Bono, M. (2014).
An ER complex of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation
by a Ufm1-independent mechanism. PLoS Genetics. Public Library of Science
(PLoS). https://doi.org/10.1371/journal.pgen.1004082
chicago: Chen, Changchun, Eisuke Itakura, Katherine P. Weber, Ramanujan S. Hegde,
and Mario de Bono. “An ER Complex of ODR-4 and ODR-8/Ufm1 Specific Protease 2
Promotes GPCR Maturation by a Ufm1-Independent Mechanism.” PLoS Genetics.
Public Library of Science (PLoS), 2014. https://doi.org/10.1371/journal.pgen.1004082.
ieee: C. Chen, E. Itakura, K. P. Weber, R. S. Hegde, and M. de Bono, “An ER complex
of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent
mechanism,” PLoS Genetics, vol. 10, no. 3. Public Library of Science (PLoS),
2014.
ista: Chen C, Itakura E, Weber KP, Hegde RS, de Bono M. 2014. An ER complex of ODR-4
and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation by a Ufm1-independent
mechanism. PLoS Genetics. 10(3), e1004082.
mla: Chen, Changchun, et al. “An ER Complex of ODR-4 and ODR-8/Ufm1 Specific Protease
2 Promotes GPCR Maturation by a Ufm1-Independent Mechanism.” PLoS Genetics,
vol. 10, no. 3, e1004082, Public Library of Science (PLoS), 2014, doi:10.1371/journal.pgen.1004082.
short: C. Chen, E. Itakura, K.P. Weber, R.S. Hegde, M. de Bono, PLoS Genetics 10
(2014).
date_created: 2019-03-19T14:45:56Z
date_published: 2014-03-06T00:00:00Z
date_updated: 2021-01-12T08:06:14Z
day: '06'
ddc:
- '570'
doi: 10.1371/journal.pgen.1004082
extern: '1'
external_id:
pmid:
- '24603482'
file:
- access_level: open_access
checksum: ac19941089a4262bb5bd74434a08b003
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:50:07Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6125'
file_name: 2014_PLOS_Chen.PDF
file_size: 8286819
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '3'
language:
- iso: eng
month: '03'
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: An ER complex of ODR-4 and ODR-8/Ufm1 specific protease 2 promotes GPCR maturation
by a Ufm1-independent mechanism
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: 10
year: '2014'
...
---
_id: '6126'
abstract:
- lang: eng
text: Aerobic animals constantly monitor and adapt to changes in O2 levels. The
molecular mechanisms involved in sensing O2 are, however, incompletely understood.
Previous studies showed that a hexacoordinated globin called GLB-5 tunes the dynamic
range of O2-sensing neurons in natural C. elegans isolates, but is defective in
the N2 lab reference strain (McGrath et al., 2009; Persson et al., 2009). GLB-5
enables a sharp behavioral switch when O2 changes between 21 and 17%. Here, we
show that GLB-5 also confers rapid behavioral and cellular recovery from exposure
to hypoxia. Hypoxia reconfigures O2-evoked Ca2+ responses in the URX O2 sensors,
and GLB-5 enables rapid recovery of these responses upon re-oxygenation. Forward
genetic screens indicate that GLB-5's effects on O2 sensing require PDL-1, the
C. elegans ortholog of mammalian PrBP/PDE6δ protein. In mammals, PDE6δ regulates
the traffic and activity of prenylated proteins (Zhang et al., 2004; Norton et
al., 2005). PDL-1 promotes localization of GCY-33 and GCY-35, atypical soluble
guanylate cyclases that act as O2 sensors, to the dendritic endings of URX and
BAG neurons, where they colocalize with GLB-5. Both GCY-33 and GCY-35 are predicted
to be prenylated. Dendritic localization is not essential for GCY-35 to function
as an O2 sensor, but disrupting pdl-1 alters the URX neuron's O2 response properties.
Functional GLB-5 can restore dendritic localization of GCY-33 in pdl-1 mutants,
suggesting GCY-33 and GLB-5 are in a complex. Our data suggest GLB-5 and the soluble
guanylate cyclases operate in close proximity to sculpt O2 responses.
author:
- first_name: E.
full_name: Gross, E.
last_name: Gross
- first_name: Z.
full_name: Soltesz, Z.
last_name: Soltesz
- first_name: S.
full_name: Oda, S.
last_name: Oda
- first_name: V.
full_name: Zelmanovich, V.
last_name: Zelmanovich
- first_name: Z.
full_name: Abergel, Z.
last_name: Abergel
- 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: Gross E, Soltesz Z, Oda S, Zelmanovich V, Abergel Z, de Bono M. GLOBIN-5-dependent
O2 responses are regulated by PDL-1/PrBP that targets prenylated soluble guanylate
cyclases to dendritic endings. Journal of Neuroscience. 2014;34(50):16726-16738.
doi:10.1523/jneurosci.5368-13.2014
apa: Gross, E., Soltesz, Z., Oda, S., Zelmanovich, V., Abergel, Z., & de Bono,
M. (2014). GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets
prenylated soluble guanylate cyclases to dendritic endings. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/jneurosci.5368-13.2014
chicago: Gross, E., Z. Soltesz, S. Oda, V. Zelmanovich, Z. Abergel, and Mario de
Bono. “GLOBIN-5-Dependent O2 Responses Are Regulated by PDL-1/PrBP That Targets
Prenylated Soluble Guanylate Cyclases to Dendritic Endings.” Journal of Neuroscience.
Society for Neuroscience, 2014. https://doi.org/10.1523/jneurosci.5368-13.2014.
ieee: E. Gross, Z. Soltesz, S. Oda, V. Zelmanovich, Z. Abergel, and M. de Bono,
“GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets prenylated
soluble guanylate cyclases to dendritic endings,” Journal of Neuroscience,
vol. 34, no. 50. Society for Neuroscience, pp. 16726–16738, 2014.
ista: Gross E, Soltesz Z, Oda S, Zelmanovich V, Abergel Z, de Bono M. 2014. GLOBIN-5-dependent
O2 responses are regulated by PDL-1/PrBP that targets prenylated soluble guanylate
cyclases to dendritic endings. Journal of Neuroscience. 34(50), 16726–16738.
mla: Gross, E., et al. “GLOBIN-5-Dependent O2 Responses Are Regulated by PDL-1/PrBP
That Targets Prenylated Soluble Guanylate Cyclases to Dendritic Endings.” Journal
of Neuroscience, vol. 34, no. 50, Society for Neuroscience, 2014, pp. 16726–38,
doi:10.1523/jneurosci.5368-13.2014.
short: E. Gross, Z. Soltesz, S. Oda, V. Zelmanovich, Z. Abergel, M. de Bono, Journal
of Neuroscience 34 (2014) 16726–16738.
date_created: 2019-03-19T14:52:26Z
date_published: 2014-12-10T00:00:00Z
date_updated: 2021-01-12T08:06:14Z
day: '10'
ddc:
- '570'
doi: 10.1523/jneurosci.5368-13.2014
extern: '1'
external_id:
pmid:
- '25505325'
file:
- access_level: open_access
checksum: a3dd71969f94c43909327cd083283d4b
content_type: application/pdf
creator: kschuh
date_created: 2019-03-19T14:55:58Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6127'
file_name: 2014_SFN_Gross.pdf
file_size: 3263422
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '50'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 16726-16738
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
- 1529-2401
publication_status: published
publisher: Society for Neuroscience
quality_controlled: '1'
status: public
title: GLOBIN-5-dependent O2 responses are regulated by PDL-1/PrBP that targets prenylated
soluble guanylate cyclases to dendritic endings
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: 34
year: '2014'
...
---
_id: '6319'
abstract:
- lang: fre
text: Nous étudions le comportement asymptotique du nombre de variétés dans une
certaine classe ne satisfaisant pas le principe de Hasse. Cette étude repose sur
des résultats récemmentobtenus par Colliot-Thélène.
arxiv: 1
author:
- first_name: Régis de la
full_name: Bretèche, Régis de la
last_name: Bretèche
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Bretèche R de la, Browning TD. Contre-exemples au principe de Hasse pour certains
tores coflasques. Journal de Théorie des Nombres de Bordeaux. 2014;26(1):25-44.
doi:10.5802/jtnb.857
apa: Bretèche, R. de la, & Browning, T. D. (2014). Contre-exemples au principe
de Hasse pour certains tores coflasques. Journal de Théorie Des Nombres de
Bordeaux. Cellule MathDoc/CEDRAM. https://doi.org/10.5802/jtnb.857
chicago: Bretèche, Régis de la, and Timothy D Browning. “Contre-Exemples Au Principe
de Hasse Pour Certains Tores Coflasques.” Journal de Théorie Des Nombres de
Bordeaux. Cellule MathDoc/CEDRAM, 2014. https://doi.org/10.5802/jtnb.857.
ieee: R. de la Bretèche and T. D. Browning, “Contre-exemples au principe de Hasse
pour certains tores coflasques,” Journal de Théorie des Nombres de Bordeaux,
vol. 26, no. 1. Cellule MathDoc/CEDRAM, pp. 25–44, 2014.
ista: Bretèche R de la, Browning TD. 2014. Contre-exemples au principe de Hasse
pour certains tores coflasques. Journal de Théorie des Nombres de Bordeaux. 26(1),
25–44.
mla: Bretèche, Régis de la, and Timothy D. Browning. “Contre-Exemples Au Principe
de Hasse Pour Certains Tores Coflasques.” Journal de Théorie Des Nombres de
Bordeaux, vol. 26, no. 1, Cellule MathDoc/CEDRAM, 2014, pp. 25–44, doi:10.5802/jtnb.857.
short: R. de la Bretèche, T.D. Browning, Journal de Théorie Des Nombres de Bordeaux
26 (2014) 25–44.
date_created: 2019-04-16T13:40:13Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:03Z
doi: 10.5802/jtnb.857
extern: '1'
external_id:
arxiv:
- '1210.4236'
intvolume: ' 26'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1210.4236
oa: 1
oa_version: Preprint
page: 25-44
publication: Journal de Théorie des Nombres de Bordeaux
publication_identifier:
issn:
- 1246-7405
- 2118-8572
publication_status: published
publisher: Cellule MathDoc/CEDRAM
quality_controlled: '1'
status: public
title: Contre-exemples au principe de Hasse pour certains tores coflasques
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2014'
...
---
_id: '6739'
abstract:
- lang: eng
text: 'We explore the relationship between polar and RM codes and we describe a
coding scheme which improves upon the performance of the standard polar code at
practical block lengths. Our starting point is the experimental observation that
RM codes have a smaller error probability than polar codes under MAP decoding.
This motivates us to introduce a family of codes that “interpolates” between RM
and polar codes, call this family C inter = {C α : α ∈ [0, 1j}, where C α|α=1
is the original polar code, and C α|α=0 is an RM code. Based on numerical observations,
we remark that the error probability under MAP decoding is an increasing function
of α. MAP decoding has in general exponential complexity, but empirically the
performance of polar codes at finite block lengths is boosted by moving along
the family Cinter even under low-complexity decoding schemes such as, for instance,
belief propagation or successive cancellation list decoder. We demonstrate the
performance gain via numerical simulations for transmission over the erasure channel
as well as the Gaussian channel.'
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
ama: 'Mondelli M, Hassani H, Urbanke R. From polar to Reed-Muller codes: A technique
to improve the finite-length performance. IEEE Transactions on Communications.
2014;62(9):3084-3091. doi:10.1109/tcomm.2014.2345069'
apa: 'Mondelli, M., Hassani, H., & Urbanke, R. (2014). From polar to Reed-Muller
codes: A technique to improve the finite-length performance. IEEE Transactions
on Communications. IEEE. https://doi.org/10.1109/tcomm.2014.2345069'
chicago: 'Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “From Polar to Reed-Muller
Codes: A Technique to Improve the Finite-Length Performance.” IEEE Transactions
on Communications. IEEE, 2014. https://doi.org/10.1109/tcomm.2014.2345069.'
ieee: 'M. Mondelli, H. Hassani, and R. Urbanke, “From polar to Reed-Muller codes:
A technique to improve the finite-length performance,” IEEE Transactions on
Communications, vol. 62, no. 9. IEEE, pp. 3084–3091, 2014.'
ista: 'Mondelli M, Hassani H, Urbanke R. 2014. From polar to Reed-Muller codes:
A technique to improve the finite-length performance. IEEE Transactions on Communications.
62(9), 3084–3091.'
mla: 'Mondelli, Marco, et al. “From Polar to Reed-Muller Codes: A Technique to Improve
the Finite-Length Performance.” IEEE Transactions on Communications, vol.
62, no. 9, IEEE, 2014, pp. 3084–91, doi:10.1109/tcomm.2014.2345069.'
short: M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Communications
62 (2014) 3084–3091.
date_created: 2019-07-31T07:20:21Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T08:08:46Z
day: '01'
doi: 10.1109/tcomm.2014.2345069
extern: '1'
external_id:
arxiv:
- '1401.3127'
intvolume: ' 62'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1401.3127
month: '09'
oa: 1
oa_version: Preprint
page: 3084-3091
publication: IEEE Transactions on Communications
publication_identifier:
issn:
- 0090-6778
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'From polar to Reed-Muller codes: A technique to improve the finite-length
performance'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2014'
...
---
_id: '6740'
abstract:
- lang: eng
text: We describe coding techniques that achieve the capacity of a discrete memoryless
asymmetric channel. To do so, we discuss how recent advances in coding for symmetric
channels yield more efficient solutions also for the asymmetric case. In more
detail, we consider three basic approaches. The first one is Gallager's scheme
that concatenates a linear code with a non-linear mapper, in order to bias the
input distribution. We explicitly show that both polar codes and spatially coupled
codes can be employed in this scenario. Further, we derive a scaling law between
the gap to capacity, the cardinality of channel input and output alphabets, and
the required size of the mapper. The second one is an integrated approach in which
the coding scheme is used both for source coding, in order to create codewords
with the capacity-achieving distribution, and for channel coding, in order to
provide error protection. Such a technique has been recently introduced by Honda
and Yamamoto in the context of polar codes, and we show how to apply it also to
the design of sparse graph codes. The third approach is based on an idea due to
Böcherer and Mathar and separates completely the two tasks of source coding and
channel coding by “chaining” together several codewords. We prove that we can
combine any suitable source code with any suitable channel code in order to provide
optimal schemes for asymmetric channels. In particular, polar codes and spatially
coupled codes fulfill the required conditions.
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
citation:
ama: 'Mondelli M, Urbanke R, Hassani H. How to achieve the capacity of asymmetric
channels. In: 52nd Annual Allerton Conference on Communication, Control, and
Computing. IEEE; 2014:789-796. doi:10.1109/allerton.2014.7028535'
apa: 'Mondelli, M., Urbanke, R., & Hassani, H. (2014). How to achieve the capacity
of asymmetric channels. In 52nd Annual Allerton Conference on Communication,
Control, and Computing (pp. 789–796). Monticello, IL, United States: IEEE.
https://doi.org/10.1109/allerton.2014.7028535'
chicago: Mondelli, Marco, Rudiger Urbanke, and Hamed Hassani. “How to Achieve the
Capacity of Asymmetric Channels.” In 52nd Annual Allerton Conference on Communication,
Control, and Computing, 789–96. IEEE, 2014. https://doi.org/10.1109/allerton.2014.7028535.
ieee: M. Mondelli, R. Urbanke, and H. Hassani, “How to achieve the capacity of asymmetric
channels,” in 52nd Annual Allerton Conference on Communication, Control, and
Computing, Monticello, IL, United States, 2014, pp. 789–796.
ista: Mondelli M, Urbanke R, Hassani H. 2014. How to achieve the capacity of asymmetric
channels. 52nd Annual Allerton Conference on Communication, Control, and Computing.
Allerton Conference on Communication, Control, and Computing, 789–796.
mla: Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.”
52nd Annual Allerton Conference on Communication, Control, and Computing,
IEEE, 2014, pp. 789–96, doi:10.1109/allerton.2014.7028535.
short: M. Mondelli, R. Urbanke, H. Hassani, in:, 52nd Annual Allerton Conference
on Communication, Control, and Computing, IEEE, 2014, pp. 789–796.
conference:
end_date: 2014-10-03
location: Monticello, IL, United States
name: Allerton Conference on Communication, Control, and Computing
start_date: 2014-09-30
date_created: 2019-07-31T07:24:23Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2023-02-23T12:49:36Z
day: '01'
doi: 10.1109/allerton.2014.7028535
extern: '1'
external_id:
arxiv:
- '1406.7373'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.7373
month: '10'
oa: 1
oa_version: Preprint
page: 789-796
publication: 52nd Annual Allerton Conference on Communication, Control, and Computing
publication_identifier:
eisbn:
- 978-1-4799-8009-3
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6678'
relation: later_version
status: public
status: public
title: How to achieve the capacity of asymmetric channels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...