---
_id: '2477'
abstract:
- lang: eng
text: Dynamic activity of glia has repeatedly been demonstrated, but if such activity
is independent from neuronal activity, glia would not have any role in the information
processing in the brain or in the generation of animal behavior. Evidence for
neurons communicating with glia is solid, but the signaling pathway leading back
from glial-to-neuronal activity was often difficult to study. Here, we introduced
a transgenic mouse line in which channelrhodopsin-2, a light-gated cation channel,
was expressed in astrocytes. Selective photostimulation of these astrocytes in
vivo triggered neuronal activation. Using slice preparations, we show that glial
photostimulation leads to release of glutamate, which was sufficient to activate
AMPA receptors on Purkinje cells and to induce long-term depression of parallel
fiber-to-Purkinje cell synapses through activation of metabotropic glutamate receptors.
In contrast to neuronal synaptic vesicular release, glial activation likely causes
preferential activation of extrasynaptic receptors that appose glial membrane.
Finally, we show that neuronal activation by glial stimulation can lead to perturbation
of cerebellar modulated motor behavior. These findings demonstrate that glia can
modulate the tone of neuronal activity and behavior. This animal model is expected
to be a potentially powerful approach to study the role of glia in brain function.
author:
- first_name: Takuya
full_name: Sasaki, Takuya
last_name: Sasaki
- first_name: Kaoru
full_name: Beppu, Kaoru
last_name: Beppu
- first_name: Kenji
full_name: Tanaka, Kenji F
last_name: Tanaka
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Ko
full_name: Matsui, Ko
last_name: Matsui
citation:
ama: Sasaki T, Beppu K, Tanaka K, Fukazawa Y, Shigemoto R, Matsui K. Application
of an optogenetic byway for perturbing neuronal activity via glial photostimulation.
PNAS. 2012;109(50):20720-20725. doi:10.1073/pnas.1213458109
apa: Sasaki, T., Beppu, K., Tanaka, K., Fukazawa, Y., Shigemoto, R., & Matsui,
K. (2012). Application of an optogenetic byway for perturbing neuronal activity
via glial photostimulation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1213458109
chicago: Sasaki, Takuya, Kaoru Beppu, Kenji Tanaka, Yugo Fukazawa, Ryuichi Shigemoto,
and Ko Matsui. “Application of an Optogenetic Byway for Perturbing Neuronal Activity
via Glial Photostimulation.” PNAS. National Academy of Sciences, 2012.
https://doi.org/10.1073/pnas.1213458109.
ieee: T. Sasaki, K. Beppu, K. Tanaka, Y. Fukazawa, R. Shigemoto, and K. Matsui,
“Application of an optogenetic byway for perturbing neuronal activity via glial
photostimulation,” PNAS, vol. 109, no. 50. National Academy of Sciences,
pp. 20720–20725, 2012.
ista: Sasaki T, Beppu K, Tanaka K, Fukazawa Y, Shigemoto R, Matsui K. 2012. Application
of an optogenetic byway for perturbing neuronal activity via glial photostimulation.
PNAS. 109(50), 20720–20725.
mla: Sasaki, Takuya, et al. “Application of an Optogenetic Byway for Perturbing
Neuronal Activity via Glial Photostimulation.” PNAS, vol. 109, no. 50,
National Academy of Sciences, 2012, pp. 20720–25, doi:10.1073/pnas.1213458109.
short: T. Sasaki, K. Beppu, K. Tanaka, Y. Fukazawa, R. Shigemoto, K. Matsui, PNAS
109 (2012) 20720–20725.
date_created: 2018-12-11T11:57:54Z
date_published: 2012-12-11T00:00:00Z
date_updated: 2021-01-12T06:57:43Z
day: '11'
doi: 10.1073/pnas.1213458109
extern: 1
intvolume: ' 109'
issue: '50'
month: '12'
page: 20720 - 20725
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '4424'
quality_controlled: 0
status: public
title: Application of an optogenetic byway for perturbing neuronal activity via glial
photostimulation
type: journal_article
volume: 109
year: '2012'
...
---
_id: '2474'
abstract:
- lang: eng
text: 'Interneurons are critical for neuronal circuit function, but how their dendritic
morphologies and membrane properties influence information flow within neuronal
circuits is largely unknown. We studied the spatiotemporal profile of synaptic
integration and short-term plasticity in dendrites of mature cerebellar stellate
cells by combining two-photon guided electrical stimulation, glutamate uncaging,
electron microscopy, and modeling. Synaptic activation within thin (0.4 μm) dendrites
produced somatic responses that became smaller and slower with increasing distance
from the soma, sublinear subthreshold input-output relationships, and a somatodendritic
gradient of short-term plasticity. Unlike most studies showing that neurons employ
active dendritic mechanisms, we found that passive cable properties of thin dendrites
determine the sublinear integration and plasticity gradient, which both result
from large dendritic depolarizations that reduce synaptic driving force. These
integrative properties allow stellate cells to act as spatiotemporal filters of
synaptic input patterns, thereby biasing their output in favor of sparse presynaptic
activity. Stellate cells are critical sources of inhibition in the cerebellum,
but how their dendrites integrate excitatory synaptic inputs is unknown. Abrahamsson
et al. show that thin dendrites and passive membrane properties of SCs promote
sublinear synaptic summation and distance-dependent short-term plasticity. '
author:
- first_name: Therese
full_name: Abrahamsson, Therese
last_name: Abrahamsson
- first_name: Laurence
full_name: Cathala, Laurence
last_name: Cathala
- first_name: Ko
full_name: Matsui, Ko
last_name: Matsui
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: David
full_name: DiGregorio, David A
last_name: Digregorio
citation:
ama: Abrahamsson T, Cathala L, Matsui K, Shigemoto R, Digregorio D. Thin dendrites
of cerebellar interneurons confer sublinear synaptic integration and a gradient
of short-term plasticity. Neuron. 2012;73(6):1159-1172. doi:10.1016/j.neuron.2012.01.027
apa: Abrahamsson, T., Cathala, L., Matsui, K., Shigemoto, R., & Digregorio,
D. (2012). Thin dendrites of cerebellar interneurons confer sublinear synaptic
integration and a gradient of short-term plasticity. Neuron. Elsevier.
https://doi.org/10.1016/j.neuron.2012.01.027
chicago: Abrahamsson, Therese, Laurence Cathala, Ko Matsui, Ryuichi Shigemoto, and
David Digregorio. “Thin Dendrites of Cerebellar Interneurons Confer Sublinear
Synaptic Integration and a Gradient of Short-Term Plasticity.” Neuron.
Elsevier, 2012. https://doi.org/10.1016/j.neuron.2012.01.027.
ieee: T. Abrahamsson, L. Cathala, K. Matsui, R. Shigemoto, and D. Digregorio, “Thin
dendrites of cerebellar interneurons confer sublinear synaptic integration and
a gradient of short-term plasticity,” Neuron, vol. 73, no. 6. Elsevier,
pp. 1159–1172, 2012.
ista: Abrahamsson T, Cathala L, Matsui K, Shigemoto R, Digregorio D. 2012. Thin
dendrites of cerebellar interneurons confer sublinear synaptic integration and
a gradient of short-term plasticity. Neuron. 73(6), 1159–1172.
mla: Abrahamsson, Therese, et al. “Thin Dendrites of Cerebellar Interneurons Confer
Sublinear Synaptic Integration and a Gradient of Short-Term Plasticity.” Neuron,
vol. 73, no. 6, Elsevier, 2012, pp. 1159–72, doi:10.1016/j.neuron.2012.01.027.
short: T. Abrahamsson, L. Cathala, K. Matsui, R. Shigemoto, D. Digregorio, Neuron
73 (2012) 1159–1172.
date_created: 2018-12-11T11:57:52Z
date_published: 2012-03-22T00:00:00Z
date_updated: 2021-01-12T06:57:42Z
day: '22'
doi: 10.1016/j.neuron.2012.01.027
extern: 1
intvolume: ' 73'
issue: '6'
month: '03'
page: 1159 - 1172
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '4427'
quality_controlled: 0
status: public
title: Thin dendrites of cerebellar interneurons confer sublinear synaptic integration
and a gradient of short-term plasticity
type: journal_article
volume: 73
year: '2012'
...
---
_id: '2515'
abstract:
- lang: eng
text: We investigated the temporal and spatial expression of SK2 in the developing
mouse hippocampus using molecular and biochemical techniques, quantitative immunogold
electron microscopy, and electrophysiology. The mRNA encoding SK2 was expressed
in the developing and adult hippocampus. Western blotting and immunohistochemistry
showed that SK2 protein increased with age. This was accompanied by a shift in
subcellular localization. Early in development (P5), SK2 was predominantly localized
to the endoplasmic reticulum in the pyramidal cell layer. But by P30 SK2 was almost
exclusively expressed in the dendrites and spines. The level of SK2 at the postsynaptic
density (PSD) also increased during development. In the adult, SK2 expression
on the spine plasma membrane showed a proximal-to-distal gradient. Consistent
with this redistribution and gradient of SK2, the selective SK channel blocker
apamin increased evoked excitatory postsynaptic potentials (EPSPs) only in CA1
pyramidal neurons from mice older than P15. However, the effect of apamin on EPSPs
was not different between synapses in proximal or distal stratum radiatum or stratum
lacunosum-moleculare in adult. These results show a developmental increase and
gradient in SK2-containing channel surface expression that underlie their influence
on neurotransmission, and that may contribute to increased memory acquisition
during early development.
author:
- first_name: Carmen
full_name: Ballesteros-Merino, Carmen
last_name: Ballesteros Merino
- first_name: Michael
full_name: Lin, Michael
last_name: Lin
- first_name: Wendy
full_name: Wu, Wendy W
last_name: Wu
- first_name: Clotilde
full_name: Ferrándiz-Huertas, Clotilde
last_name: Ferrándiz Huertas
- first_name: María
full_name: Cabañero, María José
last_name: Cabañero
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: James
full_name: Maylie, James G
last_name: Maylie
- first_name: John
full_name: Adelman, John P
last_name: Adelman
- first_name: Rafael
full_name: Luján, Rafael
last_name: Luján
citation:
ama: Ballesteros Merino C, Lin M, Wu W, et al. Developmental profile of SK2 channel
expression and function in CA1 neurons. Hippocampus. 2012;22(6):1467-1480.
doi:10.1002/hipo.20986
apa: Ballesteros Merino, C., Lin, M., Wu, W., Ferrándiz Huertas, C., Cabañero, M.,
Watanabe, M., … Luján, R. (2012). Developmental profile of SK2 channel expression
and function in CA1 neurons. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.20986
chicago: Ballesteros Merino, Carmen, Michael Lin, Wendy Wu, Clotilde Ferrándiz Huertas,
María Cabañero, Masahiko Watanabe, Yugo Fukazawa, et al. “ Developmental Profile
of SK2 Channel Expression and Function in CA1 Neurons.” Hippocampus. Wiley-Blackwell,
2012. https://doi.org/10.1002/hipo.20986.
ieee: C. Ballesteros Merino et al., “ Developmental profile of SK2 channel
expression and function in CA1 neurons,” Hippocampus, vol. 22, no. 6. Wiley-Blackwell,
pp. 1467–1480, 2012.
ista: Ballesteros Merino C, Lin M, Wu W, Ferrándiz Huertas C, Cabañero M, Watanabe
M, Fukazawa Y, Shigemoto R, Maylie J, Adelman J, Luján R. 2012. Developmental
profile of SK2 channel expression and function in CA1 neurons. Hippocampus. 22(6),
1467–1480.
mla: Ballesteros Merino, Carmen, et al. “ Developmental Profile of SK2 Channel Expression
and Function in CA1 Neurons.” Hippocampus, vol. 22, no. 6, Wiley-Blackwell,
2012, pp. 1467–80, doi:10.1002/hipo.20986.
short: C. Ballesteros Merino, M. Lin, W. Wu, C. Ferrándiz Huertas, M. Cabañero,
M. Watanabe, Y. Fukazawa, R. Shigemoto, J. Maylie, J. Adelman, R. Luján, Hippocampus
22 (2012) 1467–1480.
date_created: 2018-12-11T11:58:07Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T06:57:57Z
day: '01'
doi: 10.1002/hipo.20986
extern: 1
intvolume: ' 22'
issue: '6'
month: '06'
page: 1467 - 1480
publication: Hippocampus
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4386'
quality_controlled: 0
status: public
title: ' Developmental profile of SK2 channel expression and function in CA1 neurons'
type: journal_article
volume: 22
year: '2012'
...
---
_id: '2514'
abstract:
- lang: eng
text: Visual information must be relayed through the lateral geniculate nucleus
before it reaches the visual cortex. However, not all spikes created in the retina
lead to postsynaptic spikes and properties of the retinogeniculate synapse contribute
to this filtering. To understand the mechanisms underlying this filtering process,
we conducted electrophysiology to assess the properties of signal transmission
in the Long-Evans rat. We also performed SDS-digested freeze-fracture replica
labeling to quantify the receptor and transporter distribution, as well as EM
reconstruction to describe the 3D structure. To analyze the impact of transmitter
diffusion on the activity of the receptors, simulations were integrated. We identified
that a large contributor to the filtering is the marked paired-pulse depression
at this synapse, which was intensified by the morphological characteristics of
the contacts. The broad presynaptic and postsynaptic contact area restricts transmitter
diffusion two dimensionally. Additionally, the presence of multiple closely arranged
release sites invites intersynaptic spillover, which causes desensitization of
AMPA receptors. The presence of AMPA receptors that slowly recover from desensitization
along with the high presynaptic release probability and multivesicular release
at each synapse also contribute to the depression. These features contrast with
many other synapses where spatiotemporal spread of transmitter is limited by rapid
transmitter clearance allowing synapses to operate more independently. We propose
that the micrometer-order structure can ultimately affect the visual information
processing.
author:
- first_name: Timotheus
full_name: Budisantoso, Timotheus
last_name: Budisantoso
- first_name: Ko
full_name: Matsui, Ko
last_name: Matsui
- first_name: Naomi
full_name: Kamasawa, Naomi
last_name: Kamasawa
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: Budisantoso T, Matsui K, Kamasawa N, Fukazawa Y, Shigemoto R. Mechanisms underlying
signal filtering at a multisynapse contact. Journal of Neuroscience. 2012;32(7):2357-2376.
doi:10.1523/JNEUROSCI.5243-11.2012
apa: Budisantoso, T., Matsui, K., Kamasawa, N., Fukazawa, Y., & Shigemoto, R.
(2012). Mechanisms underlying signal filtering at a multisynapse contact. Journal
of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.5243-11.2012
chicago: Budisantoso, Timotheus, Ko Matsui, Naomi Kamasawa, Yugo Fukazawa, and Ryuichi
Shigemoto. “Mechanisms Underlying Signal Filtering at a Multisynapse Contact.”
Journal of Neuroscience. Society for Neuroscience, 2012. https://doi.org/10.1523/JNEUROSCI.5243-11.2012.
ieee: T. Budisantoso, K. Matsui, N. Kamasawa, Y. Fukazawa, and R. Shigemoto, “Mechanisms
underlying signal filtering at a multisynapse contact,” Journal of Neuroscience,
vol. 32, no. 7. Society for Neuroscience, pp. 2357–2376, 2012.
ista: Budisantoso T, Matsui K, Kamasawa N, Fukazawa Y, Shigemoto R. 2012. Mechanisms
underlying signal filtering at a multisynapse contact. Journal of Neuroscience.
32(7), 2357–2376.
mla: Budisantoso, Timotheus, et al. “Mechanisms Underlying Signal Filtering at a
Multisynapse Contact.” Journal of Neuroscience, vol. 32, no. 7, Society
for Neuroscience, 2012, pp. 2357–76, doi:10.1523/JNEUROSCI.5243-11.2012.
short: T. Budisantoso, K. Matsui, N. Kamasawa, Y. Fukazawa, R. Shigemoto, Journal
of Neuroscience 32 (2012) 2357–2376.
date_created: 2018-12-11T11:58:07Z
date_published: 2012-02-15T00:00:00Z
date_updated: 2021-01-12T06:57:57Z
day: '15'
doi: 10.1523/JNEUROSCI.5243-11.2012
extern: 1
intvolume: ' 32'
issue: '7'
month: '02'
page: 2357 - 2376
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '4387'
quality_controlled: 0
status: public
title: Mechanisms underlying signal filtering at a multisynapse contact
type: journal_article
volume: 32
year: '2012'
...
---
_id: '2689'
abstract:
- lang: eng
text: R-type calcium channels (RTCCs) are well known for their role in synaptic
plasticity, but little is known about their subcellular distribution across various
neuronal compartments. Using subtype-specific antibodies, we characterized the
regional and subcellular localization of Ca v2.3 in mice and rats at both light
and electron microscopic levels. Ca v2.3 immunogold particles were found to be
predominantly presynaptic in the interpeduncular nucleus, but postsynaptic in
other brain regions. Serial section analysis of electron microscopic images from
the hippocampal CA1 revealed a higher density of immunogold particles in the dendritic
shaft plasma membrane compared with the pyramidal cell somata. However, the labeling
densities were not significantly different among the apical, oblique, or basal
dendrites. Immunogold particles were also observed over the plasma membrane of
dendritic spines, including both synaptic and extrasynaptic sites. Individual
spine heads contained <20 immunogold particles, with an average density of
~260 immunoparticles per μm 3 spine head volume, in accordance with the density
of RTCCs estimated using calcium imaging (Sabatini and Svoboda, 2000). The Ca
v2.3 density was variable among similar-sized spine heads and did not correlate
with the density in the parent dendrite, implying that spines are individual calcium
compartments operating autonomously from their parent dendrites.
author:
- first_name: Laxmi
full_name: Parajuli, Laxmi K
last_name: Parajuli
- first_name: Chikako
full_name: Nakajima, Chikako
last_name: Nakajima
- first_name: Ákos
full_name: Kulik, Ákos
last_name: Kulik
- first_name: Ko
full_name: Matsui, Ko
last_name: Matsui
- first_name: Toni
full_name: Schneider, Toni
last_name: Schneider
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
citation:
ama: Parajuli L, Nakajima C, Kulik Á, et al. Quantitative regional and ultra structural
localization of the Ca v2 3 subunit of R type calcium channel in mouse brain.
Journal of Neuroscience. 2012;32(39):13555-13567. doi:10.1523/JNEUROSCI.1142-12.2012
apa: Parajuli, L., Nakajima, C., Kulik, Á., Matsui, K., Schneider, T., Shigemoto,
R., & Fukazawa, Y. (2012). Quantitative regional and ultra structural localization
of the Ca v2 3 subunit of R type calcium channel in mouse brain. Journal of
Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1142-12.2012
chicago: Parajuli, Laxmi, Chikako Nakajima, Ákos Kulik, Ko Matsui, Toni Schneider,
Ryuichi Shigemoto, and Yugo Fukazawa. “Quantitative Regional and Ultra Structural
Localization of the Ca v2 3 Subunit of R Type Calcium Channel in Mouse Brain.”
Journal of Neuroscience. Society for Neuroscience, 2012. https://doi.org/10.1523/JNEUROSCI.1142-12.2012.
ieee: L. Parajuli et al., “Quantitative regional and ultra structural localization
of the Ca v2 3 subunit of R type calcium channel in mouse brain,” Journal of
Neuroscience, vol. 32, no. 39. Society for Neuroscience, pp. 13555–13567,
2012.
ista: Parajuli L, Nakajima C, Kulik Á, Matsui K, Schneider T, Shigemoto R, Fukazawa
Y. 2012. Quantitative regional and ultra structural localization of the Ca v2
3 subunit of R type calcium channel in mouse brain. Journal of Neuroscience. 32(39),
13555–13567.
mla: Parajuli, Laxmi, et al. “Quantitative Regional and Ultra Structural Localization
of the Ca v2 3 Subunit of R Type Calcium Channel in Mouse Brain.” Journal of
Neuroscience, vol. 32, no. 39, Society for Neuroscience, 2012, pp. 13555–67,
doi:10.1523/JNEUROSCI.1142-12.2012.
short: L. Parajuli, C. Nakajima, Á. Kulik, K. Matsui, T. Schneider, R. Shigemoto,
Y. Fukazawa, Journal of Neuroscience 32 (2012) 13555–13567.
date_created: 2018-12-11T11:59:05Z
date_published: 2012-09-26T00:00:00Z
date_updated: 2021-01-12T06:59:04Z
day: '26'
doi: 10.1523/JNEUROSCI.1142-12.2012
extern: 1
intvolume: ' 32'
issue: '39'
month: '09'
page: 13555 - 13567
publication: Journal of Neuroscience
publication_status: published
publisher: Society for Neuroscience
publist_id: '4208'
quality_controlled: 0
status: public
title: Quantitative regional and ultra structural localization of the Ca v2 3 subunit
of R type calcium channel in mouse brain
type: journal_article
volume: 32
year: '2012'
...
---
_id: '2687'
abstract:
- lang: eng
text: Left-right asymmetry of human brain function has been known for a century,
although much of molecular and cellular basis of brain laterality remains to be
elusive. Recent studies suggest that hippocampal CA3-CA1 excitatory synapses are
asymmetrically arranged, however, the functional implication of the asymmetrical
circuitry has not been studied at the behavioral level. In order to address the
left-right asymmetry of hippocampal function in behaving mice, we analyzed the
performance of "split-brain" mice in the Barnes maze. The "split-brain"
mice received ventral hippocampal commissure and corpus callosum transection in
addition to deprivation of visual input from one eye. In such mice, the hippocampus
in the side of visual deprivation receives sensory-driven input. Better spatial
task performance was achieved by the mice which were forced to use the right hippocampus
than those which were forced to use the left hippocampus. In two-choice spatial
maze, forced usage of left hippocampus resulted in a comparable performance to
the right counterpart, suggesting that both hippocampal hemispheres are capable
of conducting spatial learning. Therefore, the results obtained from the Barnes
maze suggest that the usage of the right hippocampus improves the accuracy of
spatial memory. Performance of non-spatial yet hippocampus-dependent tasks (e.g.
fear conditioning) was not influenced by the laterality of the hippocampus.
author:
- first_name: Yoshiaki
full_name: Shinohara, Yoshiaki
last_name: Shinohara
- first_name: Aki
full_name: Hosoya, Aki
last_name: Hosoya
- first_name: Nobuyuki
full_name: Yamasaki, Nobuyuki
last_name: Yamasaki
- first_name: Hassan
full_name: Ahmed, Hassan
last_name: Ahmed
- first_name: Satoko
full_name: Hattori, Satoko
last_name: Hattori
- first_name: Megumi
full_name: Eguchi, Megumi
last_name: Eguchi
- first_name: Shun
full_name: Yamaguchi, Shun
last_name: Yamaguchi
- first_name: Tsuyoshi
full_name: Miyakawa, Tsuyoshi
last_name: Miyakawa
- first_name: Hajime
full_name: Hirase, Hajime
last_name: Hirase
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: Shinohara Y, Hosoya A, Yamasaki N, et al. Right-hemispheric dominance of spatial
memory in split-brain mice. Hippocampus. 2012;22(2):117-121. doi:10.1002/hipo.20886
apa: Shinohara, Y., Hosoya, A., Yamasaki, N., Ahmed, H., Hattori, S., Eguchi, M.,
… Shigemoto, R. (2012). Right-hemispheric dominance of spatial memory in split-brain
mice. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.20886
chicago: Shinohara, Yoshiaki, Aki Hosoya, Nobuyuki Yamasaki, Hassan Ahmed, Satoko
Hattori, Megumi Eguchi, Shun Yamaguchi, Tsuyoshi Miyakawa, Hajime Hirase, and
Ryuichi Shigemoto. “Right-Hemispheric Dominance of Spatial Memory in Split-Brain
Mice.” Hippocampus. Wiley-Blackwell, 2012. https://doi.org/10.1002/hipo.20886.
ieee: Y. Shinohara et al., “Right-hemispheric dominance of spatial memory
in split-brain mice,” Hippocampus, vol. 22, no. 2. Wiley-Blackwell, pp.
117–121, 2012.
ista: Shinohara Y, Hosoya A, Yamasaki N, Ahmed H, Hattori S, Eguchi M, Yamaguchi
S, Miyakawa T, Hirase H, Shigemoto R. 2012. Right-hemispheric dominance of spatial
memory in split-brain mice. Hippocampus. 22(2), 117–121.
mla: Shinohara, Yoshiaki, et al. “Right-Hemispheric Dominance of Spatial Memory
in Split-Brain Mice.” Hippocampus, vol. 22, no. 2, Wiley-Blackwell, 2012,
pp. 117–21, doi:10.1002/hipo.20886.
short: Y. Shinohara, A. Hosoya, N. Yamasaki, H. Ahmed, S. Hattori, M. Eguchi, S.
Yamaguchi, T. Miyakawa, H. Hirase, R. Shigemoto, Hippocampus 22 (2012) 117–121.
date_created: 2018-12-11T11:59:04Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T06:59:03Z
day: '01'
doi: 10.1002/hipo.20886
extern: 1
intvolume: ' 22'
issue: '2'
month: '01'
page: 117 - 121
publication: Hippocampus
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4210'
quality_controlled: 0
status: public
title: Right-hemispheric dominance of spatial memory in split-brain mice
type: journal_article
volume: 22
year: '2012'
...
---
_id: '2688'
abstract:
- lang: eng
text: To gain insights into structure-function relationship of excitatory synapses,
we revisit our quantitative analysis of synaptic AMPAR by highly sensitive freeze-fracture
replica labeling in eight different connections. All of these connections showed
linear correlation between synapse size and AMPAR number indicating a common intra-synapse-type
relationship in CNS synapses. On the contrary, inter-synapse-type relationship
is unexpected indicating no correlation between averages of synapse size and AMPAR
number. Interestingly, connections with large average synapse size and low AMPAR
density showed high variability of AMPAR number and mosaic distribution within
the postsynaptic membrane. We propose an idea that these connections may quickly
exhibit synaptic plasticity by modifying AMPAR density/number whereas those with
high AMPAR density change their efficacy by modifying synapse size.
author:
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
citation:
ama: Fukazawa Y, Shigemoto R. Intra-synapse-type and inter-synapse-type relationships
between synaptic size and AMPAR expression. Current Opinion in Neurobiology.
2012;22(3):446-452. doi:10.1016/j.conb.2012.01.006
apa: Fukazawa, Y., & Shigemoto, R. (2012). Intra-synapse-type and inter-synapse-type
relationships between synaptic size and AMPAR expression. Current Opinion in
Neurobiology. Elsevier. https://doi.org/10.1016/j.conb.2012.01.006
chicago: Fukazawa, Yugo, and Ryuichi Shigemoto. “Intra-Synapse-Type and Inter-Synapse-Type
Relationships between Synaptic Size and AMPAR Expression.” Current Opinion
in Neurobiology. Elsevier, 2012. https://doi.org/10.1016/j.conb.2012.01.006.
ieee: Y. Fukazawa and R. Shigemoto, “Intra-synapse-type and inter-synapse-type relationships
between synaptic size and AMPAR expression,” Current Opinion in Neurobiology,
vol. 22, no. 3. Elsevier, pp. 446–452, 2012.
ista: Fukazawa Y, Shigemoto R. 2012. Intra-synapse-type and inter-synapse-type relationships
between synaptic size and AMPAR expression. Current Opinion in Neurobiology. 22(3),
446–452.
mla: Fukazawa, Yugo, and Ryuichi Shigemoto. “Intra-Synapse-Type and Inter-Synapse-Type
Relationships between Synaptic Size and AMPAR Expression.” Current Opinion
in Neurobiology, vol. 22, no. 3, Elsevier, 2012, pp. 446–52, doi:10.1016/j.conb.2012.01.006.
short: Y. Fukazawa, R. Shigemoto, Current Opinion in Neurobiology 22 (2012) 446–452.
date_created: 2018-12-11T11:59:04Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T06:59:03Z
day: '01'
doi: 10.1016/j.conb.2012.01.006
extern: 1
intvolume: ' 22'
issue: '3'
month: '06'
page: 446 - 452
publication: Current Opinion in Neurobiology
publication_status: published
publisher: Elsevier
publist_id: '4209'
quality_controlled: 0
status: public
title: Intra-synapse-type and inter-synapse-type relationships between synaptic size
and AMPAR expression
type: journal_article
volume: 22
year: '2012'
...
---
_id: '2696'
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: Erdös L. Universality for random matrices and log-gases. ArXiv. 2012.
apa: Erdös, L. (2012). Universality for random matrices and log-gases. ArXiv.
ArXiv.
chicago: Erdös, László. “Universality for Random Matrices and Log-Gases.” ArXiv.
ArXiv, 2012.
ieee: L. Erdös, “Universality for random matrices and log-gases,” ArXiv.
ArXiv, 2012.
ista: Erdös L. 2012. Universality for random matrices and log-gases. ArXiv, .
mla: Erdös, László. “Universality for Random Matrices and Log-Gases.” ArXiv,
ArXiv, 2012.
short: L. Erdös, ArXiv (2012).
date_created: 2018-12-11T11:59:07Z
date_published: 2012-12-04T00:00:00Z
date_updated: 2021-01-12T06:59:06Z
day: '04'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1212.0839
month: '12'
oa: 1
publication: ArXiv
publication_status: published
publisher: ArXiv
publist_id: '4201'
quality_controlled: 0
status: public
title: Universality for random matrices and log-gases
type: preprint
year: '2012'
...
---
_id: '2700'
alternative_title:
- Quantum Theory from Small to Large Scales
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: 'Erdös L. Lecture notes on quantum Brownian motion. In: Vol 95. Oxford University
Press; 2012:3-98.'
apa: Erdös, L. (2012). Lecture notes on quantum Brownian motion (Vol. 95, pp. 3–98).
Presented at the Les Houches Summer School 2010, Oxford University Press.
chicago: Erdös, László. “Lecture Notes on Quantum Brownian Motion,” 95:3–98. Oxford
University Press, 2012.
ieee: L. Erdös, “Lecture notes on quantum Brownian motion,” presented at the Les
Houches Summer School 2010, 2012, vol. 95, pp. 3–98.
ista: Erdös L. 2012. Lecture notes on quantum Brownian motion. Les Houches Summer
School 2010, Quantum Theory from Small to Large Scales, vol. 95, 3–98.
mla: Erdös, László. Lecture Notes on Quantum Brownian Motion. Vol. 95, Oxford
University Press, 2012, pp. 3–98.
short: L. Erdös, in:, Oxford University Press, 2012, pp. 3–98.
conference:
name: Les Houches Summer School 2010
date_created: 2018-12-11T11:59:08Z
date_published: 2012-05-24T00:00:00Z
date_updated: 2021-01-12T06:59:08Z
day: '24'
extern: 1
intvolume: ' 95'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1009.0843
month: '05'
oa: 1
page: 3 - 98
publication_status: published
publisher: Oxford University Press
publist_id: '4196'
quality_controlled: 0
status: public
title: Lecture notes on quantum Brownian motion
type: conference
volume: 95
year: '2012'
...
---
_id: '2715'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with specifications given as
Büchi (liveness) objectives. We consider the problem of computing the set of almost-sure
winning vertices from where the objective can be ensured with probability 1. We
study for the first time the average case complexity of the classical algorithm
for computing the set of almost-sure winning vertices for MDPs with Büchi objectives.
Our contributions are as follows: First, we show that for MDPs with constant out-degree
the expected number of iterations is at most logarithmic and the average case
running time is linear (as compared to the worst case linear number of iterations
and quadratic time complexity). Second, for the average case analysis over all
MDPs we show that the expected number of iterations is constant and the average
case running time is linear (again as compared to the worst case linear number
of iterations and quadratic time complexity). Finally we also show that given
that all MDPs are equally likely, the probability that the classical algorithm
requires more than constant number of iterations is exponentially small.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Manas
full_name: Joglekar, Manas
last_name: Joglekar
- first_name: Nisarg
full_name: Shah, Nisarg
last_name: Shah
citation:
ama: 'Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm
for Markov decision processes with Büchi objectives. In: Vol 18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2012:461-473. doi:10.4230/LIPIcs.FSTTCS.2012.461'
apa: 'Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis
of the classical algorithm for Markov decision processes with Büchi objectives
(Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology
and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461'
chicago: Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case
Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,”
18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461.
ieee: 'K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives,” presented at the
FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad,
India, 2012, vol. 18, pp. 461–473.'
ista: 'Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.'
mla: Chatterjee, Krishnendu, et al. Average Case Analysis of the Classical Algorithm
for Markov Decision Processes with Büchi Objectives. Vol. 18, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2012, pp. 461–73, doi:10.4230/LIPIcs.FSTTCS.2012.461.
short: K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012, pp. 461–473.
conference:
end_date: 2012-12-17
location: Hyderabad, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2012-12-15
date_created: 2018-12-11T11:59:13Z
date_published: 2012-12-10T00:00:00Z
date_updated: 2023-02-23T10:06:04Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2012.461
ec_funded: 1
file:
- access_level: open_access
checksum: d4d644ed1a885dbfc4fa1ef4c5724dab
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:53Z
date_updated: 2020-07-14T12:45:45Z
file_id: '5040'
file_name: IST-2016-525-v1+1_42_1_.pdf
file_size: 519040
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 461 - 473
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4180'
pubrep_id: '525'
quality_controlled: '1'
related_material:
record:
- id: '1598'
relation: later_version
status: public
scopus_import: 1
status: public
title: Average case analysis of the classical algorithm for Markov decision processes
with Büchi objectives
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2012'
...
---
_id: '10904'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω-regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on VASS (vector addition systems
with states). Second, we present an optimal symbolic and incremental algorithm
to compute a finite-memory winning strategy (if one exists) in such games. Finally,
we give a complete characterization of when finite memory of strategies can be
traded off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: 'Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23,
FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft
faculty fellowship.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
citation:
ama: 'Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional
quantitative objectives. In: Koutny M, Ulidowski I, eds. CONCUR 2012 - Concurrency
Theory. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:10.1007/978-3-642-32940-1_10'
apa: 'Chatterjee, K., Randour, M., & Raskin, J.-F. (2012). Strategy synthesis
for multi-dimensional quantitative objectives. In M. Koutny & I. Ulidowski
(Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin,
Heidelberg: Springer. https://doi.org/10.1007/978-3-642-32940-1_10'
chicago: 'Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy
Synthesis for Multi-Dimensional Quantitative Objectives.” In CONCUR 2012 -
Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31.
Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-32940-1_10.'
ieee: K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle
upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
ista: 'Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional
quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference
on Concurrency Theory, LNCS, vol. 7454, 115–131.'
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny
and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.
short: K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.),
CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
conference:
end_date: 2012-09-07
location: Newcastle upon Tyne, United Kingdom
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2012-09-04
date_created: 2022-03-21T08:00:21Z
date_published: 2012-09-15T00:00:00Z
date_updated: 2023-02-23T10:55:06Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-32940-1_10
ec_funded: 1
editor:
- first_name: Maciej
full_name: Koutny, Maciej
last_name: Koutny
- first_name: Irek
full_name: Ulidowski, Irek
last_name: Ulidowski
external_id:
arxiv:
- '1201.5073'
intvolume: ' 7454'
language:
- iso: eng
month: '09'
oa_version: Preprint
page: 115-131
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: CONCUR 2012 - Concurrency Theory
publication_identifier:
eisbn:
- '9783642329401'
isbn:
- '9783642329395'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '2716'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7454
year: '2012'
...
---
_id: '2770'
abstract:
- lang: eng
text: 'Consider N×N Hermitian or symmetric random matrices H with independent entries,
where the distribution of the (i,j) matrix element is given by the probability
measure vij with zero expectation and with variance σ ιj 2. We assume that the
variances satisfy the normalization condition Σiσij2=1 for all j and that there
is a positive constant c such that c≤Nσ ιj 2 ιc -1. We further assume that the
probability distributions νij have a uniform subexponential decay. We prove that
the Stieltjes transform of the empirical eigenvalue distribution of H is given
by the Wigner semicircle law uniformly up to the edges of the spectrum with an
error of order (Nη) -1 where η is the imaginary part of the spectral parameter
in the Stieltjes transform. There are three corollaries to this strong local semicircle
law: (1) Rigidity of eigenvalues: If γj=γj,N denotes the classical location of
the j-th eigenvalue under the semicircle law ordered in increasing order, then
the j-th eigenvalue λj is close to γj in the sense that for some positive constants
C, c P{double-struck}(∃j:|λ j-γ j|≥(logN) CloglogN[min(j,N-j+1)] -1/3N -2/3)≤
C exp[-(logN) cloglogN] for N large enough. (2) The proof of Dyson''s conjecture
(Dyson, 1962 [15]) which states that the time scale of the Dyson Brownian motion
to reach local equilibrium is of order N -1 up to logarithmic corrections. (3)
The edge universality holds in the sense that the probability distributions of
the largest (and the smallest) eigenvalues of two generalized Wigner ensembles
are the same in the large N limit provided that the second moments of the two
ensembles are identical.'
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Erdös L, Yau H, Yin J. Rigidity of eigenvalues of generalized Wigner matrices.
Advances in Mathematics. 2012;229(3):1435-1515. doi:10.1016/j.aim.2011.12.010
apa: Erdös, L., Yau, H., & Yin, J. (2012). Rigidity of eigenvalues of generalized
Wigner matrices. Advances in Mathematics. Academic Press. https://doi.org/10.1016/j.aim.2011.12.010
chicago: Erdös, László, Horng Yau, and Jun Yin. “Rigidity of Eigenvalues of Generalized
Wigner Matrices.” Advances in Mathematics. Academic Press, 2012. https://doi.org/10.1016/j.aim.2011.12.010.
ieee: L. Erdös, H. Yau, and J. Yin, “Rigidity of eigenvalues of generalized Wigner
matrices,” Advances in Mathematics, vol. 229, no. 3. Academic Press, pp.
1435–1515, 2012.
ista: Erdös L, Yau H, Yin J. 2012. Rigidity of eigenvalues of generalized Wigner
matrices. Advances in Mathematics. 229(3), 1435–1515.
mla: Erdös, László, et al. “Rigidity of Eigenvalues of Generalized Wigner Matrices.”
Advances in Mathematics, vol. 229, no. 3, Academic Press, 2012, pp. 1435–515,
doi:10.1016/j.aim.2011.12.010.
short: L. Erdös, H. Yau, J. Yin, Advances in Mathematics 229 (2012) 1435–1515.
date_created: 2018-12-11T11:59:30Z
date_published: 2012-02-15T00:00:00Z
date_updated: 2021-01-12T06:59:35Z
day: '15'
doi: 10.1016/j.aim.2011.12.010
extern: 1
intvolume: ' 229'
issue: '3'
month: '02'
page: 1435 - 1515
publication: Advances in Mathematics
publication_status: published
publisher: Academic Press
publist_id: '4120'
quality_controlled: 0
status: public
title: Rigidity of eigenvalues of generalized Wigner matrices
type: journal_article
volume: 229
year: '2012'
...
---
_id: '2769'
abstract:
- lang: eng
text: We present a generalization of the method of the local relaxation flow to
establish the universality of local spectral statistics of a broad class of large
random matrices. We show that the local distribution of the eigenvalues coincides
with the local statistics of the corresponding Gaussian ensemble provided the
distribution of the individual matrix element is smooth and the eigenvalues {X
J} N j=1 are close to their classical location {y j} N j=1 determined by the limiting
density of eigenvalues. Under the scaling where the typical distance between neighboring
eigenvalues is of order 1/N, the necessary apriori estimate on the location of
eigenvalues requires only to know that E|x j - γ j| 2 ≤ N-1-ε on average. This
information can be obtained by well established methods for various matrix ensembles.
We demonstrate the method by proving local spectral universality for sample covariance
matrices.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Erdös L, Schlein B, Yau H, Yin J. The local relaxation flow approach to universality
of the local statistics for random matrices. Annales de l’institut Henri Poincare
(B) Probability and Statistics. 2012;48(1):1-46. doi:10.1214/10-AIHP388
apa: Erdös, L., Schlein, B., Yau, H., & Yin, J. (2012). The local relaxation
flow approach to universality of the local statistics for random matrices. Annales
de l’institut Henri Poincare (B) Probability and Statistics. Institute of
Mathematical Statistics. https://doi.org/10.1214/10-AIHP388
chicago: Erdös, László, Benjamin Schlein, Horng Yau, and Jun Yin. “The Local Relaxation
Flow Approach to Universality of the Local Statistics for Random Matrices.” Annales
de l’institut Henri Poincare (B) Probability and Statistics. Institute of
Mathematical Statistics, 2012. https://doi.org/10.1214/10-AIHP388.
ieee: L. Erdös, B. Schlein, H. Yau, and J. Yin, “The local relaxation flow approach
to universality of the local statistics for random matrices,” Annales de l’institut
Henri Poincare (B) Probability and Statistics, vol. 48, no. 1. Institute of
Mathematical Statistics, pp. 1–46, 2012.
ista: Erdös L, Schlein B, Yau H, Yin J. 2012. The local relaxation flow approach
to universality of the local statistics for random matrices. Annales de l’institut
Henri Poincare (B) Probability and Statistics. 48(1), 1–46.
mla: Erdös, László, et al. “The Local Relaxation Flow Approach to Universality of
the Local Statistics for Random Matrices.” Annales de l’institut Henri Poincare
(B) Probability and Statistics, vol. 48, no. 1, Institute of Mathematical
Statistics, 2012, pp. 1–46, doi:10.1214/10-AIHP388.
short: L. Erdös, B. Schlein, H. Yau, J. Yin, Annales de l’institut Henri Poincare
(B) Probability and Statistics 48 (2012) 1–46.
date_created: 2018-12-11T11:59:30Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2021-01-12T06:59:34Z
day: '01'
doi: 10.1214/10-AIHP388
extern: 1
intvolume: ' 48'
issue: '1'
month: '02'
page: 1 - 46
publication: Annales de l'institut Henri Poincare (B) Probability and Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '4121'
quality_controlled: 0
status: public
title: The local relaxation flow approach to universality of the local statistics
for random matrices
type: journal_article
volume: 48
year: '2012'
...
---
_id: '2767'
abstract:
- lang: eng
text: 'Consider N × N Hermitian or symmetric random matrices H where the distribution
of the (i, j) matrix element is given by a probability measure ν ij with a subexponential
decay. Let σ ij 2 be the variance for the probability measure ν ij with the normalization
property that Σ iσ i,j 2 = 1 for all j. Under essentially the only condition that
c ≤ N σ ij 2 ≤ c -1 for some constant c > 0, we prove that, in the limit N
→ ∞, the eigenvalue spacing statistics of H in the bulk of the spectrum coincide
with those of the Gaussian unitary or orthogonal ensemble (GUE or GOE). We also
show that for band matrices with bandwidth M the local semicircle law holds to
the energy scale M -1. '
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Erdös L, Yau H, Yin J. Bulk universality for generalized Wigner matrices. Probability
Theory and Related Fields. 2012;154(1-2):341-407. doi:10.1007/s00440-011-0390-3
apa: Erdös, L., Yau, H., & Yin, J. (2012). Bulk universality for generalized
Wigner matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-011-0390-3
chicago: Erdös, László, Horng Yau, and Jun Yin. “Bulk Universality for Generalized
Wigner Matrices.” Probability Theory and Related Fields. Springer, 2012.
https://doi.org/10.1007/s00440-011-0390-3.
ieee: L. Erdös, H. Yau, and J. Yin, “Bulk universality for generalized Wigner matrices,”
Probability Theory and Related Fields, vol. 154, no. 1–2. Springer, pp.
341–407, 2012.
ista: Erdös L, Yau H, Yin J. 2012. Bulk universality for generalized Wigner matrices.
Probability Theory and Related Fields. 154(1–2), 341–407.
mla: Erdös, László, et al. “Bulk Universality for Generalized Wigner Matrices.”
Probability Theory and Related Fields, vol. 154, no. 1–2, Springer, 2012,
pp. 341–407, doi:10.1007/s00440-011-0390-3.
short: L. Erdös, H. Yau, J. Yin, Probability Theory and Related Fields 154 (2012)
341–407.
date_created: 2018-12-11T11:59:29Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T06:59:33Z
day: '01'
doi: 10.1007/s00440-011-0390-3
extern: 1
intvolume: ' 154'
issue: 1-2
month: '10'
page: 341 - 407
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '4123'
quality_controlled: 0
status: public
title: Bulk universality for generalized Wigner matrices
type: journal_article
volume: 154
year: '2012'
...
---
_id: '2768'
abstract:
- lang: eng
text: We consider a two dimensional magnetic Schrödinger operator with a spatially
stationary random magnetic field. We assume that the magnetic field has a positive
lower bound and that it has Fourier modes on arbitrarily short scales. We prove
the Wegner estimate at arbitrary energy, i. e. we show that the averaged density
of states is finite throughout the whole spectrum. We also prove Anderson localization
at the bottom of the spectrum.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: David
full_name: Hasler, David G
last_name: Hasler
citation:
ama: Erdös L, Hasler D. Wegner estimate and Anderson localization for random magnetic
fields. Communications in Mathematical Physics. 2012;309(2):507-542. doi:10.1007/s00220-011-1373-z
apa: Erdös, L., & Hasler, D. (2012). Wegner estimate and Anderson localization
for random magnetic fields. Communications in Mathematical Physics. Springer.
https://doi.org/10.1007/s00220-011-1373-z
chicago: Erdös, László, and David Hasler. “Wegner Estimate and Anderson Localization
for Random Magnetic Fields.” Communications in Mathematical Physics. Springer,
2012. https://doi.org/10.1007/s00220-011-1373-z.
ieee: L. Erdös and D. Hasler, “Wegner estimate and Anderson localization for random
magnetic fields,” Communications in Mathematical Physics, vol. 309, no.
2. Springer, pp. 507–542, 2012.
ista: Erdös L, Hasler D. 2012. Wegner estimate and Anderson localization for random
magnetic fields. Communications in Mathematical Physics. 309(2), 507–542.
mla: Erdös, László, and David Hasler. “Wegner Estimate and Anderson Localization
for Random Magnetic Fields.” Communications in Mathematical Physics, vol.
309, no. 2, Springer, 2012, pp. 507–42, doi:10.1007/s00220-011-1373-z.
short: L. Erdös, D. Hasler, Communications in Mathematical Physics 309 (2012) 507–542.
date_created: 2018-12-11T11:59:30Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T06:59:34Z
day: '01'
doi: 10.1007/s00220-011-1373-z
extern: 1
intvolume: ' 309'
issue: '2'
month: '01'
page: 507 - 542
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4122'
quality_controlled: 0
status: public
title: Wegner estimate and Anderson localization for random magnetic fields
type: journal_article
volume: 309
year: '2012'
...
---
_id: '2775'
abstract:
- lang: eng
text: The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue
statistics of large random matrices exhibit universal behavior depending only
on the symmetry class of the matrix ensemble. For invariant matrix models, the
eigenvalue distributions are given by a log-gas with potential V and inverse temperature
β = 1, 2, 4, corresponding to the orthogonal, unitary and symplectic ensembles.
For β ∉ {1, 2, 4}, there is no natural random matrix ensemble behind this model,
but the statistical physics interpretation of the log-gas is still valid for all
β > 0. The universality conjecture for invariant ensembles asserts that the
local eigenvalue statistics are independent of V. In this article, we review our
recent solution to the universality conjecture for both invariant and non-invariant
ensembles. We will also demonstrate that the local ergodicity of the Dyson Brownian
motion is the intrinsic mechanism behind the universality. Furthermore, we review
the solution of Dyson's conjecture on the local relaxation time of the Dyson Brownian
motion. Related questions such as delocalization of eigenvectors and local version
of Wigner's semicircle law will also be discussed.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
citation:
ama: Erdös L, Yau H. Universality of local spectral statistics of random matrices.
Bulletin of the American Mathematical Society. 2012;49(3):377-414. doi:10.1090/S0273-0979-2012-01372-1
apa: Erdös, L., & Yau, H. (2012). Universality of local spectral statistics
of random matrices. Bulletin of the American Mathematical Society. American
Mathematical Society. https://doi.org/10.1090/S0273-0979-2012-01372-1
chicago: Erdös, László, and Horng Yau. “Universality of Local Spectral Statistics
of Random Matrices.” Bulletin of the American Mathematical Society. American
Mathematical Society, 2012. https://doi.org/10.1090/S0273-0979-2012-01372-1.
ieee: L. Erdös and H. Yau, “Universality of local spectral statistics of random
matrices,” Bulletin of the American Mathematical Society, vol. 49, no.
3. American Mathematical Society, pp. 377–414, 2012.
ista: Erdös L, Yau H. 2012. Universality of local spectral statistics of random
matrices. Bulletin of the American Mathematical Society. 49(3), 377–414.
mla: Erdös, László, and Horng Yau. “Universality of Local Spectral Statistics of
Random Matrices.” Bulletin of the American Mathematical Society, vol. 49,
no. 3, American Mathematical Society, 2012, pp. 377–414, doi:10.1090/S0273-0979-2012-01372-1.
short: L. Erdös, H. Yau, Bulletin of the American Mathematical Society 49 (2012)
377–414.
date_created: 2018-12-11T11:59:32Z
date_published: 2012-01-30T00:00:00Z
date_updated: 2021-01-12T06:59:36Z
day: '30'
doi: 10.1090/S0273-0979-2012-01372-1
extern: 1
intvolume: ' 49'
issue: '3'
month: '01'
page: 377 - 414
publication: Bulletin of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '4115'
quality_controlled: 0
status: public
title: Universality of local spectral statistics of random matrices
type: journal_article
volume: 49
year: '2012'
...
---
_id: '2777'
abstract:
- lang: eng
text: We consider a large neutral molecule with total nuclear charge Z in a model
with self-generated classical magnetic field and where the kinetic energy of the
electrons is treated relativistically. To ensure stability, we assume that Zα
< 2/π, where α denotes the fine structure constant. We are interested in the
ground state energy in the simultaneous limit Z → ∞, α → 0 such that κ = Zα is
fixed. The leading term in the energy asymptotics is independent of κ, it is given
by the Thomas-Fermi energy of order Z7/3 and it is unchanged by including the
self-generated magnetic field. We prove the first correction term to this energy,
the so-called Scott correction of the form S(αZ)Z2. The current paper extends
the result of Solovej et al. [Commun. Pure Appl. Math.LXIII, 39-118 (2010)] on
the Scott correction for relativistic molecules to include a self-generated magnetic
field. Furthermore, we show that the corresponding Scott correction function S,
first identified by Solovej et al. [Commun. Pure Appl. Math.LXIII, 39-118 (2010)],
is unchanged by including a magnetic field. We also prove new Lieb-Thirring inequalities
for the relativistic kinetic energy with magnetic fields.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Søren
full_name: Fournais, Søren
last_name: Fournais
- first_name: Jan
full_name: Solovej, Jan P
last_name: Solovej
citation:
ama: Erdös L, Fournais S, Solovej J. Relativistic Scott correction in self-generated
magnetic fields. Journal of Mathematical Physics. 2012;53(9). doi:10.1063/1.3697417
apa: Erdös, L., Fournais, S., & Solovej, J. (2012). Relativistic Scott correction
in self-generated magnetic fields. Journal of Mathematical Physics. American
Institute of Physics. https://doi.org/10.1063/1.3697417
chicago: Erdös, László, Søren Fournais, and Jan Solovej. “Relativistic Scott Correction
in Self-Generated Magnetic Fields.” Journal of Mathematical Physics. American
Institute of Physics, 2012. https://doi.org/10.1063/1.3697417.
ieee: L. Erdös, S. Fournais, and J. Solovej, “Relativistic Scott correction in self-generated
magnetic fields,” Journal of Mathematical Physics, vol. 53, no. 9. American
Institute of Physics, 2012.
ista: Erdös L, Fournais S, Solovej J. 2012. Relativistic Scott correction in self-generated
magnetic fields. Journal of Mathematical Physics. 53(9).
mla: Erdös, László, et al. “Relativistic Scott Correction in Self-Generated Magnetic
Fields.” Journal of Mathematical Physics, vol. 53, no. 9, American Institute
of Physics, 2012, doi:10.1063/1.3697417.
short: L. Erdös, S. Fournais, J. Solovej, Journal of Mathematical Physics 53 (2012).
date_created: 2018-12-11T11:59:32Z
date_published: 2012-09-28T00:00:00Z
date_updated: 2021-01-12T06:59:37Z
day: '28'
doi: 10.1063/1.3697417
extern: 1
intvolume: ' 53'
issue: '9'
month: '09'
publication: Journal of Mathematical Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '4113'
quality_controlled: 0
status: public
title: Relativistic Scott correction in self-generated magnetic fields
type: journal_article
volume: 53
year: '2012'
...
---
_id: '2772'
abstract:
- lang: eng
text: We consider the semiclassical asymptotics of the sum of negative eigenvalues
of the three-dimensional Pauli operator with an external potential and a self-generated
magnetic field B. We also add the field energy β ∫ B 2 and we minimize over all
magnetic fields. The parameter β effectively determines the strength of the field.
We consider the weak field regime with βh 2 ≥ const > 0, where h is the semiclassical
parameter. For smooth potentials we prove that the semiclassical asymptotics of
the total energy is given by the non-magnetic Weyl term to leading order with
an error bound that is smaller by a factor h 1+e{open}, i. e. the subleading term
vanishes. However for potentials with a Coulomb singularity, the subleading term
does not vanish due to the non-semiclassical effect of the singularity. Combined
with a multiscale technique, this refined estimate is used in the companion paper
(Erdo{double acute}s et al. in Scott correction for large molecules with a self-generated
magnetic field, Preprint, 2011) to prove the second order Scott correction to
the ground state energy of large atoms and molecules.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Søren
full_name: Fournais, Søren
last_name: Fournais
- first_name: Jan
full_name: Solovej, Jan P
last_name: Solovej
citation:
ama: Erdös L, Fournais S, Solovej J. Second order semiclassics with self generated
magnetic fields. Annales Henri Poincare. 2012;13(4):671-730. doi:10.1007/s00023-011-0150-z
apa: Erdös, L., Fournais, S., & Solovej, J. (2012). Second order semiclassics
with self generated magnetic fields. Annales Henri Poincare. Birkhäuser.
https://doi.org/10.1007/s00023-011-0150-z
chicago: Erdös, László, Søren Fournais, and Jan Solovej. “Second Order Semiclassics
with Self Generated Magnetic Fields.” Annales Henri Poincare. Birkhäuser,
2012. https://doi.org/10.1007/s00023-011-0150-z.
ieee: L. Erdös, S. Fournais, and J. Solovej, “Second order semiclassics with self
generated magnetic fields,” Annales Henri Poincare, vol. 13, no. 4. Birkhäuser,
pp. 671–730, 2012.
ista: Erdös L, Fournais S, Solovej J. 2012. Second order semiclassics with self
generated magnetic fields. Annales Henri Poincare. 13(4), 671–730.
mla: Erdös, László, et al. “Second Order Semiclassics with Self Generated Magnetic
Fields.” Annales Henri Poincare, vol. 13, no. 4, Birkhäuser, 2012, pp.
671–730, doi:10.1007/s00023-011-0150-z.
short: L. Erdös, S. Fournais, J. Solovej, Annales Henri Poincare 13 (2012) 671–730.
date_created: 2018-12-11T11:59:31Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2021-01-12T06:59:36Z
day: '01'
doi: 10.1007/s00023-011-0150-z
extern: 1
intvolume: ' 13'
issue: '4'
month: '05'
page: 671 - 730
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '4118'
quality_controlled: 0
status: public
title: Second order semiclassics with self generated magnetic fields
type: journal_article
volume: 13
year: '2012'
...
---
_id: '2776'
abstract:
- lang: eng
text: We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs,
i.e. graphs on N vertices where every edge is chosen independently and with probability
p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one.
Under the assumption pN≫N2/3 , we prove the universality of eigenvalue distributions
both in the bulk and at the edge of the spectrum. More precisely, we prove (1)
that the eigenvalue spacing of the Erdős-Rényi graph in the bulk of the spectrum
has the same distribution as that of the Gaussian orthogonal ensemble; and (2)
that the second largest eigenvalue of the Erdős-Rényi graph has the same distribution
as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application
of our method, we prove the bulk universality of generalized Wigner matrices under
the assumption that the matrix entries have at least 4 + ε moments.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Antti
full_name: Knowles, Antti
last_name: Knowles
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: 'Erdös L, Knowles A, Yau H, Yin J. Spectral statistics of Erdős-Rényi graphs
II: Eigenvalue spacing and the extreme eigenvalues. Communications in Mathematical
Physics. 2012;314(3):587-640. doi:10.1007/s00220-012-1527-7'
apa: 'Erdös, L., Knowles, A., Yau, H., & Yin, J. (2012). Spectral statistics
of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. Communications
in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1527-7'
chicago: 'Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Spectral Statistics
of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues.” Communications
in Mathematical Physics. Springer, 2012. https://doi.org/10.1007/s00220-012-1527-7.'
ieee: 'L. Erdös, A. Knowles, H. Yau, and J. Yin, “Spectral statistics of Erdős-Rényi
graphs II: Eigenvalue spacing and the extreme eigenvalues,” Communications
in Mathematical Physics, vol. 314, no. 3. Springer, pp. 587–640, 2012.'
ista: 'Erdös L, Knowles A, Yau H, Yin J. 2012. Spectral statistics of Erdős-Rényi
graphs II: Eigenvalue spacing and the extreme eigenvalues. Communications in Mathematical
Physics. 314(3), 587–640.'
mla: 'Erdös, László, et al. “Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue
Spacing and the Extreme Eigenvalues.” Communications in Mathematical Physics,
vol. 314, no. 3, Springer, 2012, pp. 587–640, doi:10.1007/s00220-012-1527-7.'
short: L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics
314 (2012) 587–640.
date_created: 2018-12-11T11:59:32Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2021-01-12T06:59:37Z
day: '01'
doi: 10.1007/s00220-012-1527-7
extern: 1
intvolume: ' 314'
issue: '3'
month: '09'
page: 587 - 640
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4114'
quality_controlled: 0
status: public
title: 'Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme
eigenvalues'
type: journal_article
volume: 314
year: '2012'
...
---
_id: '2774'
abstract:
- lang: eng
text: We consider a large neutral molecule with total nuclear charge Z in non-relativistic
quantum mechanics with a self-generated classical electromagnetic field. To ensure
stability, we assume that Zα 2 ≤ κ 0 for a sufficiently small κ 0, where α denotes
the fine structure constant. We show that, in the simultaneous limit Z → ∞, α
→ 0 such that κ = Zα 2 is fixed, the ground state energy of the system is given
by a two term expansion c 1Z 7/3 + c 2(κ) Z 2 + o(Z 2). The leading term is given
by the non-magnetic Thomas-Fermi theory. Our result shows that the magnetic field
affects only the second (so-called Scott) term in the expansion.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Søren
full_name: Fournais, Søren
last_name: Fournais
- first_name: Jan
full_name: Solovej, Jan P
last_name: Solovej
citation:
ama: Erdös L, Fournais S, Solovej J. Scott correction for large atoms and molecules
in a self-generated magnetic field. Communications in Mathematical Physics.
2012;312(3):847-882. doi:10.1007/s00220-012-1468-1
apa: Erdös, L., Fournais, S., & Solovej, J. (2012). Scott correction for large
atoms and molecules in a self-generated magnetic field. Communications in Mathematical
Physics. Springer. https://doi.org/10.1007/s00220-012-1468-1
chicago: Erdös, László, Søren Fournais, and Jan Solovej. “Scott Correction for Large
Atoms and Molecules in a Self-Generated Magnetic Field.” Communications in
Mathematical Physics. Springer, 2012. https://doi.org/10.1007/s00220-012-1468-1.
ieee: L. Erdös, S. Fournais, and J. Solovej, “Scott correction for large atoms and
molecules in a self-generated magnetic field,” Communications in Mathematical
Physics, vol. 312, no. 3. Springer, pp. 847–882, 2012.
ista: Erdös L, Fournais S, Solovej J. 2012. Scott correction for large atoms and
molecules in a self-generated magnetic field. Communications in Mathematical Physics.
312(3), 847–882.
mla: Erdös, László, et al. “Scott Correction for Large Atoms and Molecules in a
Self-Generated Magnetic Field.” Communications in Mathematical Physics,
vol. 312, no. 3, Springer, 2012, pp. 847–82, doi:10.1007/s00220-012-1468-1.
short: L. Erdös, S. Fournais, J. Solovej, Communications in Mathematical Physics
312 (2012) 847–882.
date_created: 2018-12-11T11:59:31Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T06:59:36Z
day: '01'
doi: 10.1007/s00220-012-1468-1
extern: 1
intvolume: ' 312'
issue: '3'
month: '06'
page: 847 - 882
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4116'
quality_controlled: 0
status: public
title: Scott correction for large atoms and molecules in a self-generated magnetic
field
type: journal_article
volume: 312
year: '2012'
...
---
_id: '2773'
abstract:
- lang: eng
text: Recently we proved [3, 4, 6, 7, 9, 10, 11] that the eigenvalue correlation
functions of a general class of random matrices converge, weakly with respect
to the energy, to the corresponding ones of Gaussian matrices. Tao and Vu [15]
gave a proof that for the special case of Hermitian Wigner matrices the convergence
can be strengthened to vague convergence at any fixed energy in the bulk. In this
article we show that this theorem is an immediate corollary of our earlier results.
Indeed, a more general form of this theorem also follows directly from our work
[2].
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
citation:
ama: Erdös L, Yau H. A comment on the Wigner-Dyson-Mehta bulk universality conjecture
for Wigner matrices. Electronic Journal of Probability. 2012;17. doi:10.1214/EJP.v17-1779
apa: Erdös, L., & Yau, H. (2012). A comment on the Wigner-Dyson-Mehta bulk universality
conjecture for Wigner matrices. Electronic Journal of Probability. Institute
of Mathematical Statistics. https://doi.org/10.1214/EJP.v17-1779
chicago: Erdös, László, and Horng Yau. “A Comment on the Wigner-Dyson-Mehta Bulk
Universality Conjecture for Wigner Matrices.” Electronic Journal of Probability.
Institute of Mathematical Statistics, 2012. https://doi.org/10.1214/EJP.v17-1779.
ieee: L. Erdös and H. Yau, “A comment on the Wigner-Dyson-Mehta bulk universality
conjecture for Wigner matrices,” Electronic Journal of Probability, vol.
17. Institute of Mathematical Statistics, 2012.
ista: Erdös L, Yau H. 2012. A comment on the Wigner-Dyson-Mehta bulk universality
conjecture for Wigner matrices. Electronic Journal of Probability. 17.
mla: Erdös, László, and Horng Yau. “A Comment on the Wigner-Dyson-Mehta Bulk Universality
Conjecture for Wigner Matrices.” Electronic Journal of Probability, vol.
17, Institute of Mathematical Statistics, 2012, doi:10.1214/EJP.v17-1779.
short: L. Erdös, H. Yau, Electronic Journal of Probability 17 (2012).
date_created: 2018-12-11T11:59:31Z
date_published: 2012-04-10T00:00:00Z
date_updated: 2021-01-12T06:59:36Z
day: '10'
doi: 10.1214/EJP.v17-1779
extern: 1
intvolume: ' 17'
month: '04'
publication: Electronic Journal of Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '4117'
quality_controlled: 0
status: public
title: A comment on the Wigner-Dyson-Mehta bulk universality conjecture for Wigner
matrices
type: journal_article
volume: 17
year: '2012'
...
---
_id: '2771'
abstract:
- lang: eng
text: We consider a magnetic Schrödinger operator in two dimensions. The magnetic
field is given as the sum of a large and constant magnetic field and a random
magnetic field. Moreover, we allow for an additional deterministic potential as
well as a magnetic field which are both periodic. We show that the spectrum of
this operator is contained in broadened bands around the Landau levels and that
the edges of these bands consist of pure point spectrum with exponentially decaying
eigenfunctions. The proof is based on a recent Wegner estimate obtained in Erdos
and Hasler (Commun. Math. Phys., preprint, arXiv:1012.5185) and a multiscale analysis.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: David
full_name: Hasler, David G
last_name: Hasler
citation:
ama: Erdös L, Hasler D. Anderson localization at band edges for random magnetic
fields. Journal of Statistical Physics. 2012;146(5):900-923. doi:10.1007/s10955-012-0445-6
apa: Erdös, L., & Hasler, D. (2012). Anderson localization at band edges for
random magnetic fields. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-012-0445-6
chicago: Erdös, László, and David Hasler. “Anderson Localization at Band Edges for
Random Magnetic Fields.” Journal of Statistical Physics. Springer, 2012.
https://doi.org/10.1007/s10955-012-0445-6.
ieee: L. Erdös and D. Hasler, “Anderson localization at band edges for random magnetic
fields,” Journal of Statistical Physics, vol. 146, no. 5. Springer, pp.
900–923, 2012.
ista: Erdös L, Hasler D. 2012. Anderson localization at band edges for random magnetic
fields. Journal of Statistical Physics. 146(5), 900–923.
mla: Erdös, László, and David Hasler. “Anderson Localization at Band Edges for Random
Magnetic Fields.” Journal of Statistical Physics, vol. 146, no. 5, Springer,
2012, pp. 900–23, doi:10.1007/s10955-012-0445-6.
short: L. Erdös, D. Hasler, Journal of Statistical Physics 146 (2012) 900–923.
date_created: 2018-12-11T11:59:31Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T06:59:35Z
day: '01'
doi: 10.1007/s10955-012-0445-6
extern: 1
intvolume: ' 146'
issue: '5'
month: '03'
page: 900 - 923
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '4119'
quality_controlled: 0
status: public
title: Anderson localization at band edges for random magnetic fields
type: journal_article
volume: 146
year: '2012'
...
---
_id: '2778'
abstract:
- lang: eng
text: We prove the bulk universality of the β-ensembles with non-convex regular
analytic potentials for any β > 0. This removes the convexity assumption appeared
in the earlier work [P. Bourgade, L. Erdös, and H.-T. Yau, Universality of general
β-ensembles, preprint arXiv:0907.5605 (2011)]. The convexity condition enabled
us to use the logarithmic Sobolev inequality to estimate events with small probability.
The new idea is to introduce a "convexified measure" so that the local
statistics are preserved under this convexification.
author:
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
citation:
ama: Bourgade P, Erdös L, Yau H. Bulk universality of general β-ensembles with non-convex
potential. Journal of Mathematical Physics. 2012;53(9). doi:10.1063/1.4751478
apa: Bourgade, P., Erdös, L., & Yau, H. (2012). Bulk universality of general
β-ensembles with non-convex potential. Journal of Mathematical Physics.
American Institute of Physics. https://doi.org/10.1063/1.4751478
chicago: Bourgade, Paul, László Erdös, and Horng Yau. “Bulk Universality of General
β-Ensembles with Non-Convex Potential.” Journal of Mathematical Physics.
American Institute of Physics, 2012. https://doi.org/10.1063/1.4751478.
ieee: P. Bourgade, L. Erdös, and H. Yau, “Bulk universality of general β-ensembles
with non-convex potential,” Journal of Mathematical Physics, vol. 53, no.
9. American Institute of Physics, 2012.
ista: Bourgade P, Erdös L, Yau H. 2012. Bulk universality of general β-ensembles
with non-convex potential. Journal of Mathematical Physics. 53(9).
mla: Bourgade, Paul, et al. “Bulk Universality of General β-Ensembles with Non-Convex
Potential.” Journal of Mathematical Physics, vol. 53, no. 9, American Institute
of Physics, 2012, doi:10.1063/1.4751478.
short: P. Bourgade, L. Erdös, H. Yau, Journal of Mathematical Physics 53 (2012).
date_created: 2018-12-11T11:59:33Z
date_published: 2012-09-28T00:00:00Z
date_updated: 2021-01-12T06:59:38Z
day: '28'
doi: 10.1063/1.4751478
extern: 1
intvolume: ' 53'
issue: '9'
month: '09'
publication: Journal of Mathematical Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '4112'
quality_controlled: 0
status: public
title: Bulk universality of general β-ensembles with non-convex potential
type: journal_article
volume: 53
year: '2012'
...
---
_id: '2779'
abstract:
- lang: eng
text: We consider a two-dimensional magnetic Schrödinger operator on a square lattice
with a spatially stationary random magnetic field. We prove Anderson localization
near the spectral edges. We use a new approach to establish a Wegner estimate
that does not rely on the monotonicity of the energy on the random parameters.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: David
full_name: Hasler, David G
last_name: Hasler
citation:
ama: Erdös L, Hasler D. Wegner estimate for random magnetic Laplacian on ℤ 2. Annales
Henri Poincare. 2012;13(8):1719-1731. doi:10.1007/s00023-012-0177-9
apa: Erdös, L., & Hasler, D. (2012). Wegner estimate for random magnetic Laplacian
on ℤ 2. Annales Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-012-0177-9
chicago: Erdös, László, and David Hasler. “Wegner Estimate for Random Magnetic Laplacian
on ℤ 2.” Annales Henri Poincare. Birkhäuser, 2012. https://doi.org/10.1007/s00023-012-0177-9.
ieee: L. Erdös and D. Hasler, “Wegner estimate for random magnetic Laplacian on
ℤ 2,” Annales Henri Poincare, vol. 13, no. 8. Birkhäuser, pp. 1719–1731,
2012.
ista: Erdös L, Hasler D. 2012. Wegner estimate for random magnetic Laplacian on
ℤ 2. Annales Henri Poincare. 13(8), 1719–1731.
mla: Erdös, László, and David Hasler. “Wegner Estimate for Random Magnetic Laplacian
on ℤ 2.” Annales Henri Poincare, vol. 13, no. 8, Birkhäuser, 2012, pp.
1719–31, doi:10.1007/s00023-012-0177-9.
short: L. Erdös, D. Hasler, Annales Henri Poincare 13 (2012) 1719–1731.
date_created: 2018-12-11T11:59:33Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T06:59:38Z
day: '01'
doi: 10.1007/s00023-012-0177-9
extern: 1
intvolume: ' 13'
issue: '8'
month: '12'
page: 1719 - 1731
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '4111'
quality_controlled: 0
status: public
title: Wegner estimate for random magnetic Laplacian on ℤ 2
type: journal_article
volume: 13
year: '2012'
...
---
_id: '2802'
abstract:
- lang: eng
text: When a binary fluid demixes under a slow temperature ramp, nucleation, coarsening
and sedimentation of droplets lead to an oscillatory evolution of the phase-separating
system. The advection of the sedimenting droplets is found to be chaotic. The
flow is driven by density differences between two phases. Here, we show how image
processing can be combined with particle tracking to resolve droplet size and
velocity simultaneously. Droplets are used as tracer particles, and the sedimentation
velocity is determined. Taking these effects into account, droplets with radii
in the range of 4-40 μm are detected and tracked. Based on these data, we resolve
the oscillations in the droplet size distribution that are coupled to the convective
flow.
author:
- first_name: Tobias
full_name: Lapp, Tobias
last_name: Lapp
- first_name: Martin
full_name: Rohloff, Martin
last_name: Rohloff
- first_name: Jürgen
full_name: Vollmer, Jürgen T
last_name: Vollmer
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Lapp T, Rohloff M, Vollmer J, Hof B. Particle tracking for polydisperse sedimenting
droplets in phase separation. Experiments in Fluids. 2012;52(5):1187-1200.
doi:10.1007/s00348-011-1243-7
apa: Lapp, T., Rohloff, M., Vollmer, J., & Hof, B. (2012). Particle tracking
for polydisperse sedimenting droplets in phase separation. Experiments in Fluids.
Springer. https://doi.org/10.1007/s00348-011-1243-7
chicago: Lapp, Tobias, Martin Rohloff, Jürgen Vollmer, and Björn Hof. “Particle
Tracking for Polydisperse Sedimenting Droplets in Phase Separation.” Experiments
in Fluids. Springer, 2012. https://doi.org/10.1007/s00348-011-1243-7.
ieee: T. Lapp, M. Rohloff, J. Vollmer, and B. Hof, “Particle tracking for polydisperse
sedimenting droplets in phase separation,” Experiments in Fluids, vol.
52, no. 5. Springer, pp. 1187–1200, 2012.
ista: Lapp T, Rohloff M, Vollmer J, Hof B. 2012. Particle tracking for polydisperse
sedimenting droplets in phase separation. Experiments in Fluids. 52(5), 1187–1200.
mla: Lapp, Tobias, et al. “Particle Tracking for Polydisperse Sedimenting Droplets
in Phase Separation.” Experiments in Fluids, vol. 52, no. 5, Springer,
2012, pp. 1187–200, doi:10.1007/s00348-011-1243-7.
short: T. Lapp, M. Rohloff, J. Vollmer, B. Hof, Experiments in Fluids 52 (2012)
1187–1200.
date_created: 2018-12-11T11:59:40Z
date_published: 2012-05-05T00:00:00Z
date_updated: 2021-01-12T06:59:49Z
day: '05'
doi: 10.1007/s00348-011-1243-7
extern: 1
intvolume: ' 52'
issue: '5'
month: '05'
page: 1187 - 1200
publication: Experiments in Fluids
publication_status: published
publisher: Springer
publist_id: '4087'
quality_controlled: 0
status: public
title: Particle tracking for polydisperse sedimenting droplets in phase separation
type: journal_article
volume: 52
year: '2012'
...
---
_id: '2803'
abstract:
- lang: eng
text: Recent numerical studies suggest that in pipe and related shear flows, the
region of phase space separating laminar from turbulent motion is organized by
a chaotic attractor, called an edge state, which mediates the transition process.
We here confirm the existence of the edge state in laboratory experiments. We
observe that it governs the dynamics during the decay of turbulence underlining
its potential relevance for turbulence control. In addition we unveil two unstable
traveling wave solutions underlying the experimental flow fields. This observation
corroborates earlier suggestions that unstable solutions organize turbulence and
its stability border.
author:
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Fernando
full_name: Mellibovsky, Fernando
last_name: Mellibovsky
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: De Lózar A, Mellibovsky F, Avila M, Hof B. Edge state in pipe flow experiments.
Physical Review Letters. 2012;108(21). doi:10.1103/PhysRevLett.108.214502
apa: De Lózar, A., Mellibovsky, F., Avila, M., & Hof, B. (2012). Edge state
in pipe flow experiments. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/PhysRevLett.108.214502
chicago: De Lózar, Alberto, Fernando Mellibovsky, Marc Avila, and Björn Hof. “Edge
State in Pipe Flow Experiments.” Physical Review Letters. American Physical
Society, 2012. https://doi.org/10.1103/PhysRevLett.108.214502.
ieee: A. De Lózar, F. Mellibovsky, M. Avila, and B. Hof, “Edge state in pipe flow
experiments,” Physical Review Letters, vol. 108, no. 21. American Physical
Society, 2012.
ista: De Lózar A, Mellibovsky F, Avila M, Hof B. 2012. Edge state in pipe flow experiments.
Physical Review Letters. 108(21).
mla: De Lózar, Alberto, et al. “Edge State in Pipe Flow Experiments.” Physical
Review Letters, vol. 108, no. 21, American Physical Society, 2012, doi:10.1103/PhysRevLett.108.214502.
short: A. De Lózar, F. Mellibovsky, M. Avila, B. Hof, Physical Review Letters 108
(2012).
date_created: 2018-12-11T11:59:41Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2021-01-12T06:59:49Z
day: '21'
doi: 10.1103/PhysRevLett.108.214502
extern: 1
intvolume: ' 108'
issue: '21'
month: '05'
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4086'
quality_controlled: 0
status: public
title: Edge state in pipe flow experiments
type: journal_article
volume: 108
year: '2012'
...
---
_id: '2804'
abstract:
- lang: eng
text: The analysis of the size distribution of droplets condensing on a substrate
(breath figures) is a test ground for scaling theories. Here, we show that a faithful
description of these distributions must explicitly deal with the growth mechanisms
of the droplets. This finding establishes a gateway connecting nucleation and
growth of the smallest droplets on surfaces to gross features of the evolution
of the droplet size distribution
author:
- first_name: Johannes
full_name: Blaschke, Johannes
last_name: Blaschke
- first_name: Tobias
full_name: Lapp, Tobias
last_name: Lapp
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Jürgen
full_name: Vollmer, Jürgen T
last_name: Vollmer
citation:
ama: 'Blaschke J, Lapp T, Hof B, Vollmer J. Breath figures: Nucleation, growth,
coalescence, and the size distribution of droplets. Physical Review Letters.
2012;109(6). doi:10.1103/PhysRevLett.109.068701'
apa: 'Blaschke, J., Lapp, T., Hof, B., & Vollmer, J. (2012). Breath figures:
Nucleation, growth, coalescence, and the size distribution of droplets. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.109.068701'
chicago: 'Blaschke, Johannes, Tobias Lapp, Björn Hof, and Jürgen Vollmer. “Breath
Figures: Nucleation, Growth, Coalescence, and the Size Distribution of Droplets.”
Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.109.068701.'
ieee: 'J. Blaschke, T. Lapp, B. Hof, and J. Vollmer, “Breath figures: Nucleation,
growth, coalescence, and the size distribution of droplets,” Physical Review
Letters, vol. 109, no. 6. American Physical Society, 2012.'
ista: 'Blaschke J, Lapp T, Hof B, Vollmer J. 2012. Breath figures: Nucleation, growth,
coalescence, and the size distribution of droplets. Physical Review Letters. 109(6).'
mla: 'Blaschke, Johannes, et al. “Breath Figures: Nucleation, Growth, Coalescence,
and the Size Distribution of Droplets.” Physical Review Letters, vol. 109,
no. 6, American Physical Society, 2012, doi:10.1103/PhysRevLett.109.068701.'
short: J. Blaschke, T. Lapp, B. Hof, J. Vollmer, Physical Review Letters 109 (2012).
date_created: 2018-12-11T11:59:41Z
date_published: 2012-08-10T00:00:00Z
date_updated: 2021-01-12T06:59:50Z
day: '10'
doi: 10.1103/PhysRevLett.109.068701
extern: 1
intvolume: ' 109'
issue: '6'
month: '08'
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4085'
quality_controlled: 0
status: public
title: 'Breath figures: Nucleation, growth, coalescence, and the size distribution
of droplets'
type: journal_article
volume: 109
year: '2012'
...
---
_id: '2825'
abstract:
- lang: eng
text: 'We study the problem of maximum marginal prediction (MMP) in probabilistic
graphical models, a task that occurs, for example, as the Bayes optimal decision
rule under a Hamming loss. MMP is typically performed as a two-stage procedure:
one estimates each variable''s marginal probability and then forms a prediction
from the states of maximal probability. In this work we propose a simple yet effective
technique for accelerating MMP when inference is sampling-based: instead of the
above two-stage procedure we directly estimate the posterior probability of each
decision variable. This allows us to identify the point of time when we are sufficiently
certain about any individual decision. Whenever this is the case, we dynamically
prune the variables we are confident about from the underlying factor graph. Consequently,
at any time only samples of variables whose decision is still uncertain need to
be created. Experiments in two prototypical scenarios, multi-label classification
and image inpainting, show that adaptive sampling can drastically accelerate MMP
without sacrificing prediction accuracy.'
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Lampert C. Dynamic pruning of factor graphs for maximum marginal prediction.
In: Vol 1. Neural Information Processing Systems; 2012:82-90.'
apa: 'Lampert, C. (2012). Dynamic pruning of factor graphs for maximum marginal
prediction (Vol. 1, pp. 82–90). Presented at the NIPS: Neural Information Processing
Systems, Lake Tahoe, NV, United States: Neural Information Processing Systems.'
chicago: Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal
Prediction,” 1:82–90. Neural Information Processing Systems, 2012.
ieee: 'C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,”
presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV,
United States, 2012, vol. 1, pp. 82–90.'
ista: 'Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction.
NIPS: Neural Information Processing Systems vol. 1, 82–90.'
mla: Lampert, Christoph. Dynamic Pruning of Factor Graphs for Maximum Marginal
Prediction. Vol. 1, Neural Information Processing Systems, 2012, pp. 82–90.
short: C. Lampert, in:, Neural Information Processing Systems, 2012, pp. 82–90.
conference:
end_date: 2012-12-06
location: Lake Tahoe, NV, United States
name: 'NIPS: Neural Information Processing Systems'
start_date: 2012-12-03
date_created: 2018-12-11T11:59:48Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T06:59:59Z
day: '01'
department:
- _id: ChLa
intvolume: ' 1'
language:
- iso: eng
month: '12'
oa_version: None
page: 82 - 90
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '3975'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dynamic pruning of factor graphs for maximum marginal prediction
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2012'
...
---
_id: '2848'
abstract:
- lang: eng
text: We study evolutionary game theory in a setting where individuals learn from
each other. We extend the traditional approach by assuming that a population contains
individuals with different learning abilities. In particular, we explore the situation
where individuals have different search spaces, when attempting to learn the strategies
of others. The search space of an individual specifies the set of strategies learnable
by that individual. The search space is genetically given and does not change
under social evolutionary dynamics. We introduce a general framework and study
a specific example in the context of direct reciprocity. For this example, we
obtain the counter intuitive result that cooperation can only evolve for intermediate
benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection.
Our paper is a step toward making a connection between computational learning
theory and evolutionary game dynamics.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 2012;301:161-173.
doi:10.1016/j.jtbi.2012.02.021
apa: Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics
in populations with different learners. Journal of Theoretical Biology.
Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021
chicago: Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary
Game Dynamics in Populations with Different Learners.” Journal of Theoretical
Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.
ieee: K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations
with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier,
pp. 161–173, 2012.
ista: Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 301, 161–173.
mla: Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with
Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier,
2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.
short: K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301
(2012) 161–173.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2021-01-12T07:00:12Z
day: '21'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jtbi.2012.02.021
ec_funded: 1
external_id:
pmid:
- '22394652'
intvolume: ' 301'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/
month: '05'
oa: 1
oa_version: Submitted Version
page: 161 - 173
pmid: 1
project:
- _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: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '3946'
quality_controlled: '1'
scopus_import: 1
status: public
title: Evolutionary game dynamics in populations with different learners
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 301
year: '2012'
...
---
_id: '2849'
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Nataliya
full_name: Strelkova, Nataliya
last_name: Strelkova
citation:
ama: Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal
trees. Russian Mathematical Surveys. 2012;67(6):1167-1168. doi:10.1070/RM2012v067n06ABEH004820
apa: Edelsbrunner, H., & Strelkova, N. (2012). On the configuration space of
Steiner minimal trees. Russian Mathematical Surveys. IOP Publishing Ltd.
https://doi.org/10.1070/RM2012v067n06ABEH004820
chicago: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
of Steiner Minimal Trees.” Russian Mathematical Surveys. IOP Publishing
Ltd., 2012. https://doi.org/10.1070/RM2012v067n06ABEH004820.
ieee: H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal
trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing Ltd.,
pp. 1167–1168, 2012.
ista: Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal
trees. Russian Mathematical Surveys. 67(6), 1167–1168.
mla: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
of Steiner Minimal Trees.” Russian Mathematical Surveys, vol. 67, no. 6,
IOP Publishing Ltd., 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.
short: H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:13Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1070/RM2012v067n06ABEH004820
file:
- access_level: open_access
checksum: 44ee8d173487e8ed41a51136816bbeb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:26Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5078'
file_name: IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf
file_size: 392021
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 67'
issue: '6'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 1167 - 1168
publication: Russian Mathematical Surveys
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '3943'
pubrep_id: '546'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the configuration space of Steiner minimal trees
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2012'
...
---
_id: '2876'
abstract:
- lang: eng
text: Cytokinin (CK) activity is regulated by the complex interplay of their metabolism,
transport, stability and cellular/tissue localization. O-glucosides of zeatin-type
CKs are postulated to be storage and/or transport forms. Active CK levels are
determined in part by their differential distribution of CK metabolites across
different subcellular compartments. We have previously shown that overexpressing
chloroplast-localized Zm-p60.1, a maize β-glucosidase capable of releasing active
cytokinins from their O- and N3-glucosides, perturbs CK homeostasis in transgenic
tobacco. We obtained tobacco (Nicotiana tabacum L., cv Petit Havana SR1) plants
overexpressing a recombinant Zm-p60.1 that is targeted to the vacuole. The protein
is correctly processed and localized to the vacuole. When grown on medium containing
exogenous zeatin, transgenic seedlings rapidly accumulate fresh weight due to
ectopic growths at the base of the hypocotyl. The presence of the enzyme in these
ectopic structures is shown by histochemical staining. CK quantification reveals
that these transgenic seedlings are unable to accumulate zeatin-O-glucoside to
levels similar to those observed in the wild type. When crossed with tobacco overexpressing
the zeatin-O-glucosyltransferase gene from Phaseolus, the vacuolar variant shows
an almost complete reversion in the root elongation assay. This is the first evidence
from intact plants that the vacuole is the storage organelle for CK O-glucosides
and that they are available to attack by Zm-p60.1. We propose the use of Zm-p60.1
as a robust molecular tool that exploits the reversibility of O-glucosylation
and enables delicate manipulations of active CK content at the cellular level.
author:
- first_name: Nagavalli
full_name: Kiran, Nagavalli S
last_name: Kiran
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Alena
full_name: Reková, Alena
last_name: Reková
- first_name: Jaroslava
full_name: Dubová, Jaroslava
last_name: Dubová
- first_name: Jiří
full_name: Malbeck, Jiří
last_name: Malbeck
- first_name: Klaus
full_name: Palme, Klaus
last_name: Palme
- first_name: Břetislav
full_name: Brzobohatý, Břetislav
last_name: Brzobohatý
citation:
ama: Kiran N, Benková E, Reková A, et al. Retargeting a maize β-glucosidase to the
vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the
vacuole. Phytochemistry. 2012;79:67-77. doi:10.1016/j.phytochem.2012.03.012
apa: Kiran, N., Benková, E., Reková, A., Dubová, J., Malbeck, J., Palme, K., &
Brzobohatý, B. (2012). Retargeting a maize β-glucosidase to the vacuole - Evidence
from intact plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry.
Elsevier. https://doi.org/10.1016/j.phytochem.2012.03.012
chicago: Kiran, Nagavalli, Eva Benková, Alena Reková, Jaroslava Dubová, Jiří Malbeck,
Klaus Palme, and Břetislav Brzobohatý. “Retargeting a Maize β-Glucosidase to the
Vacuole - Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the
Vacuole.” Phytochemistry. Elsevier, 2012. https://doi.org/10.1016/j.phytochem.2012.03.012.
ieee: N. Kiran et al., “Retargeting a maize β-glucosidase to the vacuole
- Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole,”
Phytochemistry, vol. 79. Elsevier, pp. 67–77, 2012.
ista: Kiran N, Benková E, Reková A, Dubová J, Malbeck J, Palme K, Brzobohatý B.
2012. Retargeting a maize β-glucosidase to the vacuole - Evidence from intact
plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry. 79, 67–77.
mla: Kiran, Nagavalli, et al. “Retargeting a Maize β-Glucosidase to the Vacuole
- Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the Vacuole.”
Phytochemistry, vol. 79, Elsevier, 2012, pp. 67–77, doi:10.1016/j.phytochem.2012.03.012.
short: N. Kiran, E. Benková, A. Reková, J. Dubová, J. Malbeck, K. Palme, B. Brzobohatý,
Phytochemistry 79 (2012) 67–77.
date_created: 2018-12-11T12:00:05Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:00:25Z
day: '01'
doi: 10.1016/j.phytochem.2012.03.012
extern: 1
intvolume: ' 79'
month: '07'
page: 67 - 77
publication: Phytochemistry
publication_status: published
publisher: Elsevier
publist_id: '3886'
quality_controlled: 0
status: public
title: Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants
that zeatin-O-glucoside is stored in the vacuole
type: journal_article
volume: 79
year: '2012'
...
---
_id: '2875'
abstract:
- lang: eng
text: Phytohormones are important plant growth regulators that control many developmental
processes, such as cell division, cell differentiation, organogenesis and morphogenesis.
They regulate a multitude of apparently unrelated physiological processes, often
with overlapping roles, and they mutually modulate their effects. These features
imply important synergistic and antagonistic interactions between the various
plant hormones. Auxin and cytokinin are central hormones involved in the regulation
of plant growth and development, including processes determining root architecture,
such as root pole establishment during early embryogenesis, root meristem maintenance
and lateral root organogenesis. Thus, to control root development both pathways
put special demands on the mechanisms that balance their activities and mediate
their interactions. Here, we summarize recent knowledge on the role of auxin and
cytokinin in the regulation of root architecture with special focus on lateral
root organogenesis, discuss the latest findings on the molecular mechanisms of
their interactions, and present forward genetic screen as a tool to identify novel
molecular components of the auxin and cytokinin crosstalk.
author:
- first_name: Agnieszka
full_name: Bielach, Agnieszka
last_name: Bielach
- first_name: Jérôme
full_name: Duclercq, Jérôme
last_name: Duclercq
- first_name: Peter
full_name: Peter Marhavy
id: 3F45B078-F248-11E8-B48F-1D18A9856A87
last_name: Marhavy
orcid: 0000-0001-5227-5741
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Bielach A, Duclercq J, Marhavý P, Benková E. Genetic approach towards the identification
of auxin - cytokinin crosstalk components involved in root development. Philosophical
Transactions of the Royal Society of London Series B, Biological Sciences.
2012;367(1595):1469-1478. doi:10.1098/rstb.2011.0233
apa: Bielach, A., Duclercq, J., Marhavý, P., & Benková, E. (2012). Genetic approach
towards the identification of auxin - cytokinin crosstalk components involved
in root development. Philosophical Transactions of the Royal Society of London.
Series B, Biological Sciences. Royal Society, The. https://doi.org/10.1098/rstb.2011.0233
chicago: Bielach, Agnieszka, Jérôme Duclercq, Peter Marhavý, and Eva Benková. “Genetic
Approach towards the Identification of Auxin - Cytokinin Crosstalk Components
Involved in Root Development.” Philosophical Transactions of the Royal Society
of London. Series B, Biological Sciences. Royal Society, The, 2012. https://doi.org/10.1098/rstb.2011.0233.
ieee: A. Bielach, J. Duclercq, P. Marhavý, and E. Benková, “Genetic approach towards
the identification of auxin - cytokinin crosstalk components involved in root
development,” Philosophical Transactions of the Royal Society of London. Series
B, Biological Sciences, vol. 367, no. 1595. Royal Society, The, pp. 1469–1478,
2012.
ista: Bielach A, Duclercq J, Marhavý P, Benková E. 2012. Genetic approach towards
the identification of auxin - cytokinin crosstalk components involved in root
development. Philosophical Transactions of the Royal Society of London. Series
B, Biological Sciences. 367(1595), 1469–1478.
mla: Bielach, Agnieszka, et al. “Genetic Approach towards the Identification of
Auxin - Cytokinin Crosstalk Components Involved in Root Development.” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 367, no. 1595, Royal Society, The, 2012, pp. 1469–78, doi:10.1098/rstb.2011.0233.
short: A. Bielach, J. Duclercq, P. Marhavý, E. Benková, Philosophical Transactions
of the Royal Society of London. Series B, Biological Sciences 367 (2012) 1469–1478.
date_created: 2018-12-11T12:00:05Z
date_published: 2012-06-05T00:00:00Z
date_updated: 2021-01-12T07:00:25Z
day: '05'
doi: 10.1098/rstb.2011.0233
extern: 1
intvolume: ' 367'
issue: '1595'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3321684/
month: '06'
oa: 1
page: 1469 - 1478
publication: Philosophical Transactions of the Royal Society of London. Series B,
Biological Sciences
publication_status: published
publisher: Royal Society, The
publist_id: '3887'
quality_controlled: 0
status: public
title: Genetic approach towards the identification of auxin - cytokinin crosstalk
components involved in root development
type: journal_article
volume: 367
year: '2012'
...
---
_id: '2878'
abstract:
- lang: eng
text: Phyllotaxis, the regular arrangement of leaves and flowers around the stem,
is a key feature of plant architecture. Current models propose that the spatiotemporal
regulation of organ initiation is controlled by a positive feedback loop between
the plant hormone auxin and its efflux carrier PIN-FORMED1 (PIN1). Consequently,
pin1 mutants give rise to naked inflorescence stalks with few or no flowers, indicating
that PIN1 plays a crucial role in organ initiation. However, pin1 mutants do produce
leaves. In order to understand the regulatory mechanisms controlling leaf initiation
in Arabidopsis (Arabidopsis thaliana) rosettes, we have characterized the vegetative
pin1 phenotype in detail. We show that although the timing of leaf initiation
in vegetative pin1 mutants is variable and divergence angles clearly deviate from
the canonical 137° value, leaves are not positioned at random during early developmental
stages. Our data further indicate that other PIN proteins are unlikely to explain
the persistence of leaf initiation and positioning during pin1 vegetative development.
Thus, phyllotaxis appears to be more complex than suggested by current mechanistic
models.
author:
- first_name: Bernadette
full_name: Guenot, Bernadette
last_name: Guenot
- first_name: Emmanuelle
full_name: Bayer, Emmanuelle
last_name: Bayer
- first_name: Daniel
full_name: Kierzkowski, Daniel
last_name: Kierzkowski
- first_name: Richard
full_name: Smith, Richard S
last_name: Smith
- first_name: Therese
full_name: Mandel, Therese
last_name: Mandel
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Cris
full_name: Kuhlemeier, Cris
last_name: Kuhlemeier
citation:
ama: Guenot B, Bayer E, Kierzkowski D, et al. Pin1 independent leaf initiation in
Arabidopsis. Plant Physiology. 2012;159(4):1501-1510. doi:10.1104/pp.112.200402
apa: Guenot, B., Bayer, E., Kierzkowski, D., Smith, R., Mandel, T., Žádníková, P.,
… Kuhlemeier, C. (2012). Pin1 independent leaf initiation in Arabidopsis. Plant
Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.112.200402
chicago: Guenot, Bernadette, Emmanuelle Bayer, Daniel Kierzkowski, Richard Smith,
Therese Mandel, Petra Žádníková, Eva Benková, and Cris Kuhlemeier. “Pin1 Independent
Leaf Initiation in Arabidopsis.” Plant Physiology. American Society of
Plant Biologists, 2012. https://doi.org/10.1104/pp.112.200402.
ieee: B. Guenot et al., “Pin1 independent leaf initiation in Arabidopsis,”
Plant Physiology, vol. 159, no. 4. American Society of Plant Biologists,
pp. 1501–1510, 2012.
ista: Guenot B, Bayer E, Kierzkowski D, Smith R, Mandel T, Žádníková P, Benková
E, Kuhlemeier C. 2012. Pin1 independent leaf initiation in Arabidopsis. Plant
Physiology. 159(4), 1501–1510.
mla: Guenot, Bernadette, et al. “Pin1 Independent Leaf Initiation in Arabidopsis.”
Plant Physiology, vol. 159, no. 4, American Society of Plant Biologists,
2012, pp. 1501–10, doi:10.1104/pp.112.200402.
short: B. Guenot, E. Bayer, D. Kierzkowski, R. Smith, T. Mandel, P. Žádníková, E.
Benková, C. Kuhlemeier, Plant Physiology 159 (2012) 1501–1510.
date_created: 2018-12-11T12:00:06Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:00:26Z
day: '01'
doi: 10.1104/pp.112.200402
extern: 1
intvolume: ' 159'
issue: '4'
month: '08'
page: 1501 - 1510
publication: Plant Physiology
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3884'
quality_controlled: 0
status: public
title: Pin1 independent leaf initiation in Arabidopsis
type: journal_article
volume: 159
year: '2012'
...
---
_id: '2879'
abstract:
- lang: eng
text: Hormones, such as auxin and cytokinin, are involved in the complex molecular
network that regulates the coordinated development of plant organs. Genes controlling
ovule patterning have been identified and studied in detail; however, the roles
of auxin and cytokinin in ovule development are largely unknown. Here we show
that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin
receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3
triple mutant with severely reduced cytokinin perception, expression of the auxin
efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle
(spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3
triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin
N6-benzylaminopurine also altered both auxin distribution and patterning of the
ovule; this process required the homeodomain transcription factor BELL1 (BEL1).
Thus, this article shows that cytokinin regulates ovule development through the
regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously
described as key regulators of ovule development, are needed for the auxin and
cytokinin signaling pathways for the correct patterning of the ovule.
author:
- first_name: Stefano
full_name: Bencivenga, Stefano
last_name: Bencivenga
- first_name: Sara
full_name: Simonini, Sara
last_name: Simonini
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Lucia
full_name: Colombo, Lucia
last_name: Colombo
citation:
ama: Bencivenga S, Simonini S, Benková E, Colombo L. The transcription factors BEL1
and SPL are required for cytokinin and auxin signaling during ovule development
in Arabidopsis. Plant Cell. 2012;24(7):2886-2897. doi:10.1105/tpc.112.100164
apa: Bencivenga, S., Simonini, S., Benková, E., & Colombo, L. (2012). The transcription
factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule
development in Arabidopsis. Plant Cell. American Society of Plant Biologists.
https://doi.org/10.1105/tpc.112.100164
chicago: Bencivenga, Stefano, Sara Simonini, Eva Benková, and Lucia Colombo. “The
Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling
during Ovule Development in Arabidopsis.” Plant Cell. American Society
of Plant Biologists, 2012. https://doi.org/10.1105/tpc.112.100164.
ieee: S. Bencivenga, S. Simonini, E. Benková, and L. Colombo, “The transcription
factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule
development in Arabidopsis,” Plant Cell, vol. 24, no. 7. American Society
of Plant Biologists, pp. 2886–2897, 2012.
ista: Bencivenga S, Simonini S, Benková E, Colombo L. 2012. The transcription factors
BEL1 and SPL are required for cytokinin and auxin signaling during ovule development
in Arabidopsis. Plant Cell. 24(7), 2886–2897.
mla: Bencivenga, Stefano, et al. “The Transcription Factors BEL1 and SPL Are Required
for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” Plant
Cell, vol. 24, no. 7, American Society of Plant Biologists, 2012, pp. 2886–97,
doi:10.1105/tpc.112.100164.
short: S. Bencivenga, S. Simonini, E. Benková, L. Colombo, Plant Cell 24 (2012)
2886–2897.
date_created: 2018-12-11T12:00:06Z
date_published: 2012-07-01T00:00:00Z
date_updated: 2021-01-12T07:00:26Z
day: '01'
doi: 10.1105/tpc.112.100164
extern: 1
intvolume: ' 24'
issue: '7'
month: '07'
page: 2886 - 2897
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '3885'
quality_controlled: 0
status: public
title: The transcription factors BEL1 and SPL are required for cytokinin and auxin
signaling during ovule development in Arabidopsis
type: journal_article
volume: 24
year: '2012'
...
---
_id: '2891'
abstract:
- lang: eng
text: "Quantitative automata are nondeterministic finite automata with edge weights.
They value a\r\nrun by some function from the sequence of visited weights to the
reals, and value a word by its\r\nminimal/maximal run. They generalize boolean
automata, and have gained much attention in\r\nrecent years. Unfortunately, important
automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata,
cannot be determinized. Yet, the quantitative setting provides the potential\r\nof
approximate determinization. We define approximate determinization with respect
to\r\na distance function, and investigate this potential.\r\nWe show that sum
automata cannot be determinized approximately with respect to any\r\ndistance
function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith
respect to some distance functions.\r\nDiscounted-sum automata allow for approximate
determinization, as the influence of a word’s\r\nsuffix is decaying. However,
the naive approach, of unfolding the automaton computations up\r\nto a sufficient
level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative
construction that is singly exponential in the discount factor, in the precision,
and\r\nin the number of states. We prove matching lower bounds, showing exponential
dependency on\r\neach of these three parameters.\r\nAverage and limit-average
automata are shown to prohibit approximate determinization with\r\nrespect to
any distance function, and this is the case even for two weights, 0 and 1."
acknowledgement: We thank Laurent Doyen for great ideas and valuable help in analyzing
discounted-sum automata.
alternative_title:
- LIPIcs
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: 'Boker U, Henzinger TA. Approximate determinization of quantitative automata.
In: Leibniz International Proceedings in Informatics. Vol 18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2012:362-373. doi:10.4230/LIPIcs.FSTTCS.2012.362'
apa: 'Boker, U., & Henzinger, T. A. (2012). Approximate determinization of quantitative
automata. In Leibniz International Proceedings in Informatics (Vol. 18,
pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362'
chicago: Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative
Automata.” In Leibniz International Proceedings in Informatics, 18:362–73.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362.
ieee: U. Boker and T. A. Henzinger, “Approximate determinization of quantitative
automata,” in Leibniz International Proceedings in Informatics, Hyderabad,
India, 2012, vol. 18, pp. 362–373.
ista: 'Boker U, Henzinger TA. 2012. Approximate determinization of quantitative
automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.'
mla: Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative
Automata.” Leibniz International Proceedings in Informatics, vol. 18, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.
short: U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.
conference:
end_date: 2012-12-17
location: Hyderabad, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2012-12-15
date_created: 2018-12-11T12:00:10Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T07:00:31Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2012.362
ec_funded: 1
file:
- access_level: open_access
checksum: 88da18d3e2cb2e5011d7d10ce38a3864
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:37Z
date_updated: 2020-07-14T12:45:52Z
file_id: '4826'
file_name: IST-2017-805-v1+1_34.pdf
file_size: 559069
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 362 - 373
project:
- _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
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '3867'
pubrep_id: '805'
quality_controlled: '1'
scopus_import: 1
status: public
title: Approximate determinization of quantitative automata
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2012'
...
---
_id: '2890'
abstract:
- lang: eng
text: 'Systems are often specified using multiple requirements on their behavior.
In practice, these requirements can be contradictory. The classical approach to
specification, verification, and synthesis demands more detailed specifications
that resolve any contradictions in the requirements. These detailed specifications
are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative
frameworks allow the formalization of the intuitive idea that what is desired
is an implementation that comes "closest" to satisfying the mutually
incompatible requirements, according to a measure of fit that can be defined by
the requirements engineer. One flexible framework for quantifying how "well"
an implementation satisfies a specification is offered by simulation distances
that are parameterized by an error model. We introduce this framework, study its
properties, and provide an algorithmic solution for the following quantitative
synthesis question: given two (or more) behavioral requirements specified by possibly
incompatible finite-state machines, and an error model, find the finite-state
implementation that minimizes the maximal simulation distance to the given requirements.
Furthermore, we generalize the framework to handle infinite alphabets (for example,
realvalued domains). We also demonstrate how quantitative specifications based
on simulation distances might lead to smaller and easier to modify specifications.
Finally, we illustrate our approach using case studies on error correcting codes
and scheduler synthesis.'
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Sivakanth
full_name: Gopi, Sivakanth
last_name: Gopi
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Nishant
full_name: Totla, Nishant
last_name: Totla
citation:
ama: 'Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible
specifications. In: Proceedings of the Tenth ACM International Conference on
Embedded Software. ACM; 2012:53-62. doi:10.1145/2380356.2380371'
apa: 'Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012).
Synthesis from incompatible specifications. In Proceedings of the tenth ACM
international conference on Embedded software (pp. 53–62). Tampere, Finland:
ACM. https://doi.org/10.1145/2380356.2380371'
chicago: Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and
Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings
of the Tenth ACM International Conference on Embedded Software, 53–62. ACM,
2012. https://doi.org/10.1145/2380356.2380371.
ieee: P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis
from incompatible specifications,” in Proceedings of the tenth ACM international
conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.
ista: 'Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from
incompatible specifications. Proceedings of the tenth ACM international conference
on Embedded software. EMSOFT: Embedded Software , 53–62.'
mla: Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” Proceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012,
pp. 53–62, doi:10.1145/2380356.2380371.
short: P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp.
53–62.
conference:
end_date: 2012-10-12
location: Tampere, Finland
name: 'EMSOFT: Embedded Software '
start_date: 2012-10-07
date_created: 2018-12-11T12:00:10Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:00:30Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2380356.2380371
ec_funded: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 53 - 62
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: Proceedings of the tenth ACM international conference on Embedded software
publication_status: published
publisher: ACM
publist_id: '3868'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesis from incompatible specifications
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2888'
abstract:
- lang: eng
text: Formal verification aims to improve the quality of hardware and software by
detecting errors before they do harm. At the basis of formal verification lies
the logical notion of correctness, which purports to capture whether or not a
circuit or program behaves as desired. We suggest that the boolean partition into
correct and incorrect systems falls short of the practical need to assess the
behavior of hardware and software in a more nuanced fashion against multiple criteria.
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
citation:
ama: 'Henzinger TA. Quantitative reactive models. In: Conference Proceedings
MODELS 2012. Vol 7590. Springer; 2012:1-2. doi:10.1007/978-3-642-33666-9_1'
apa: 'Henzinger, T. A. (2012). Quantitative reactive models. In Conference proceedings
MODELS 2012 (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. https://doi.org/10.1007/978-3-642-33666-9_1'
chicago: Henzinger, Thomas A. “Quantitative Reactive Models.” In Conference Proceedings
MODELS 2012, 7590:1–2. Springer, 2012. https://doi.org/10.1007/978-3-642-33666-9_1.
ieee: T. A. Henzinger, “Quantitative reactive models,” in Conference proceedings
MODELS 2012, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.
ista: 'Henzinger TA. 2012. Quantitative reactive models. Conference proceedings
MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol.
7590, 1–2.'
mla: Henzinger, Thomas A. “Quantitative Reactive Models.” Conference Proceedings
MODELS 2012, vol. 7590, Springer, 2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.
short: T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012,
pp. 1–2.
conference:
end_date: 2012-10-05
location: Innsbruck, Austria
name: 'MODELS: Model-driven Engineering Languages and Systems'
start_date: 2012-09-30
date_created: 2018-12-11T12:00:09Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2021-01-12T07:00:29Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33666-9_1
ec_funded: 1
intvolume: ' 7590'
language:
- iso: eng
month: '09'
oa_version: None
page: 1 - 2
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 MODELS 2012
publication_status: published
publisher: Springer
publist_id: '3870'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative reactive models
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7590
year: '2012'
...
---
_id: '2903'
abstract:
- lang: eng
text: In order to enjoy a digital version of the Jordan Curve Theorem, it is common
to use the closed topology for the foreground and the open topology for the background
of a 2-dimensional binary image. In this paper, we introduce a single topology
that enjoys this theorem for all thresholds decomposing a real-valued image into
foreground and background. This topology is easy to construct and it generalizes
to n-dimensional images.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
citation:
ama: 'Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In:
IEEE; 2012:41-48. doi:10.1109/ISVD.2012.11'
apa: 'Edelsbrunner, H., & Symonova, O. (2012). The adaptive topology of a digital
image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams
in Science and Engineering, New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/ISVD.2012.11'
chicago: Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital
Image,” 41–48. IEEE, 2012. https://doi.org/10.1109/ISVD.2012.11.
ieee: 'H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,”
presented at the ISVD: International Symposium on Voronoi Diagrams in Science
and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.'
ista: 'Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image.
ISVD: International Symposium on Voronoi Diagrams in Science and Engineering,
41–48.'
mla: Edelsbrunner, Herbert, and Olga Symonova. The Adaptive Topology of a Digital
Image. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11.
short: H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.
conference:
end_date: 2012-06-29
location: 'New Brunswick, NJ, USA '
name: 'ISVD: International Symposium on Voronoi Diagrams in Science and Engineering'
start_date: 2012-06-27
date_created: 2018-12-11T12:00:15Z
date_published: 2012-08-06T00:00:00Z
date_updated: 2021-01-12T07:00:35Z
day: '06'
ddc:
- '000'
department:
- _id: HeEd
- _id: MaJö
doi: 10.1109/ISVD.2012.11
file:
- access_level: open_access
checksum: 444869a4e8abf07834f88b6e5cb5e9c3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:41Z
date_updated: 2020-07-14T12:45:52Z
file_id: '4765'
file_name: IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf
file_size: 760548
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 41 - 48
publication_status: published
publisher: IEEE
publist_id: '3844'
pubrep_id: '545'
quality_controlled: '1'
scopus_import: 1
status: public
title: The adaptive topology of a digital image
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2916'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a quantitative measure for interfaces, called interface simulation distance. It
makes the alternating refinement preorder quantitative by, intu- itively, tolerating
errors (while counting them) in the alternating simulation game. We show that
the interface simulation distance satisfies the triangle inequality, that the
distance between two interfaces does not increase under parallel composition with
a third interface, and that the distance between two interfaces can be bounded
from above and below by distances between abstractions of the two interfaces.
We illustrate the framework, and the properties of the distances under composition
of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances.
In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS;
2012:29-42. doi:10.4204/EPTCS.96.3'
apa: 'Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface
Simulation Distances. In Electronic Proceedings in Theoretical Computer Science
(Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3'
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” In Electronic Proceedings in Theoretical
Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation
Distances,” in Electronic Proceedings in Theoretical Computer Science,
Napoli, Italy, 2012, vol. 96, pp. 29–42.
ista: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation
Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games,
Automata, Logic, and Formal Verification vol. 96, 29–42.'
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings
in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings
in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2012-09-06
date_created: 2018-12-11T12:00:19Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2023-02-23T10:12:05Z
day: '07'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4204/EPTCS.96.3
ec_funded: 1
external_id:
arxiv:
- '1210.2450'
intvolume: ' 96'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '10'
oa: 1
oa_version: Submitted Version
page: 29 - 42
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
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Electronic Proceedings in Theoretical Computer Science
publication_status: published
publisher: EPTCS
publist_id: '3827'
quality_controlled: '1'
related_material:
record:
- id: '1733'
relation: later_version
status: public
scopus_import: 1
status: public
title: Interface Simulation Distances
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_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: '2911'
abstract:
- lang: eng
text: |-
We have selected problems that may not yet be well known, but have the
potential to push the research in interesting directions. In particular, we state
problems that do not require specific knowledge outside the standard circle of ideas
in discrete geometry. Despite the relatively simple statements, these problems are
related to current research and their solutions are likely to require new ideas and
approaches. We have chosen problems from different fields to make this short paper
attractive to a wide range of specialists.
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Alexander
full_name: Ivanov, Alexander
last_name: Ivanov
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Edelsbrunner H, Ivanov A, Karasev R. Open problems in discrete and computational
geometry. Automatic Control and Computer Sciences. 2012;in print.
apa: Edelsbrunner, H., Ivanov, A., & Karasev, R. (2012). Open problems in discrete
and computational geometry. Automatic Control and Computer Sciences. Springer.
chicago: Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems
in Discrete and Computational Geometry.” Automatic Control and Computer Sciences.
Springer, 2012.
ieee: H. Edelsbrunner, A. Ivanov, and R. Karasev, “Open problems in discrete and
computational geometry,” Automatic Control and Computer Sciences, vol.
in print. Springer, 2012.
ista: Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational
geometry. Automatic Control and Computer Sciences. in print.
mla: Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational
Geometry.” Automatic Control and Computer Sciences, vol. in print, Springer,
2012.
short: H. Edelsbrunner, A. Ivanov, R. Karasev, Automatic Control and Computer Sciences
in print (2012).
date_created: 2018-12-11T12:00:18Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:38Z
day: '01'
extern: 1
month: '01'
publication: Automatic Control and Computer Sciences
publication_status: published
publisher: Springer
publist_id: '3832'
quality_controlled: 0
status: public
title: Open problems in discrete and computational geometry
type: journal_article
volume: in print
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: '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
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: '2929'
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. The Power of Linear Programming for Valued CSPs: A Constructive
Characterization. Unknown; 2012.'
apa: 'Kolmogorov, V. (2012). The power of linear programming for valued CSPs:
a constructive characterization. Unknown.'
chicago: 'Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs:
A Constructive Characterization. Unknown, 2012.'
ieee: 'V. Kolmogorov, The power of linear programming for valued CSPs: a constructive
characterization. Unknown, 2012.'
ista: 'Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive
characterization, Unknown,p.'
mla: 'Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs:
A Constructive Characterization. Unknown, 2012.'
short: 'V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive
Characterization, Unknown, 2012.'
date_created: 2018-12-11T12:00:24Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:21Z
day: '01'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.7213
month: '01'
oa: 1
publication_status: published
publisher: Unknown
publist_id: '3807'
quality_controlled: 0
status: public
title: 'The power of linear programming for valued CSPs: a constructive characterization'
type: report
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: '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: '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: '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: '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'
...