---
_id: '2126'
abstract:
- lang: eng
text: |
Let K be an irreducible and reversible Markov kernel on a finite set X. We construct a metric W on the set of probability measures on X and show that with respect to this metric, the law of the continuous time Markov chain evolves as the gradient flow of the entropy. This result is a discrete counterpart of the Wasserstein gradient flow interpretation of the heat flow in Rn by Jordan, Kinderlehrer and Otto (1998). The metric W is similar to, but different from, the L2-Wasserstein metric, and is defined via a discrete variant of the Benamou–Brenier formula.
acknowledgement: Supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation
for Scientific Research (NWO)
author:
- first_name: Jan
full_name: Jan Maas
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Maas J. Gradient flows of the entropy for finite Markov chains. Journal
of Functional Analysis. 2011;261(8):2250-2292. doi:10.1016/j.jfa.2011.06.009
apa: Maas, J. (2011). Gradient flows of the entropy for finite Markov chains. Journal
of Functional Analysis. Academic Press. https://doi.org/10.1016/j.jfa.2011.06.009
chicago: Maas, Jan. “Gradient Flows of the Entropy for Finite Markov Chains.” Journal
of Functional Analysis. Academic Press, 2011. https://doi.org/10.1016/j.jfa.2011.06.009 .
ieee: J. Maas, “Gradient flows of the entropy for finite Markov chains,” Journal
of Functional Analysis, vol. 261, no. 8. Academic Press, pp. 2250–2292, 2011.
ista: Maas J. 2011. Gradient flows of the entropy for finite Markov chains. Journal
of Functional Analysis. 261(8), 2250–2292.
mla: Maas, Jan. “Gradient Flows of the Entropy for Finite Markov Chains.” Journal
of Functional Analysis, vol. 261, no. 8, Academic Press, 2011, pp. 2250–92,
doi:10.1016/j.jfa.2011.06.009
.
short: J. Maas, Journal of Functional Analysis 261 (2011) 2250–2292.
date_created: 2018-12-11T11:55:51Z
date_published: 2011-03-04T00:00:00Z
date_updated: 2021-01-12T06:55:28Z
day: '04'
doi: '10.1016/j.jfa.2011.06.009 '
extern: 1
intvolume: ' 261'
issue: '8'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.5238
month: '03'
oa: 1
page: 2250 - 2292
publication: Journal of Functional Analysis
publication_status: published
publisher: Academic Press
publist_id: '4909'
quality_controlled: 0
status: public
title: Gradient flows of the entropy for finite Markov chains
type: journal_article
volume: 261
year: '2011'
...
---
_id: '2138'
abstract:
- lang: eng
text: A (diatomic) shape resonance is a metastable state of a pair of colliding
atoms quasi-bound by the centrifugal barrier imposed by the angular momentum involved
in the collision. The temporary trapping of the atoms' scattering wavefunction
corresponds to an enhanced atom pair density at low interatomic separations. This
leads to larger overlap of the wavefunctions involved in a molecule formation
process such as photoassociation, rendering the process more efficient. However,
for an ensemble of atoms, the atom pair density will only be enhanced if the energy
of the resonance comes close to the temperature of the atomic ensemble. Herein
we explore the possibility of controlling the energy of a shape resonance by shifting
it toward the temperature of atoms confined in a trap. The shifts are imparted
by the interaction of non-resonant light with the anisotropic polarizability of
the atom pair, which affects both the centrifugal barrier and the pair's rotational
and vibrational levels. We find that at laser intensities of up to 5×109 W/cm2
the pair density is increased by one order of magnitude for 87Rb atoms at 100μK
and by two orders of magnitude for 88Sr atoms at 20μK.
acknowledgement: Financial support from the Deutsche Forschungsgemeinschaft (Grant
No. KO 2301/2), by the Spanish project FIS2008-02380 (MICINN) as well as the Grants
FQM-2445 and FQM-4643 (Junta de Andaluc´ıa), Campus de Excelencia Internacional
Proyecto GENIL CEB09-0010
author:
- first_name: Ruzin
full_name: Ağanoğlu, Ruzin
last_name: Ağanoğlu
- first_name: Mikhail
full_name: Mikhail Lemeshko
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Břetislav
full_name: Friedrich, Břetislav
last_name: Friedrich
- first_name: Rosario
full_name: González-Férez, Rosario
last_name: González Férez
- first_name: Christiane
full_name: Koch, Christiane P
last_name: Koch
citation:
ama: Ağanoğlu R, Lemeshko M, Friedrich B, González Férez R, Koch C. Controlling
a diatomic shape resonance with non-resonant light. Unknown. 2011.
apa: Ağanoğlu, R., Lemeshko, M., Friedrich, B., González Férez, R., & Koch,
C. (2011). Controlling a diatomic shape resonance with non-resonant light. Unknown.
ArXiv.
chicago: Ağanoğlu, Ruzin, Mikhail Lemeshko, Břetislav Friedrich, Rosario González
Férez, and Christiane Koch. “Controlling a Diatomic Shape Resonance with Non-Resonant
Light.” Unknown. ArXiv, 2011.
ieee: R. Ağanoğlu, M. Lemeshko, B. Friedrich, R. González Férez, and C. Koch, “Controlling
a diatomic shape resonance with non-resonant light,” Unknown. ArXiv, 2011.
ista: Ağanoğlu R, Lemeshko M, Friedrich B, González Férez R, Koch C. 2011. Controlling
a diatomic shape resonance with non-resonant light. Unknown, .
mla: Ağanoğlu, Ruzin, et al. “Controlling a Diatomic Shape Resonance with Non-Resonant
Light.” Unknown, ArXiv, 2011.
short: R. Ağanoğlu, M. Lemeshko, B. Friedrich, R. González Férez, C. Koch, Unknown
(2011).
date_created: 2018-12-11T11:55:55Z
date_published: 2011-05-04T00:00:00Z
date_updated: 2021-01-12T06:55:32Z
day: '04'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1105.0761
month: '05'
oa: 1
publication: Unknown
publication_status: published
publisher: ArXiv
publist_id: '4886'
quality_controlled: 0
status: public
title: Controlling a diatomic shape resonance with non-resonant light
type: preprint
year: '2011'
...
---
_id: '2198'
abstract:
- lang: eng
text: We show that dressing polar molecules with a far-off-resonant optical field
leads to new types of intermolecular potentials, which undergo a crossover from
the inverse power to oscillating behavior depending on the intermolecular distance,
and whose parameters can be tuned by varying the laser intensity and wavelength.
We present analytic expressions for the potential energy surfaces, thereby providing
direct access to the parameters of an optical field required to design intermolecular
interactions experimentally.
author:
- first_name: Mikhail
full_name: Mikhail Lemeshko
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Lemeshko M. Shaping interactions between polar molecules with far-off-resonant
light. Physical Review A - Atomic, Molecular, and Optical Physics. 2011;83(5).
doi:10.1103/PhysRevA.83.051402
apa: Lemeshko, M. (2011). Shaping interactions between polar molecules with far-off-resonant
light. Physical Review A - Atomic, Molecular, and Optical Physics. American
Physical Society. https://doi.org/10.1103/PhysRevA.83.051402
chicago: Lemeshko, Mikhail. “Shaping Interactions between Polar Molecules with Far-off-Resonant
Light.” Physical Review A - Atomic, Molecular, and Optical Physics. American
Physical Society, 2011. https://doi.org/10.1103/PhysRevA.83.051402.
ieee: M. Lemeshko, “Shaping interactions between polar molecules with far-off-resonant
light,” Physical Review A - Atomic, Molecular, and Optical Physics, vol.
83, no. 5. American Physical Society, 2011.
ista: Lemeshko M. 2011. Shaping interactions between polar molecules with far-off-resonant
light. Physical Review A - Atomic, Molecular, and Optical Physics. 83(5).
mla: Lemeshko, Mikhail. “Shaping Interactions between Polar Molecules with Far-off-Resonant
Light.” Physical Review A - Atomic, Molecular, and Optical Physics, vol.
83, no. 5, American Physical Society, 2011, doi:10.1103/PhysRevA.83.051402.
short: M. Lemeshko, Physical Review A - Atomic, Molecular, and Optical Physics 83
(2011).
date_created: 2018-12-11T11:56:17Z
date_published: 2011-05-27T00:00:00Z
date_updated: 2021-01-12T06:55:55Z
day: '27'
doi: 10.1103/PhysRevA.83.051402
extern: 1
intvolume: ' 83'
issue: '5'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.1046
month: '05'
oa: 1
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '4775'
quality_controlled: 0
status: public
title: Shaping interactions between polar molecules with far-off-resonant light
type: journal_article
volume: 83
year: '2011'
...
---
_id: '2199'
abstract:
- lang: eng
text: By invoking supersymmetry, we found a condition under which the Stark-effect
problem for a polar and polarizable molecule subject to nonresonant electric fields
becomes exactly solvable for the family of stretched states. The analytic expressions
for the wave function and eigenenergy and other expectation values allow one to
readily reverse-engineer the problem of finding the values of the interaction
parameters required for creating quantum states with preordained characteristics.
The method also allows the construction of families of isospectral potentials,
realizable with combined fields.
acknowledgement: 'ARO '
author:
- first_name: Mikhail
full_name: Mikhail Lemeshko
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Mustafa
full_name: Mustafa, Mustafa K
last_name: Mustafa
- first_name: Sabre
full_name: Kais, Sabre
last_name: Kais
- first_name: Břetislav
full_name: Friedrich, Břetislav
last_name: Friedrich
citation:
ama: Lemeshko M, Mustafa M, Kais S, Friedrich B. Supersymmetric factorization yields
exact solutions to the molecular Stark-effect problem for "stretched"
states. Physical Review A - Atomic, Molecular, and Optical Physics. 2011;83(4).
doi:10.1103/PhysRevA.83.043415
apa: Lemeshko, M., Mustafa, M., Kais, S., & Friedrich, B. (2011). Supersymmetric
factorization yields exact solutions to the molecular Stark-effect problem for
"stretched" states. Physical Review A - Atomic, Molecular,
and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.83.043415
chicago: Lemeshko, Mikhail, Mustafa Mustafa, Sabre Kais, and Břetislav Friedrich.
“Supersymmetric Factorization Yields Exact Solutions to the Molecular Stark-Effect
Problem for "Stretched" States.” Physical Review A - Atomic,
Molecular, and Optical Physics. American Physical Society, 2011. https://doi.org/10.1103/PhysRevA.83.043415.
ieee: M. Lemeshko, M. Mustafa, S. Kais, and B. Friedrich, “Supersymmetric factorization
yields exact solutions to the molecular Stark-effect problem for "stretched"
states,” Physical Review A - Atomic, Molecular, and Optical Physics, vol.
83, no. 4. American Physical Society, 2011.
ista: Lemeshko M, Mustafa M, Kais S, Friedrich B. 2011. Supersymmetric factorization
yields exact solutions to the molecular Stark-effect problem for "stretched"
states. Physical Review A - Atomic, Molecular, and Optical Physics. 83(4).
mla: Lemeshko, Mikhail, et al. “Supersymmetric Factorization Yields Exact Solutions
to the Molecular Stark-Effect Problem for "Stretched" States.”
Physical Review A - Atomic, Molecular, and Optical Physics, vol. 83, no.
4, American Physical Society, 2011, doi:10.1103/PhysRevA.83.043415.
short: M. Lemeshko, M. Mustafa, S. Kais, B. Friedrich, Physical Review A - Atomic,
Molecular, and Optical Physics 83 (2011).
date_created: 2018-12-11T11:56:17Z
date_published: 2011-04-25T00:00:00Z
date_updated: 2021-01-12T06:55:56Z
day: '25'
doi: 10.1103/PhysRevA.83.043415
extern: 1
intvolume: ' 83'
issue: '4'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1105.5262
month: '04'
oa: 1
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '4776'
quality_controlled: 0
status: public
title: Supersymmetric factorization yields exact solutions to the molecular Stark-effect
problem for "stretched" states
type: journal_article
volume: 83
year: '2011'
...
---
_id: '2200'
abstract:
- lang: eng
text: We made use of supersymmetric (SUSY) quantum mechanics to find the condition
under which the Stark effect problem for a polar and polarizable closed-shell
diatomic molecule subjected to collinear electrostatic and nonresonant radiative
fields becomes exactly solvable. The condition Δω = ω2/4(m+1)2 connects values
of the dimensionless parameters ω and Δω that characterize the strengths of the
permanent and induced dipole interactions of the molecule with the respective
fields. The exact solutions are obtained for the \J̃ = m, m; ω, Δω) family of
'stretched' states. The field-free and strong-field limits of the combined-fields
problem were found to exhibit supersymmetry and shape invariance, which is indeed
the reason why they are analytically solvable. By making use of the analytic form
of the \J̃ = m,m; ω, Δω) wavefunctions, we obtained simple formulae for the expectation
values of the space-fixed electric dipole moment, the alignment cosine and the
angular momentum squared, and derived a 'sum rule' that combines the above expectation
values into a formula for the eigenenergy. The analytic expressions for the characteristics
of the strongly oriented and aligned states provide direct access to the values
of the interaction parameters required for creating such states in the laboratory.
acknowledgement: SK thanks the ARO for financial support
author:
- first_name: Mikhail
full_name: Mikhail Lemeshko
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Mustafa
full_name: Mustafa, Mustafa K
last_name: Mustafa
- first_name: Sabre
full_name: Kais, Sabre
last_name: Kais
- first_name: Břetislav
full_name: Friedrich, Břetislav
last_name: Friedrich
citation:
ama: Lemeshko M, Mustafa M, Kais S, Friedrich B. Supersymmetry identifies molecular
Stark states whose eigenproperties can be obtained analytically. New Journal
of Physics. 2011;13. doi:10.1088/1367-2630/13/6/063036
apa: Lemeshko, M., Mustafa, M., Kais, S., & Friedrich, B. (2011). Supersymmetry
identifies molecular Stark states whose eigenproperties can be obtained analytically.
New Journal of Physics. IOP Publishing Ltd. https://doi.org/10.1088/1367-2630/13/6/063036
chicago: Lemeshko, Mikhail, Mustafa Mustafa, Sabre Kais, and Břetislav Friedrich.
“Supersymmetry Identifies Molecular Stark States Whose Eigenproperties Can Be
Obtained Analytically.” New Journal of Physics. IOP Publishing Ltd., 2011.
https://doi.org/10.1088/1367-2630/13/6/063036.
ieee: M. Lemeshko, M. Mustafa, S. Kais, and B. Friedrich, “Supersymmetry identifies
molecular Stark states whose eigenproperties can be obtained analytically,” New
Journal of Physics, vol. 13. IOP Publishing Ltd., 2011.
ista: Lemeshko M, Mustafa M, Kais S, Friedrich B. 2011. Supersymmetry identifies
molecular Stark states whose eigenproperties can be obtained analytically. New
Journal of Physics. 13.
mla: Lemeshko, Mikhail, et al. “Supersymmetry Identifies Molecular Stark States
Whose Eigenproperties Can Be Obtained Analytically.” New Journal of Physics,
vol. 13, IOP Publishing Ltd., 2011, doi:10.1088/1367-2630/13/6/063036.
short: M. Lemeshko, M. Mustafa, S. Kais, B. Friedrich, New Journal of Physics 13
(2011).
date_created: 2018-12-11T11:56:17Z
date_published: 2011-06-20T00:00:00Z
date_updated: 2021-01-12T06:55:57Z
day: '20'
doi: 10.1088/1367-2630/13/6/063036
extern: 1
intvolume: ' 13'
main_file_link:
- open_access: '1'
url: 'http://arxiv.org/abs/1106.4402 '
month: '06'
oa: 1
publication: New Journal of Physics
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '4774'
quality_controlled: 0
status: public
title: Supersymmetry identifies molecular Stark states whose eigenproperties can be
obtained analytically
type: journal_article
volume: 13
year: '2011'
...
---
_id: '2320'
abstract:
- lang: eng
text: The binding of polarons, or its absence, is an old and subtle topic. After
defining the model we state some recent theorems of ours. First, the transition
from many-body collapse to the existence of a thermodynamic limit for N polarons
occurs precisely at U = 2α, where U is the electronic Coulomb repulsion and α
is the polaron coupling constant. Second, if U is large enough, there is no multi-polaron
binding of any kind. We also discuss the Pekar-Tomasevich approximation to the
ground state energy, which is valid for large α. Finally, we derive exact results,
not reported before, about the one-dimensional toy model introduced by E. P. Gross.
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Lawrence
full_name: Thomas, Lawrence E
last_name: Thomas
citation:
ama: 'Frank R, Lieb É, Seiringer R, Thomas L. Binding, stability, and non-binding
of multi-polaron systems. In: World Scientific Publishing; 2011:21-32. doi:10.1142/9789814350365_0002'
apa: 'Frank, R., Lieb, É., Seiringer, R., & Thomas, L. (2011). Binding, stability,
and non-binding of multi-polaron systems (pp. 21–32). Presented at the QMath:
Mathematical Results in Quantum Physics, World Scientific Publishing. https://doi.org/10.1142/9789814350365_0002'
chicago: Frank, Rupert, Élliott Lieb, Robert Seiringer, and Lawrence Thomas. “Binding,
Stability, and Non-Binding of Multi-Polaron Systems,” 21–32. World Scientific
Publishing, 2011. https://doi.org/10.1142/9789814350365_0002.
ieee: 'R. Frank, É. Lieb, R. Seiringer, and L. Thomas, “Binding, stability, and
non-binding of multi-polaron systems,” presented at the QMath: Mathematical Results
in Quantum Physics, 2011, pp. 21–32.'
ista: 'Frank R, Lieb É, Seiringer R, Thomas L. 2011. Binding, stability, and non-binding
of multi-polaron systems. QMath: Mathematical Results in Quantum Physics, 21–32.'
mla: Frank, Rupert, et al. Binding, Stability, and Non-Binding of Multi-Polaron
Systems. World Scientific Publishing, 2011, pp. 21–32, doi:10.1142/9789814350365_0002.
short: R. Frank, É. Lieb, R. Seiringer, L. Thomas, in:, World Scientific Publishing,
2011, pp. 21–32.
conference:
name: 'QMath: Mathematical Results in Quantum Physics'
date_created: 2018-12-11T11:56:58Z
date_published: 2011-05-26T00:00:00Z
date_updated: 2021-01-12T06:56:45Z
day: '26'
doi: 10.1142/9789814350365_0002
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1010.0737
month: '05'
oa: 1
page: 21 - 32
publication_status: published
publisher: World Scientific Publishing
publist_id: '4607'
quality_controlled: 0
status: public
title: Binding, stability, and non-binding of multi-polaron systems
type: conference
year: '2011'
...
---
_id: '2321'
abstract:
- lang: eng
text: We derive a sharp bound on the location of non-positive eigenvalues of Schrödinger
operators on the half-line with complex-valued potentials.
alternative_title:
- 'Operator Theory: Advances and Applications'
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Ari
full_name: Laptev, Ari
last_name: Laptev
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Frank R, Laptev A, Seiringer R. A sharp bound on eigenvalues of Schrödinger
operators on the halfline with complex-valued potentials. In: Vol 214. Springer;
2011:39-44. doi:10.1007/978-3-7643-9994-8_3'
apa: 'Frank, R., Laptev, A., & Seiringer, R. (2011). A sharp bound on eigenvalues
of Schrödinger operators on the halfline with complex-valued potentials (Vol.
214, pp. 39–44). Presented at the OTAMP: Operator Theory, Analysis and Mathematical
Physics, Springer. https://doi.org/10.1007/978-3-7643-9994-8_3'
chicago: Frank, Rupert, Ari Laptev, and Robert Seiringer. “ A Sharp Bound on Eigenvalues
of Schrödinger Operators on the Halfline with Complex-Valued Potentials,” 214:39–44.
Springer, 2011. https://doi.org/10.1007/978-3-7643-9994-8_3.
ieee: 'R. Frank, A. Laptev, and R. Seiringer, “ A sharp bound on eigenvalues of
Schrödinger operators on the halfline with complex-valued potentials,” presented
at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2011, vol. 214,
pp. 39–44.'
ista: 'Frank R, Laptev A, Seiringer R. 2011. A sharp bound on eigenvalues of Schrödinger
operators on the halfline with complex-valued potentials. OTAMP: Operator Theory,
Analysis and Mathematical Physics, Operator Theory: Advances and Applications,
vol. 214, 39–44.'
mla: Frank, Rupert, et al. A Sharp Bound on Eigenvalues of Schrödinger Operators
on the Halfline with Complex-Valued Potentials. Vol. 214, Springer, 2011,
pp. 39–44, doi:10.1007/978-3-7643-9994-8_3.
short: R. Frank, A. Laptev, R. Seiringer, in:, Springer, 2011, pp. 39–44.
conference:
name: 'OTAMP: Operator Theory, Analysis and Mathematical Physics'
date_created: 2018-12-11T11:56:59Z
date_published: 2011-03-31T00:00:00Z
date_updated: 2021-01-12T06:56:46Z
day: '31'
doi: 10.1007/978-3-7643-9994-8_3
extern: 1
intvolume: ' 214'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0903.2053
month: '03'
oa: 1
page: 39 - 44
publication_status: published
publisher: Springer
publist_id: '4606'
quality_controlled: 0
status: public
title: ' A sharp bound on eigenvalues of Schrödinger operators on the halfline with
complex-valued potentials'
type: conference
volume: 214
year: '2011'
...
---
_id: '2390'
abstract:
- lang: eng
text: 'We resolve several longstanding problems concerning the stability and the
absence of multi-particle binding for N≥2 polarons. Fröhlich''s 1937 polaron model
describes non-relativistic particles interacting with a scalar quantized field
with coupling √α, and with each other by Coulomb repulsion of strength U. We prove
the following: (i) While there is a known thermodynamic instability for U<2α,
stability of matter does hold for U>2α, that is, the ground state energy per
particle has a finite limit as N→∞. (ii) There is no binding of any kind if U
exceeds a critical value that depends on α but not on N. The same results are
shown to hold for the Pekar-Tomasevich model.'
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Lawrence
full_name: Thomas, Lawrence E
last_name: Thomas
citation:
ama: Frank R, Lieb É, Seiringer R, Thomas L. Stability and absence of binding for
multi-polaron systems. Publications Mathematiques de l Institut des Hautes
Etudes Scientifiques. 2011;113(1):39-67. doi:10.1007/s10240-011-0031-5
apa: Frank, R., Lieb, É., Seiringer, R., & Thomas, L. (2011). Stability and
absence of binding for multi-polaron systems. Publications Mathematiques de
l Institut Des Hautes Etudes Scientifiques. Springer. https://doi.org/10.1007/s10240-011-0031-5
chicago: Frank, Rupert, Élliott Lieb, Robert Seiringer, and Lawrence Thomas. “Stability
and Absence of Binding for Multi-Polaron Systems.” Publications Mathematiques
de l Institut Des Hautes Etudes Scientifiques. Springer, 2011. https://doi.org/10.1007/s10240-011-0031-5.
ieee: R. Frank, É. Lieb, R. Seiringer, and L. Thomas, “Stability and absence of
binding for multi-polaron systems,” Publications Mathematiques de l Institut
des Hautes Etudes Scientifiques, vol. 113, no. 1. Springer, pp. 39–67, 2011.
ista: Frank R, Lieb É, Seiringer R, Thomas L. 2011. Stability and absence of binding
for multi-polaron systems. Publications Mathematiques de l Institut des Hautes
Etudes Scientifiques. 113(1), 39–67.
mla: Frank, Rupert, et al. “Stability and Absence of Binding for Multi-Polaron Systems.”
Publications Mathematiques de l Institut Des Hautes Etudes Scientifiques,
vol. 113, no. 1, Springer, 2011, pp. 39–67, doi:10.1007/s10240-011-0031-5.
short: R. Frank, É. Lieb, R. Seiringer, L. Thomas, Publications Mathematiques de
l Institut Des Hautes Etudes Scientifiques 113 (2011) 39–67.
date_created: 2018-12-11T11:57:23Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2021-01-12T06:57:12Z
day: '01'
doi: 10.1007/s10240-011-0031-5
extern: 1
intvolume: ' 113'
issue: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1004.4892
month: '06'
oa: 1
page: 39 - 67
publication: Publications Mathematiques de l Institut des Hautes Etudes Scientifiques
publication_status: published
publisher: Springer
publist_id: '4534'
quality_controlled: 0
status: public
title: Stability and absence of binding for multi-polaron systems
type: journal_article
volume: 113
year: '2011'
...
---
_id: '2391'
abstract:
- lang: eng
text: The change in energy of an ideal Fermi gas when a local one-body potential
is inserted into the system, or when the density is changed locally, are important
quantities in condensed matter physics. We show that they can be rigorously bounded
from below by a universal constant times the value given by the semiclassical
approximation.
author:
- first_name: Rupert
full_name: Frank, Rupert L
last_name: Frank
- first_name: Mathieu
full_name: Lewin, Mathieu
last_name: Lewin
- first_name: Élliott
full_name: Lieb, Élliott H
last_name: Lieb
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Frank R, Lewin M, Lieb É, Seiringer R. Energy cost to make a hole in the fermi
sea. Physical Review Letters. 2011;106(15). doi:10.1103/PhysRevLett.106.150402
apa: Frank, R., Lewin, M., Lieb, É., & Seiringer, R. (2011). Energy cost to
make a hole in the fermi sea. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/PhysRevLett.106.150402
chicago: Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “Energy
Cost to Make a Hole in the Fermi Sea.” Physical Review Letters. American
Physical Society, 2011. https://doi.org/10.1103/PhysRevLett.106.150402.
ieee: R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “Energy cost to make a hole
in the fermi sea,” Physical Review Letters, vol. 106, no. 15. American
Physical Society, 2011.
ista: Frank R, Lewin M, Lieb É, Seiringer R. 2011. Energy cost to make a hole in
the fermi sea. Physical Review Letters. 106(15).
mla: Frank, Rupert, et al. “Energy Cost to Make a Hole in the Fermi Sea.” Physical
Review Letters, vol. 106, no. 15, American Physical Society, 2011, doi:10.1103/PhysRevLett.106.150402.
short: R. Frank, M. Lewin, É. Lieb, R. Seiringer, Physical Review Letters 106 (2011).
date_created: 2018-12-11T11:57:24Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T06:57:12Z
day: '01'
doi: 10.1103/PhysRevLett.106.150402
extern: 1
intvolume: ' 106'
issue: '15'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.1414
month: '01'
oa: 1
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4535'
quality_controlled: 0
status: public
title: Energy cost to make a hole in the fermi sea
type: journal_article
volume: 106
year: '2011'
...
---
_id: '2393'
abstract:
- lang: eng
text: We investigate the low energy excitation spectrum of a Bose gas with weak,
long range repulsive interactions. In particular, we prove that the Bogoliubov
spectrum of elementary excitations with linear dispersion relation for small momentum
becomes exact in the mean-field limit.
author:
- first_name: Robert
full_name: Robert Seiringer
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Seiringer R. The excitation spectrum for weakly interacting Bosons. Communications
in Mathematical Physics. 2011;306(2):565-578. doi:10.1007/s00220-011-1261-6
apa: Seiringer, R. (2011). The excitation spectrum for weakly interacting Bosons.
Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-011-1261-6
chicago: Seiringer, Robert. “The Excitation Spectrum for Weakly Interacting Bosons.”
Communications in Mathematical Physics. Springer, 2011. https://doi.org/10.1007/s00220-011-1261-6.
ieee: R. Seiringer, “The excitation spectrum for weakly interacting Bosons,” Communications
in Mathematical Physics, vol. 306, no. 2. Springer, pp. 565–578, 2011.
ista: Seiringer R. 2011. The excitation spectrum for weakly interacting Bosons.
Communications in Mathematical Physics. 306(2), 565–578.
mla: Seiringer, Robert. “The Excitation Spectrum for Weakly Interacting Bosons.”
Communications in Mathematical Physics, vol. 306, no. 2, Springer, 2011,
pp. 565–78, doi:10.1007/s00220-011-1261-6.
short: R. Seiringer, Communications in Mathematical Physics 306 (2011) 565–578.
date_created: 2018-12-11T11:57:24Z
date_published: 2011-09-01T00:00:00Z
date_updated: 2021-01-12T06:57:13Z
day: '01'
doi: 10.1007/s00220-011-1261-6
extern: 1
intvolume: ' 306'
issue: '2'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1008.5349
month: '09'
oa: 1
page: 565 - 578
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4533'
quality_controlled: 0
status: public
title: The excitation spectrum for weakly interacting Bosons
type: journal_article
volume: 306
year: '2011'
...
---
_id: '6749'
abstract:
- lang: eng
text: This article refers to algorithms based on finite difference schemes for computing
mean and affine curvature evolutions of digital images, introduced by Alvarez
and Morel [L. Alvarez, J.M. Morel, “Formalization and computational aspects of
image analysis”, Acta Numerica, pp. 159, 1994]. We discuss consistency, stability
and convergence. Our analysis focuses on some possible choices of the parameters,
choices that generate multiple variants in the implementations. Meaningful visual
examples on how the algorithms actually work are provided.
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Adina
full_name: Ciomaga, Adina
last_name: Ciomaga
citation:
ama: Mondelli M, Ciomaga A. Finite difference schemes for MCM and AMSS. Image
Processing On Line. 2011;1:127-177. doi:10.5201/ipol.2011.cm_fds
apa: Mondelli, M., & Ciomaga, A. (2011). Finite difference schemes for MCM and
AMSS. Image Processing On Line. IPOL Image Processing On Line. https://doi.org/10.5201/ipol.2011.cm_fds
chicago: Mondelli, Marco, and Adina Ciomaga. “Finite Difference Schemes for MCM
and AMSS.” Image Processing On Line. IPOL Image Processing On Line, 2011.
https://doi.org/10.5201/ipol.2011.cm_fds.
ieee: M. Mondelli and A. Ciomaga, “Finite difference schemes for MCM and AMSS,”
Image Processing On Line, vol. 1. IPOL Image Processing On Line, pp. 127–177,
2011.
ista: Mondelli M, Ciomaga A. 2011. Finite difference schemes for MCM and AMSS. Image
Processing On Line. 1, 127–177.
mla: Mondelli, Marco, and Adina Ciomaga. “Finite Difference Schemes for MCM and
AMSS.” Image Processing On Line, vol. 1, IPOL Image Processing On Line,
2011, pp. 127–77, doi:10.5201/ipol.2011.cm_fds.
short: M. Mondelli, A. Ciomaga, Image Processing On Line 1 (2011) 127–177.
date_created: 2019-07-31T09:44:24Z
date_published: 2011-09-13T00:00:00Z
date_updated: 2021-01-12T08:08:50Z
day: '13'
ddc:
- '000'
doi: 10.5201/ipol.2011.cm_fds
extern: '1'
file:
- access_level: open_access
checksum: 910710811224c633202791e0c217d05d
content_type: application/pdf
creator: dernst
date_created: 2019-08-01T06:34:21Z
date_updated: 2020-07-14T12:47:39Z
file_id: '6751'
file_name: 2011_IPOL_Mondelli.pdf
file_size: 2793903
relation: main_file
file_date_updated: 2020-07-14T12:47:39Z
has_accepted_license: '1'
intvolume: ' 1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: 127-177
publication: Image Processing On Line
publication_identifier:
issn:
- 2105-1232
publication_status: published
publisher: IPOL Image Processing On Line
quality_controlled: '1'
status: public
title: Finite difference schemes for MCM and AMSS
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2011'
...
---
_id: '469'
abstract:
- lang: eng
text: 'Spontaneous release of glutamate is important for maintaining synaptic strength
and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis
remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates
Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently
is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular
Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report
that external Ca2+ triggers spontaneous glutamate release more weakly than evoked
release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous
release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases
in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement
of spontaneous release by extracellular calcium is insensitive to chelation of
intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR),
a G-protein-coupled receptor present in nerve terminals, by several specific agonists
increased spontaneous glutamate release. The frequency of spontaneous synaptic
transmission was decreased in CaSR mutant neurons. The concentration-effect relationship
for extracellular calcium regulation of spontaneous release was well described
by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these
results indicate that extracellular Ca2+ does not trigger spontaneous glutamate
release by simply increasing calcium influx but stimulates CaSR and thereby promotes
resting spontaneous glutamate release. '
author:
- first_name: Nicholas
full_name: Vyleta, Nicholas
id: 36C4978E-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: Stephen
full_name: Smith, Stephen
last_name: Smith
citation:
ama: Vyleta N, Smith S. Spontaneous glutamate release is independent of calcium
influx and tonically activated by the calcium-sensing receptor. European Journal
of Neuroscience. 2011;31(12):4593-4606. doi:10.1523/JNEUROSCI.6398-10.2011
apa: Vyleta, N., & Smith, S. (2011). Spontaneous glutamate release is independent
of calcium influx and tonically activated by the calcium-sensing receptor. European
Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1523/JNEUROSCI.6398-10.2011
chicago: Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is
Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.”
European Journal of Neuroscience. Wiley-Blackwell, 2011. https://doi.org/10.1523/JNEUROSCI.6398-10.2011.
ieee: N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium
influx and tonically activated by the calcium-sensing receptor,” European Journal
of Neuroscience, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.
ista: Vyleta N, Smith S. 2011. Spontaneous glutamate release is independent of calcium
influx and tonically activated by the calcium-sensing receptor. European Journal
of Neuroscience. 31(12), 4593–4606.
mla: Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent
of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” European
Journal of Neuroscience, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606,
doi:10.1523/JNEUROSCI.6398-10.2011.
short: N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606.
date_created: 2018-12-11T11:46:39Z
date_published: 2011-03-23T00:00:00Z
date_updated: 2021-01-12T08:00:49Z
day: '23'
department:
- _id: PeJo
doi: 10.1523/JNEUROSCI.6398-10.2011
intvolume: ' 31'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/
month: '03'
oa: 1
oa_version: Submitted Version
page: 4593 - 4606
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7353'
quality_controlled: '1'
scopus_import: 1
status: public
title: Spontaneous glutamate release is independent of calcium influx and tonically
activated by the calcium-sensing receptor
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2011'
...
---
_id: '490'
abstract:
- lang: eng
text: 'BioSig is an open source software library for biomedical signal processing.
The aim of the BioSig project is to foster research in biomedical signal processing
by providing free and open source software tools for many different application
areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer
interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research.
Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram
(ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG),
or respiration signals is a very relevant element of the BioSig project. Specifically,
BioSig provides solutions for data acquisition, artifact processing, quality control,
feature extraction, classification, modeling, and data visualization, to name
a few. In this paper, we highlight several methods to help students and researchers
to work more efficiently with biomedical signals. '
article_number: '935364'
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Carmen
full_name: Vidaurre, Carmen
last_name: Vidaurre
- first_name: Tilmann
full_name: Sander, Tilmann
last_name: Sander
citation:
ama: 'Schlögl A, Vidaurre C, Sander T. BioSig: The free and open source software
library for biomedical signal processing. Computational Intelligence and Neuroscience.
2011;2011. doi:10.1155/2011/935364'
apa: 'Schlögl, A., Vidaurre, C., & Sander, T. (2011). BioSig: The free and open
source software library for biomedical signal processing. Computational Intelligence
and Neuroscience. Hindawi Publishing Corporation. https://doi.org/10.1155/2011/935364'
chicago: 'Schlögl, Alois, Carmen Vidaurre, and Tilmann Sander. “BioSig: The Free
and Open Source Software Library for Biomedical Signal Processing.” Computational
Intelligence and Neuroscience. Hindawi Publishing Corporation, 2011. https://doi.org/10.1155/2011/935364.'
ieee: 'A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source
software library for biomedical signal processing,” Computational Intelligence
and Neuroscience, vol. 2011. Hindawi Publishing Corporation, 2011.'
ista: 'Schlögl A, Vidaurre C, Sander T. 2011. BioSig: The free and open source software
library for biomedical signal processing. Computational Intelligence and Neuroscience.
2011, 935364.'
mla: 'Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library
for Biomedical Signal Processing.” Computational Intelligence and Neuroscience,
vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:10.1155/2011/935364.'
short: A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience
2011 (2011).
date_created: 2018-12-11T11:46:45Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T08:01:02Z
day: '01'
ddc:
- '005'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.1155/2011/935364
file:
- access_level: open_access
checksum: 8263bbf255171f2054f43f3db5f53b6e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:44Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4642'
file_name: IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf
file_size: 2863551
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 2011'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Computational Intelligence and Neuroscience
publication_status: published
publisher: Hindawi Publishing Corporation
publist_id: '7330'
pubrep_id: '947'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'BioSig: The free and open source software library for biomedical signal processing'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 2011
year: '2011'
...
---
_id: '518'
abstract:
- lang: eng
text: Cancer stem cells or cancer initiating cells are believed to contribute to
cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with
fundamental roles in gene regulation. The role of miRNAs in cancer stem cells
is only poorly understood. Here, we report miRNA expression profiles of glioblastoma
stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred
to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore,
inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates
cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is
a putative transcription factor, which induces the expression of the anti-proliferative
cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9
* and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation
and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour
suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival.
Our findings could provide a basis for novel strategies of glioblastoma therapy.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Schraivogel, Daniel
last_name: Schraivogel
- first_name: Lasse
full_name: Weinmann, Lasse
last_name: Weinmann
- first_name: Dagmar
full_name: Beier, Dagmar
last_name: Beier
- first_name: Ghazaleh
full_name: Tabatabai, Ghazaleh
last_name: Tabatabai
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Jia
full_name: Zhu, Jia
last_name: Zhu
- first_name: Martina
full_name: Anton, Martina
last_name: Anton
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Michael
full_name: Weller, Michael
last_name: Weller
- first_name: Christoph
full_name: Beier, Christoph
last_name: Beier
- first_name: Gunter
full_name: Meister, Gunter
last_name: Meister
citation:
ama: Schraivogel D, Weinmann L, Beier D, et al. CAMTA1 is a novel tumour suppressor
regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 2011;30(20):4309-4322.
doi:10.1038/emboj.2011.301
apa: Schraivogel, D., Weinmann, L., Beier, D., Tabatabai, G., Eichner, A., Zhu,
J., … Meister, G. (2011). CAMTA1 is a novel tumour suppressor regulated by miR-9/9
* in glioblastoma stem cells. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2011.301
chicago: Schraivogel, Daniel, Lasse Weinmann, Dagmar Beier, Ghazaleh Tabatabai,
Alexander Eichner, Jia Zhu, Martina Anton, et al. “CAMTA1 Is a Novel Tumour Suppressor
Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” EMBO Journal. Wiley-Blackwell,
2011. https://doi.org/10.1038/emboj.2011.301.
ieee: D. Schraivogel et al., “CAMTA1 is a novel tumour suppressor regulated
by miR-9/9 * in glioblastoma stem cells,” EMBO Journal, vol. 30, no. 20.
Wiley-Blackwell, pp. 4309–4322, 2011.
ista: Schraivogel D, Weinmann L, Beier D, Tabatabai G, Eichner A, Zhu J, Anton M,
Sixt MK, Weller M, Beier C, Meister G. 2011. CAMTA1 is a novel tumour suppressor
regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 30(20), 4309–4322.
mla: Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated
by MiR-9/9 * in Glioblastoma Stem Cells.” EMBO Journal, vol. 30, no. 20,
Wiley-Blackwell, 2011, pp. 4309–22, doi:10.1038/emboj.2011.301.
short: D. Schraivogel, L. Weinmann, D. Beier, G. Tabatabai, A. Eichner, J. Zhu,
M. Anton, M.K. Sixt, M. Weller, C. Beier, G. Meister, EMBO Journal 30 (2011) 4309–4322.
date_created: 2018-12-11T11:46:55Z
date_published: 2011-10-19T00:00:00Z
date_updated: 2021-01-12T08:01:19Z
day: '19'
department:
- _id: MiSi
doi: 10.1038/emboj.2011.301
external_id:
pmid:
- '21857646'
intvolume: ' 30'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/
month: '10'
oa: 1
oa_version: Submitted Version
page: 4309 - 4322
pmid: 1
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7301'
quality_controlled: '1'
scopus_import: 1
status: public
title: CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma
stem cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2011'
...
---
_id: '531'
abstract:
- lang: eng
text: Software transactional memories (STM) are described in the literature with
assumptions of sequentially consistent program execution and atomicity of high
level operations like read, write, and abort. However, in a realistic setting,
processors use relaxed memory models to optimize hardware performance. Moreover,
the atomicity of operations depends on the underlying hardware. This paper presents
the first approach to verify STMs under relaxed memory models with atomicity of
32 bit loads and stores, and read-modify-write operations. We describe RML, a
simple language for expressing concurrent programs. We develop a semantics of
RML parametrized by a relaxed memory model. We then present our tool, FOIL, which
takes as input the RML description of an STM algorithm restricted to two threads
and two variables, and the description of a memory model, and automatically determines
the locations of fences, which if inserted, ensure the correctness of the restricted
STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and
McRT STM under the memory models of sequential consistency, total store order,
partial store order, and relaxed memory order for two threads and two variables.
Finally, we extend the verification results for DSTM and TL2 to an arbitrary number
of threads and variables by manually proving that the structural properties of
STMs are satisfied at the hardware level of atomicity under the considered relaxed
memory models.
article_processing_charge: No
article_type: original
author:
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- 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: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models.
Formal Methods in System Design. 2011;39(3):297-331. doi:10.1007/s10703-011-0131-3
apa: Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM
on relaxed memory models. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-011-0131-3
chicago: Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of
STM on Relaxed Memory Models.” Formal Methods in System Design. Springer,
2011. https://doi.org/10.1007/s10703-011-0131-3.
ieee: R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed
memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer,
pp. 297–331, 2011.
ista: Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory
models. Formal Methods in System Design. 39(3), 297–331.
mla: Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” Formal
Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.
short: R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39
(2011) 297–331.
date_created: 2018-12-11T11:47:00Z
date_published: 2011-12-01T00:00:00Z
date_updated: 2021-01-12T08:01:27Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s10703-011-0131-3
intvolume: ' 39'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 297 - 331
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '7288'
quality_controlled: '1'
scopus_import: 1
status: public
title: Verification of STM on relaxed memory models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2011'
...
---
_id: '5379'
abstract:
- lang: eng
text: Computing the winning set for Büchi objectives in alternating games on graphs
is a central problem in computer aided verification with a large number of applications.
The long standing best known upper bound for solving the problem is ̃O(n·m), where
n is the number of vertices and m is the number of edges in the graph. We are
the first to break the ̃O(n·m) boundary by presenting a new technique that reduces
the running time to O(n2). This bound also leads to O(n2) time algorithms for
computing the set of almost-sure winning vertices for Büchi objectives (1) in
alternating games with probabilistic transitions (improving an earlier bound of
O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier
bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3
an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique
can be used to compute the maximal end-component decomposition of a graph in time
O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show
how to maintain the winning set for Büchi objectives in alternating games under
a sequence of edge insertions or a sequence of edge deletions in O(n) amortized
time per operation. This is the first dynamic algorithm for this problem.
alternative_title:
- IST Austria Technical Report
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: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Chatterjee K, Henzinger MH. An O(N2) Time Algorithm for Alternating Büchi
Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0009
apa: Chatterjee, K., & Henzinger, M. H. (2011). An O(n2) time algorithm for
alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
chicago: Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm
for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
ieee: K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating
Büchi games. IST Austria, 2011.
ista: Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating
Büchi games, IST Austria, 20p.
mla: Chatterjee, Krishnendu, and Monika H. Henzinger. An O(N2) Time Algorithm
for Alternating Büchi Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0009.
short: K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi
Games, IST Austria, 2011.
date_created: 2018-12-12T11:38:59Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2023-02-23T11:15:12Z
day: '11'
ddc:
- '000'
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0009
file:
- access_level: open_access
checksum: 0b354264229045d982332fd2cb5b9a26
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:43Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5504'
file_name: IST-2011-0009_IST-2011-0009.pdf
file_size: 388665
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '15'
related_material:
record:
- id: '3165'
relation: later_version
status: public
status: public
title: An O(n2) time algorithm for alternating Büchi games
type: technical_report
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2011'
...
---
_id: '5380'
abstract:
- lang: eng
text: 'We consider 2-player games played on a finite state space for an infinite
number of rounds. The games are concurrent: in each round, the two players (player
1 and player 2) choose their moves independently and simultaneously; the current
state and the two moves determine the successor state. We study concurrent games
with ω-regular winning conditions specified as parity objectives. We consider
the qualitative analysis problems: the computation of the almost-sure and limit-sure
winning set of states, where player 1 can ensure to win with probability 1 and
with probability arbitrarily close to 1, respectively. In general the almost-sure
and limit-sure winning strategies require both infinite-memory as well as infinite-precision
(to describe probabilities). We study the bounded-rationality problem for qualitative
analysis of concurrent parity games, where the strategy set for player 1 is restricted
to bounded-resource strategies. In terms of precision, strategies can be deterministic,
uniform, finite-precision or infinite-precision; and in terms of memory, strategies
can be memoryless, finite-memory or infinite-memory. We present a precise and
complete characterization of the qualitative winning sets for all combinations
of classes of strategies. In particular, we show that uniform memoryless strategies
are as powerful as finite-precision infinite-memory strategies, and infinite-precision
memoryless strategies are as powerful as infinite-precision finite-memory strategies. We
show that the winning sets can be computed in O(n2d+3) time, where n is the size
of the game structure and 2d is the number of priorities (or colors), and our
algorithms are symbolic. The membership problem of whether a state belongs to
a winning set can be decided in NP ∩ coNP. While this complexity is the same as
for the simpler class of turn-based parity games, where in each state only one
of the two players has a choice of moves, our algorithms,that are obtained by
characterization of the winning sets as μ-calculus formulas, are considerably
more involved than those for turn-based games.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Chatterjee K. Bounded Rationality in Concurrent Parity Games. IST Austria;
2011. doi:10.15479/AT:IST-2011-0008
apa: Chatterjee, K. (2011). Bounded rationality in concurrent parity games.
IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
chicago: Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games.
IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
ieee: K. Chatterjee, Bounded rationality in concurrent parity games. IST
Austria, 2011.
ista: Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria,
53p.
mla: Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games.
IST Austria, 2011, doi:10.15479/AT:IST-2011-0008.
short: K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria,
2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2023-02-23T11:22:53Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0008
file:
- access_level: open_access
checksum: 0fd38186409be819a911c4990fa79d1f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:22Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5544'
file_name: IST-2011-0008_IST-2011-0008.pdf
file_size: 500399
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '53'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '16'
related_material:
record:
- id: '3338'
relation: later_version
status: public
status: public
title: Bounded rationality in concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distri- bution over the successor
states. The game is played for infinitely many rounds and thus the players construct
an infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or pos- itively (i.e., with positive probability), no matter the
strategy of the second player.\r\n\r\nWe classify such games according to the
information and to the power of randomization available to the players. On the
basis of information, the game can be one-sided with either (a) player 1, or (b)
player 2 having partial observation (and the other player has perfect observation),
or two- sided with (c) both players having partial observation. On the basis of
randomization, (a) the players may not be allowed to use randomization (pure strategies),
or (b) they may choose a probability distribution over actions but the actual
random choice is external and not visible to the player (actions invisible), or
(c) they may use full randomization.\r\n\r\nOur main results for pure strategies
are as follows: (1) For one-sided games with player 2 perfect observation we show
that (in contrast to full randomized strategies) belief-based (subset-construction
based) strate- gies are not sufficient, and present an exponential upper bound
on mem- ory both for almost-sure and positive winning strategies; we show that
the problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
the explicit exponential construction. (2) For one-sided games with player 1 perfect
observation we show that non-elementary memory is both necessary and sufficient
for both almost-sure and posi- tive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least non-elementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence re- sult exhibit
serious flaws in previous results in the literature: we show a non-elementary
memory lower bound for almost-sure winning whereas an exponential upper bound
was previously claimed."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win
When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007'
apa: 'Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic
games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.'
ieee: 'K. Chatterjee and L. Doyen, Partial-observation stochastic games: How
to win when belief fails. IST Austria, 2011.'
ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
win when belief fails, IST Austria, 43p.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.'
short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2023-02-23T11:05:48Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:27Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5488'
file_name: IST-2011-0007_IST-2011-0007.pdf
file_size: 574055
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
record:
- id: '1903'
relation: later_version
status: public
- id: '2211'
relation: later_version
status: public
- id: '2955'
relation: later_version
status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5382'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on a finite state space for
an infinite num- ber of rounds. The games are concurrent: in each round, the two
players (player 1 and player 2) choose their moves independently and simultaneously;
the current state and the two moves determine a probability distribution over
the successor states. We also consider the important special case of turn-based
stochastic games where players make moves in turns, rather than concurrently.
We study concurrent games with ω-regular winning conditions specified as parity
objectives. The value for player 1 for a parity objective is the maximal probability
with which the player can guarantee the satisfaction of the objective against
all strategies of the opponent. We study the problem of continuity and robustness
of the value function in concurrent and turn-based stochastic parity games with
respect to imprecision in the transition probabilities. We present quantitative
bounds on the difference of the value function (in terms of the imprecision of
the transition probabilities) and show the value continuity for structurally equivalent
concurrent games (two games are structurally equivalent if the support of the
transition func- tion is same and the probabilities differ). We also show robustness
of optimal strategies for structurally equivalent turn-based stochastic parity
games. Finally we show that the value continuity property breaks without the structurally
equivalent assumption (even for Markov chains) and show that our quantitative
bound is asymptotically optimal. Hence our results are tight (the assumption is
both necessary and sufficient) and optimal (our quantitative bound is asymptotically
optimal).'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Chatterjee K. Robustness of Structurally Equivalent Concurrent Parity Games.
IST Austria; 2011. doi:10.15479/AT:IST-2011-0006
apa: Chatterjee, K. (2011). Robustness of structurally equivalent concurrent
parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
chicago: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.
ieee: K. Chatterjee, Robustness of structurally equivalent concurrent parity
games. IST Austria, 2011.
ista: Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity
games, IST Austria, 18p.
mla: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0006.
short: K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games,
IST Austria, 2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-06-27T00:00:00Z
date_updated: 2023-02-23T11:23:01Z
day: '27'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0006
file:
- access_level: open_access
checksum: 1322b652d6ab07eb5248298a3f91c1cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:24Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5546'
file_name: IST-2011-0006_IST-2011-0006.pdf
file_size: 335997
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '18'
related_material:
record:
- id: '3341'
relation: later_version
status: public
status: public
title: Robustness of structurally equivalent concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5383'
abstract:
- lang: eng
text: We present a new decidable logic called TREX for expressing constraints about
imperative tree data structures. In particular, TREX supports a transitive closure
operator that can express reachability constraints, which often appear in data
structure invariants. We show that our logic is closed under weakest precondition
computation, which enables its use for automated software verification. We further
show that satisfiability of formulas in TREX is decidable in NP. The low complexity
makes it an attractive alternative to more expensive logics such as monadic second-order
logic (MSOL) over trees, which have been traditionally used for reasoning about
tree data structures.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Marco
full_name: Muñiz, Marco
last_name: Muñiz
- first_name: Viktor
full_name: Kuncak, Viktor
last_name: Kuncak
citation:
ama: Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative
Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005
apa: Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure
for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005
chicago: Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision
Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.
ieee: T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for
imperative tree data structures. IST Austria, 2011.
ista: Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative
tree data structures, IST Austria, 25p.
mla: Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree
Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.
short: T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative
Tree Data Structures, IST Austria, 2011.
date_created: 2018-12-12T11:39:01Z
date_published: 2011-04-26T00:00:00Z
date_updated: 2023-02-23T11:22:16Z
day: '26'
ddc:
- '000'
- '006'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2011-0005
file:
- access_level: open_access
checksum: b20029184c4a819c5f4466a4a3d238b5
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:01Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5462'
file_name: IST-2011-0005_IST-2011-0005.pdf
file_size: 619053
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '19'
related_material:
record:
- id: '3323'
relation: later_version
status: public
status: public
title: On an efficient decision procedure for imperative tree data structures
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...