---
_id: '3113'
abstract:
- lang: eng
text: A cell membrane can be considered a liquid-phase plane in which lipids and
proteins theoretically are free to diffuse. Numerous reports,however, describe
retarded diffusion ofmembrane proteins in animal cells. This anomalous diffusion
results from a combination of structuring factors including protein-protein interactions,
cytoskeleton corralling, and lipid organization into microdomains. In plant cells,
plasma-membrane (PM) proteins have been described as relatively immobile, but
the control mechanisms that structure the PM have not been studied. Here, we use
fluorescence recovery after photobleaching to estimate mobility of a set of minimal
PM proteins. These proteins consist only of a PM-anchoring domain fused to a fluorescent
protein, but their mobilities remained limited, as is the case for many full-length
proteins. Neither the cytoskeleton nor membrane microdomain structure was involved
in constraining the diffusion of these proteins. The cell wall, however, was shown
to have a crucial role in immobilizing PM proteins. In addition, by single-molecule
fluorescence imaging we confirmed that the pattern of cellulose deposition in
the cell wall affects the trajectory and speed ofPMprotein diffusion. Regulation
ofPMprotein dynamics by the plant cell wall can be interpreted as a mechanism
for regulating protein interactions in processes such as trafficking and signal
transduction.
author:
- first_name: Alexandre
full_name: Martinière, Alexandre
last_name: Martinière
- first_name: Irene
full_name: Lavagi, Irene
last_name: Lavagi
- first_name: Gayathri
full_name: Nageswaran, Gayathri
last_name: Nageswaran
- first_name: Daniel
full_name: Rolfe, Daniel J
last_name: Rolfe
- first_name: Lilly
full_name: Maneta-Peyret, Lilly
last_name: Maneta Peyret
- first_name: Doan
full_name: Luu, Doan-Trung
last_name: Luu
- first_name: Stanley
full_name: Botchway, Stanley W
last_name: Botchway
- first_name: Stephen
full_name: Webb, Stephen E
last_name: Webb
- first_name: Sebastien
full_name: Mongrand, Sebastien
last_name: Mongrand
- first_name: Christophe
full_name: Maurel, Christophe
last_name: Maurel
- first_name: Marisa
full_name: Martin-Fernandez, Marisa L
last_name: Martin Fernandez
- first_name: Jürgen
full_name: Kleine-Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Patrick
full_name: Moreau, Patrick
last_name: Moreau
- first_name: John
full_name: Runions, John
last_name: Runions
citation:
ama: Martinière A, Lavagi I, Nageswaran G, et al. Cell wall constrains lateral diffusion
of plant plasma membrane proteins. PNAS. 2012;109(31):12805-12810. doi:10.1073/pnas.1202040109
apa: Martinière, A., Lavagi, I., Nageswaran, G., Rolfe, D., Maneta Peyret, L., Luu,
D., … Runions, J. (2012). Cell wall constrains lateral diffusion of plant plasma
membrane proteins. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1202040109
chicago: Martinière, Alexandre, Irene Lavagi, Gayathri Nageswaran, Daniel Rolfe,
Lilly Maneta Peyret, Doan Luu, Stanley Botchway, et al. “Cell Wall Constrains
Lateral Diffusion of Plant Plasma Membrane Proteins.” PNAS. National Academy
of Sciences, 2012. https://doi.org/10.1073/pnas.1202040109.
ieee: A. Martinière et al., “Cell wall constrains lateral diffusion of plant
plasma membrane proteins,” PNAS, vol. 109, no. 31. National Academy of
Sciences, pp. 12805–12810, 2012.
ista: Martinière A, Lavagi I, Nageswaran G, Rolfe D, Maneta Peyret L, Luu D, Botchway
S, Webb S, Mongrand S, Maurel C, Martin Fernandez M, Kleine Vehn J, Friml J, Moreau
P, Runions J. 2012. Cell wall constrains lateral diffusion of plant plasma membrane
proteins. PNAS. 109(31), 12805–12810.
mla: Martinière, Alexandre, et al. “Cell Wall Constrains Lateral Diffusion of Plant
Plasma Membrane Proteins.” PNAS, vol. 109, no. 31, National Academy of
Sciences, 2012, pp. 12805–10, doi:10.1073/pnas.1202040109.
short: A. Martinière, I. Lavagi, G. Nageswaran, D. Rolfe, L. Maneta Peyret, D. Luu,
S. Botchway, S. Webb, S. Mongrand, C. Maurel, M. Martin Fernandez, J. Kleine Vehn,
J. Friml, P. Moreau, J. Runions, PNAS 109 (2012) 12805–12810.
date_created: 2018-12-11T12:01:28Z
date_published: 2012-07-31T00:00:00Z
date_updated: 2021-01-12T07:41:09Z
day: '31'
doi: 10.1073/pnas.1202040109
extern: 1
intvolume: ' 109'
issue: '31'
month: '07'
page: 12805 - 12810
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '3586'
quality_controlled: 0
status: public
title: Cell wall constrains lateral diffusion of plant plasma membrane proteins
type: journal_article
volume: 109
year: '2012'
...
---
_id: '3114'
abstract:
- lang: eng
text: Auxin is a key coordinative signal required for many aspects of plant development
and its levels are controlled by auxin metabolism and intercellular auxin transport.
Here we find that a member of PIN auxin transporter family, PIN8 is expressed
in male gametophyte of Arabidopsis thaliana and has a crucial role in pollen development
and functionality. Ectopic expression in sporophytic tissues establishes a role
of PIN8 in regulating auxin homoeostasis and metabolism. PIN8 co-localizes with
PIN5 to the endoplasmic reticulum (ER) where it acts as an auxin transporter.
Genetic analyses reveal an antagonistic action of PIN5 and PIN8 in the regulation
of intracellular auxin homoeostasis and gametophyte as well as sporophyte development.
Our results reveal a role of the auxin transport in male gametophyte development
in which the distinct actions of ER-localized PIN transporters regulate cellular
auxin homoeostasis and maintain the auxin levels optimal for pollen development
and pollen tube growth.
author:
- first_name: Zhaojun
full_name: Ding, Zhaojun
last_name: Ding
- first_name: Bangjun
full_name: Wang, Bangjun
last_name: Wang
- first_name: Ignacio
full_name: Moreno, Ignacio
last_name: Moreno
- first_name: Nikoleta
full_name: Dupláková, Nikoleta
last_name: Dupláková
- first_name: Sibu
full_name: Sibu Simon
id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
last_name: Simon
orcid: 0000-0002-1998-6741
- first_name: Nicola
full_name: Carraro, Nicola
last_name: Carraro
- first_name: Jesica
full_name: Reemmer, Jesica
last_name: Reemmer
- first_name: Aleš
full_name: Pěnčík, Aleš
last_name: Pěnčík
- first_name: Xu
full_name: Xu Chen
id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Ricardo
full_name: Tejos, Ricardo I
last_name: Tejos
- first_name: Petr
full_name: Skůpa, Petr
last_name: Skůpa
- first_name: Stephan
full_name: Pollmann, Stephan
last_name: Pollmann
- first_name: Jozef
full_name: Mravec, Jozef
last_name: Mravec
- first_name: Jan
full_name: Petrášek, Jan
last_name: Petrášek
- first_name: Eva
full_name: Zažímalová, Eva
last_name: Zažímalová
- first_name: David
full_name: Honys, David
last_name: Honys
- first_name: Jakub
full_name: Rolčík, Jakub
last_name: Rolčík
- first_name: Angus
full_name: Murphy, Angus S
last_name: Murphy
- first_name: Ariel
full_name: Orellana, Ariel
last_name: Orellana
- first_name: Markus
full_name: Geisler, Markus
last_name: Geisler
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Ding Z, Wang B, Moreno I, et al. ER-localized auxin transporter PIN8 regulates
auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications.
2012;3(AN 941). doi:10.1038/ncomms1941
apa: Ding, Z., Wang, B., Moreno, I., Dupláková, N., Simon, S., Carraro, N., … Friml,
J. (2012). ER-localized auxin transporter PIN8 regulates auxin homeostasis and
male gametophyte development in Arabidopsis. Nature Communications. Nature
Publishing Group. https://doi.org/10.1038/ncomms1941
chicago: Ding, Zhaojun, Bangjun Wang, Ignacio Moreno, Nikoleta Dupláková, Sibu Simon,
Nicola Carraro, Jesica Reemmer, et al. “ER-Localized Auxin Transporter PIN8 Regulates
Auxin Homeostasis and Male Gametophyte Development in Arabidopsis.” Nature
Communications. Nature Publishing Group, 2012. https://doi.org/10.1038/ncomms1941.
ieee: Z. Ding et al., “ER-localized auxin transporter PIN8 regulates auxin
homeostasis and male gametophyte development in Arabidopsis,” Nature Communications,
vol. 3, no. AN 941. Nature Publishing Group, 2012.
ista: Ding Z, Wang B, Moreno I, Dupláková N, Simon S, Carraro N, Reemmer J, Pěnčík
A, Chen X, Tejos R, Skůpa P, Pollmann S, Mravec J, Petrášek J, Zažímalová E, Honys
D, Rolčík J, Murphy A, Orellana A, Geisler M, Friml J. 2012. ER-localized auxin
transporter PIN8 regulates auxin homeostasis and male gametophyte development
in Arabidopsis. Nature Communications. 3(AN 941).
mla: Ding, Zhaojun, et al. “ER-Localized Auxin Transporter PIN8 Regulates Auxin
Homeostasis and Male Gametophyte Development in Arabidopsis.” Nature Communications,
vol. 3, no. AN 941, Nature Publishing Group, 2012, doi:10.1038/ncomms1941.
short: Z. Ding, B. Wang, I. Moreno, N. Dupláková, S. Simon, N. Carraro, J. Reemmer,
A. Pěnčík, X. Chen, R. Tejos, P. Skůpa, S. Pollmann, J. Mravec, J. Petrášek, E.
Zažímalová, D. Honys, J. Rolčík, A. Murphy, A. Orellana, M. Geisler, J. Friml,
Nature Communications 3 (2012).
date_created: 2018-12-11T12:01:28Z
date_published: 2012-07-03T00:00:00Z
date_updated: 2021-01-12T07:41:09Z
day: '03'
doi: 10.1038/ncomms1941
extern: 1
intvolume: ' 3'
issue: AN 941
month: '07'
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '3585'
quality_controlled: 0
status: public
title: ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte
development in Arabidopsis
type: journal_article
volume: 3
year: '2012'
...
---
_id: '3111'
abstract:
- lang: eng
text: PIN-FORMED (PIN) protein-mediated auxin polar transport is critically important
for development, pattern formation, and morphogenesis in plants. Auxin has been
implicated in the regulation of polar auxin transport by inhibiting PIN endocytosis
[1, 2], but how auxin regulates this process is poorly understood. Our genetic
screen identified the Arabidopsis SPIKE1 (SPK1) gene whose loss-of-function mutations
increased lateral root density and retarded gravitropic responses, as do pin2
knockout mutations [3]. SPK1 belongs to the conserved DHR2-Dock family of Rho
guanine nucleotide exchange factors [4-6]. The spk1 mutations induced PIN2 internalization
that was not suppressed by auxin, as did the loss-of-function mutations for Rho-like
GTPase from Plants 6 (ROP6)-GTPase or its effector RIC1. Furthermore, SPK1 was
required for auxin induction of ROP6 activation. Our results have established
a Rho GTPase-based auxin signaling pathway that maintains PIN2 polar distribution
to the plasma membrane via inhibition of its internalization in Arabidopsis roots.
Our findings provide new insights into signaling mechanisms that underlie the
regulation of the dynamic trafficking of PINs required for long-distance auxin
transport and that link auxin signaling to PIN-mediated pattern formation and
morphogenesis.
author:
- first_name: Deshu
full_name: Lin, Deshu
last_name: Lin
- first_name: Shingo
full_name: Nagawa, Shingo
last_name: Nagawa
- first_name: Jisheng
full_name: Chen, Jisheng
last_name: Chen
- first_name: Lingyan
full_name: Cao, Lingyan
last_name: Cao
- first_name: Xu
full_name: Xu Chen
id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Tongda
full_name: Xu, Tongda
last_name: Xu
- first_name: Hongjiang
full_name: Hongjiang Li
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Pankaj
full_name: Dhonukshe, Pankaj
last_name: Dhonukshe
- first_name: Chizuko
full_name: Yamamuro, Chizuko
last_name: Yamamuro
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Ben
full_name: Scheres, Ben
last_name: Scheres
- first_name: Ying
full_name: Fu, Ying
last_name: Fu
- first_name: Zhenbiao
full_name: Yang, Zhenbiao
last_name: Yang
citation:
ama: Lin D, Nagawa S, Chen J, et al. A ROP GTPase dependent auxin signaling pathway
regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current
Biology. 2012;22(14):1319-1325. doi:10.1016/j.cub.2012.05.019
apa: Lin, D., Nagawa, S., Chen, J., Cao, L., Chen, X., Xu, T., … Yang, Z. (2012).
A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution
of PIN2 in Arabidopsis roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2012.05.019
chicago: Lin, Deshu, Shingo Nagawa, Jisheng Chen, Lingyan Cao, Xu Chen, Tongda Xu,
Hongjiang Li, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates
the Subcellular Distribution of PIN2 in Arabidopsis Roots.” Current Biology.
Cell Press, 2012. https://doi.org/10.1016/j.cub.2012.05.019.
ieee: D. Lin et al., “A ROP GTPase dependent auxin signaling pathway regulates
the subcellular distribution of PIN2 in Arabidopsis roots,” Current Biology,
vol. 22, no. 14. Cell Press, pp. 1319–1325, 2012.
ista: Lin D, Nagawa S, Chen J, Cao L, Chen X, Xu T, Li H, Dhonukshe P, Yamamuro
C, Friml J, Scheres B, Fu Y, Yang Z. 2012. A ROP GTPase dependent auxin signaling
pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current
Biology. 22(14), 1319–1325.
mla: Lin, Deshu, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates
the Subcellular Distribution of PIN2 in Arabidopsis Roots.” Current Biology,
vol. 22, no. 14, Cell Press, 2012, pp. 1319–25, doi:10.1016/j.cub.2012.05.019.
short: D. Lin, S. Nagawa, J. Chen, L. Cao, X. Chen, T. Xu, H. Li, P. Dhonukshe,
C. Yamamuro, J. Friml, B. Scheres, Y. Fu, Z. Yang, Current Biology 22 (2012) 1319–1325.
date_created: 2018-12-11T12:01:27Z
date_published: 2012-07-24T00:00:00Z
date_updated: 2021-01-12T07:41:08Z
day: '24'
doi: 10.1016/j.cub.2012.05.019
extern: 1
intvolume: ' 22'
issue: '14'
month: '07'
page: 1319 - 1325
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '3588'
quality_controlled: 0
status: public
title: A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution
of PIN2 in Arabidopsis roots
type: journal_article
volume: 22
year: '2012'
...
---
_id: '3112'
abstract:
- lang: eng
text: The dynamic spatial and temporal distribution of the crucial plant signaling
molecule auxin is achieved by feedback coordination of auxin signaling and intercellular
auxin transport pathways [1, 2]. Developmental roles of auxin have been attributed
predominantly to its effect on transcription; however, an alternative pathway
involving AUXIN BINDING PROTEIN1 (ABP1) has been proposed to regulate clathrin-mediated
endocytosis in roots and Rho-like GTPase (ROP)-dependent pavement cell interdigitation
in leaves [3, 4]. In this study, we show that ROP6 and its downstream effector
RIC1 regulate clathrin association with the plasma membrane for clathrin-mediated
endocytosis, as well as for its feedback regulation by auxin. Genetic analysis
revealed that ROP6/RIC1 acts downstream of ABP1 to regulate endocytosis. This
signaling circuit is also involved in the feedback regulation of PIN-FORMED 1
(PIN1) and PIN2 auxin transporters activity (via its constitutive endocytosis)
and corresponding auxin transport-mediated processes, including root gravitropism
and leave vascular tissue patterning. Our findings suggest that the signaling
module auxin-ABP1-ROP6/RIC1-clathrin-PIN1/PIN2 is a shared component of the feedback
regulation of auxin transport during both root and aerial development.
author:
- first_name: Xu
full_name: Xu Chen
id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Stéphanie
full_name: Robert, Stéphanie
last_name: Robert
- first_name: Ricardo
full_name: Tejos, Ricardo
last_name: Tejos
- first_name: Christian
full_name: Löfke, Christian
last_name: Löfke
- first_name: Deshu
full_name: Lin, Deshu
last_name: Lin
- first_name: Zhenbiao
full_name: Yang, Zhenbiao
last_name: Yang
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Chen X, Naramoto S, Robert S, et al. ABP1 and ROP6 GTPase signaling regulate
clathrin mediated endocytosis in Arabidopsis roots. Current Biology. 2012;22(14):1326-1332.
doi:10.1016/j.cub.2012.05.020
apa: Chen, X., Naramoto, S., Robert, S., Tejos, R., Löfke, C., Lin, D., … Friml,
J. (2012). ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis
in Arabidopsis roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2012.05.020
chicago: Chen, Xu, Satoshi Naramoto, Stéphanie Robert, Ricardo Tejos, Christian
Löfke, Deshu Lin, Zhenbiao Yang, and Jiří Friml. “ABP1 and ROP6 GTPase Signaling
Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” Current Biology.
Cell Press, 2012. https://doi.org/10.1016/j.cub.2012.05.020.
ieee: X. Chen et al., “ABP1 and ROP6 GTPase signaling regulate clathrin mediated
endocytosis in Arabidopsis roots,” Current Biology, vol. 22, no. 14. Cell
Press, pp. 1326–1332, 2012.
ista: Chen X, Naramoto S, Robert S, Tejos R, Löfke C, Lin D, Yang Z, Friml J. 2012.
ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis
roots. Current Biology. 22(14), 1326–1332.
mla: Chen, Xu, et al. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated
Endocytosis in Arabidopsis Roots.” Current Biology, vol. 22, no. 14, Cell
Press, 2012, pp. 1326–32, doi:10.1016/j.cub.2012.05.020.
short: X. Chen, S. Naramoto, S. Robert, R. Tejos, C. Löfke, D. Lin, Z. Yang, J.
Friml, Current Biology 22 (2012) 1326–1332.
date_created: 2018-12-11T12:01:27Z
date_published: 2012-07-24T00:00:00Z
date_updated: 2021-01-12T07:41:08Z
day: '24'
doi: 10.1016/j.cub.2012.05.020
extern: 1
intvolume: ' 22'
issue: '14'
month: '07'
page: 1326 - 1332
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '3587'
quality_controlled: 0
status: public
title: ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis
roots
type: journal_article
volume: 22
year: '2012'
...
---
_id: '3128'
abstract:
- lang: eng
text: 'We consider two-player zero-sum stochastic games on graphs with ω-regular
winning conditions specified as parity objectives. These games have applications
in the design and control of reactive systems. We survey the complexity results
for the problem of deciding the winner in such games, and in classes of interest
obtained as special cases, based on the information and the power of randomization
available to the players, on the class of objectives and on the winning mode.
On the basis of information, these games can be classified as follows: (a) partial-observation
(both players have partial view of the game); (b) one-sided partial-observation
(one player has partial-observation and the other player has complete-observation);
and (c) complete-observation (both players have complete view of the game). The
one-sided partial-observation games have two important subclasses: the one-player
games, known as partial-observation Markov decision processes (POMDPs), and the
blind one-player games, known as probabilistic automata. On the basis of randomization,
(a) the players may not be allowed to use randomization (pure strategies), or
(b) they may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) they
may use full randomization. Finally, various classes of games are obtained by
restricting the parity objective to a reachability, safety, Büchi, or coBüchi
condition. We also consider several winning modes, such as sure-winning (i.e.,
all outcomes of a strategy have to satisfy the winning condition), almost-sure
winning (i.e., winning with probability 1), limit-sure winning (i.e., winning
with probability arbitrarily close to 1), and value-threshold winning (i.e., winning
with probability at least ν, where ν is a given rational). '
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), 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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic
parity games. Formal Methods in System Design. 2012;43(2):268-284. doi:10.1007/s10703-012-0164-2
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation
stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey
of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design.
Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation
stochastic parity games,” Formal Methods in System Design, vol. 43, no.
2. Springer, pp. 268–284, 2012.
ista: Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation
stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
mla: Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic
Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer,
2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design
43 (2012) 268–284.
date_created: 2018-12-11T12:01:33Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:41:15Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-012-0164-2
ec_funded: 1
file:
- access_level: open_access
checksum: dd3d590f383bb2ac6cfda1489ac1c42a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:27Z
date_updated: 2020-07-14T12:46:00Z
file_id: '4882'
file_name: IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf
file_size: 163983
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 43'
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 268 - 284
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '3570'
pubrep_id: '303'
quality_controlled: '1'
scopus_import: 1
status: public
title: A survey of partial-observation stochastic parity games
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2012'
...
---
_id: '3125'
abstract:
- lang: eng
text: We propose a new learning method to infer a mid-level feature representation
that combines the advantage of semantic attribute representations with the higher
expressive power of non-semantic features. The idea lies in augmenting an existing
attribute-based representation with additional dimensions for which an autoencoder
model is coupled with a large-margin principle. This construction allows a smooth
transition between the zero-shot regime with no training example, the unsupervised
regime with training examples but without class labels, and the supervised regime
with training examples and with class labels. The resulting optimization problem
can be solved efficiently, because several of the necessity steps have closed-form
solutions. Through extensive experiments we show that the augmented representation
achieves better results in terms of object categorization accuracy than the semantic
representation alone.
alternative_title:
- LNCS
article_processing_charge: No
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. Augmented attribute representations.
In: Vol 7576. Springer; 2012:242-255. doi:10.1007/978-3-642-33715-4_18'
apa: 'Sharmanska, V., Quadrianto, N., & Lampert, C. (2012). Augmented attribute
representations (Vol. 7576, pp. 242–255). Presented at the ECCV: European Conference
on Computer Vision, Florence, Italy: Springer. https://doi.org/10.1007/978-3-642-33715-4_18'
chicago: Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Augmented
Attribute Representations,” 7576:242–55. Springer, 2012. https://doi.org/10.1007/978-3-642-33715-4_18.
ieee: 'V. Sharmanska, N. Quadrianto, and C. Lampert, “Augmented attribute representations,”
presented at the ECCV: European Conference on Computer Vision, Florence, Italy,
2012, vol. 7576, no. PART 5, pp. 242–255.'
ista: 'Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations.
ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 242–255.'
mla: Sharmanska, Viktoriia, et al. Augmented Attribute Representations. Vol.
7576, no. PART 5, Springer, 2012, pp. 242–55, doi:10.1007/978-3-642-33715-4_18.
short: V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255.
conference:
end_date: 2012-10-13
location: Florence, Italy
name: 'ECCV: European Conference on Computer Vision'
start_date: 2012-10-07
date_created: 2018-12-11T12:01:32Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2023-02-23T11:13:25Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1007/978-3-642-33715-4_18
file:
- access_level: open_access
checksum: bccdbe0663780d25a1e0524002b2d896
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T12:29:04Z
date_updated: 2020-07-14T12:46:00Z
file_id: '7861'
file_name: 2012_ECCV_Sharmanska.pdf
file_size: 6073897
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 7576'
issue: PART 5
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 242 - 255
publication_status: published
publisher: Springer
publist_id: '3574'
quality_controlled: '1'
scopus_import: 1
status: public
title: Augmented attribute representations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7576
year: '2012'
...
---
_id: '3129'
abstract:
- lang: eng
text: "Let K be a simplicial complex and g the rank of its p-th homology group Hp(K)
defined with ℤ2 coefficients. We show that we can compute a basis H of Hp(K) and
annotate each p-simplex of K with a binary vector of length g with the following
property: the annotations, summed over all p-simplices in any p-cycle z, provide
the coordinate vector of the homology class [z] in the basis H. The basis and
the annotations for all simplices can be computed in O(n ω ) time, where n is
the size of K and ω < 2.376 is a quantity so that two n×n matrices can be multiplied
in O(n ω ) time. The precomputed annotations permit answering queries about the
independence or the triviality of p-cycles efficiently.\r\n\r\nUsing annotations
of edges in 2-complexes, we derive better algorithms for computing optimal basis
and optimal homologous cycles in 1 - dimensional homology. Specifically, for computing
an optimal basis of H1(K) , we improve the previously known time complexity from
O(n 4) to O(n ω + n 2 g ω − 1). Here n denotes the size of the 2-skeleton of
K and g the rank of H1(K) . Computing an optimal cycle homologous to a given 1-cycle
is NP-hard even for surfaces and an algorithm taking 2 O(g) nlogn time is known
for surfaces. We extend this algorithm to work with arbitrary 2-complexes in O(n
ω ) + 2 O(g) n 2logn time using annotations.\r\n"
alternative_title:
- LNCS
author:
- first_name: Oleksiy
full_name: Busaryev, Oleksiy
last_name: Busaryev
- first_name: Sergio
full_name: Cabello, Sergio
last_name: Cabello
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Tamal
full_name: Dey, Tamal
last_name: Dey
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: 'Busaryev O, Cabello S, Chen C, Dey T, Wang Y. Annotating simplices with a
homology basis and its applications. In: Vol 7357. Springer; 2012:189-200. doi:10.1007/978-3-642-31155-0_17'
apa: 'Busaryev, O., Cabello, S., Chen, C., Dey, T., & Wang, Y. (2012). Annotating
simplices with a homology basis and its applications (Vol. 7357, pp. 189–200).
Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki,
Finland: Springer. https://doi.org/10.1007/978-3-642-31155-0_17'
chicago: Busaryev, Oleksiy, Sergio Cabello, Chao Chen, Tamal Dey, and Yusu Wang.
“Annotating Simplices with a Homology Basis and Its Applications,” 7357:189–200.
Springer, 2012. https://doi.org/10.1007/978-3-642-31155-0_17.
ieee: 'O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices
with a homology basis and its applications,” presented at the SWAT: Symposium
and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.'
ista: 'Busaryev O, Cabello S, Chen C, Dey T, Wang Y. 2012. Annotating simplices
with a homology basis and its applications. SWAT: Symposium and Workshops on Algorithm
Theory, LNCS, vol. 7357, 189–200.'
mla: Busaryev, Oleksiy, et al. Annotating Simplices with a Homology Basis and
Its Applications. Vol. 7357, Springer, 2012, pp. 189–200, doi:10.1007/978-3-642-31155-0_17.
short: O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp.
189–200.
conference:
end_date: 2012-07-06
location: Helsinki, Finland
name: 'SWAT: Symposium and Workshops on Algorithm Theory'
start_date: 2012-07-04
date_created: 2018-12-11T12:01:33Z
date_published: 2012-06-19T00:00:00Z
date_updated: 2021-01-12T07:41:15Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-642-31155-0_17
external_id:
arxiv:
- '1107.3793'
intvolume: ' 7357'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.3793
month: '06'
oa: 1
oa_version: Preprint
page: 189 - 200
publication_status: published
publisher: Springer
publist_id: '3569'
quality_controlled: '1'
scopus_import: 1
status: public
title: Annotating simplices with a homology basis and its applications
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7357
year: '2012'
...
---
_id: '3126'
abstract:
- lang: eng
text: "In this work we propose a new information-theoretic clustering algorithm
that infers cluster memberships by direct optimization of a non-parametric mutual
information estimate between data distribution and cluster assignment. Although
the optimization objective has a solid theoretical foundation it is hard to optimize.
We propose an approximate optimization formulation that leads to an efficient
algorithm with low runtime complexity. The algorithm has a single free parameter,
the number of clusters to find. We demonstrate superior performance on several
synthetic and real datasets.\r\n"
alternative_title:
- LNCS
author:
- first_name: Andreas
full_name: Müller, Andreas
last_name: Müller
- first_name: Sebastian
full_name: Nowozin, Sebastian
last_name: Nowozin
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Müller A, Nowozin S, Lampert C. Information theoretic clustering using minimal
spanning trees. In: Vol 7476. Springer; 2012:205-215. doi:10.1007/978-3-642-32717-9_21'
apa: 'Müller, A., Nowozin, S., & Lampert, C. (2012). Information theoretic clustering
using minimal spanning trees (Vol. 7476, pp. 205–215). Presented at the DAGM:
German Association For Pattern Recognition, Graz, Austria: Springer. https://doi.org/10.1007/978-3-642-32717-9_21'
chicago: Müller, Andreas, Sebastian Nowozin, and Christoph Lampert. “Information
Theoretic Clustering Using Minimal Spanning Trees,” 7476:205–15. Springer, 2012.
https://doi.org/10.1007/978-3-642-32717-9_21.
ieee: 'A. Müller, S. Nowozin, and C. Lampert, “Information theoretic clustering
using minimal spanning trees,” presented at the DAGM: German Association For Pattern
Recognition, Graz, Austria, 2012, vol. 7476, pp. 205–215.'
ista: 'Müller A, Nowozin S, Lampert C. 2012. Information theoretic clustering using
minimal spanning trees. DAGM: German Association For Pattern Recognition, LNCS,
vol. 7476, 205–215.'
mla: Müller, Andreas, et al. Information Theoretic Clustering Using Minimal Spanning
Trees. Vol. 7476, Springer, 2012, pp. 205–15, doi:10.1007/978-3-642-32717-9_21.
short: A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215.
conference:
end_date: 2012-08-31
location: Graz, Austria
name: 'DAGM: German Association For Pattern Recognition'
start_date: 2012-08-28
date_created: 2018-12-11T12:01:32Z
date_published: 2012-08-14T00:00:00Z
date_updated: 2021-01-12T07:41:14Z
day: '14'
department:
- _id: ChLa
doi: 10.1007/978-3-642-32717-9_21
intvolume: ' 7476'
language:
- iso: eng
month: '08'
oa_version: None
page: 205 - 215
publication_status: published
publisher: Springer
publist_id: '3573'
quality_controlled: '1'
scopus_import: 1
status: public
title: Information theoretic clustering using minimal spanning trees
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7476
year: '2012'
...
---
_id: '3155'
abstract:
- lang: eng
text: 'We propose synchronous interfaces, a new interface theory for discrete-time
systems. We use an application to time-triggered scheduling to drive the design
choices for our formalism; in particular, additionally to deriving useful mathematical
properties, we focus on providing a syntax which is adapted to natural high-level
system modeling. As a result, we develop an interface model that relies on a guarded-command
based language and is equipped with shared variables and explicit discrete-time
clocks. We define all standard interface operations: compatibility checking, composition,
refinement, and shared refinement. Apart from the synchronous interface model,
the contribution of this paper is the establishment of a formal relation between
interface theories and real-time scheduling, where we demonstrate a fully automatic
framework for the incremental computation of time-triggered schedules.'
acknowledgement: Research partially supported by the Danish-Chinese Center for Cyber
Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB.
alternative_title:
- LNCS
author:
- first_name: Benoît
full_name: Delahaye, Benoît
last_name: Delahaye
- first_name: Uli
full_name: Fahrenberg, Uli
last_name: Fahrenberg
- 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: Axel
full_name: Legay, Axel
last_name: Legay
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface
theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218.
doi:10.1007/978-3-642-30793-5_13'
apa: 'Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., & Nickovic,
D. (2012). Synchronous interface theories and time triggered scheduling (Vol.
7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and
Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed
Systems , Stockholm, Sweden: Springer. https://doi.org/10.1007/978-3-642-30793-5_13'
chicago: Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan
Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18.
Springer, 2012. https://doi.org/10.1007/978-3-642-30793-5_13.
ieee: 'B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous
interface theories and time triggered scheduling,” presented at the FORTE: Formal
Techniques for Networked and Distributed Systems & FMOODS: Formal Methods
for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273,
pp. 203–218.'
ista: 'Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous
interface theories and time triggered scheduling. FORTE: Formal Techniques for
Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based
Distributed Systems , LNCS, vol. 7273, 203–218.'
mla: Delahaye, Benoît, et al. Synchronous Interface Theories and Time Triggered
Scheduling. Vol. 7273, Springer, 2012, pp. 203–18, doi:10.1007/978-3-642-30793-5_13.
short: B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer,
2012, pp. 203–218.
conference:
end_date: 2012-06-16
location: Stockholm, Sweden
name: 'FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS:
Formal Methods for Open Object-Based Distributed Systems '
start_date: 2012-06-13
date_created: 2018-12-11T12:01:43Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:26Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-30793-5_13
file:
- access_level: open_access
checksum: feae2e07f2d9a59843f8ddabf25d179f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:25Z
date_updated: 2020-07-14T12:46:01Z
file_id: '4879'
file_name: IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf
file_size: 493198
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 7273'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 203 - 218
publication_status: published
publisher: Springer
publist_id: '3539'
pubrep_id: '88'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synchronous interface theories and time triggered scheduling
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7273
year: '2012'
...
---
_id: '3159'
abstract:
- lang: eng
text: The structure of hierarchical networks in biological and physical systems
has long been characterized using the Horton-Strahler ordering scheme. The scheme
assigns an integer order to each edge in the network based on the topology of
branching such that the order increases from distal parts of the network (e.g.,
mountain streams or capillaries) to the "root" of the network (e.g.,
the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied
to networks with loops because they they create a contradiction in the edge ordering
in terms of which edge precedes another in the hierarchy. Here, we present a generalization
of the Horton-Strahler order to weighted planar reticular networks, where weights
are assumed to correlate with the importance of network edges, e.g., weights estimated
from edge widths may correlate to flow capacity. Our method assigns hierarchical
levels not only to edges of the network, but also to its loops, and classifies
the edges into reticular edges, which are responsible for loop formation, and
tree edges. In addition, we perform a detailed and rigorous theoretical analysis
of the sensitivity of the hierarchical levels to weight perturbations. In doing
so, we show that the ordering of the reticular edges is more robust to noise in
weight estimation than is the ordering of the tree edges. We discuss applications
of this generalized Horton-Strahler ordering to the study of leaf venation and
other biological networks.
acknowledgement: "his work was supported by the National Science Foundation Plant
Genome Research Program (grant 0820624 to H.E. and J.S.W.), the Defense Advanced
Projects Research Agency (grant HR0011-09-1-0055 to H.E. and J.S.W.), and the European
Science Foundation (under the Research Networking Programme on “Applied and Computational
Algebraic Topology” run by H.E.). Joshua S. Weitz, Ph.D., holds a Career Award at
the Scientific Interface from the Burroughs Wellcome Fund.\r\n\r\n\r\n\r\nDuring
preparation of this manuscript the authors became aware of a related work by Katifori
and Magnasco (arXiv:1110.1412v1), concurrently submitted and accepted for publication
in PLoS ONE."
article_number: e36715
author:
- first_name: Yuriy
full_name: Mileyko, Yuriy
last_name: Mileyko
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Charles
full_name: Price, Charles
last_name: Price
- first_name: Joshua
full_name: Weitz, Joshua
last_name: Weitz
citation:
ama: Mileyko Y, Edelsbrunner H, Price C, Weitz J. Hierarchical ordering of reticular
networks. PLoS One. 2012;7(6). doi:10.1371/journal.pone.0036715
apa: Mileyko, Y., Edelsbrunner, H., Price, C., & Weitz, J. (2012). Hierarchical
ordering of reticular networks. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036715
chicago: Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz.
“Hierarchical Ordering of Reticular Networks.” PLoS One. Public Library
of Science, 2012. https://doi.org/10.1371/journal.pone.0036715.
ieee: Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering
of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science,
2012.
ista: Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of
reticular networks. PLoS One. 7(6), e36715.
mla: Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” PLoS
One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.
short: Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).
date_created: 2018-12-11T12:01:44Z
date_published: 2012-06-06T00:00:00Z
date_updated: 2021-01-12T07:41:28Z
day: '06'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1371/journal.pone.0036715
file:
- access_level: open_access
checksum: 515a98ad72e470752f03f13663dcaff8
content_type: application/pdf
creator: kschuh
date_created: 2019-02-05T12:38:43Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5922'
file_name: 2012_PLoS_Mileyko.PDF
file_size: 541583
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3530'
pubrep_id: '385'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hierarchical ordering of reticular networks
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: 7
year: '2012'
...