---
_id: '2264'
abstract:
- lang: eng
text: Faithful progression through the cell cycle is crucial to the maintenance
and developmental potential of stem cells. Here, we demonstrate that neural stem
cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger
transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in
two temporally and spatially distinct progenitor domains. Differential conditional
deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal
olfactory bulb progenitors disrupted transitions through G1, G2 and M phases,
whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified
by deletion of Sp2 using mosaic analysis with double markers, which clearly established
that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly,
conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons
in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms
as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis
in the embryonic and postnatal brain.
article_processing_charge: No
author:
- first_name: Huixuan
full_name: Liang, Huixuan
last_name: Liang
- first_name: Guanxi
full_name: Xiao, Guanxi
last_name: Xiao
- first_name: Haifeng
full_name: Yin, Haifeng
last_name: Yin
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Jonathan
full_name: Horowitz, Jonathan
last_name: Horowitz
- first_name: Troy
full_name: Ghashghaei, Troy
last_name: Ghashghaei
citation:
ama: Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development
is dependent on the function of specificity protein 2 in cell cycle progression.
Development. 2013;140(3):552-561. doi:10.1242/dev.085621
apa: Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., & Ghashghaei,
T. (2013). Neural development is dependent on the function of specificity protein
2 in cell cycle progression. Development. Company of Biologists. https://doi.org/10.1242/dev.085621
chicago: Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz,
and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity
Protein 2 in Cell Cycle Progression.” Development. Company of Biologists,
2013. https://doi.org/10.1242/dev.085621.
ieee: H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei,
“Neural development is dependent on the function of specificity protein 2 in cell
cycle progression,” Development, vol. 140, no. 3. Company of Biologists,
pp. 552–561, 2013.
ista: Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural
development is dependent on the function of specificity protein 2 in cell cycle
progression. Development. 140(3), 552–561.
mla: Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of
Specificity Protein 2 in Cell Cycle Progression.” Development, vol. 140,
no. 3, Company of Biologists, 2013, pp. 552–61, doi:10.1242/dev.085621.
short: H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development
140 (2013) 552–561.
date_created: 2018-12-11T11:56:39Z
date_published: 2013-02-01T00:00:00Z
date_updated: 2021-01-12T06:56:23Z
day: '01'
department:
- _id: SiHi
doi: 10.1242/dev.085621
external_id:
pmid:
- '23293287'
intvolume: ' 140'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/
month: '02'
oa: 1
oa_version: Submitted Version
page: 552 - 561
pmid: 1
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '4681'
quality_controlled: '1'
scopus_import: 1
status: public
title: Neural development is dependent on the function of specificity protein 2 in
cell cycle progression
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2013'
...
---
_id: '2270'
abstract:
- lang: eng
text: "Representation languages for coalitional games are a key research area in
algorithmic game theory. There is an inher-\r\nent tradeoff between how general
a language is, allowing it to capture more elaborate games, and how hard
\ it is computationally to optimize and solve such games. One prominent such
\ language is the simple yet expressive\r\nWeighted Graph Games (WGGs) representation
(Deng and Papadimitriou 1994), which maintains knowledge about synergies between
agents in the form of an edge weighted graph. We consider the problem of finding
\ the optimal coalition structure in WGGs. The agents in such games are vertices
in a graph, and the value of a coalition is the sum of the weights of the edges
present between coalition members. The optimal coalition structure is a partition
of the agents to coalitions, that maximizes the sum of utilities obtained by the
coalitions. We show that finding the optimal coalition structure is not
only hard for general graphs, but is also intractable for restricted families
such as planar graphs which are amenable for many other combinatorial problems.
\ We then provide algorithms with constant factor approximations for planar, minorfree
and bounded degree graphs."
arxiv: 1
author:
- first_name: Yoram
full_name: Bachrach, Yoram
last_name: Bachrach
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Morteza
full_name: Zadimoghaddam, Morteza
last_name: Zadimoghaddam
citation:
ama: 'Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures
in Cooperative Graph Games. In: AAAI Press; 2013:81-87.'
apa: 'Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal
Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the
AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI
Press.'
chicago: Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam.
“Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press,
2013.
ieee: 'Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition
Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial
Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.'
ista: 'Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition
Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence,
81–87.'
mla: Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph
Games. AAAI Press, 2013, pp. 81–87.
short: Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press,
2013, pp. 81–87.
conference:
end_date: 2013-07-18
location: Bellevue, WA, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2013-07-14
date_created: 2018-12-11T11:56:41Z
date_published: 2013-12-31T00:00:00Z
date_updated: 2021-01-12T06:56:25Z
day: '31'
department:
- _id: VlKo
external_id:
arxiv:
- '1108.5248'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1108.5248
month: '12'
oa: 1
oa_version: None
page: 81-87
publication_status: published
publisher: AAAI Press
publist_id: '4674'
quality_controlled: '1'
status: public
title: Optimal Coalition Structures in Cooperative Graph Games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2272'
abstract:
- lang: eng
text: "We consider Conditional Random Fields (CRFs) with pattern-based potentials
defined on a chain. In this model the energy of a string (labeling) x1...xn is
the sum of terms over intervals [i,j] where each term is non-zero only if the
substring xi...xj equals a prespecified pattern α. Such CRFs can be naturally
applied to many sequence tagging problems.\r\nWe present efficient algorithms
for the three standard inference tasks in a CRF, namely computing (i) the partition
function, (ii) marginals, and (iii) computing the MAP. Their complexities are
respectively O(nL), O(nLℓmax) and O(nLmin{|D|,log(ℓmax+1)}) where L is the combined
length of input patterns, ℓmax is the maximum length of a pattern, and D is the
input alphabet. This improves on the previous algorithms of (Ye et al., 2009)
whose complexities are respectively O(nL|D|), O(n|Γ|L2ℓ2max) and O(nL|D|), where
|Γ| is the number of input patterns.\r\nIn addition, we give an efficient algorithm
for sampling. Finally, we consider the case of non-positive weights. (Komodakis
& Paragios, 2009) gave an O(nL) algorithm for computing the MAP. We present
a modification that has the same worst-case complexity but can beat it in the
best case. "
alternative_title:
- JMLR
article_processing_charge: No
author:
- first_name: Rustem
full_name: Takhanov, Rustem
id: 2CCAC26C-F248-11E8-B48F-1D18A9856A87
last_name: Takhanov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Takhanov R, Kolmogorov V. Inference algorithms for pattern-based CRFs on sequence
data. In: ICML’13 Proceedings of the 30th International Conference on International.
Vol 28. ML Research Press; 2013:145-153.'
apa: 'Takhanov, R., & Kolmogorov, V. (2013). Inference algorithms for pattern-based
CRFs on sequence data. In ICML’13 Proceedings of the 30th International Conference
on International (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.'
chicago: Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based
CRFs on Sequence Data.” In ICML’13 Proceedings of the 30th International Conference
on International, 28:145–53. ML Research Press, 2013.
ieee: R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs
on sequence data,” in ICML’13 Proceedings of the 30th International Conference
on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
ista: 'Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs
on sequence data. ICML’13 Proceedings of the 30th International Conference on
International. ICML: International Conference on Machine Learning, JMLR, vol.
28, 145–153.'
mla: Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based
CRFs on Sequence Data.” ICML’13 Proceedings of the 30th International Conference
on International, vol. 28, no. 3, ML Research Press, 2013, pp. 145–53.
short: R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International
Conference on International, ML Research Press, 2013, pp. 145–153.
conference:
end_date: 2013-06-21
location: Atlanta, GA, USA
name: 'ICML: International Conference on Machine Learning'
start_date: 2013-06-16
date_created: 2018-12-11T11:56:41Z
date_published: 2013-06-01T00:00:00Z
date_updated: 2023-10-17T09:51:32Z
day: '01'
department:
- _id: VlKo
intvolume: ' 28'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://proceedings.mlr.press/v28/takhanov13.pdf?CFID=105472548&CFTOKEN=5c5859b5d97b4439-27B4AC58-BA92-A964-B598CAACEE6CC515
month: '06'
oa: 1
oa_version: Submitted Version
page: 145 - 153
publication: ICML'13 Proceedings of the 30th International Conference on International
publication_status: published
publisher: ML Research Press
publist_id: '4672'
quality_controlled: '1'
related_material:
record:
- id: '1794'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Inference algorithms for pattern-based CRFs on sequence data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2013'
...
---
_id: '2273'
abstract:
- lang: eng
text: We propose a new family of message passing techniques for MAP estimation in
graphical models which we call Sequential Reweighted Message Passing (SRMP). Special
cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster
Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation
is simpler than the original derivation of TRW-S, and does not involve a decomposition
into trees. This allows easy generalizations. We present such a generalization
for the case of higher-order graphical models, and test it on several real-world
problems with promising results.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013.
apa: Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.
chicago: Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST
Austria, 2013.
ieee: V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
ista: Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.
mla: Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria,
2013.
short: V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.
date_created: 2018-12-11T11:56:42Z
date_published: 2013-09-22T00:00:00Z
date_updated: 2019-01-24T13:07:32Z
day: '22'
department:
- _id: VlKo
extern: 0
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5655
month: '09'
oa: 1
publication_status: published
publisher: IST Austria
publist_id: '4671'
quality_controlled: 0
status: public
title: Reweighted message passing revisited
type: report
year: '2013'
...
---
_id: '2274'
abstract:
- lang: eng
text: "Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto'92) as
protection to a shared resource. The basic idea is to ask the service requestor
to dedicate some non-trivial amount of computational work to every request. The
original applications included prevention of spam and protection against denial
of service attacks. More recently, PoWs have been used to prevent double spending
in the Bitcoin digital currency system.\r\n\r\nIn this work, we put forward an
alternative concept for PoWs -- so-called proofs of space (PoS), where a service
requestor must dedicate a significant amount of disk space as opposed to computation.
We construct secure PoS schemes in the random oracle model, using graphs with
high "pebbling complexity" and Merkle hash-trees. "
author:
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Sebastian
full_name: Faust, Sebastian
last_name: Faust
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of Space.
IST Austria; 2013.
apa: Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2013). Proofs
of Space. IST Austria.
chicago: Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof
Z Pietrzak. Proofs of Space. IST Austria, 2013.
ieee: S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of
Space. IST Austria, 2013.
ista: Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space,
IST Austria,p.
mla: Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
short: S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space,
IST Austria, 2013.
date_created: 2018-12-11T11:56:42Z
date_published: 2013-11-28T00:00:00Z
date_updated: 2023-02-23T10:09:33Z
day: '28'
ddc:
- '530'
department:
- _id: VlKo
- _id: KrPi
file:
- access_level: open_access
checksum: 37b61637b62fc079d9141c59d9f1a94f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:11Z
date_updated: 2020-07-14T12:45:36Z
file_id: '5197'
file_name: IST-2016-671-v1+1_796.pdf
file_size: 405870
relation: main_file
file_date_updated: 2020-07-14T12:45:36Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
publist_id: '4670'
pubrep_id: '671'
related_material:
record:
- id: '1675'
relation: later_version
status: public
scopus_import: 1
status: public
title: Proofs of Space
type: report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2276'
abstract:
- lang: eng
text: The problem of minimizing the Potts energy function frequently occurs in computer
vision applications. One way to tackle this NP-hard problem was proposed by Kovtun
[19, 20]. It identifies a part of an optimal solution by running k maxflow computations,
where k is the number of labels. The number of “labeled” pixels can be significant
in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce
the runtime to O (log k) maxflow computations (or one parametric maxflow computation).
Furthermore, the output of our algorithm allows to speed-up the subsequent alpha
expansion for the unlabeled part, or can be used as it is for time-critical applications.
To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7]
for Tree Metrics . We also show a connection to k-submodular functions from combinatorial
optimization, and discuss k-submodular relaxations for general energy functions.
arxiv: 1
author:
- first_name: Igor
full_name: Gridchyn, Igor
id: 4B60654C-F248-11E8-B48F-1D18A9856A87
last_name: Gridchyn
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular
functions. In: IEEE; 2013:2320-2327. doi:10.1109/ICCV.2013.288'
apa: 'Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow
and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288'
chicago: Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow
and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288.
ieee: 'I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular
functions,” presented at the ICCV: International Conference on Computer Vision,
Sydney, Australia, 2013, pp. 2320–2327.'
ista: 'Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular
functions. ICCV: International Conference on Computer Vision, 2320–2327.'
mla: Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow
and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.
short: I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:43Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:28Z
day: '01'
department:
- _id: JoCs
- _id: VlKo
doi: 10.1109/ICCV.2013.288
external_id:
arxiv:
- '1310.1771'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1310.1771
month: '12'
oa: 1
oa_version: Preprint
page: 2320 - 2327
publication_status: published
publisher: IEEE
publist_id: '4668'
quality_controlled: '1'
status: public
title: Potts model, parametric maxflow and k-submodular functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2277'
abstract:
- lang: eng
text: Redundancies and correlations in the responses of sensory neurons may seem
to waste neural resources, but they can also carry cues about structured stimuli
and may help the brain to correct for response errors. To investigate the effect
of stimulus structure on redundancy in retina, we measured simultaneous responses
from populations of retinal ganglion cells presented with natural and artificial
stimuli that varied greatly in correlation structure; these stimuli and recordings
are publicly available online. Responding to spatio-temporally structured stimuli
such as natural movies, pairs of ganglion cells were modestly more correlated
than in response to white noise checkerboards, but they were much less correlated
than predicted by a non-adapting functional model of retinal response. Meanwhile,
responding to stimuli with purely spatial correlations, pairs of ganglion cells
showed increased correlations consistent with a static, non-adapting receptive
field and nonlinearity. We found that in response to spatio-temporally correlated
stimuli, ganglion cells had faster temporal kernels and tended to have stronger
surrounds. These properties of individual cells, along with gain changes that
opposed changes in effective contrast at the ganglion cell input, largely explained
the pattern of pairwise correlations across stimuli where receptive field measurements
were possible.
article_number: e1003344
author:
- first_name: Kristina
full_name: Simmons, Kristina
last_name: Simmons
- first_name: Jason
full_name: Prentice, Jason
last_name: Prentice
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Jan
full_name: Homann, Jan
last_name: Homann
- first_name: Heather
full_name: Yee, Heather
last_name: Yee
- first_name: Stephanie
full_name: Palmer, Stephanie
last_name: Palmer
- first_name: Philip
full_name: Nelson, Philip
last_name: Nelson
- first_name: Vijay
full_name: Balasubramanian, Vijay
last_name: Balasubramanian
citation:
ama: Simmons K, Prentice J, Tkačik G, et al. Transformation of stimulus correlations
by the retina. PLoS Computational Biology. 2013;9(12). doi:10.1371/journal.pcbi.1003344
apa: Simmons, K., Prentice, J., Tkačik, G., Homann, J., Yee, H., Palmer, S., … Balasubramanian,
V. (2013). Transformation of stimulus correlations by the retina. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003344
chicago: Simmons, Kristina, Jason Prentice, Gašper Tkačik, Jan Homann, Heather Yee,
Stephanie Palmer, Philip Nelson, and Vijay Balasubramanian. “Transformation of
Stimulus Correlations by the Retina.” PLoS Computational Biology. Public
Library of Science, 2013. https://doi.org/10.1371/journal.pcbi.1003344.
ieee: K. Simmons et al., “Transformation of stimulus correlations by the
retina,” PLoS Computational Biology, vol. 9, no. 12. Public Library of
Science, 2013.
ista: Simmons K, Prentice J, Tkačik G, Homann J, Yee H, Palmer S, Nelson P, Balasubramanian
V. 2013. Transformation of stimulus correlations by the retina. PLoS Computational
Biology. 9(12), e1003344.
mla: Simmons, Kristina, et al. “Transformation of Stimulus Correlations by the Retina.”
PLoS Computational Biology, vol. 9, no. 12, e1003344, Public Library of
Science, 2013, doi:10.1371/journal.pcbi.1003344.
short: K. Simmons, J. Prentice, G. Tkačik, J. Homann, H. Yee, S. Palmer, P. Nelson,
V. Balasubramanian, PLoS Computational Biology 9 (2013).
date_created: 2018-12-11T11:56:43Z
date_published: 2013-12-05T00:00:00Z
date_updated: 2023-02-23T14:07:04Z
day: '05'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1003344
file:
- access_level: open_access
checksum: 46722afc4f7eabb0831165d9c1b171ad
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:36Z
date_updated: 2020-07-14T12:45:36Z
file_id: '5089'
file_name: IST-2016-410-v1+1_journal.pcbi.1003344.pdf
file_size: 3115568
relation: main_file
file_date_updated: 2020-07-14T12:45:36Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '4667'
pubrep_id: '410'
quality_controlled: '1'
related_material:
record:
- id: '9752'
relation: research_data
status: public
scopus_import: 1
status: public
title: Transformation of stimulus correlations by the retina
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2013'
...
---
_id: '2279'
abstract:
- lang: eng
text: We consider two-player games played on weighted directed graphs with mean-payoff
and total-payoff objectives, two classical quantitative objectives. While for
single-dimensional games the complexity and memory bounds for both objectives
coincide, we show that in contrast to multi-dimensional mean-payoff games that
are known to be coNP-complete, multi-dimensional total-payoff games are undecidable.
We introduce conservative approximations of these objectives, where the payoff
is considered over a local finite window sliding along a play, instead of the
whole play. For single dimension, we show that (i) if the window size is polynomial,
deciding the winner takes polynomial time, and (ii) the existence of a bounded
window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff
games. For multiple dimensions, we show that (i) the problem with fixed window
size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to
decide the existence of a bounded window.
acknowledgement: 279307; ERC; Fonds National de la Reserche Luxembourg; 279499; ERC;
Fonds National de la Reserche Luxembourg
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff
through windows. 2013;8172:118-132. doi:10.1007/978-3-319-02444-8_10
apa: 'Chatterjee, K., Doyen, L., Randour, M., & Raskin, J. (2013). Looking at
mean-payoff and total-payoff through windows. Presented at the ATVA: Automated
Technology for Verification and Analysis, Hanoi, Vietnam: Springer. https://doi.org/10.1007/978-3-319-02444-8_10'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin.
“Looking at Mean-Payoff and Total-Payoff through Windows.” Lecture Notes in Computer
Science. Springer, 2013. https://doi.org/10.1007/978-3-319-02444-8_10.
ieee: K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff
and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
ista: Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and
total-payoff through windows. 8172, 118–132.
mla: Chatterjee, Krishnendu, et al. Looking at Mean-Payoff and Total-Payoff through
Windows. Vol. 8172, Springer, 2013, pp. 118–32, doi:10.1007/978-3-319-02444-8_10.
short: K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.
conference:
end_date: 2013-10-18
location: Hanoi, Vietnam
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2013-10-15
date_created: 2018-12-11T11:56:44Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2023-02-23T12:22:51Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-319-02444-8_10
ec_funded: 1
intvolume: ' 8172'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1302.4248
month: '01'
oa: 1
oa_version: Preprint
page: 118 - 132
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '4656'
quality_controlled: '1'
related_material:
record:
- id: '523'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Looking at mean-payoff and total-payoff through windows
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8172
year: '2013'
...
---
_id: '2280'
abstract:
- lang: eng
text: The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal
container so as to minimize a measure of overlap between ellipsoids is considered.
A bilevel optimization formulation is given, together with an algorithm for the
general case and a simpler algorithm for the special case in which all ellipsoids
are in fact spheres. Convergence results are proved and computational experience
is described and illustrated. The motivating application-chromosome organization
in the human cell nucleus-is discussed briefly, and some illustrative results
are presented.
arxiv: 1
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Stephen
full_name: Wright, Stephen
last_name: Wright
citation:
ama: Uhler C, Wright S. Packing ellipsoids with overlap. SIAM Review. 2013;55(4):671-706.
doi:10.1137/120872309
apa: Uhler, C., & Wright, S. (2013). Packing ellipsoids with overlap. SIAM
Review. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120872309
chicago: Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.”
SIAM Review. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120872309.
ieee: C. Uhler and S. Wright, “Packing ellipsoids with overlap,” SIAM Review,
vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706,
2013.
ista: Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4),
671–706.
mla: Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM
Review, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013,
pp. 671–706, doi:10.1137/120872309.
short: C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.
date_created: 2018-12-11T11:56:44Z
date_published: 2013-11-07T00:00:00Z
date_updated: 2021-01-12T06:56:30Z
day: '07'
department:
- _id: CaUh
doi: 10.1137/120872309
external_id:
arxiv:
- '1204.0235'
intvolume: ' 55'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1204.0235
month: '11'
oa: 1
oa_version: Preprint
page: 671 - 706
publication: SIAM Review
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '4655'
quality_controlled: '1'
scopus_import: 1
status: public
title: Packing ellipsoids with overlap
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2013'
...
---
_id: '2282'
abstract:
- lang: eng
text: Epithelial spreading is a common and fundamental aspect of various developmental
and disease-related processes such as epithelial closure and wound healing. A
key challenge for epithelial tissues undergoing spreading is to increase their
surface area without disrupting epithelial integrity. Here we show that orienting
cell divisions by tension constitutes an efficient mechanism by which the enveloping
cell layer (EVL) releases anisotropic tension while undergoing spreading during
zebrafish epiboly. The control of EVL cell-division orientation by tension involves
cell elongation and requires myosin II activity to align the mitotic spindle with
the main tension axis. We also found that in the absence of tension-oriented cell
divisions and in the presence of increased tissue tension, EVL cells undergo ectopic
fusions, suggesting that the reduction of tension anisotropy by oriented cell
divisions is required to prevent EVL cells from fusing. We conclude that cell-division
orientation by tension constitutes a key mechanism for limiting tension anisotropy
and thus promoting tissue spreading during EVL epiboly.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
acknowledgement: 'This work was supported by the IST Austria and MPI-CBG '
author:
- first_name: Pedro
full_name: Campinho, Pedro
id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87
last_name: Campinho
orcid: 0000-0002-8526-5416
- first_name: Martin
full_name: Behrndt, Martin
id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
last_name: Behrndt
- first_name: Jonas
full_name: Ranft, Jonas
last_name: Ranft
- first_name: Thomas
full_name: Risler, Thomas
last_name: Risler
- first_name: Nicolas
full_name: Minc, Nicolas
last_name: Minc
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented
cell divisions limit anisotropic tissue tension in epithelial spreading during
zebrafish epiboly. Nature Cell Biology. 2013;15:1405-1414. doi:10.1038/ncb2869
apa: Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., & Heisenberg,
C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension
in epithelial spreading during zebrafish epiboly. Nature Cell Biology.
Nature Publishing Group. https://doi.org/10.1038/ncb2869
chicago: Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc,
and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic
Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell
Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/ncb2869.
ieee: P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg,
“Tension-oriented cell divisions limit anisotropic tissue tension in epithelial
spreading during zebrafish epiboly,” Nature Cell Biology, vol. 15. Nature
Publishing Group, pp. 1405–1414, 2013.
ista: Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented
cell divisions limit anisotropic tissue tension in epithelial spreading during
zebrafish epiboly. Nature Cell Biology. 15, 1405–1414.
mla: Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic
Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell
Biology, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:10.1038/ncb2869.
short: P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg,
Nature Cell Biology 15 (2013) 1405–1414.
date_created: 2018-12-11T11:56:45Z
date_published: 2013-11-10T00:00:00Z
date_updated: 2023-02-21T17:02:44Z
day: '10'
department:
- _id: CaHe
doi: 10.1038/ncb2869
intvolume: ' 15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://hal.upmc.fr/hal-00983313/
month: '11'
oa: 1
oa_version: Submitted Version
page: 1405 - 1414
project:
- _id: 252ABD0A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 930-B20
name: Control of Epithelial Cell Layer Spreading in Zebrafish
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '4652'
quality_controlled: '1'
related_material:
record:
- id: '1403'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Tension-oriented cell divisions limit anisotropic tissue tension in epithelial
spreading during zebrafish epiboly
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2013'
...
---
_id: '2284'
abstract:
- lang: eng
text: 'Background: The brood of ants and other social insects is highly susceptible
to pathogens, particularly those that penetrate the soft larval and pupal cuticle.
We here test whether the presence of a pupal cocoon, which occurs in some ant
species but not in others, affects the sanitary brood care and fungal infection
patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We
use a) a comparative approach analysing four species with either naked or cocooned
pupae and b) a within-species analysis of a single ant species, in which both
pupal types co-exist in the same colony. Results: We found that the presence of
a cocoon did not compromise fungal pathogen detection by the ants and that species
with cocooned pupae increased brood grooming after pathogen exposure. All tested
ant species further removed brood from their nests, which was predominantly expressed
towards larvae and naked pupae treated with the live fungal pathogen. In contrast,
cocooned pupae exposed to live fungus were not removed at higher rates than cocooned
pupae exposed to dead fungus or a sham control. Consistent with this, exposure
to the live fungus caused high numbers of infections and fungal outgrowth in larvae
and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed
the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion:
Our study suggests that the pupal cocoon has a protective effect against fungal
infection, causing an adaptive change in sanitary behaviours by the ants. It further
demonstrates that brood removal-originally described for honeybees as "hygienic
behaviour"-is a widespread sanitary behaviour in ants, which likely has important
implications on disease dynamics in social insect colonies.'
acknowledgement: "The study was funded by the European Research Council (Marie Curie
ERG 036569) and Marie Curie IEF 302204 to LVU\r\nCC BY 2.0\r\n"
article_number: '225'
author:
- first_name: Simon
full_name: Tragust, Simon
id: 35A7A418-F248-11E8-B48F-1D18A9856A87
last_name: Tragust
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Michel
full_name: Chapuisat, Michel
last_name: Chapuisat
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Pupal cocoons affect
sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary
Biology. 2013;13(1). doi:10.1186/1471-2148-13-225
apa: Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., & Cremer, S. (2013).
Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies.
BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/1471-2148-13-225
chicago: Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia
Cremer. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections
in Ant Colonies.” BMC Evolutionary Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2148-13-225.
ieee: S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Pupal
cocoons affect sanitary brood care and limit fungal infections in ant colonies,”
BMC Evolutionary Biology, vol. 13, no. 1. BioMed Central, 2013.
ista: Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2013. Pupal cocoons
affect sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary
Biology. 13(1), 225.
mla: Tragust, Simon, et al. “Pupal Cocoons Affect Sanitary Brood Care and Limit
Fungal Infections in Ant Colonies.” BMC Evolutionary Biology, vol. 13,
no. 1, 225, BioMed Central, 2013, doi:10.1186/1471-2148-13-225.
short: S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, BMC Evolutionary
Biology 13 (2013).
date_created: 2018-12-11T11:56:46Z
date_published: 2013-10-14T00:00:00Z
date_updated: 2023-02-23T14:07:06Z
day: '14'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1186/1471-2148-13-225
ec_funded: 1
file:
- access_level: open_access
checksum: c16ef36f2a10786a7885e19c4528d707
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:41Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5026'
file_name: IST-2016-402-v1+1_1471-2148-13-225.pdf
file_size: 281736
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
- _id: 25DAF0B2-B435-11E9-9278-68D0E5697425
grant_number: CR-118/3-1
name: Host-Parasite Coevolution
publication: BMC Evolutionary Biology
publication_status: published
publisher: BioMed Central
publist_id: '4647'
pubrep_id: '402'
quality_controlled: '1'
related_material:
record:
- id: '9753'
relation: research_data
status: public
scopus_import: 1
status: public
title: Pupal cocoons affect sanitary brood care and limit fungal infections in ant
colonies
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: 13
year: '2013'
...
---
_id: '2286'
abstract:
- lang: eng
text: The spatiotemporal control of cell divisions is a key factor in epithelial
morphogenesis and patterning. Mao et al (2013) now describe how differential rates
of proliferation within the Drosophila wing disc epithelium give rise to anisotropic
tissue tension in peripheral/proximal regions of the disc. Such global tissue
tension anisotropy in turn determines the orientation of cell divisions by controlling
epithelial cell elongation.
author:
- first_name: Pedro
full_name: Campinho, Pedro
id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87
last_name: Campinho
orcid: 0000-0002-8526-5416
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Campinho P, Heisenberg C-PJ. The force and effect of cell proliferation. EMBO
Journal. 2013;32(21):2783-2784. doi:10.1038/emboj.2013.225
apa: Campinho, P., & Heisenberg, C.-P. J. (2013). The force and effect of cell
proliferation. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2013.225
chicago: Campinho, Pedro, and Carl-Philipp J Heisenberg. “The Force and Effect of
Cell Proliferation.” EMBO Journal. Wiley-Blackwell, 2013. https://doi.org/10.1038/emboj.2013.225.
ieee: P. Campinho and C.-P. J. Heisenberg, “The force and effect of cell proliferation,”
EMBO Journal, vol. 32, no. 21. Wiley-Blackwell, pp. 2783–2784, 2013.
ista: Campinho P, Heisenberg C-PJ. 2013. The force and effect of cell proliferation.
EMBO Journal. 32(21), 2783–2784.
mla: Campinho, Pedro, and Carl-Philipp J. Heisenberg. “The Force and Effect of Cell
Proliferation.” EMBO Journal, vol. 32, no. 21, Wiley-Blackwell, 2013, pp.
2783–84, doi:10.1038/emboj.2013.225.
short: P. Campinho, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 2783–2784.
date_created: 2018-12-11T11:56:46Z
date_published: 2013-10-04T00:00:00Z
date_updated: 2021-01-12T06:56:32Z
day: '04'
department:
- _id: CaHe
doi: 10.1038/emboj.2013.225
external_id:
pmid:
- '24097062'
intvolume: ' 32'
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3817470/
month: '10'
oa: 1
oa_version: Submitted Version
page: 2783 - 2784
pmid: 1
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4645'
quality_controlled: '1'
scopus_import: 1
status: public
title: The force and effect of cell proliferation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
_id: '2287'
abstract:
- lang: eng
text: Negative frequency-dependent selection should result in equal sex ratios in
large populations of dioecious flowering plants, but deviations from equality
are commonly reported. A variety of ecological and genetic factors can explain
biased sex ratios, although the mechanisms involved are not well understood. Most
dioecious species are long-lived and/or clonal complicating efforts to identify
stages during the life cycle when biases develop. We investigated the demographic
correlates of sex-ratio variation in two chromosome races of Rumex hastatulus,
an annual, wind-pollinated colonizer of open habitats from the southern USA. We
examined sex ratios in 46 populations and evaluated the hypothesis that the proximity
of males in the local mating environment, through its influence on gametophytic
selection, is the primary cause of female-biased sex ratios. Female-biased sex
ratios characterized most populations of R. hastatulus (mean sex ratio = 0.62),
with significant female bias in 89% of populations. Large, high-density populations
had the highest proportion of females, whereas smaller, low-density populations
had sex ratios closer to equality. Progeny sex ratios were more female biased
when males were in closer proximity to females, a result consistent with the gametophytic
selection hypothesis. Our results suggest that interactions between demographic
and genetic factors are probably the main cause of female-biased sex ratios in
R. hastatulus. The annual life cycle of this species may limit the scope for selection
against males and may account for the weaker degree of bias in comparison with
perennial Rumex species.
author:
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: Spencer
full_name: Barrett, Spencer
last_name: Barrett
citation:
ama: Pickup M, Barrett S. The influence of demography and local mating environment
on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution.
2013;3(3):629-639. doi:10.1002/ece3.465
apa: Pickup, M., & Barrett, S. (2013). The influence of demography and local
mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology
and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.465
chicago: Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and
Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.”
Ecology and Evolution. Wiley-Blackwell, 2013. https://doi.org/10.1002/ece3.465.
ieee: M. Pickup and S. Barrett, “The influence of demography and local mating environment
on sex ratios in a wind-pollinated dioecious plant,” Ecology and Evolution,
vol. 3, no. 3. Wiley-Blackwell, pp. 629–639, 2013.
ista: Pickup M, Barrett S. 2013. The influence of demography and local mating environment
on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 3(3),
629–639.
mla: Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local
Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology
and Evolution, vol. 3, no. 3, Wiley-Blackwell, 2013, pp. 629–39, doi:10.1002/ece3.465.
short: M. Pickup, S. Barrett, Ecology and Evolution 3 (2013) 629–639.
date_created: 2018-12-11T11:56:47Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2021-01-12T06:56:32Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1002/ece3.465
file:
- access_level: open_access
checksum: b5531bab4c0dec396bf5c8497fe178bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:35Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5290'
file_name: IST-2016-416-v1+1_Pickup_et_al-2013-Ecology_and_Evolution.pdf
file_size: 626949
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 629 - 639
publication: Ecology and Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4644'
pubrep_id: '416'
quality_controlled: '1'
scopus_import: 1
status: public
title: The influence of demography and local mating environment on sex ratios in a
wind-pollinated dioecious plant
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: 3
year: '2013'
...
---
_id: '2289'
abstract:
- lang: eng
text: Formal verification aims to improve the quality of software by detecting errors
before they do harm. At the basis of formal verification is the logical notion
of correctness, which purports to capture whether or not a program behaves as
desired. We suggest that the boolean partition of software into correct and incorrect
programs falls short of the practical need to assess the behavior of software
in a more nuanced fashion against multiple criteria. We therefore propose to introduce
quantitative fitness measures for programs, specifically for measuring the function,
performance, and robustness of reactive programs such as concurrent processes.
This article describes the goals of the ERC Advanced Investigator Project QUAREM.
The project aims to build and evaluate a theory of quantitative fitness measures
for reactive models. Such a theory must strive to obtain quantitative generalizations
of the paradigms that have been success stories in qualitative reactive modeling,
such as compositionality, property-preserving abstraction and abstraction refinement,
model checking, and synthesis. The theory will be evaluated not only in the context
of software and hardware engineering, but also in the context of systems biology.
In particular, we will use the quantitative reactive models and fitness measures
developed in this project for testing hypotheses about the mechanisms behind data
from biological experiments.
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Henzinger TA. Quantitative reactive modeling and verification. Computer
Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7
apa: Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer
Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7
chicago: Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.”
Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7.
ieee: T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer
Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013.
ista: Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer
Science Research and Development. 28(4), 331–344.
mla: Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer
Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44,
doi:10.1007/s00450-013-0251-7.
short: T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.
date_created: 2018-12-11T11:56:47Z
date_published: 2013-10-05T00:00:00Z
date_updated: 2021-01-12T06:56:33Z
day: '05'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s00450-013-0251-7
ec_funded: 1
file:
- access_level: open_access
checksum: f117a00f9f046165bfa95595681e08a0
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:51Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5308'
file_name: IST-2016-626-v1+1_s00450-013-0251-7.pdf
file_size: 570361
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 331 - 344
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Computer Science Research and Development
publication_status: published
publisher: Springer
publist_id: '4642'
pubrep_id: '626'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative reactive modeling and verification
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: 28
year: '2013'
...
---
_id: '2290'
abstract:
- lang: eng
text: The plant hormone indole-acetic acid (auxin) is essential for many aspects
of plant development. Auxin-mediated growth regulation typically involves the
establishment of an auxin concentration gradient mediated by polarly localized
auxin transporters. The localization of auxin carriers and their amount at the
plasma membrane are controlled by membrane trafficking processes such as secretion,
endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory
pathway mediates the localization of auxin carriers is not well understood. In
this study we have used the differential cell elongation process during apical
hook development to elucidate the mechanisms underlying the post-Golgi trafficking
of auxin carriers in Arabidopsis. We show that differential cell elongation during
apical hook development is defective in Arabidopsis mutant echidna (ech). ECH
protein is required for the trans-Golgi network (TGN)-mediated trafficking of
the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation
only marginally perturbs the trafficking of the highly related auxin influx carrier
LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook
development. Electron tomography reveals that the trafficking defects in ech mutant
are associated with the perturbation of secretory vesicle genesis from the TGN.
Our results identify differential mechanisms for the post-Golgi trafficking of
de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal
how trafficking of auxin influx carriers mediates the control of differential
cell elongation in apical hook development.
author:
- first_name: Yohann
full_name: Boutté, Yohann
last_name: Boutté
- first_name: Kristoffer
full_name: Jonsson, Kristoffer
last_name: Jonsson
- first_name: Heather
full_name: Mcfarlane, Heather
last_name: Mcfarlane
- first_name: Errin
full_name: Johnson, Errin
last_name: Johnson
- first_name: Delphine
full_name: Gendre, Delphine
last_name: Gendre
- first_name: Ranjan
full_name: Swarup, Ranjan
last_name: Swarup
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Lacey
full_name: Samuels, Lacey
last_name: Samuels
- first_name: Stéphanie
full_name: Robert, Stéphanie
last_name: Robert
- first_name: Rishikesh
full_name: Bhalerao, Rishikesh
last_name: Bhalerao
citation:
ama: Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking
of auxin carriers for differential cell elongation. PNAS. 2013;110(40):16259-16264.
doi:10.1073/pnas.1309057110
apa: Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R.,
… Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers
for differential cell elongation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1309057110
chicago: Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine
Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh
Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential
Cell Elongation.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1309057110.
ieee: Y. Boutté et al., “ECHIDNA mediated post Golgi trafficking of auxin
carriers for differential cell elongation,” PNAS, vol. 110, no. 40. National
Academy of Sciences, pp. 16259–16264, 2013.
ista: Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J,
Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking
of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.
mla: Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers
for Differential Cell Elongation.” PNAS, vol. 110, no. 40, National Academy
of Sciences, 2013, pp. 16259–64, doi:10.1073/pnas.1309057110.
short: Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J.
Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.
date_created: 2018-12-11T11:56:48Z
date_published: 2013-10-01T00:00:00Z
date_updated: 2021-01-12T06:56:33Z
day: '01'
department:
- _id: JiFr
doi: 10.1073/pnas.1309057110
external_id:
pmid:
- '24043780'
intvolume: ' 110'
issue: '40'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/
month: '10'
oa: 1
oa_version: Submitted Version
page: 16259 - 16264
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '4639'
quality_controlled: '1'
scopus_import: 1
status: public
title: ECHIDNA mediated post Golgi trafficking of auxin carriers for differential
cell elongation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 110
year: '2013'
...
---
_id: '2291'
abstract:
- lang: eng
text: "Cryptographic access control promises to offer easily distributed trust and
broader applicability, while reducing reliance on low-level online monitors. Traditional
implementations of cryptographic access control rely on simple cryptographic primitives
whereas recent endeavors employ primitives with richer functionality and security
guarantees. Worryingly, few of the existing cryptographic access-control schemes
come with precise guarantees, the gap between the policy specification and the
implementation being analyzed only informally, if at all. In this paper we begin
addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification,
we look at the well-established Role-Based Access Control (RBAC) model, as used
in a typical file system. In short, we provide a precise syntax for a computational
version of RBAC, offer rigorous definitions for cryptographic policy enforcement
of a large class of RBAC security policies, and demonstrate that an implementation
based on attribute-based encryption meets our security notions. We view our main
contribution as being at the conceptual level. Although we work with RBAC for
concreteness, our general methodology could guide future research for uses of
cryptography in other access-control models. \r\n"
author:
- first_name: Anna
full_name: Ferrara, Anna
last_name: Ferrara
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: 'Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In:
IEEE; 2013:115-129. doi:10.1109/CSF.2013.15'
apa: 'Ferrara, A., Fuchsbauer, G., & Warinschi, B. (2013). Cryptographically
enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations,
New Orleans, LA, United States: IEEE. https://doi.org/10.1109/CSF.2013.15'
chicago: Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically
Enforced RBAC,” 115–29. IEEE, 2013. https://doi.org/10.1109/CSF.2013.15.
ieee: 'A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced
RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United
States, 2013, pp. 115–129.'
ista: 'Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC.
CSF: Computer Security Foundations, 115–129.'
mla: Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp.
115–29, doi:10.1109/CSF.2013.15.
short: A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.
conference:
end_date: 2013-09-28
location: New Orleans, LA, United States
name: 'CSF: Computer Security Foundations'
start_date: 2013-09-26
date_created: 2018-12-11T11:56:48Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2021-01-12T06:56:34Z
day: '01'
department:
- _id: KrPi
doi: 10.1109/CSF.2013.15
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2013/492
month: '09'
oa: 1
oa_version: Submitted Version
page: 115 - 129
publication_status: published
publisher: IEEE
publist_id: '4637'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cryptographically enforced RBAC
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2293'
abstract:
- lang: eng
text: Many computer vision problems have an asymmetric distribution of information
between training and test time. In this work, we study the case where we are given
additional information about the training data, which however will not be available
at test time. This situation is called learning using privileged information (LUPI).
We introduce two maximum-margin techniques that are able to make use of this additional
source of information, and we show that the framework is applicable to several
scenarios that have been studied in computer vision before. Experiments with attributes,
bounding boxes, image tags and rationales as additional information in object
classification show promising results.
author:
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information.
In: IEEE; 2013:825-832. doi:10.1109/ICCV.2013.107'
apa: 'Sharmanska, V., Quadrianto, N., & Lampert, C. (2013). Learning to rank
using privileged information (pp. 825–832). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.107'
chicago: Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning
to Rank Using Privileged Information,” 825–32. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.107.
ieee: 'V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged
information,” presented at the ICCV: International Conference on Computer Vision,
Sydney, Australia, 2013, pp. 825–832.'
ista: 'Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged
information. ICCV: International Conference on Computer Vision, 825–832.'
mla: Sharmanska, Viktoriia, et al. Learning to Rank Using Privileged Information.
IEEE, 2013, pp. 825–32, doi:10.1109/ICCV.2013.107.
short: V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:49Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2023-02-23T10:36:41Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/ICCV.2013.107
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf
month: '12'
oa: 1
oa_version: Submitted Version
page: 825 - 832
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: IEEE
publist_id: '4635'
quality_controlled: '1'
scopus_import: 1
status: public
title: Learning to rank using privileged information
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2294'
abstract:
- lang: eng
text: "In this work we propose a system for automatic classification of Drosophila
embryos into developmental stages.\r\nWhile the system is designed to solve an
actual problem in biological research, we believe that the principle underly-\r\ning
it is interesting not only for biologists, but also for researchers in computer
vision. The main idea is to combine two orthogonal sources of information: one
is a classifier trained on strongly invariant features, which makes it applicable
to images of very different conditions, but also leads to rather noisy predictions.
The other is a label propagation step based on a more powerful similarity measure
that however is only consistent within specific subsets of the data at a time.\r\nIn
our biological setup, the information sources are the shape and the staining patterns
of embryo images. We show\r\nexperimentally that while neither of the methods
\ can be used by itself to achieve satisfactory results, their combina-\r\ntion
achieves prediction quality comparable to human performance."
author:
- first_name: Tomas
full_name: Kazmar, Tomas
last_name: Kazmar
- first_name: Evgeny
full_name: Kvon, Evgeny
last_name: Kvon
- first_name: Alexander
full_name: Stark, Alexander
last_name: Stark
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using
Label Propagation. In: IEEE; 2013. doi:10.1109/ICCV.2013.139'
apa: 'Kazmar, T., Kvon, E., Stark, A., & Lampert, C. (2013). Drosophila Embryo
Stage Annotation using Label Propagation. Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.139'
chicago: Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila
Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. https://doi.org/10.1109/ICCV.2013.139.
ieee: 'T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation
using Label Propagation,” presented at the ICCV: International Conference on Computer
Vision, Sydney, Australia, 2013.'
ista: 'Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation
using Label Propagation. ICCV: International Conference on Computer Vision.'
mla: Kazmar, Tomas, et al. Drosophila Embryo Stage Annotation Using Label Propagation.
IEEE, 2013, doi:10.1109/ICCV.2013.139.
short: T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:49Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2021-01-12T06:56:35Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/ICCV.2013.139
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.cv-foundation.org/openaccess/ICCV2013.py
month: '12'
oa: 1
oa_version: Submitted Version
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: IEEE
publist_id: '4634'
quality_controlled: '1'
scopus_import: 1
status: public
title: Drosophila Embryo Stage Annotation using Label Propagation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '2295'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs) with ω-regular
conditions specified as parity objectives. The qualitative analysis problem given
a POMDP and a parity objective asks whether there is a strategy to ensure that
the objective is satisfied with probability 1 (resp. positive probability). While
the qualitative analysis problems are known to be undecidable even for very special
cases of parity objectives, we establish decidability (with optimal EXPTIME-complete
complexity) of the qualitative analysis problems for POMDPs with all parity objectives
under finite-memory strategies. We also establish asymptotically optimal (exponential)
memory bounds.
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable
Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:10.4230/LIPIcs.CSL.2013.165
apa: 'Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about
partially observable Markov decision processes with omega-regular objectives.
Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165'
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable
about Partially Observable Markov Decision Processes with Omega-Regular Objectives.”
Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.165.
ieee: K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially
observable Markov decision processes with omega-regular objectives,” vol. 23.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
ista: Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially
observable Markov decision processes with omega-regular objectives. 23, 165–180.
mla: Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable
Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.
short: K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
conference:
end_date: 2013-09-05
location: Torino, Italy
name: 'CSL: Computer Science Logic'
start_date: 2013-09-02
date_created: 2018-12-11T11:56:50Z
date_published: 2013-08-27T00:00:00Z
date_updated: 2023-02-23T12:24:38Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CSL.2013.165
ec_funded: 1
file:
- access_level: open_access
checksum: ba2828322955574d9283bea0e17a37a6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:42Z
date_updated: 2020-07-14T12:45:37Z
file_id: '4766'
file_name: IST-2017-756-v1+1_2.pdf
file_size: 345171
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 23'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 165 - 180
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4633'
pubrep_id: '756'
quality_controlled: '1'
related_material:
record:
- id: '1477'
relation: later_version
status: public
- id: '5400'
relation: earlier_version
status: public
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: What is decidable about partially observable Markov decision processes with
omega-regular objectives
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: 23
year: '2013'
...
---
_id: '2297'
abstract:
- lang: eng
text: We present an overview of mathematical results on the low temperature properties
of dilute quantum gases, which have been obtained in the past few years. The presentation
includes a discussion of Bose-Einstein condensation, the excitation spectrum for
trapped gases and its relation to superfluidity, as well as the appearance of
quantized vortices in rotating systems. All these properties are intensely being
studied in current experiments on cold atomic gases. We will give a description
of the mathematics involved in understanding these phenomena, starting from the
underlying many-body Schrödinger equation.
arxiv: 1
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Seiringer R. Hot topics in cold gases: A mathematical physics perspective.
Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5'
apa: 'Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective.
Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5'
chicago: 'Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.”
Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.'
ieee: 'R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,”
Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232,
2013.'
ista: 'Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective.
Japanese Journal of Mathematics. 8(2), 185–232.'
mla: 'Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.”
Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232,
doi:10.1007/s11537-013-1264-5.'
short: R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.
date_created: 2018-12-11T11:56:50Z
date_published: 2013-09-24T00:00:00Z
date_updated: 2021-01-12T06:56:36Z
day: '24'
department:
- _id: RoSe
doi: 10.1007/s11537-013-1264-5
external_id:
arxiv:
- '0908.3686'
intvolume: ' 8'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0908.3686
month: '09'
oa: 1
oa_version: Preprint
page: 185 - 232
publication: Japanese Journal of Mathematics
publication_status: published
publisher: Springer
publist_id: '4631'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Hot topics in cold gases: A mathematical physics perspective'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2013'
...