---
_id: '963'
abstract:
- lang: eng
text: 'Network games are widely used as a model for selfish resource-allocation
problems. In the classical model, each player selects a path connecting her source
and target vertex. The cost of traversing an edge depends on the number of players
that traverse it. Thus, it abstracts the fact that different users may use a resource
at different times and for different durations, which plays an important role
in defining the costs of the users in reality. For example, when transmitting
packets in a communication network, routing traffic in a road network, or processing
a task in a production system, the traversal of the network involves an inherent
delay, and so sharing and congestion of resources crucially depends on time. We
study timed network games , which add a time component to network games. Each
vertex v in the network is associated with a cost function, mapping the load on
v to the price that a player pays for staying in v for one time unit with this
load. In addition, each edge has a guard, describing time intervals in which the
edge can be traversed, forcing the players to spend time on vertices. Unlike earlier
work that add a time component to network games, the time in our model is continuous
and cannot be discretized. In particular, players have uncountably many strategies,
and a game may have uncountably many pure Nash equilibria. We study properties
of timed network games with cost-sharing or congestion cost functions: their stability,
equilibrium inefficiency, and complexity. In particular, we show that the answer
to the question whether we can restrict attention to boundary strategies, namely
ones in which edges are traversed only at the boundaries of guards, is mixed. '
alternative_title:
- LIPIcs
article_number: '37'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.37'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2017). Timed network games with clocks
(Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science,
Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.37'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.37.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Aalborg, Denmark, 2017,
vol. 83.'
ista: 'Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 37.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2017.
conference:
end_date: 2017-08-25
location: Aalborg, Denmark
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2017-08-21
date_created: 2018-12-11T11:49:26Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-07-10T12:01:59Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2017.37
file:
- access_level: open_access
checksum: f55eaf7f3c36ea07801112acfedd17d5
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:10Z
date_updated: 2020-07-14T12:48:18Z
file_id: '5059'
file_name: IST-2017-829-v1+1_mfcs-cr.pdf
file_size: 369730
relation: main_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
intvolume: ' 83'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6438'
pubrep_id: '829'
quality_controlled: '1'
related_material:
record:
- id: '6005'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 83
year: '2017'
...
---
_id: '9707'
abstract:
- lang: eng
text: Branching morphogenesis of the epithelial ureteric bud forms the renal collecting
duct system and is critical for normal nephron number, while low nephron number
is implicated in hypertension and renal disease. Ureteric bud growth and branching
requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric
bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling
up-regulates transcription factors Etv4 and Etv5, which are also critical for
branching. Despite extensive knowledge of the genetic control of these events,
it is not understood, at the cellular level, how renal branching morphogenesis
is achieved or how Ret signaling influences epithelial cell behaviors to promote
this process. Analysis of chimeric embryos previously suggested a role for Ret
signaling in promoting cell rearrangements in the nephric duct, but this method
was unsuited to study individual cell behaviors during ureteric bud branching.
Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture
and time-lapse imaging, to trace the movements and divisions of individual ureteric
bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type
clones in which the mutant and wild-type sister cells are differentially and heritably
marked by green and red fluorescent proteins. We find that, in normal kidneys,
most individual tip cells behave as self-renewing progenitors, some of whose progeny
remain at the tips while others populate the growing UB trunks. In Ret or Etv4
MADM clones, the wild-type cells generated at a UB tip are much more likely to
remain at, or move to, the new tips during branching and elongation, while their
Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks.
By tracking successive mitoses in a cell lineage, we find that Ret signaling has
little effect on proliferation, in contrast to its effects on cell movement. Our
results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric
bud tips, and suggest a model in which these cell movements mediate branching
morphogenesis.
article_processing_charge: No
author:
- first_name: Paul
full_name: Riccio, Paul
last_name: Riccio
- first_name: Christina
full_name: Cebrián, Christina
last_name: Cebrián
- first_name: Hui
full_name: Zong, Hui
last_name: Zong
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Frank
full_name: Costantini, Frank
last_name: Costantini
citation:
ama: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. Data from: Ret and
Etv4 promote directed movements of progenitor cells during renal branching morphogenesis.
2017. doi:10.5061/dryad.pk16b'
apa: 'Riccio, P., Cebrián, C., Zong, H., Hippenmeyer, S., & Costantini, F. (2017).
Data from: Ret and Etv4 promote directed movements of progenitor cells during
renal branching morphogenesis. Dryad. https://doi.org/10.5061/dryad.pk16b'
chicago: 'Riccio, Paul, Christina Cebrián, Hui Zong, Simon Hippenmeyer, and Frank
Costantini. “Data from: Ret and Etv4 Promote Directed Movements of Progenitor
Cells during Renal Branching Morphogenesis.” Dryad, 2017. https://doi.org/10.5061/dryad.pk16b.'
ieee: 'P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, and F. Costantini, “Data
from: Ret and Etv4 promote directed movements of progenitor cells during renal
branching morphogenesis.” Dryad, 2017.'
ista: 'Riccio P, Cebrián C, Zong H, Hippenmeyer S, Costantini F. 2017. Data from:
Ret and Etv4 promote directed movements of progenitor cells during renal branching
morphogenesis, Dryad, 10.5061/dryad.pk16b.'
mla: 'Riccio, Paul, et al. Data from: Ret and Etv4 Promote Directed Movements
of Progenitor Cells during Renal Branching Morphogenesis. Dryad, 2017, doi:10.5061/dryad.pk16b.'
short: P. Riccio, C. Cebrián, H. Zong, S. Hippenmeyer, F. Costantini, (2017).
date_created: 2021-07-23T09:39:34Z
date_published: 2017-01-14T00:00:00Z
date_updated: 2022-08-25T13:34:55Z
day: '14'
department:
- _id: SiHi
doi: 10.5061/dryad.pk16b
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.pk16b
month: '01'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9702'
relation: used_in_publication
status: deleted
status: public
title: 'Data from: Ret and Etv4 promote directed movements of progenitor cells during
renal branching morphogenesis'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '9709'
abstract:
- lang: eng
text: Across the nervous system, certain population spiking patterns are observed
far more frequently than others. A hypothesis about this structure is that these
collective activity patterns function as population codewords–collective modes–carrying
information distinct from that of any single cell. We investigate this phenomenon
in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop
a novel statistical model that decomposes the population response into modes;
it predicts the distribution of spiking activity in the ganglion cell population
with high accuracy. We found that the modes represent localized features of the
visual stimulus that are distinct from the features represented by single neurons.
Modes form clusters of activity states that are readily discriminated from one
another. When we repeated the same visual stimulus, we found that the same mode
was robustly elicited. These results suggest that retinal ganglion cells’ collective
signaling is endowed with a form of error-correcting code–a principle that may
hold in brain areas beyond retina.
article_processing_charge: No
author:
- first_name: Jason
full_name: Prentice, Jason
last_name: Prentice
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Mark
full_name: Ioffe, Mark
last_name: Ioffe
- first_name: Adrianna
full_name: Loback, Adrianna
last_name: Loback
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: 'Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. Data from: Error-robust
modes of the retinal population code. 2017. doi:10.5061/dryad.1f1rc'
apa: 'Prentice, J., Marre, O., Ioffe, M., Loback, A., Tkačik, G., & Berry, M.
(2017). Data from: Error-robust modes of the retinal population code. Dryad. https://doi.org/10.5061/dryad.1f1rc'
chicago: 'Prentice, Jason, Olivier Marre, Mark Ioffe, Adrianna Loback, Gašper Tkačik,
and Michael Berry. “Data from: Error-Robust Modes of the Retinal Population Code.”
Dryad, 2017. https://doi.org/10.5061/dryad.1f1rc.'
ieee: 'J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, and M. Berry, “Data
from: Error-robust modes of the retinal population code.” Dryad, 2017.'
ista: 'Prentice J, Marre O, Ioffe M, Loback A, Tkačik G, Berry M. 2017. Data from:
Error-robust modes of the retinal population code, Dryad, 10.5061/dryad.1f1rc.'
mla: 'Prentice, Jason, et al. Data from: Error-Robust Modes of the Retinal Population
Code. Dryad, 2017, doi:10.5061/dryad.1f1rc.'
short: J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkačik, M. Berry, (2017).
date_created: 2021-07-23T11:34:34Z
date_published: 2017-10-18T00:00:00Z
date_updated: 2025-09-22T09:43:12Z
day: '18'
department:
- _id: GaTk
doi: 10.5061/dryad.1f1rc
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.1f1rc
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1197'
relation: used_in_publication
status: public
status: public
title: 'Data from: Error-robust modes of the retinal population code'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2017'
...
---
_id: '463'
abstract:
- lang: eng
text: We investigate transient behaviors induced by magnetic fields on the dynamics
of the flow of a ferrofluid in the gap between two concentric, independently rotating
cylinders. Without applying any magnetic fields, we uncover emergence of flow
states constituted by a combination of a localized spiral state (SPIl) in the
top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v)
with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl +
SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented,
we observe the transient behaviors between multi-cell states passing through two
critical thresholds in a strength of an axial (transverse) magnetic field. Before
the first critical threshold of a magnetic field strength, multi-stable states
with different number of cells could be observed. After the first critical threshold,
we find the transient behavior between the three- and two-cell flow states. For
more strength of magnetic field or after the second critical threshold, we discover
that multi-cell states are disappeared and a localized spiral state remains to
be stimulated. The studied transient behavior could be understood by the investigation
of various quantities including a modal kinetic energy, a mode amplitude of the
radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence
of new flow states and the transient behavior between their states in ferrofluidic
flows indicate that richer and potentially controllable dynamics through magnetic
fields could be possible in ferrofluic flow.
article_number: '113112'
article_processing_charge: No
article_type: original
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Soorok
full_name: Ryu, Soorok
last_name: Ryu
citation:
ama: Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states
in ferrofluidic Taylor-Couette flow. Chaos. 2017;27(11). doi:10.1063/1.5002771
apa: Altmeyer, S., Do, Y., & Ryu, S. (2017). Transient behavior between multi-cell
flow states in ferrofluidic Taylor-Couette flow. Chaos. AIP Publishing.
https://doi.org/10.1063/1.5002771
chicago: Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between
Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos. AIP
Publishing, 2017. https://doi.org/10.1063/1.5002771.
ieee: S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow
states in ferrofluidic Taylor-Couette flow,” Chaos, vol. 27, no. 11. AIP
Publishing, 2017.
ista: Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow
states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.
mla: Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States
in Ferrofluidic Taylor-Couette Flow.” Chaos, vol. 27, no. 11, 113112, AIP
Publishing, 2017, doi:10.1063/1.5002771.
short: S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2025-09-18T09:58:08Z
day: '01'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1063/1.5002771
external_id:
isi:
- '000416827300016'
file:
- access_level: open_access
checksum: 0731f9d416760c1062db258ca51f8bdc
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T15:14:30Z
date_updated: 2020-07-14T12:46:32Z
file_id: '6970'
file_name: 2017_Chaos_Altmeyer.pdf
file_size: 7714020
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 27'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Chaos
publication_identifier:
issn:
- 1054-1500
publication_status: published
publisher: AIP Publishing
publist_id: '7358'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette
flow
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2017'
...
---
_id: '464'
abstract:
- lang: eng
text: The computation of the winning set for parity objectives and for Streett objectives
in graphs as well as in game graphs are central problems in computer-aided verification,
with application to the verification of closed systems with strong fairness conditions,
the verification of open systems, checking interface compatibility, well-formedness
of specifications, and the synthesis of reactive systems. We show how to compute
the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives
in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs
in time O(n2+nklogn). For both problems this gives faster algorithms for dense
graphs and represents the first improvement in asymptotic running time in 15 years.
article_number: '26'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and
Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017
apa: Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved algorithms
for parity and Streett objectives. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
chicago: Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved
Algorithms for Parity and Streett Objectives.” Logical Methods in Computer
Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
ieee: K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for
parity and Streett objectives,” Logical Methods in Computer Science, vol.
13, no. 3. International Federation of Computational Logic, 2017.
ista: Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity
and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett
Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International
Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
short: K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer
Science 13 (2017).
corr_author: '1'
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2025-09-23T09:20:52Z
day: '26'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(3:26)2017
ec_funded: 1
external_id:
arxiv:
- '1410.0833'
isi:
- '000419163000001'
file:
- access_level: open_access
checksum: 12d469ae69b80361333d7dead965cf5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:27Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5010'
file_name: IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf
file_size: 582940
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7357'
pubrep_id: '956'
quality_controlled: '1'
related_material:
record:
- id: '1661'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Improved algorithms for parity and Streett objectives
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2017'
...
---
_id: '466'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. There exist two different views: (i) the expectation
semantics, where the goal is to optimize the expected mean-payoff objective, and
(ii) the satisfaction semantics, where the goal is to maximize the probability
of runs such that the mean-payoff value stays above a given vector. We consider
optimization with respect to both objectives at once, thus unifying the existing
semantics. Precisely, the goal is to optimize the expectation while ensuring the
satisfaction constraint. Our problem captures the notion of optimization with
respect to strategies that are risk-averse (i.e., ensure certain probabilistic
guarantee). Our main results are as follows: First, we present algorithms for
the decision problems which are always polynomial in the size of the MDP. We also
show that an approximation of the Pareto-curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions. Second, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem. '
article_number: '15'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Křetínská, Zuzana
last_name: Křetínská
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff
objectives in Markov decision processes. Logical Methods in Computer Science.
2017;13(2). doi:10.23638/LMCS-13(2:15)2017
apa: Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views
on multiple mean-payoff objectives in Markov decision processes. Logical Methods
in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017
chicago: Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical
Methods in Computer Science. International Federation of Computational Logic,
2017. https://doi.org/10.23638/LMCS-13(2:15)2017.
ieee: K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple
mean-payoff objectives in Markov decision processes,” Logical Methods in Computer
Science, vol. 13, no. 2. International Federation of Computational Logic,
2017.
ista: Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple
mean-payoff objectives in Markov decision processes. Logical Methods in Computer
Science. 13(2), 15.
mla: Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes.” Logical Methods in Computer Science,
vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.
short: K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science
13 (2017).
corr_author: '1'
date_created: 2018-12-11T11:46:38Z
date_published: 2017-07-03T00:00:00Z
date_updated: 2025-09-29T11:00:42Z
day: '03'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(2:15)2017
ec_funded: 1
external_id:
isi:
- '000419160800002'
file:
- access_level: open_access
checksum: bfa405385ec6229ad5ead89ab5751639
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:32Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5354'
file_name: IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf
file_size: 511832
relation: main_file
file_date_updated: 2020-07-14T12:46:33Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '2'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7355'
pubrep_id: '957'
quality_controlled: '1'
related_material:
record:
- id: '5429'
relation: earlier_version
status: public
- id: '5435'
relation: earlier_version
status: public
- id: '1657'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2017'
...
---
_id: '467'
abstract:
- lang: eng
text: Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata or in any other known
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata, which makes it possible to express important
quantitative properties such as average response time. In nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in runtime verification. We establish an almost-complete
decidability picture for the basic decision problems about nested weighted automata
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties.
article_number: '31'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: 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: Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions
on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata.
ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM
Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.
ista: Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions
on Computational Logic (TOCL). 18(4), 31.
mla: Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions
on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
short: K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational
Logic (TOCL) 18 (2017).
corr_author: '1'
date_created: 2018-12-11T11:46:38Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2025-09-23T09:39:58Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3152769
ec_funded: 1
external_id:
arxiv:
- '1606.03598'
isi:
- '000419237100006'
intvolume: ' 18'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.03598
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: ACM Transactions on Computational Logic (TOCL)
publication_identifier:
issn:
- 1529-3785
publication_status: published
publisher: ACM
publist_id: '7354'
quality_controlled: '1'
related_material:
record:
- id: '5415'
relation: earlier_version
status: public
- id: '5436'
relation: earlier_version
status: public
- id: '1656'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Nested weighted automata
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 18
year: '2017'
...
---
_id: '471'
abstract:
- lang: eng
text: 'We present a new algorithm for the statistical model checking of Markov chains
with respect to unbounded temporal properties, including full linear temporal
logic. The main idea is that we monitor each simulation run on the fly, in order
to detect quickly if a bottom strongly connected component is entered with high
probability, in which case the simulation run can be terminated early. As a result,
our simulation runs are often much shorter than required by termination bounds
that are computed a priori for a desired level of confidence on a large state
space. In comparison to previous algorithms for statistical model checking our
method is not only faster in many cases but also requires less information about
the system, namely, only the minimum transition probability that occurs in the
Markov chain. In addition, our method can be generalised to unbounded quantitative
properties such as mean-payoff bounds. '
article_number: '12'
article_processing_charge: No
arxiv: 1
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- 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: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking
for unbounded temporal properties. ACM Transactions on Computational Logic.
2017;18(2). doi:10.1145/3060139
apa: Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster
statistical model checking for unbounded temporal properties. ACM Transactions
on Computational Logic. ACM. https://doi.org/10.1145/3060139
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM
Transactions on Computational Logic. ACM, 2017. https://doi.org/10.1145/3060139.
ieee: P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical
model checking for unbounded temporal properties,” ACM Transactions on Computational
Logic, vol. 18, no. 2. ACM, 2017.
ista: Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model
checking for unbounded temporal properties. ACM Transactions on Computational
Logic. 18(2), 12.
mla: Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal
Properties.” ACM Transactions on Computational Logic, vol. 18, no. 2, 12,
ACM, 2017, doi:10.1145/3060139.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational
Logic 18 (2017).
corr_author: '1'
date_created: 2018-12-11T11:46:39Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2025-09-22T09:21:16Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/3060139
ec_funded: 1
external_id:
arxiv:
- '1504.05739'
isi:
- '000405208400005'
intvolume: ' 18'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.05739
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: ACM Transactions on Computational Logic
publication_identifier:
issn:
- 1529-3785
publication_status: published
publisher: ACM
publist_id: '7349'
quality_controlled: '1'
related_material:
record:
- id: '1234'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Faster statistical model checking for unbounded temporal properties
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 18
year: '2017'
...
---
_id: '481'
abstract:
- lang: eng
text: We introduce planar matchings on directed pseudo-line arrangements, which
yield a planar set of pseudo-line segments such that only matching-partners are
adjacent. By translating the planar matching problem into a corresponding stable
roommates problem we show that such matchings always exist. Using our new framework,
we establish, for the first time, a complete, rigorous definition of weighted
straight skeletons, which are based on a so-called wavefront propagation process.
We present a generalized and unified approach to treat structural changes in the
wavefront that focuses on the restoration of weak planarity by finding planar
matchings.
acknowledgement: 'Supported by NSERC and the Ross and Muriel Cheriton Fellowship.
Research supported by Austrian Science Fund (FWF): P25816-N15.'
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons.
International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229.
doi:10.1142/S0218195916600050
apa: Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted
straight skeletons. International Journal of Computational Geometry and Applications.
World Scientific Publishing. https://doi.org/10.1142/S0218195916600050
chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for
Weighted Straight Skeletons.” International Journal of Computational Geometry
and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.
ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight
skeletons,” International Journal of Computational Geometry and Applications,
vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.
ista: Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight
skeletons. International Journal of Computational Geometry and Applications. 26(3–4),
211–229.
mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”
International Journal of Computational Geometry and Applications, vol.
26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.
short: T. Biedl, S. Huber, P. Palfrader, International Journal of Computational
Geometry and Applications 26 (2017) 211–229.
corr_author: '1'
date_created: 2018-12-11T11:46:43Z
date_published: 2017-04-13T00:00:00Z
date_updated: 2025-09-29T13:22:54Z
day: '13'
ddc:
- '004'
- '514'
- '516'
department:
- _id: HeEd
doi: 10.1142/S0218195916600050
file:
- access_level: open_access
checksum: f79e8558bfe4b368dfefeb8eec2e3a5e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:34Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4758'
file_name: IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf
file_size: 769296
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 26'
issue: 3-4
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 211 - 229
publication: International Journal of Computational Geometry and Applications
publication_status: published
publisher: World Scientific Publishing
publist_id: '7338'
pubrep_id: '949'
quality_controlled: '1'
related_material:
record:
- id: '10892'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Planar matchings for weighted straight skeletons
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: 26
year: '2017'
...
---
_id: '483'
abstract:
- lang: eng
text: We prove the universality for the eigenvalue gap statistics in the bulk of
the spectrum for band matrices, in the regime where the band width is comparable
with the dimension of the matrix, W ~ N. All previous results concerning universality
of non-Gaussian random matrices are for mean-field models. By relying on a new
mean-field reduction technique, we deduce universality from quantum unique ergodicity
for band matrices.
article_processing_charge: No
arxiv: 1
author:
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band
matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800.
doi:10.4310/ATMP.2017.v21.n3.a5
apa: Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a
class of random band matrices. Advances in Theoretical and Mathematical Physics.
International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5
chicago: Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for
a Class of Random Band Matrices.” Advances in Theoretical and Mathematical
Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.
ieee: P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random
band matrices,” Advances in Theoretical and Mathematical Physics, vol.
21, no. 3. International Press, pp. 739–800, 2017.
ista: Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random
band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.
mla: Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.”
Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International
Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.
short: P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical
Physics 21 (2017) 739–800.
date_created: 2018-12-11T11:46:43Z
date_published: 2017-08-25T00:00:00Z
date_updated: 2025-09-18T09:52:57Z
day: '25'
department:
- _id: LaEr
doi: 10.4310/ATMP.2017.v21.n3.a5
ec_funded: 1
external_id:
arxiv:
- '1602.02312'
isi:
- '000409382300005'
intvolume: ' 21'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.02312
month: '08'
oa: 1
oa_version: Submitted Version
page: 739 - 800
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- 1095-0761
publication_status: published
publisher: International Press
publist_id: '7337'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Universality for a class of random band matrices
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 21
year: '2017'
...
---
_id: '484'
abstract:
- lang: eng
text: We consider the dynamics of a large quantum system of N identical bosons in
3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed
0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution
in the Nparticle Hilbert space. The leading order behaviour of the dynamics is
determined by Hartree theory while the second order is given by Bogoliubov theory.
article_processing_charge: No
arxiv: 1
author:
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
citation:
ama: Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of
interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738.
doi:10.4310/ATMP.2017.v21.n3.a4
apa: Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field
dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics.
International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4
chicago: Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field
Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics.
International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.
ieee: P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics
of interacting bosons,” Advances in Theoretical and Mathematical Physics,
vol. 21, no. 3. International Press, pp. 683–738, 2017.
ista: Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics
of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3),
683–738.
mla: Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field
Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics,
vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.
short: P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics
21 (2017) 683–738.
date_created: 2018-12-11T11:46:43Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-18T09:52:14Z
day: '01'
department:
- _id: RoSe
doi: 10.4310/ATMP.2017.v21.n3.a4
ec_funded: 1
external_id:
arxiv:
- '1509.04631'
isi:
- '000409382300004'
intvolume: ' 21'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.04631
month: '01'
oa: 1
oa_version: Submitted Version
page: 683 - 738
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- 1095-0761
publication_status: published
publisher: International Press
publist_id: '7336'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bogoliubov correction to the mean-field dynamics of interacting bosons
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 21
year: '2017'
...
---
_id: '485'
abstract:
- lang: eng
text: We present results on nonlinear electro-optical conversion of microwave radiation
into the optical telecommunication band with more than 0.1% photon number conversion
efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator
article_number: NM3A.1
article_processing_charge: No
author:
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Michele
full_name: Collodo, Michele
last_name: Collodo
- first_name: Ulrich
full_name: Vogl, Ulrich
last_name: Vogl
- first_name: Birgit
full_name: Stiller, Birgit
last_name: Stiller
- first_name: Gerhard
full_name: Schunk, Gerhard
last_name: Schunk
- first_name: Dmitry
full_name: Strekalov, Dmitry
last_name: Strekalov
- first_name: Christoph
full_name: Marquardt, Christoph
last_name: Marquardt
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
citation:
ama: 'Rueda Sanchez AR, Sedlmeir F, Collodo M, et al. Single sideband microwave
to optical photon conversion-an-electro-optic-realization. In: Optics InfoBase
Conference Papers. Vol F54. Optica Publishing Group; 2017. doi:10.1364/NLO.2017.NM3A.1'
apa: 'Rueda Sanchez, A. R., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk,
G., … Schwefel, H. (2017). Single sideband microwave to optical photon conversion-an-electro-optic-realization.
In Optics InfoBase Conference Papers (Vol. F54). Waikoloa, HI, United States:
Optica Publishing Group. https://doi.org/10.1364/NLO.2017.NM3A.1'
chicago: Rueda Sanchez, Alfredo R, Florian Sedlmeir, Michele Collodo, Ulrich Vogl,
Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Single Sideband Microwave
to Optical Photon Conversion-an-Electro-Optic-Realization.” In Optics InfoBase
Conference Papers, Vol. F54. Optica Publishing Group, 2017. https://doi.org/10.1364/NLO.2017.NM3A.1.
ieee: A. R. Rueda Sanchez et al., “Single sideband microwave to optical photon
conversion-an-electro-optic-realization,” in Optics InfoBase Conference Papers,
Waikoloa, HI, United States, 2017, vol. F54.
ista: 'Rueda Sanchez AR, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov
D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2017. Single sideband
microwave to optical photon conversion-an-electro-optic-realization. Optics InfoBase
Conference Papers. NLO: Nonlinear Optics vol. F54, NM3A.1.'
mla: Rueda Sanchez, Alfredo R., et al. “Single Sideband Microwave to Optical Photon
Conversion-an-Electro-Optic-Realization.” Optics InfoBase Conference Papers,
vol. F54, NM3A.1, Optica Publishing Group, 2017, doi:10.1364/NLO.2017.NM3A.1.
short: A.R. Rueda Sanchez, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk,
D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:,
Optics InfoBase Conference Papers, Optica Publishing Group, 2017.
conference:
end_date: 2017-07-21
location: Waikoloa, HI, United States
name: 'NLO: Nonlinear Optics'
start_date: 2017-07-17
date_created: 2018-12-11T11:46:44Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2025-06-03T11:23:42Z
day: '01'
department:
- _id: JoFi
doi: 10.1364/NLO.2017.NM3A.1
language:
- iso: eng
month: '07'
oa_version: None
publication: Optics InfoBase Conference Papers
publication_identifier:
isbn:
- 978-155752820-9
publication_status: published
publisher: Optica Publishing Group
publist_id: '7335'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single sideband microwave to optical photon conversion-an-electro-optic-realization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: F54
year: '2017'
...
---
_id: '487'
abstract:
- lang: eng
text: In this paper we study network architecture for unlicensed cellular networking
for outdoor coverage in TV white spaces. The main technology proposed for TV white
spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af
is originally designed for improved indoor propagation. We show that long links,
typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed
terminal, and significantly reduce its efficiency. Instead, we propose CellFi,
an alternative architecture based on LTE. LTE is designed for long-range coverage
and throughput efficiency, but it is also designed to operate in tightly controlled
and centrally managed networks. CellFi overcomes these problems by designing an
LTE-compatible spectrum database component, mandatory for TV white space networking,
and introducing an interference management component for distributed coordination.
CellFi interference management is compatible with existing LTE mechanisms, requires
no explicit communication between base stations, and is more efficient than CSMA
for long links. We evaluate our design through extensive real world evaluation
on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af,
it increases coverage by 40% and reduces median flow completion times by 2.3x.
article_processing_charge: No
author:
- first_name: Ghufran
full_name: Baig, Ghufran
last_name: Baig
- first_name: Bozidar
full_name: Radunovic, Bozidar
last_name: Radunovic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Matthew
full_name: Balkwill, Matthew
last_name: Balkwill
- first_name: Thomas
full_name: Karagiannis, Thomas
last_name: Karagiannis
- first_name: Lili
full_name: Qiu, Lili
last_name: Qiu
citation:
ama: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards
unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017
13th International Conference on Emerging Networking EXperiments and Technologies.
ACM; 2017:2-14. doi:10.1145/3143361.3143367'
apa: 'Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., &
Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings
of the 2017 13th International Conference on emerging Networking EXperiments and
Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367'
chicago: Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill,
Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV
White Spaces.” In Proceedings of the 2017 13th International Conference on
Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367.
ieee: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L.
Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings
of the 2017 13th International Conference on emerging Networking EXperiments and
Technologies, Incheon, South Korea, 2017, pp. 2–14.
ista: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017.
Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017
13th International Conference on emerging Networking EXperiments and Technologies.
CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.'
mla: Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.”
Proceedings of the 2017 13th International Conference on Emerging Networking
EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.
short: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu,
in:, Proceedings of the 2017 13th International Conference on Emerging Networking
EXperiments and Technologies, ACM, 2017, pp. 2–14.
conference:
end_date: 2017-12-15
location: Incheon, South Korea
name: 'CoNEXT: Conference on emerging Networking EXperiments and Technologies'
start_date: 2017-12-12
corr_author: '1'
date_created: 2018-12-11T11:46:45Z
date_published: 2017-11-28T00:00:00Z
date_updated: 2025-09-18T09:50:43Z
day: '28'
department:
- _id: DaAl
doi: 10.1145/3143361.3143367
external_id:
isi:
- '000526087500002'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 2 - 14
publication: Proceedings of the 2017 13th International Conference on emerging Networking
EXperiments and Technologies
publication_identifier:
isbn:
- 978-145035422-6
publication_status: published
publisher: ACM
publist_id: '7333'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Towards unlicensed cellular networks in TV white spaces
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2017'
...
---
_id: '512'
abstract:
- lang: eng
text: 'The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population. The fixation
probability is a fundamental quantity of natural selection, and known to depend
on the population structure. Amplifiers of natural selection are population structures
which increase the fixation probability of advantageous mutants, as compared to
the baseline case of well-mixed populations. In this work we focus on symmetric
population structures represented as undirected graphs. In the regime of undirected
graphs, the strongest amplifier known has been the Star graph, and the existence
of undirected graphs with stronger amplification properties has remained open
for over a decade. In this work we present the Comet and Comet-swarm families
of undirected graphs. We show that for a range of fitness values of the mutants,
the Comet and Cometswarm graphs have fixation probability strictly larger than
the fixation probability of the Star graph, for fixed population size and at the
limit of large populations, respectively. '
article_number: '82'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected
population structures: Comets beat stars. Scientific Reports. 2017;7(1).
doi:10.1038/s41598-017-00107-w'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification
on undirected population structures: Comets beat stars. Scientific Reports.
Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.”
Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification
on undirected population structures: Comets beat stars,” Scientific Reports,
vol. 7, no. 1. Nature Publishing Group, 2017.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on
undirected population structures: Comets beat stars. Scientific Reports. 7(1),
82.'
mla: 'Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures:
Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing
Group, 2017, doi:10.1038/s41598-017-00107-w.'
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports
7 (2017).
corr_author: '1'
date_created: 2018-12-11T11:46:53Z
date_published: 2017-03-06T00:00:00Z
date_updated: 2025-09-18T09:50:10Z
day: '06'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1038/s41598-017-00107-w
ec_funded: 1
external_id:
isi:
- '000396867800013'
file:
- access_level: open_access
checksum: 7d05cbdd914e194a019c0f91fb64e9a8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:35Z
date_updated: 2020-07-14T12:46:36Z
file_id: '5357'
file_name: IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf
file_size: 1536783
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Nature Publishing Group
publist_id: '7307'
pubrep_id: '938'
quality_controlled: '1'
related_material:
record:
- id: '5449'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 7
year: '2017'
...
---
_id: '513'
abstract:
- lang: eng
text: 'We present an experimental setup that creates a shear flow with zero mean
advection velocity achieved by counterbalancing the nonzero streamwise pressure
gradient by moving boundaries, which generates plane Couette-Poiseuille flow.
We obtain experimental results in the transitional regime for this flow. Using
flow visualization, we characterize the subcritical transition to turbulence in
Couette-Poiseuille flow and show the existence of turbulent spots generated by
a permanent perturbation. Due to the zero mean advection velocity of the base
profile, these turbulent structures are nearly stationary. We distinguish two
regions of the turbulent spot: the active turbulent core, which is characterized
by waviness of the streaks similar to traveling waves, and the surrounding region,
which includes in addition the weak undisturbed streaks and oblique waves at the
laminar-turbulent interface. We also study the dependence of the size of these
two regions on Reynolds number. Finally, we show that the traveling waves move
in the downstream (Poiseuille) direction.'
article_number: '043904'
article_processing_charge: No
arxiv: 1
author:
- first_name: Lukasz
full_name: Klotz, Lukasz
id: 2C9AF1C2-F248-11E8-B48F-1D18A9856A87
last_name: Klotz
orcid: 0000-0003-1740-7635
- first_name: Grégoire M
full_name: Lemoult, Grégoire M
id: 4787FE80-F248-11E8-B48F-1D18A9856A87
last_name: Lemoult
- first_name: Idalia
full_name: Frontczak, Idalia
last_name: Frontczak
- first_name: Laurette
full_name: Tuckerman, Laurette
last_name: Tuckerman
- first_name: José
full_name: Wesfreid, José
last_name: Wesfreid
citation:
ama: 'Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille
flow experiment with zero mean advection velocity: Subcritical transition to turbulence.
Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904'
apa: 'Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J.
(2017). Couette-Poiseuille flow experiment with zero mean advection velocity:
Subcritical transition to turbulence. Physical Review Fluids. American
Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904'
chicago: 'Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman,
and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection
Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids.
American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.'
ieee: 'L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille
flow experiment with zero mean advection velocity: Subcritical transition to turbulence,”
Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.'
ista: 'Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille
flow experiment with zero mean advection velocity: Subcritical transition to turbulence.
Physical Review Fluids. 2(4), 043904.'
mla: 'Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection
Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids,
vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904.'
short: L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical
Review Fluids 2 (2017).
date_created: 2018-12-11T11:46:54Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2025-09-18T09:49:18Z
day: '01'
department:
- _id: BjHo
doi: 10.1103/PhysRevFluids.2.043904
external_id:
arxiv:
- '1704.02619'
isi:
- '000400249900003'
intvolume: ' 2'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.02619
month: '04'
oa: 1
oa_version: Preprint
publication: Physical Review Fluids
publication_status: published
publisher: American Physical Society
publist_id: '7306'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical
transition to turbulence'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2
year: '2017'
...
---
_id: '514'
abstract:
- lang: eng
text: 'Orientation in space is represented in specialized brain circuits. Persistent
head direction signals are transmitted from anterior thalamus to the presubiculum,
but the identity of the presubicular target neurons, their connectivity and function
in local microcircuits are unknown. Here, we examine how thalamic afferents recruit
presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic
interactions between these cells. Pyramidal neuron activation of Martinotti cells
in superficial layers is strongly facilitating such that high-frequency head directional
stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback
plays a dual role: precisely timed spikes may not inhibit the firing of in-tune
head direction cells, while exerting lateral inhibition. Autonomous attractor
dynamics emerge from a modelled network implementing wiring motifs and timing
sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop.
This inhibitory microcircuit is therefore tuned to refine and maintain head direction
information in the presubiculum.'
article_number: '16032'
article_processing_charge: No
author:
- first_name: Jean
full_name: Simonnet, Jean
last_name: Simonnet
- first_name: Mérie
full_name: Nassar, Mérie
last_name: Nassar
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Ivan
full_name: Cohen, Ivan
last_name: Cohen
- first_name: Bertrand
full_name: Mathon, Bertrand
last_name: Mathon
- first_name: Charlotte
full_name: Boccara, Charlotte
id: 3FC06552-F248-11E8-B48F-1D18A9856A87
last_name: Boccara
orcid: 0000-0001-7237-5109
- first_name: Richard
full_name: Miles, Richard
last_name: Miles
- first_name: Desdemona
full_name: Fricker, Desdemona
last_name: Fricker
citation:
ama: Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition
may maintain head direction signals in mouse presubiculum. Nature Communications.
2017;8. doi:10.1038/ncomms16032
apa: Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N.,
… Fricker, D. (2017). Activity dependent feedback inhibition may maintain head
direction signals in mouse presubiculum. Nature Communications. Nature
Publishing Group. https://doi.org/10.1038/ncomms16032
chicago: Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon,
Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent
Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.”
Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032.
ieee: J. Simonnet et al., “Activity dependent feedback inhibition may maintain
head direction signals in mouse presubiculum,” Nature Communications, vol.
8. Nature Publishing Group, 2017.
ista: Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker
D. 2017. Activity dependent feedback inhibition may maintain head direction signals
in mouse presubiculum. Nature Communications. 8, 16032.
mla: Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain
Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol.
8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.
short: J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R.
Miles, D. Fricker, Nature Communications 8 (2017).
date_created: 2018-12-11T11:46:54Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2025-09-18T09:48:43Z
day: '01'
ddc:
- '571'
department:
- _id: JoCs
doi: 10.1038/ncomms16032
external_id:
isi:
- '000405901100001'
file:
- access_level: open_access
checksum: 76d8a2b72a58e56adb410ec37dfa7eee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2020-07-14T12:46:36Z
file_id: '5083'
file_name: IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf
file_size: 2948357
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '7305'
pubrep_id: '937'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Activity dependent feedback inhibition may maintain head direction signals
in mouse presubiculum
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8
year: '2017'
...
---
_id: '515'
abstract:
- lang: eng
text: 'The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the
inner mitochondrial membrane is composed of five large protein complexes, named
CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule
used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC
complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI
forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome),
as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC
III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures
of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the
assembly and function of the SCs. Here we review and compare these recent studies
and discuss how they have advanced our understanding of mitochondrial electron
transport.'
article_processing_charge: No
article_type: original
author:
- first_name: James A
full_name: Letts, James A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization
of the mitochondrial electron transport chain. Nature Structural and Molecular
Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460'
apa: 'Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The
higher-order organization of the mitochondrial electron transport chain. Nature
Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460'
chicago: 'Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The
Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature
Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.'
ieee: 'J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order
organization of the mitochondrial electron transport chain,” Nature Structural
and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808,
2017.'
ista: 'Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order
organization of the mitochondrial electron transport chain. Nature Structural
and Molecular Biology. 24(10), 800–808.'
mla: 'Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The
Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature
Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group,
2017, pp. 800–08, doi:10.1038/nsmb.3460.'
short: J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017)
800–808.
corr_author: '1'
date_created: 2018-12-11T11:46:54Z
date_published: 2017-10-05T00:00:00Z
date_updated: 2025-09-18T09:47:41Z
day: '05'
ddc:
- '572'
department:
- _id: LeSa
doi: 10.1038/nsmb.3460
ec_funded: 1
external_id:
isi:
- '000412278000006'
file:
- access_level: open_access
checksum: 9bc7e8c41b43636dd7566289e511f096
content_type: application/pdf
creator: lsazanov
date_created: 2019-11-07T12:51:07Z
date_updated: 2020-07-14T12:46:36Z
file_id: '6993'
file_name: 29893_2_merged_1501257589_red.pdf
file_size: 4118385
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 800 - 808
project:
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
publication: Nature Structural and Molecular Biology
publication_identifier:
issn:
- 1545-9993
publication_status: published
publisher: Nature Publishing Group
publist_id: '7304'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Clarifying the supercomplex: The higher-order organization of the mitochondrial
electron transport chain'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 24
year: '2017'
...
---
_id: '520'
abstract:
- lang: eng
text: Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic
manipulations alone. Here, by modulating the concentration of allosteric effectors,
we focus on increasing product formation without further burdening the cells with
increased expression of enzymes. Resorting to a novel 96-well microplate cultivation
system for cyanobacteria, and using lactate-producing strains of Synechocystis
PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect
of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable
analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of
the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of
lactate productivity. Furthermore, we observed that as carbon is increasingly
deviated during growth toward product formation, there is an increased fixation
rate in the population of spontaneous mutants harboring an impaired production
pathway. This is a challenge in the development of green cell factories, which
may be countered by the incorporation in biotechnological processes of strategies
such as the one pioneered here.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Wei
full_name: Du, Wei
last_name: Du
- first_name: Andreas
full_name: Angermayr, Andreas
id: 4677C796-F248-11E8-B48F-1D18A9856A87
last_name: Angermayr
orcid: 0000-0001-8619-2223
- first_name: Joeri
full_name: Jongbloets, Joeri
last_name: Jongbloets
- first_name: Douwe
full_name: Molenaar, Douwe
last_name: Molenaar
- first_name: Herwig
full_name: Bachmann, Herwig
last_name: Bachmann
- first_name: Klaas
full_name: Hellingwerf, Klaas
last_name: Hellingwerf
- first_name: Filipe
full_name: Branco Dos Santos, Filipe
last_name: Branco Dos Santos
citation:
ama: Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes
the fitness burden associated with lactate production in Synechocystis sp. PCC6803.
ACS Synthetic Biology. 2017;6(3):395-401. doi:10.1021/acssynbio.6b00235
apa: Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf,
K., & Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes
the fitness burden associated with lactate production in Synechocystis sp. PCC6803.
ACS Synthetic Biology. American Chemical Society. https://doi.org/10.1021/acssynbio.6b00235
chicago: Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann,
Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation
Exposes the Fitness Burden Associated with Lactate Production in Synechocystis
Sp. PCC6803.” ACS Synthetic Biology. American Chemical Society, 2017. https://doi.org/10.1021/acssynbio.6b00235.
ieee: W. Du et al., “Nonhierarchical flux regulation exposes the fitness
burden associated with lactate production in Synechocystis sp. PCC6803,” ACS
Synthetic Biology, vol. 6, no. 3. American Chemical Society, pp. 395–401,
2017.
ista: Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco
Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden
associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic
Biology. 6(3), 395–401.
mla: Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden
Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic
Biology, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:10.1021/acssynbio.6b00235.
short: W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf,
F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.
date_created: 2018-12-11T11:46:56Z
date_published: 2017-03-17T00:00:00Z
date_updated: 2025-09-18T09:45:41Z
day: '17'
department:
- _id: ToBo
doi: 10.1021/acssynbio.6b00235
external_id:
isi:
- '000397080300002'
pmid:
- '27936615'
intvolume: ' 6'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 395 - 401
pmid: 1
publication: ACS Synthetic Biology
publication_identifier:
issn:
- 2161-5063
publication_status: published
publisher: American Chemical Society
publist_id: '7298'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonhierarchical flux regulation exposes the fitness burden associated with
lactate production in Synechocystis sp. PCC6803
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6
year: '2017'
...
---
_id: '521'
abstract:
- lang: eng
text: Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y
induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful
in showing that the classical dimension raising theorems hold in large scale;
that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and
Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely
n-to-1 maps, which include the natural quotient maps via a finite group action,
and prove that they preserve the asymptotic dimension.
article_processing_charge: No
arxiv: 1
author:
- first_name: Kyle
full_name: Austin, Kyle
last_name: Austin
- first_name: Ziga
full_name: Virk, Ziga
id: 2E36B656-F248-11E8-B48F-1D18A9856A87
last_name: Virk
citation:
ama: Austin K, Virk Z. Higson compactification and dimension raising. Topology
and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005
apa: Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising.
Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005
chicago: Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.”
Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.
ieee: K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology
and its Applications, vol. 215. Elsevier, pp. 45–57, 2017.
ista: Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology
and its Applications. 215, 45–57.
mla: Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.”
Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.
short: K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.
corr_author: '1'
date_created: 2018-12-11T11:46:56Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-18T09:47:04Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.topol.2016.10.005
external_id:
arxiv:
- '1608.03954'
isi:
- '000390501400005'
intvolume: ' 215'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.03954
month: '01'
oa: 1
oa_version: Submitted Version
page: 45 - 57
publication: Topology and its Applications
publication_identifier:
issn:
- 0166-8641
publication_status: published
publisher: Elsevier
publist_id: '7299'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Higson compactification and dimension raising
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 215
year: '2017'
...
---
_id: '534'
abstract:
- lang: eng
text: We investigate the complexity of finding an embedded non-orientable surface
of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural
question in low-dimensional topology, and as a first non-trivial instance of embeddability
of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding
to the relatively few hardness results that are currently known in 3-manifold
topology. In addition, we show that the problem lies in NP when the Euler genus
g is odd, and we give an explicit algorithm in this case.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Benjamin
full_name: Burton, Benjamin
last_name: Burton
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds.
Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0
apa: Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable
surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer.
https://doi.org/10.1007/s00454-017-9900-0
chicago: Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable
Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer,
2017. https://doi.org/10.1007/s00454-017-9900-0.
ieee: B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces
in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4.
Springer, pp. 871–888, 2017.
ista: Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in
3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.
mla: Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.”
Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017,
pp. 871–88, doi:10.1007/s00454-017-9900-0.
short: B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry
58 (2017) 871–888.
corr_author: '1'
date_created: 2018-12-11T11:47:01Z
date_published: 2017-06-09T00:00:00Z
date_updated: 2025-09-18T09:45:02Z
day: '09'
department:
- _id: UlWa
doi: 10.1007/s00454-017-9900-0
external_id:
arxiv:
- '1602.07907'
isi:
- '000413958900006'
intvolume: ' 58'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.07907
month: '06'
oa: 1
oa_version: Preprint
page: 871 - 888
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '7283'
quality_controlled: '1'
related_material:
record:
- id: '1379'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Finding non-orientable surfaces in 3-Manifolds
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 58
year: '2017'
...