---
_id: '2917'
abstract:
- lang: eng
text: 'The search for extra-terrestrial intelligence (SETI) has been performed principally
as a one-way survey, listening of radio frequencies across the Milky Way and other
galaxies. However, scientists have engaged in an active messaging only rarely.
This suggests the simple rationale that if other civilizations exist and take
a similar approach to ours, namely listening but not broadcasting, the result
is a silent universe. A simple game theoretical model, the prisoner''s dilemma,
explains this situation: each player (civilization) can passively search (defect),
or actively search and broadcast (cooperate). In order to maximize the payoff
(or, equivalently, minimize the risks) the best strategy is not to broadcast.
In fact, the active search has been opposed on the basis that it might be dangerous
to expose ourselves. However, most of these ideas have not been based on objective
arguments, and ignore accounting of the possible gains and losses. Thus, the question
stands: should we perform an active search? I develop a game-theoretical framework
where civilizations can be of different types, and explicitly apply it to a situation
where societies are either interested in establishing a two-way communication
or belligerent and in urge to exploit ours. The framework gives a quantitative
solution (a mixed-strategy), which is how frequent we should perform the active
SETI. This frequency is roughly proportional to the inverse of the risk, and can
be extremely small. However, given the immense amount of stars being scanned,
it supports active SETI. The model is compared with simulations, and the possible
actions are evaluated through the San Marino scale, measuring the risks of messaging.'
author:
- first_name: Harold
full_name: Vladar, Harold
id: 2A181218-F248-11E8-B48F-1D18A9856A87
last_name: Vladar
orcid: 0000-0002-5985-7653
citation:
ama: de Vladar H. The game of active search for extra terrestrial intelligence Breaking
the Great Silence . International Journal of Astrobiology. 2012;12(1):53-62.
doi:10.1017/S1473550412000407
apa: de Vladar, H. (2012). The game of active search for extra terrestrial intelligence
Breaking the Great Silence . International Journal of Astrobiology. Cambridge
University Press. https://doi.org/10.1017/S1473550412000407
chicago: Vladar, Harold de. “The Game of Active Search for Extra Terrestrial Intelligence
Breaking the Great Silence .” International Journal of Astrobiology. Cambridge
University Press, 2012. https://doi.org/10.1017/S1473550412000407.
ieee: H. de Vladar, “The game of active search for extra terrestrial intelligence
Breaking the Great Silence ,” International Journal of Astrobiology, vol.
12, no. 1. Cambridge University Press, pp. 53–62, 2012.
ista: de Vladar H. 2012. The game of active search for extra terrestrial intelligence
Breaking the Great Silence . International Journal of Astrobiology. 12(1), 53–62.
mla: de Vladar, Harold. “The Game of Active Search for Extra Terrestrial Intelligence
Breaking the Great Silence .” International Journal of Astrobiology, vol.
12, no. 1, Cambridge University Press, 2012, pp. 53–62, doi:10.1017/S1473550412000407.
short: H. de Vladar, International Journal of Astrobiology 12 (2012) 53–62.
date_created: 2018-12-11T12:00:19Z
date_published: 2012-11-06T00:00:00Z
date_updated: 2021-01-12T07:00:41Z
day: '06'
department:
- _id: NiBa
doi: 10.1017/S1473550412000407
intvolume: ' 12'
issue: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 53 - 62
publication: International Journal of Astrobiology
publication_status: published
publisher: Cambridge University Press
publist_id: '3821'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The game of active search for extra terrestrial intelligence Breaking the
Great Silence '
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2012'
...
---
_id: '2928'
abstract:
- lang: eng
text: ' This paper addresses the problem of approximate MAP-MRF inference in
general graphical models. Following [36], we consider a family of linear programming
relaxations of the problem where each relaxation is specified by a set of nested
pairs of factors for which the marginalization constraint needs to be enforced.
We develop a generalization of the TRW-S algorithm [9] for this problem, where
we use a decomposition into junction chains, monotonic w.r.t. some ordering on
the nodes. This generalizes the monotonic chains in [9] in a natural way. We also
show how to deal with nested factors in an efficient way. Experiments show an
improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on
a number of computer vision and natural language processing problems. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thomas
full_name: Schoenemann, Thomas
last_name: Schoenemann
citation:
ama: Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message
passing. arXiv. 2012.
apa: Kolmogorov, V., & Schoenemann, T. (2012). Generalized sequential tree-reweighted
message passing. arXiv. ArXiv.
chicago: Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted
Message Passing.” ArXiv. ArXiv, 2012.
ieee: V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted
message passing,” arXiv. ArXiv, 2012.
ista: Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted
message passing. arXiv, .
mla: Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted
Message Passing.” ArXiv, ArXiv, 2012.
short: V. Kolmogorov, T. Schoenemann, ArXiv (2012).
date_created: 2018-12-11T12:00:23Z
date_published: 2012-05-29T00:00:00Z
date_updated: 2021-01-12T07:00:45Z
day: '29'
department:
- _id: VlKo
external_id:
arxiv:
- '1205.6352'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1205.6352
month: '05'
oa: 1
oa_version: Preprint
page: '16'
publication: arXiv
publication_status: published
publisher: ArXiv
publist_id: '3809'
status: public
title: Generalized sequential tree-reweighted message passing
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2930'
abstract:
- lang: eng
text: "In this paper we investigate k-submodular functions. This natural family
of discrete functions includes submodular and bisubmodular functions as the special
cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known
Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts
that the minimum of the (bi)submodular function can be found by solving a maximization
problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron,
prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm
to construct the vertices of the polyhedron.\r\n"
acknowledgement: "We would like to thank Andrei Krokhin for encourag- ing our cooperation,
for helpful discussions, and for his critical reading of the manuscript.\r\n"
alternative_title:
- LNCS
author:
- first_name: Anna
full_name: Huber, Anna
last_name: Huber
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol
7422. Springer; 2012:451-462. doi:10.1007/978-3-642-32147-4_40'
apa: 'Huber, A., & Kolmogorov, V. (2012). Towards minimizing k-submodular functions
(Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial
Optimization, Athens, Greece: Springer. https://doi.org/10.1007/978-3-642-32147-4_40'
chicago: Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular
Functions,” 7422:451–62. Springer, 2012. https://doi.org/10.1007/978-3-642-32147-4_40.
ieee: 'A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,”
presented at the ISCO: International Symposium on Combinatorial Optimization,
Athens, Greece, 2012, vol. 7422, pp. 451–462.'
ista: 'Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO:
International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.'
mla: Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions.
Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
short: A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.
conference:
end_date: 2012-04-21
location: Athens, Greece
name: 'ISCO: International Symposium on Combinatorial Optimization'
start_date: 2012-04-19
date_created: 2018-12-11T12:00:24Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2021-01-12T07:00:46Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-642-32147-4_40
intvolume: ' 7422'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5469
month: '04'
oa: 1
oa_version: Preprint
page: 451 - 462
publication_status: published
publisher: Springer
publist_id: '3806'
quality_controlled: '1'
scopus_import: 1
status: public
title: Towards minimizing k-submodular functions
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7422
year: '2012'
...
---
_id: '2931'
abstract:
- lang: eng
text: "In this paper, we present a new approach for establishing correspondences
between sparse image features related by an unknown nonrigid mapping and corrupted
by clutter and occlusion, such as points extracted from images of different instances
of the same object category. We formulate this matching task as an energy minimization
problem by defining an elaborate objective function of the appearance and the
spatial arrangement of the features. Optimization of this energy is an instance
of graph matching, which is in general an NP-hard problem. We describe a novel
graph matching optimization technique, which we refer to as dual decomposition
(DD), and demonstrate on a variety of examples that this method outperforms existing
graph matching algorithms. In the majority of our examples, DD is able to find
the global minimum within a minute. The ability to globally optimize the objective
allows us to accurately learn the parameters of our matching model from training
examples. We show on several matching tasks that our learned model yields results
superior to those of state-of-the-art methods.\r\n"
acknowledgement: This research was funded in part by Microsoft Research.
author:
- first_name: Lorenzo
full_name: Torresani, Lorenzo
last_name: Torresani
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature
correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence.
2012;35(2):259-271. doi:10.1109/TPAMI.2012.105
apa: Torresani, L., Kolmogorov, V., & Rother, C. (2012). A dual decomposition
approach to feature correspondence. IEEE Transactions on Pattern Analysis and
Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2012.105
chicago: Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition
Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis
and Machine Intelligence. IEEE, 2012. https://doi.org/10.1109/TPAMI.2012.105.
ieee: L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach
to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine
Intelligence, vol. 35, no. 2. IEEE, pp. 259–271, 2012.
ista: Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to
feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence.
35(2), 259–271.
mla: Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35,
no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105.
short: L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis
and Machine Intelligence 35 (2012) 259–271.
date_created: 2018-12-11T12:00:24Z
date_published: 2012-05-08T00:00:00Z
date_updated: 2021-01-12T07:00:46Z
day: '08'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2012.105
intvolume: ' 35'
issue: '2'
language:
- iso: eng
month: '05'
oa_version: None
page: 259 - 271
project:
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3805'
quality_controlled: '1'
scopus_import: 1
status: public
title: A dual decomposition approach to feature correspondence
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2012'
...
---
_id: '2936'
abstract:
- lang: eng
text: The notion of delays arises naturally in many computational models, such as,
in the design of circuits, control systems, and dataflow languages. In this work,
we introduce automata with delay blocks (ADBs), extending finite state automata
with variable time delay blocks, for deferring individual transition output symbols,
in a discrete-time setting. We show that the ADB languages strictly subsume the
regular languages, and are incomparable in expressive power to the context-free
languages. We show that ADBs are closed under union, concatenation and Kleene
star, and under intersection with regular languages, but not closed under complementation
and intersection with other ADB languages. We show that the emptiness and the
membership problems are decidable in polynomial time for ADBs, whereas the universality
problem is undecidable. Finally we consider the linear-time model checking problem,
i.e., whether the language of an ADB is contained in a regular language, and show
that the model checking problem is PSPACE-complete. Copyright 2012 ACM.
acknowledgement: 'This work has been financially supported in part by the European
Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract
# 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008
(Modeling and control of Networked vehicle systems in persistent autonomous operations);
by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic
Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start
grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant
QUAREM; and FWF Grant No S11403-N23 (RiSE).'
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: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks.
In: Roceedings of the Tenth ACM International Conference on Embedded Software.
ACM; 2012:43-52. doi:10.1145/2380356.2380370'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata
with time delay blocks. In roceedings of the tenth ACM international conference
on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite
Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International
Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.
ieee: K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time
delay blocks,” in roceedings of the tenth ACM international conference on Embedded
software, Tampere, Finland, 2012, pp. 43–52.
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay
blocks. roceedings of the tenth ACM international conference on Embedded software.
EMSOFT: Embedded Software , 43–52.'
mla: Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012,
pp. 43–52, doi:10.1145/2380356.2380370.
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM
International Conference on Embedded Software, ACM, 2012, pp. 43–52.
conference:
end_date: 2012-10-12
location: Tampere, Finland
name: 'EMSOFT: Embedded Software '
start_date: 2012-10-07
date_created: 2018-12-11T12:00:26Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2380356.2380370
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.7019
month: '10'
oa: 1
oa_version: Preprint
page: 43 - 52
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: roceedings of the tenth ACM international conference on Embedded software
publication_status: published
publisher: ACM
publist_id: '3799'
quality_controlled: '1'
scopus_import: 1
status: public
title: Finite automata with time delay blocks
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2937'
abstract:
- lang: eng
text: Developers building cryptography into security-sensitive applications face
a daunting task. Not only must they understand the security guarantees delivered
by the constructions they choose, they must also implement and combine them correctly
and efficiently. Cryptographic compilers free developers from this task by turning
high-level specifications of security goals into efficient implementations. Yet,
trusting such tools is hard as they rely on complex mathematical machinery and
claim security properties that are subtle and difficult to verify. In this paper
we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented
level of assurance without sacrificing practicality for a comprehensive class
of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline
of ZKCrypt integrates purpose-built verified compilers and verifying compilers
producing formal proofs in the CertiCrypt framework. By combining the guarantees
delivered by each stage, ZKCrypt provides assurance that the output implementation
securely realizes the abstract proof goal given as input. We report on the main
characteristics of ZKCrypt, highlight new definitions and concepts at its foundations,
and illustrate its applicability through a representative example of an anonymous
credential system.
acknowledgement: This work was partially funded by National Funds through the FCT
- Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and
Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant
agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT,
Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project
S2009TIC-1465 PROMETIDOS.
author:
- first_name: José
full_name: Almeida, José
last_name: Almeida
- first_name: Manuel
full_name: Barbosa, Manuel
last_name: Barbosa
- first_name: Endre
full_name: Bangerter, Endre
last_name: Bangerter
- first_name: Gilles
full_name: Barthe, Gilles
last_name: Barthe
- first_name: Stephan
full_name: Krenn, Stephan
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Santiago
full_name: Béguelin, Santiago
last_name: Béguelin
citation:
ama: 'Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof
cryptography: Verifiable compilation of efficient zero-knowledge protocols. In:
Proceedings of the 2012 ACM Conference on Computer and Communications Security.
ACM; 2012:488-500. doi:10.1145/2382196.2382249'
apa: 'Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., & Béguelin,
S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge
protocols. In Proceedings of the 2012 ACM conference on Computer and communications
security (pp. 488–500). Raleigh, NC, USA: ACM. https://doi.org/10.1145/2382196.2382249'
chicago: 'Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan
Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation
of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference
on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.'
ieee: 'J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin,
“Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,”
in Proceedings of the 2012 ACM conference on Computer and communications security,
Raleigh, NC, USA, 2012, pp. 488–500.'
ista: 'Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full
proof cryptography: Verifiable compilation of efficient zero-knowledge protocols.
Proceedings of the 2012 ACM conference on Computer and communications security.
CCS: Computer and Communications Security, 488–500.'
mla: 'Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of
Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference
on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.'
short: J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:,
Proceedings of the 2012 ACM Conference on Computer and Communications Security,
ACM, 2012, pp. 488–500.
conference:
end_date: 2012-10-18
location: Raleigh, NC, USA
name: 'CCS: Computer and Communications Security'
start_date: 2012-10-16
date_created: 2018-12-11T12:00:26Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/2382196.2382249
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2012/258
month: '10'
oa: 1
oa_version: Submitted Version
page: 488 - 500
publication: Proceedings of the 2012 ACM conference on Computer and communications
security
publication_status: published
publisher: ACM
publist_id: '3798'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Full proof cryptography: Verifiable compilation of efficient zero-knowledge
protocols'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2938'
abstract:
- lang: eng
text: 'Social insects have a very high potential to become invasive pest species.
Here, we explore how their social lifestyle and their interaction with parasites
may contribute to this invasive success. Similar to solitary species, parasite
release followed by the evolution of increased competitive ability can promote
establishment of introduced social insect hosts in their introduced range. Genetic
bottlenecks during introduction of low numbers of founder individuals decrease
the genetic diversity at three levels: the population, the colony and the individual,
with the colony level being specific to social insects. Reduced genetic diversity
can affect both the individual immune system and the collective colony-level disease
defences (social immunity). Still, the dual immune system is likely to make social
insects more robust to parasite attack. Changes in social structure from small,
family-based, territorially aggressive societies in native populations towards
huge networks of cooperating nests (unicoloniality) occur in some invasive social
insects, for example, most invasive ants and some termites. Unicoloniality is
likely to affect disease dynamics in multiple ways. The free exchange of individuals
within the population leads to an increased genetic heterogeneity among individuals
of a single nest, thereby decreasing disease transmission. However, the multitude
of reproductively active queens per colony buffers the effect of individual diseased
queens and their offspring, which may result in a higher level of vertical disease
transmission in unicolonial societies. Lastly, unicoloniality provides a competitive
advantage over native species, allowing them to quickly become the dominant species
in the habitat, which in turn selects for parasite adaptation to this common host
genotype and thus eventually a high parasite pressure. Overall, invasions by insect
societies are characterized by general features applying to all introduced species,
as well as idiosyncrasies that emerge from their social lifestyle. It is important
to study these effects in concert to be able to develop efficient management and
biocontrol strategies. © 2012 British Ecological Society.'
acknowledgement: We thank Mark Brown, Christopher Pull, Meghan L. Vyleta, Miriam Stock,
Barbara Casillas-Perez and three anonymous reviewers for valuable comments on the
manuscript and Eva Sixt for ant drawings. Funding was obtained from the German Science
Foundation (DFG, by an Individual Research Grant to S.C.) and the European Research
Council (ERC, by an ERC-Starting Grant to SC and an Individual Marie Curie EIF fellowship
to L.desU.). The authors declare no conflict of interests.
author:
- 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: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Ugelvig LV, Cremer S. Effects of social immunity and unicoloniality on host
parasite interactions in invasive insect societies. Functional Ecology.
2012;26(6):1300-1312. doi:10.1111/1365-2435.12013
apa: Ugelvig, L. V., & Cremer, S. (2012). Effects of social immunity and unicoloniality
on host parasite interactions in invasive insect societies. Functional Ecology.
Wiley-Blackwell. https://doi.org/10.1111/1365-2435.12013
chicago: Ugelvig, Line V, and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality
on Host Parasite Interactions in Invasive Insect Societies.” Functional Ecology.
Wiley-Blackwell, 2012. https://doi.org/10.1111/1365-2435.12013.
ieee: L. V. Ugelvig and S. Cremer, “Effects of social immunity and unicoloniality
on host parasite interactions in invasive insect societies,” Functional Ecology,
vol. 26, no. 6. Wiley-Blackwell, pp. 1300–1312, 2012.
ista: Ugelvig LV, Cremer S. 2012. Effects of social immunity and unicoloniality
on host parasite interactions in invasive insect societies. Functional Ecology.
26(6), 1300–1312.
mla: Ugelvig, Line V., and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality
on Host Parasite Interactions in Invasive Insect Societies.” Functional Ecology,
vol. 26, no. 6, Wiley-Blackwell, 2012, pp. 1300–12, doi:10.1111/1365-2435.12013.
short: L.V. Ugelvig, S. Cremer, Functional Ecology 26 (2012) 1300–1312.
date_created: 2018-12-11T12:00:27Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:39:54Z
day: '01'
department:
- _id: SyCr
doi: 10.1111/1365-2435.12013
intvolume: ' 26'
issue: '6'
language:
- iso: eng
month: '01'
oa_version: None
page: 1300 - 1312
publication: Functional Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3797'
quality_controlled: '1'
scopus_import: 1
status: public
title: Effects of social immunity and unicoloniality on host parasite interactions
in invasive insect societies
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2012'
...
---
_id: '2941'
author:
- first_name: Nikolai
full_name: Dolbilin, Nikolai
last_name: Dolbilin
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Oleg
full_name: Musin, Oleg
last_name: Musin
citation:
ama: Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over
triangulations of Delaunay sets. Russian Mathematical Surveys. 2012;67(4):781-783.
doi:10.1070/RM2012v067n04ABEH004807
apa: Dolbilin, N., Edelsbrunner, H., & Musin, O. (2012). On the optimality of
functionals over triangulations of Delaunay sets. Russian Mathematical Surveys.
IOP Publishing. https://doi.org/10.1070/RM2012v067n04ABEH004807
chicago: Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality
of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical
Surveys. IOP Publishing, 2012. https://doi.org/10.1070/RM2012v067n04ABEH004807.
ieee: N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals
over triangulations of Delaunay sets,” Russian Mathematical Surveys, vol.
67, no. 4. IOP Publishing, pp. 781–783, 2012.
ista: Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals
over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.
mla: Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations
of Delaunay Sets.” Russian Mathematical Surveys, vol. 67, no. 4, IOP Publishing,
2012, pp. 781–83, doi:10.1070/RM2012v067n04ABEH004807.
short: N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012)
781–783.
date_created: 2018-12-11T12:00:28Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:39:55Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1070/RM2012v067n04ABEH004807
file:
- access_level: open_access
checksum: 389a5ae53d6347de36c3468034f2821d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:49Z
date_updated: 2020-07-14T12:45:55Z
file_id: '5239'
file_name: IST-2013-132-v1+1_2012-J-04-Functional-E.pdf
file_size: 253816
relation: main_file
file_date_updated: 2020-07-14T12:45:55Z
has_accepted_license: '1'
intvolume: ' 67'
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 781 - 783
publication: Russian Mathematical Surveys
publication_status: published
publisher: IOP Publishing
publist_id: '3792'
pubrep_id: '132'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the optimality of functionals over triangulations of Delaunay sets
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2012'
...
---
_id: '2942'
abstract:
- lang: eng
text: Interface theories provide a formal framework for component-based development
of software and hardware which supports the incremental design of systems and
the independent implementability of components. These capabilities are ensured
through mathematical properties of the parallel composition operator and the refinement
relation for components. More recently, a conjunction operation was added to interface
theories in order to provide support for handling multiple viewpoints, requirements
engineering, and component reuse. Unfortunately, the conjunction operator does
not allow independent implementability in general. In this paper, we study conditions
that need to be imposed on interface models in order to enforce independent implementability
with respect to conjunction. We focus on multiple viewpoint specifications and
propose a new compatibility criterion between two interfaces, which we call orthogonality.
We show that orthogonal interfaces can be refined separately, while preserving
both orthogonality and composability with other interfaces. We illustrate the
independent implementability of different viewpoints with a FIFO buffer example.
acknowledgement: ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), FWF National
Research Network RISE (Rigorous Systems Engineering)
alternative_title:
- LNCS
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Henzinger TA, Nickovic D. Independent implementability of viewpoints. In:
Conference Proceedings Monterey Workshop 2012. Vol 7539. Springer; 2012:380-395.
doi:10.1007/978-3-642-34059-8_20'
apa: 'Henzinger, T. A., & Nickovic, D. (2012). Independent implementability
of viewpoints. In Conference proceedings Monterey Workshop 2012 (Vol.
7539, pp. 380–395). Oxford, UK: Springer. https://doi.org/10.1007/978-3-642-34059-8_20'
chicago: Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability
of Viewpoints.” In Conference Proceedings Monterey Workshop 2012, 7539:380–95.
Springer, 2012. https://doi.org/10.1007/978-3-642-34059-8_20.
ieee: T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,”
in Conference proceedings Monterey Workshop 2012, Oxford, UK, 2012, vol.
7539, pp. 380–395.
ista: Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints. Conference
proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.
mla: Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of
Viewpoints.” Conference Proceedings Monterey Workshop 2012, vol. 7539,
Springer, 2012, pp. 380–95, doi:10.1007/978-3-642-34059-8_20.
short: T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop
2012, Springer, 2012, pp. 380–395.
conference:
end_date: 2012-03-21
location: Oxford, UK
name: Monterey Workshop 2012
start_date: 2012-03-19
date_created: 2018-12-11T12:00:28Z
date_published: 2012-09-16T00:00:00Z
date_updated: 2021-01-12T07:39:56Z
day: '16'
department:
- _id: ToHe
doi: 10.1007/978-3-642-34059-8_20
ec_funded: 1
intvolume: ' 7539'
language:
- iso: eng
month: '09'
oa_version: None
page: 380 - 395
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: ' Conference proceedings Monterey Workshop 2012'
publication_status: published
publisher: Springer
publist_id: '3791'
quality_controlled: '1'
scopus_import: 1
status: public
title: Independent implementability of viewpoints
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7539
year: '2012'
...
---
_id: '2943'
abstract:
- lang: eng
text: We examine whether the Escherichia coli chromosome is folded into a self-adherent
nucleoprotein complex, or alternately is a confined but otherwise unconstrained
self-avoiding polymer. We address this through in vivo visualization, using an
inducible GFP fusion to the nucleoid-associated protein Fis to non-specifically
decorate the entire chromosome. For a range of different growth conditions, the
chromosome is a compact structure that does not fill the volume of the cell, and
which moves from the new pole to the cell centre. During rapid growth, chromosome
segregation occurs well before cell division, with daughter chromosomes coupled
by a thin inter-daughter filament before complete segregation, whereas during
slow growth chromosomes stay adjacent until cell division occurs. Image correlation
analysis indicates that sub-nucleoid structure is stable on a 1min timescale,
comparable to the timescale for redistribution time measured for GFP-Fis after
photobleaching. Optical deconvolution and writhe calculation analysis indicate
that the nucleoid has a large-scale coiled organization rather than being an amorphous
mass. Our observations are consistent with the chromosome having a self-adherent
filament organization.
acknowledgement: We thank Professor Philippe Cluzel and Mr Lance Min for providing
advice and materials. Jeannette Chau provided technical support. Work at NU was
supported by NSF Grants DMR-0715099, MCB-1022117, DMR-1206868, DMR-0520513 and DMR-1121262
(NU-MRSEC), by NIH-NCI Grant U54CA143869-01 (NU-PS-OC) and by the Chicago Biomedical
Consortium with support from the Searle Funds at the Chicago Community Trust. Work
at UCLA was supported by NIH Grant GM038509.
author:
- first_name: Nastaran
full_name: Hadizadeh Yazdi, Nastaran
last_name: Hadizadeh Yazdi
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Reid
full_name: Johnson, Reid
last_name: Johnson
- first_name: John
full_name: Marko, John
last_name: Marko
citation:
ama: Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. Variation of the folding and
dynamics of the Escherichia coli chromosome with growth conditions. Molecular
Microbiology. 2012;86(6):1318-1333. doi:10.1111/mmi.12071
apa: Hadizadeh Yazdi, N., Guet, C. C., Johnson, R., & Marko, J. (2012). Variation
of the folding and dynamics of the Escherichia coli chromosome with growth conditions.
Molecular Microbiology. Wiley-Blackwell. https://doi.org/10.1111/mmi.12071
chicago: Hadizadeh Yazdi, Nastaran, Calin C Guet, Reid Johnson, and John Marko.
“Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with
Growth Conditions.” Molecular Microbiology. Wiley-Blackwell, 2012. https://doi.org/10.1111/mmi.12071.
ieee: N. Hadizadeh Yazdi, C. C. Guet, R. Johnson, and J. Marko, “Variation of the
folding and dynamics of the Escherichia coli chromosome with growth conditions,”
Molecular Microbiology, vol. 86, no. 6. Wiley-Blackwell, pp. 1318–1333,
2012.
ista: Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. 2012. Variation of the folding
and dynamics of the Escherichia coli chromosome with growth conditions. Molecular
Microbiology. 86(6), 1318–1333.
mla: Hadizadeh Yazdi, Nastaran, et al. “Variation of the Folding and Dynamics of
the Escherichia Coli Chromosome with Growth Conditions.” Molecular Microbiology,
vol. 86, no. 6, Wiley-Blackwell, 2012, pp. 1318–33, doi:10.1111/mmi.12071.
short: N. Hadizadeh Yazdi, C.C. Guet, R. Johnson, J. Marko, Molecular Microbiology
86 (2012) 1318–1333.
date_created: 2018-12-11T12:00:28Z
date_published: 2012-11-09T00:00:00Z
date_updated: 2021-01-12T07:39:56Z
day: '09'
department:
- _id: CaGu
doi: 10.1111/mmi.12071
intvolume: ' 86'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://europepmc.org/articles/pmc3524407
month: '11'
oa: 1
oa_version: Submitted Version
page: 1318 - 1333
publication: Molecular Microbiology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3790'
quality_controlled: '1'
scopus_import: 1
status: public
title: Variation of the folding and dynamics of the Escherichia coli chromosome with
growth conditions
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 86
year: '2012'
...
---
_id: '2945'
abstract:
- lang: eng
text: In search of foreign antigens, lymphocytes recirculate from the blood, through
lymph nodes, into lymphatics and back to the blood. Dendritic cells also migrate
to lymph nodes for optimal interaction with lymphocytes. This continuous trafficking
of immune cells into and out of lymph nodes is essential for immune surveillance
of foreign invaders. In this article, we review our current understanding of the
functions of high endothelial venules (HEVs), stroma and lymphatics in the entry,
positioning and exit of immune cells in lymph nodes during homeostasis, and we
highlight the unexpected role of dendritic cells in the control of lymphocyte
homing through HEVs.
acknowledgement: We thank M. Sixt and A. Peixoto for helpful comments on the manuscript.
Work in the laboratory of J.-P.G. is supported by grants from Fondation ARC pour
la Recherche sur le Cancer, Agence Nationale de la Recherche (ANR), Institut National
du Cancer (INCA), Fondation RITC and Région Midi-Pyrénées. Research by R.F. is supported
by Deutsche Forschungsgemeinschaft (DFG) grants SFB621-A1, SFB738-B5, SFB587-B3,
SFB900-B1 and KFO 250-FO 334/2-1. We regret that, owing to space limitations, we
could not always quote the work of colleagues who have contributed to the field.
author:
- first_name: Jean
full_name: Girard, Jean
last_name: Girard
- first_name: Christine
full_name: Moussion, Christine
id: 3356F664-F248-11E8-B48F-1D18A9856A87
last_name: Moussion
- first_name: Reinhold
full_name: Förster, Reinhold
last_name: Förster
citation:
ama: Girard J, Moussion C, Förster R. HEVs, lymphatics and homeostatic immune cell
trafficking in lymph nodes. Nature Reviews Immunology. 2012;12(11):762-773.
doi:10.1038/nri3298
apa: Girard, J., Moussion, C., & Förster, R. (2012). HEVs, lymphatics and homeostatic
immune cell trafficking in lymph nodes. Nature Reviews Immunology. Nature
Publishing Group. https://doi.org/10.1038/nri3298
chicago: Girard, Jean, Christine Moussion, and Reinhold Förster. “HEVs, Lymphatics
and Homeostatic Immune Cell Trafficking in Lymph Nodes.” Nature Reviews Immunology.
Nature Publishing Group, 2012. https://doi.org/10.1038/nri3298.
ieee: J. Girard, C. Moussion, and R. Förster, “HEVs, lymphatics and homeostatic
immune cell trafficking in lymph nodes,” Nature Reviews Immunology, vol.
12, no. 11. Nature Publishing Group, pp. 762–773, 2012.
ista: Girard J, Moussion C, Förster R. 2012. HEVs, lymphatics and homeostatic immune
cell trafficking in lymph nodes. Nature Reviews Immunology. 12(11), 762–773.
mla: Girard, Jean, et al. “HEVs, Lymphatics and Homeostatic Immune Cell Trafficking
in Lymph Nodes.” Nature Reviews Immunology, vol. 12, no. 11, Nature Publishing
Group, 2012, pp. 762–73, doi:10.1038/nri3298.
short: J. Girard, C. Moussion, R. Förster, Nature Reviews Immunology 12 (2012) 762–773.
date_created: 2018-12-11T12:00:29Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:39:57Z
day: '01'
department:
- _id: MiSi
doi: 10.1038/nri3298
intvolume: ' 12'
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 762 - 773
publication: Nature Reviews Immunology
publication_status: published
publisher: Nature Publishing Group
publist_id: '3787'
quality_controlled: '1'
scopus_import: 1
status: public
title: HEVs, lymphatics and homeostatic immune cell trafficking in lymph nodes
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2012'
...
---
_id: '2946'
abstract:
- lang: eng
text: MicroRNAs (miRNAs) are small noncoding RNAs that function in literally all
cellular processes. miRNAs interact with Argonaute (Ago) proteins and guide them
to specific target sites located in the 3′-untranslated region (3′-UTR) of target
mRNAs leading to translational repression and deadenylation-induced mRNA degradation.
Most miRNAs are processed from hairpin-structured precursors by the consecutive
action of the RNase III enzymes Drosha and Dicer. However, processing of miR-451
is Dicer independent and cleavage is mediated by the endonuclease Ago2. Here we
have characterized miR-451 sequence and structure requirements for processing
as well as sorting of miRNAs into different Ago proteins. Pre-miR-451 appears
to be optimized for Ago2 cleavage and changes result in reduced processing. In
addition, we show that the mature miR-451 only associates with Ago2 suggesting
that mature miRNAs are not exchanged between different members of the Ago protein
family. Based on cloning and deep sequencing of endogenous miRNAs associated with
Ago1-3, we do not find evidence for miRNA sorting in human cells. However, Ago
identity appears to influence the length of some miRNAs, while others remain unaffected.
acknowledgement: "Deutsche Forschungsgemeinschaft (DFG) (SFB 960 and FOR855); European
Research Council (ERC grant ‘sRNAs’); European Union (FP7 project ‘ONCOMIRs’); German
Bundesministerium für Bildung und Forschung (BMBF, NGFN+, FKZ PIM-01GS0804-5); Bavarian
Genome Research Network (BayGene to G.M.); The Netherlands Organization for Scientific
Research (NWO, VIDI grant to E.B.). Funding for open access charge: DFG via the
open access publishing program. \r\n\r\nWe thank Sigrun Ammon and Corinna Friederich
for technical assistance and Sebastian Petri and Daniel Schraivogel for helpful
discussions."
author:
- first_name: Anne
full_name: Dueck, Anne
last_name: Dueck
- first_name: Christian
full_name: Ziegler, Christian
last_name: Ziegler
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Eugène
full_name: Berezikov, Eugène
last_name: Berezikov
- first_name: Gunter
full_name: Meister, Gunter
last_name: Meister
citation:
ama: Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. MicroRNAs associated
with the different human Argonaute proteins. Nucleic Acids Research. 2012;40(19):9850-9862.
doi:10.1093/nar/gks705
apa: Dueck, A., Ziegler, C., Eichner, A., Berezikov, E., & Meister, G. (2012).
MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids
Research. Oxford University Press. https://doi.org/10.1093/nar/gks705
chicago: Dueck, Anne, Christian Ziegler, Alexander Eichner, Eugène Berezikov, and
Gunter Meister. “MicroRNAs Associated with the Different Human Argonaute Proteins.”
Nucleic Acids Research. Oxford University Press, 2012. https://doi.org/10.1093/nar/gks705.
ieee: A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, and G. Meister, “MicroRNAs
associated with the different human Argonaute proteins,” Nucleic Acids Research,
vol. 40, no. 19. Oxford University Press, pp. 9850–9862, 2012.
ista: Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. 2012. MicroRNAs associated
with the different human Argonaute proteins. Nucleic Acids Research. 40(19), 9850–9862.
mla: Dueck, Anne, et al. “MicroRNAs Associated with the Different Human Argonaute
Proteins.” Nucleic Acids Research, vol. 40, no. 19, Oxford University Press,
2012, pp. 9850–62, doi:10.1093/nar/gks705.
short: A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, G. Meister, Nucleic Acids
Research 40 (2012) 9850–9862.
date_created: 2018-12-11T12:00:29Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:57Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1093/nar/gks705
file:
- access_level: open_access
checksum: 1bb8d1ff894014b481657a21083c941c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:12Z
date_updated: 2020-07-14T12:45:55Z
file_id: '4993'
file_name: IST-2015-383-v1+1_Nucl._Acids_Res.-2012-Dueck-9850-62.pdf
file_size: 8126936
relation: main_file
file_date_updated: 2020-07-14T12:45:55Z
has_accepted_license: '1'
intvolume: ' 40'
issue: '19'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 9850 - 9862
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '3786'
pubrep_id: '383'
quality_controlled: '1'
scopus_import: 1
status: public
title: MicroRNAs associated with the different human Argonaute proteins
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2012'
...
---
_id: '2947'
abstract:
- lang: eng
text: We introduce games with probabilistic uncertainty, a model for controller
synthesis in which the controller observes the state through imprecise sensors
that provide correct information about the current state with a fixed probability.
That is, in each step, the sensors return an observed state, and given the observed
state, there is a probability distribution (due to the estimation error) over
the actual current state. The controller must base its decision on the observed
state (rather than the actual current state, which it does not know). On the other
hand, we assume that the environment can perfectly observe the current state.
We show that controller synthesis for qualitative ω-regular objectives in our
model can be reduced in polynomial time to standard partial-observation stochastic
games, and vice-versa. As a consequence we establish the precise decidability
frontier for the new class of games, and establish optimal complexity results
for all the decidable problems.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Chmelik M, Majumdar R. Equivalence of games with probabilistic
uncertainty and partial observation games. In: Vol 7561. Springer; 2012:385-399.
doi:10.1007/978-3-642-33386-6_30'
apa: 'Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games
with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399).
Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram,
India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30'
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence
of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99.
Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
ieee: 'K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic
uncertainty and partial observation games,” presented at the ATVA: Automated
Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol.
7561, pp. 385–399.'
ista: 'Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic
uncertainty and partial observation games. ATVA: Automated Technology for Verification
and Analysis, LNCS, vol. 7561, 385–399.'
mla: Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty
and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.
short: K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, India
name: ' ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
date_created: 2018-12-11T12:00:29Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:39:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-33386-6_30
ec_funded: 1
intvolume: ' 7561'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.4140
month: '06'
oa: 1
oa_version: Preprint
page: 385 - 399
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3785'
quality_controlled: '1'
scopus_import: 1
status: public
title: Equivalence of games with probabilistic uncertainty and partial observation
games
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7561
year: '2012'
...
---
_id: '2949'
author:
- first_name: David
full_name: Dupret, David
last_name: Dupret
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Dupret D, Csicsvari JL. The medial entorhinal cortex keeps Up. Nature Neuroscience.
2012;15(11):1471-1472. doi:10.1038/nn.3245
apa: Dupret, D., & Csicsvari, J. L. (2012). The medial entorhinal cortex keeps
Up. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3245
chicago: Dupret, David, and Jozsef L Csicsvari. “The Medial Entorhinal Cortex Keeps
Up.” Nature Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nn.3245.
ieee: D. Dupret and J. L. Csicsvari, “The medial entorhinal cortex keeps Up,” Nature
Neuroscience, vol. 15, no. 11. Nature Publishing Group, pp. 1471–1472, 2012.
ista: Dupret D, Csicsvari JL. 2012. The medial entorhinal cortex keeps Up. Nature
Neuroscience. 15(11), 1471–1472.
mla: Dupret, David, and Jozsef L. Csicsvari. “The Medial Entorhinal Cortex Keeps
Up.” Nature Neuroscience, vol. 15, no. 11, Nature Publishing Group, 2012,
pp. 1471–72, doi:10.1038/nn.3245.
short: D. Dupret, J.L. Csicsvari, Nature Neuroscience 15 (2012) 1471–1472.
date_created: 2018-12-11T12:00:30Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:39:59Z
day: '01'
department:
- _id: JoCs
doi: 10.1038/nn.3245
intvolume: ' 15'
issue: '11'
language:
- iso: eng
main_file_link:
- url: http://www.mrcbndu.ox.ac.uk/publications/medial-entorhinal-cortex-keeps
month: '11'
oa_version: None
page: 1471 - 1472
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '3782'
quality_controlled: '1'
scopus_import: 1
status: public
title: The medial entorhinal cortex keeps Up
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2012'
...
---
_id: '2950'
abstract:
- lang: eng
text: Contractile actomyosin rings drive various fundamental morphogenetic processes
ranging from cytokinesis to wound healing. Actomyosin rings are generally thought
to function by circumferential contraction. Here, we show that the spreading of
the enveloping cell layer (EVL) over the yolk cell during zebrafish gastrulation
is driven by a contractile actomyosin ring. In contrast to previous suggestions,
we find that this ring functions not only by circumferential contraction but also
by a flow-friction mechanism. This generates a pulling force through resistance
against retrograde actomyosin flow. EVL spreading proceeds normally in situations
where circumferential contraction is unproductive, indicating that the flow-friction
mechanism is sufficient. Thus, actomyosin rings can function in epithelial morphogenesis
through a combination of cable-constriction and flow-friction mechanisms.
acknowledged_ssus:
- _id: SSU
author:
- first_name: Martin
full_name: Behrndt, Martin
id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
last_name: Behrndt
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- first_name: Pedro
full_name: Campinho, Pedro
id: 3AFBBC42-F248-11E8-B48F-1D18A9856A87
last_name: Campinho
orcid: 0000-0002-8526-5416
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Felix
full_name: Oswald, Felix
last_name: Oswald
- first_name: Julia
full_name: Roensch, Julia
id: 4220E59C-F248-11E8-B48F-1D18A9856A87
last_name: Roensch
- first_name: Stephan
full_name: Grill, Stephan
last_name: Grill
- 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: Behrndt M, Salbreux G, Campinho P, et al. Forces driving epithelial spreading
in zebrafish gastrulation. Science. 2012;338(6104):257-260. doi:10.1126/science.1224143
apa: Behrndt, M., Salbreux, G., Campinho, P., Hauschild, R., Oswald, F., Roensch,
J., … Heisenberg, C.-P. J. (2012). Forces driving epithelial spreading in zebrafish
gastrulation. Science. American Association for the Advancement of Science.
https://doi.org/10.1126/science.1224143
chicago: Behrndt, Martin, Guillaume Salbreux, Pedro Campinho, Robert Hauschild,
Felix Oswald, Julia Roensch, Stephan Grill, and Carl-Philipp J Heisenberg. “Forces
Driving Epithelial Spreading in Zebrafish Gastrulation.” Science. American
Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1224143.
ieee: M. Behrndt et al., “Forces driving epithelial spreading in zebrafish
gastrulation,” Science, vol. 338, no. 6104. American Association for the
Advancement of Science, pp. 257–260, 2012.
ista: Behrndt M, Salbreux G, Campinho P, Hauschild R, Oswald F, Roensch J, Grill
S, Heisenberg C-PJ. 2012. Forces driving epithelial spreading in zebrafish gastrulation.
Science. 338(6104), 257–260.
mla: Behrndt, Martin, et al. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.”
Science, vol. 338, no. 6104, American Association for the Advancement of
Science, 2012, pp. 257–60, doi:10.1126/science.1224143.
short: M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch,
S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.
date_created: 2018-12-11T12:00:30Z
date_published: 2012-10-12T00:00:00Z
date_updated: 2023-02-21T17:02:44Z
day: '12'
department:
- _id: CaHe
- _id: Bio
doi: 10.1126/science.1224143
intvolume: ' 338'
issue: '6104'
language:
- iso: eng
month: '10'
oa_version: None
page: 257 - 260
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: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3778'
quality_controlled: '1'
related_material:
record:
- id: '1403'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Forces driving epithelial spreading in zebrafish gastrulation
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 338
year: '2012'
...
---
_id: '2951'
abstract:
- lang: eng
text: Differential cell adhesion and cortex tension are thought to drive cell sorting
by controlling cell-cell contact formation. Here, we show that cell adhesion and
cortex tension have different mechanical functions in controlling progenitor cell-cell
contact formation and sorting during zebrafish gastrulation. Cortex tension controls
cell-cell contact expansion by modulating interfacial tension at the contact.
By contrast, adhesion has little direct function in contact expansion, but instead
is needed to mechanically couple the cortices of adhering cells at their contacts,
allowing cortex tension to control contact expansion. The coupling function of
adhesion is mediated by E-cadherin and limited by the mechanical anchoring of
E-cadherin to the cortex. Thus, cell adhesion provides the mechanical scaffold
for cell cortex tension to drive cell sorting during gastrulation.
acknowledged_ssus:
- _id: SSU
author:
- first_name: Jean-Léon
full_name: Maître, Jean-Léon
id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
last_name: Maître
orcid: 0000-0002-3688-1474
- first_name: Hélène
full_name: Berthoumieux, Hélène
last_name: Berthoumieux
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
- first_name: Frank
full_name: Julicher, Frank
last_name: Julicher
- first_name: Ewa
full_name: Paluch, Ewa
last_name: Paluch
- 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: Maître J-L, Berthoumieux H, Krens G, et al. Adhesion functions in cell sorting
by mechanically coupling the cortices of adhering cells. Science. 2012;338(6104):253-256.
doi:10.1126/science.1225399
apa: Maître, J.-L., Berthoumieux, H., Krens, G., Salbreux, G., Julicher, F., Paluch,
E., & Heisenberg, C.-P. J. (2012). Adhesion functions in cell sorting by mechanically
coupling the cortices of adhering cells. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.1225399
chicago: Maître, Jean-Léon, Hélène Berthoumieux, Gabriel Krens, Guillaume Salbreux,
Frank Julicher, Ewa Paluch, and Carl-Philipp J Heisenberg. “Adhesion Functions
in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” Science.
American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1225399.
ieee: J.-L. Maître et al., “Adhesion functions in cell sorting by mechanically
coupling the cortices of adhering cells,” Science, vol. 338, no. 6104.
American Association for the Advancement of Science, pp. 253–256, 2012.
ista: Maître J-L, Berthoumieux H, Krens G, Salbreux G, Julicher F, Paluch E, Heisenberg
C-PJ. 2012. Adhesion functions in cell sorting by mechanically coupling the cortices
of adhering cells. Science. 338(6104), 253–256.
mla: Maître, Jean-Léon, et al. “Adhesion Functions in Cell Sorting by Mechanically
Coupling the Cortices of Adhering Cells.” Science, vol. 338, no. 6104,
American Association for the Advancement of Science, 2012, pp. 253–56, doi:10.1126/science.1225399.
short: J.-L. Maître, H. Berthoumieux, G. Krens, G. Salbreux, F. Julicher, E. Paluch,
C.-P.J. Heisenberg, Science 338 (2012) 253–256.
date_created: 2018-12-11T12:00:31Z
date_published: 2012-10-12T00:00:00Z
date_updated: 2021-01-12T07:40:00Z
day: '12'
department:
- _id: CaHe
doi: 10.1126/science.1225399
intvolume: ' 338'
issue: '6104'
language:
- iso: eng
month: '10'
oa_version: None
page: 253 - 256
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3777'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adhesion functions in cell sorting by mechanically coupling the cortices of
adhering cells
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 338
year: '2012'
...
---
_id: '2952'
abstract:
- lang: eng
text: Body axis elongation represents a common and fundamental morphogenetic process
in development. A key mechanism triggering body axis elongation without additional
growth is convergent extension (CE), whereby a tissue undergoes simultaneous narrowing
and extension. Both collective cell migration and cell intercalation are thought
to drive CE and are used to different degrees in various species as they elongate
their body axis. Here, we provide an overview of CE as a general strategy for
body axis elongation and discuss conserved and divergent mechanisms underlying
CE among different species.
acknowledgement: 'M.T. is supported by the UK Medical Research Council (MRC) and Royal
Society and C.-P.H. by the Fonds zur Förderung der wissenschaftlichen Forschung
(FWF), Deutsche Forschungsgemeinschaft (DFG) and Institute of Science and Technology
Austria. '
author:
- first_name: Masazumi
full_name: Tada, Masazumi
last_name: Tada
- 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: Tada M, Heisenberg C-PJ. Convergent extension Using collective cell migration
and cell intercalation to shape embryos. Development. 2012;139(21):3897-3904.
doi:10.1242/dev.073007
apa: Tada, M., & Heisenberg, C.-P. J. (2012). Convergent extension Using collective
cell migration and cell intercalation to shape embryos. Development. Company
of Biologists. https://doi.org/10.1242/dev.073007
chicago: Tada, Masazumi, and Carl-Philipp J Heisenberg. “Convergent Extension Using
Collective Cell Migration and Cell Intercalation to Shape Embryos.” Development.
Company of Biologists, 2012. https://doi.org/10.1242/dev.073007.
ieee: M. Tada and C.-P. J. Heisenberg, “Convergent extension Using collective cell
migration and cell intercalation to shape embryos,” Development, vol. 139,
no. 21. Company of Biologists, pp. 3897–3904, 2012.
ista: Tada M, Heisenberg C-PJ. 2012. Convergent extension Using collective cell
migration and cell intercalation to shape embryos. Development. 139(21), 3897–3904.
mla: Tada, Masazumi, and Carl-Philipp J. Heisenberg. “Convergent Extension Using
Collective Cell Migration and Cell Intercalation to Shape Embryos.” Development,
vol. 139, no. 21, Company of Biologists, 2012, pp. 3897–904, doi:10.1242/dev.073007.
short: M. Tada, C.-P.J. Heisenberg, Development 139 (2012) 3897–3904.
date_created: 2018-12-11T12:00:31Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:40:00Z
day: '01'
department:
- _id: CaHe
doi: 10.1242/dev.073007
intvolume: ' 139'
issue: '21'
language:
- iso: eng
month: '11'
oa_version: None
page: 3897 - 3904
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '3776'
quality_controlled: '1'
scopus_import: 1
status: public
title: Convergent extension Using collective cell migration and cell intercalation
to shape embryos
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2012'
...
---
_id: '2953'
author:
- 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
- first_name: Reinhard
full_name: Fässler, Reinhard
last_name: Fässler
citation:
ama: Heisenberg C-PJ, Fässler R. Cell-cell adhesion and extracellular matrix diversity
counts. Current Opinion in Cell Biology. 2012;24(5):559-561. doi:10.1016/j.ceb.2012.09.002
apa: Heisenberg, C.-P. J., & Fässler, R. (2012). Cell-cell adhesion and extracellular
matrix diversity counts. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2012.09.002
chicago: Heisenberg, Carl-Philipp J, and Reinhard Fässler. “Cell-Cell Adhesion and
Extracellular Matrix Diversity Counts.” Current Opinion in Cell Biology.
Elsevier, 2012. https://doi.org/10.1016/j.ceb.2012.09.002.
ieee: C.-P. J. Heisenberg and R. Fässler, “Cell-cell adhesion and extracellular
matrix diversity counts,” Current Opinion in Cell Biology, vol. 24, no.
5. Elsevier, pp. 559–561, 2012.
ista: Heisenberg C-PJ, Fässler R. 2012. Cell-cell adhesion and extracellular matrix
diversity counts. Current Opinion in Cell Biology. 24(5), 559–561.
mla: Heisenberg, Carl-Philipp J., and Reinhard Fässler. “Cell-Cell Adhesion and
Extracellular Matrix Diversity Counts.” Current Opinion in Cell Biology,
vol. 24, no. 5, Elsevier, 2012, pp. 559–61, doi:10.1016/j.ceb.2012.09.002.
short: C.-P.J. Heisenberg, R. Fässler, Current Opinion in Cell Biology 24 (2012)
559–561.
date_created: 2018-12-11T12:00:31Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:40:01Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.ceb.2012.09.002
intvolume: ' 24'
issue: '5'
language:
- iso: eng
month: '10'
oa_version: None
page: 559 - 561
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '3773'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cell-cell adhesion and extracellular matrix diversity counts
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2012'
...
---
_id: '2954'
abstract:
- lang: eng
text: Spontaneous postsynaptic currents (PSCs) provide key information about the
mechanisms of synaptic transmission and the activity modes of neuronal networks.
However, detecting spontaneous PSCs in vitro and in vivo has been challenging,
because of the small amplitude, the variable kinetics, and the undefined time
of generation of these events. Here, we describe a, to our knowledge, new method
for detecting spontaneous synaptic events by deconvolution, using a template that
approximates the average time course of spontaneous PSCs. A recorded PSC trace
is deconvolved from the template, resulting in a series of delta-like functions.
The maxima of these delta-like events are reliably detected, revealing the precise
onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based
method has a unique temporal resolution, allowing the detection of individual
events in high-frequency bursts. Furthermore, the deconvolution-based method has
a high amplitude resolution, because deconvolution can substantially increase
the signal/noise ratio. When tested against previously published methods using
experimental data, the deconvolution-based method was superior for spontaneous
PSCs recorded in vivo. Using the high-resolution deconvolution-based detection
algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents
in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.
acknowledgement: "This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10)
and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J.
Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and
F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n"
author:
- first_name: Alejandro
full_name: Pernia-Andrade, Alejandro
id: 36963E98-F248-11E8-B48F-1D18A9856A87
last_name: Pernia-Andrade
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Yvonne
full_name: Stickler, Yvonne
id: 63B76600-E9CC-11E9-9B5F-82450873F7A1
last_name: Stickler
- first_name: Ulrich
full_name: Fröbe, Ulrich
last_name: Fröbe
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution
based method with high sensitivity and temporal resolution for detection of spontaneous
synaptic currents in vitro and in vivo. Biophysical Journal. 2012;103(7):1429-1439.
doi:10.1016/j.bpj.2012.08.039
apa: Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &
Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal
resolution for detection of spontaneous synaptic currents in vitro and in vivo.
Biophysical Journal. Biophysical. https://doi.org/10.1016/j.bpj.2012.08.039
chicago: Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe,
Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity
and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
and in Vivo.” Biophysical Journal. Biophysical, 2012. https://doi.org/10.1016/j.bpj.2012.08.039.
ieee: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M.
Jonas, “A deconvolution based method with high sensitivity and temporal resolution
for detection of spontaneous synaptic currents in vitro and in vivo,” Biophysical
Journal, vol. 103, no. 7. Biophysical, pp. 1429–1439, 2012.
ista: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012.
A deconvolution based method with high sensitivity and temporal resolution for
detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal.
103(7), 1429–1439.
mla: Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity
and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
and in Vivo.” Biophysical Journal, vol. 103, no. 7, Biophysical, 2012,
pp. 1429–39, doi:10.1016/j.bpj.2012.08.039.
short: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas,
Biophysical Journal 103 (2012) 1429–1439.
date_created: 2018-12-11T12:00:32Z
date_published: 2012-10-03T00:00:00Z
date_updated: 2021-01-12T07:40:01Z
day: '03'
department:
- _id: PeJo
- _id: ScienComp
doi: 10.1016/j.bpj.2012.08.039
external_id:
pmid:
- '23062335'
intvolume: ' 103'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/
month: '10'
oa: 1
oa_version: Submitted Version
page: 1429 - 1439
pmid: 1
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Biophysical Journal
publication_status: published
publisher: Biophysical
publist_id: '3774'
quality_controlled: '1'
scopus_import: 1
status: public
title: A deconvolution based method with high sensitivity and temporal resolution
for detection of spontaneous synaptic currents in vitro and in vivo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2012'
...
---
_id: '2955'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on finite graphs with reachability
objectives where the first player tries to ensure a target state to be visited
almost-surely (i.e., with probability 1), or positively (i.e., with positive probability),
no matter the strategy of the second player. We classify such games according
to the information and the power of randomization available to the players. On
the basis of information, the game can be one-sided with either (a) player 1,
or (b) player 2 having partial observation (and the other player has perfect observation),
or two-sided with (c) both players having partial observation. On the basis of
randomization, the players (a) may not be allowed to use randomization (pure strategies),
or (b) may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) may
use full randomization. Our main results for pure strategies are as follows. (1)
For one-sided games with player 1 having partial observation we show that (in
contrast to full randomized strategies) belief-based (subset-construction based)
strategies are not sufficient, and we present an exponential upper bound on memory
both for almostsure and positive winning strategies; we show that the problem
of deciding the existence of almost-sure and positive winning strategies for player
1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation
we show that non-elementary memory is both necessary and sufficient for both almost-sure
and positive winning strategies. (3) We show that for the general (two-sided)
case finite-memory strategies are sufficient for both positive and almost-sure
winning, and at least non-elementary memory is required. We establish the equivalence
of the almost-sure winning problems for pure strategies and for randomized strategies
with actions invisible. Our equivalence result exhibits serious flaws in previous
results of the literature: we show a non-elementary memory lower bound for almost-sure
winning whereas an exponential upper bound was previously claimed.'
acknowledgement: 'This work was partially supported by FWF Grant No P 23499-N23, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
article_number: '6280436'
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when
belief fails. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on
Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.28'
apa: 'Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games:
How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual
ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28.'
ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to
win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, Dubrovnik, Croatia, 2012.'
ista: 'Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to
win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.'
short: K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:32Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.28
ec_funded: 1
external_id:
arxiv:
- '1107.2141'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2141
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3771'
quality_controlled: '1'
related_material:
record:
- id: '2211'
relation: later_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...