---
_id: '2741'
abstract:
- lang: eng
text: 'The Pauli operator describes the energy of a nonrelativistic quantum particle
with spin 1/2 in a magnetic field and an external potential. A new Lieb-Thirring
type inequality on the sum of the negative eigenvalues is presented. The main
feature compared to earlier results is that in the large field regime the present
estimate grows with the optimal (first) power of the strength of the magnetic
field. As a byproduct of the method, we also obtain an optimal upper bound on
the pointwise density of zero energy eigenfunctions of the Dirac operator. The
main technical tools are: (i) a new localization scheme for the square of the
resolvent of a general class of second order elliptic operators; (ii) a geometric
construction of a Dirac operator with a constant magnetic field that approximates
the original Dirac operator in a tubular neighborhood of a fixed field line. The
errors may depend on the regularity of the magnetic field but they are uniform
in the field strength.'
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: Jan
full_name: Solovej, Jan P
last_name: Solovej
citation:
ama: Erdös L, Solovej J. Uniform Lieb-Thirring inequality for the three-dimensional
Pauli operator with a strong non-homogeneous magnetic field. Annales Henri
Poincare. 2004;5(4):671-741. doi:10.1007/s00023-004-0180-x
apa: Erdös, L., & Solovej, J. (2004). Uniform Lieb-Thirring inequality for the
three-dimensional Pauli operator with a strong non-homogeneous magnetic field.
Annales Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-004-0180-x
chicago: Erdös, László, and Jan Solovej. “Uniform Lieb-Thirring Inequality for the
Three-Dimensional Pauli Operator with a Strong Non-Homogeneous Magnetic Field.”
Annales Henri Poincare. Birkhäuser, 2004. https://doi.org/10.1007/s00023-004-0180-x.
ieee: L. Erdös and J. Solovej, “Uniform Lieb-Thirring inequality for the three-dimensional
Pauli operator with a strong non-homogeneous magnetic field,” Annales Henri
Poincare, vol. 5, no. 4. Birkhäuser, pp. 671–741, 2004.
ista: Erdös L, Solovej J. 2004. Uniform Lieb-Thirring inequality for the three-dimensional
Pauli operator with a strong non-homogeneous magnetic field. Annales Henri Poincare.
5(4), 671–741.
mla: Erdös, László, and Jan Solovej. “Uniform Lieb-Thirring Inequality for the Three-Dimensional
Pauli Operator with a Strong Non-Homogeneous Magnetic Field.” Annales Henri
Poincare, vol. 5, no. 4, Birkhäuser, 2004, pp. 671–741, doi:10.1007/s00023-004-0180-x.
short: L. Erdös, J. Solovej, Annales Henri Poincare 5 (2004) 671–741.
date_created: 2018-12-11T11:59:21Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2021-01-12T06:59:24Z
day: '01'
doi: 10.1007/s00023-004-0180-x
extern: 1
intvolume: ' 5'
issue: '4'
month: '08'
page: 671 - 741
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '4151'
quality_controlled: 0
status: public
title: Uniform Lieb-Thirring inequality for the three-dimensional Pauli operator with
a strong non-homogeneous magnetic field
type: journal_article
volume: 5
year: '2004'
...
---
_id: '2742'
abstract:
- lang: eng
text: We consider a system of N weakly interacting fermions with a real analytic
pair interaction. We prove that for a general class of initial data there exists
a fixed time T such that the difference between the one particle density matrix
of this system and the solution of the nonlinear Hartree equation is of order
N−1 for any time t⩽T.
author:
- first_name: Alexander
full_name: Elgart, Alexander
last_name: Elgart
- 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
citation:
ama: Elgart A, Erdös L, Schlein B, Yau H. Nonlinear Hartree equation as the mean
field limit of weakly coupled fermions. Journal de Mathématiques Pures et Appliquées.
2004;83(10):1241-1273. doi:10.1016/j.matpur.2004.03.006
apa: Elgart, A., Erdös, L., Schlein, B., & Yau, H. (2004). Nonlinear Hartree
equation as the mean field limit of weakly coupled fermions. Journal de Mathématiques
Pures et Appliquées. Elsevier. https://doi.org/10.1016/j.matpur.2004.03.006
chicago: Elgart, Alexander, László Erdös, Benjamin Schlein, and Horng Yau. “Nonlinear
Hartree Equation as the Mean Field Limit of Weakly Coupled Fermions.” Journal
de Mathématiques Pures et Appliquées. Elsevier, 2004. https://doi.org/10.1016/j.matpur.2004.03.006.
ieee: A. Elgart, L. Erdös, B. Schlein, and H. Yau, “Nonlinear Hartree equation as
the mean field limit of weakly coupled fermions,” Journal de Mathématiques
Pures et Appliquées, vol. 83, no. 10. Elsevier, pp. 1241–1273, 2004.
ista: Elgart A, Erdös L, Schlein B, Yau H. 2004. Nonlinear Hartree equation as the
mean field limit of weakly coupled fermions. Journal de Mathématiques Pures et
Appliquées. 83(10), 1241–1273.
mla: Elgart, Alexander, et al. “Nonlinear Hartree Equation as the Mean Field Limit
of Weakly Coupled Fermions.” Journal de Mathématiques Pures et Appliquées,
vol. 83, no. 10, Elsevier, 2004, pp. 1241–73, doi:10.1016/j.matpur.2004.03.006.
short: A. Elgart, L. Erdös, B. Schlein, H. Yau, Journal de Mathématiques Pures et
Appliquées 83 (2004) 1241–1273.
date_created: 2018-12-11T11:59:22Z
date_published: 2004-10-01T00:00:00Z
date_updated: 2021-01-12T06:59:24Z
day: '01'
doi: 10.1016/j.matpur.2004.03.006
extern: 1
intvolume: ' 83'
issue: '10'
month: '10'
page: 1241 - 1273
publication: Journal de Mathématiques Pures et Appliquées
publication_status: published
publisher: Elsevier
publist_id: '4150'
quality_controlled: 0
status: public
title: Nonlinear Hartree equation as the mean field limit of weakly coupled fermions
type: journal_article
volume: 83
year: '2004'
...
---
_id: '2786'
abstract:
- lang: eng
text: Transition to turbulence in pipe flow is one of the most fundamental and longest-
standing problems in fluid dynamics. Stability theory suggests that the flow remains
laminar for all flow rates, but in practice pipe flow becomes turbulent even at
moderate speeds. This transition drastically affects the transport efficiency
of mass, momentum, and heat. On the basis of the recent discovery of unstable
traveling waves in computational studies of the Navier-Stokes equations and ideas
from dynamical systems theory, a model for the transition process has been suggested.
We report experimental observation of these traveling waves in pipe flow, confirming
the proposed transition scenario and suggesting that the dynamics associated with
these unstable states may indeed capture the nature of fluid turbulence.
author:
- 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: Casimir
full_name: van Doorne, Casimir W
last_name: Van Doorne
- first_name: Jerry
full_name: Westerweel, Jerry
last_name: Westerweel
- first_name: Frans
full_name: Nieuwstadt, Frans T
last_name: Nieuwstadt
- first_name: Holger
full_name: Faisst, Holger
last_name: Faisst
- first_name: Bruno
full_name: Eckhardt, Bruno
last_name: Eckhardt
- first_name: Håkan
full_name: Wedin, Håkan
last_name: Wedin
- first_name: Richard
full_name: Kersweli, Richard R
last_name: Kersweli
- first_name: Fabian
full_name: Waleffe, Fabian
last_name: Waleffe
citation:
ama: Hof B, Van Doorne C, Westerweel J, et al. Experimental observation of nonlinear
traveling waves in turbulent pipe flow. Science. 2004;305(5690):1594-1598.
doi:10.1126/science.1100393
apa: Hof, B., Van Doorne, C., Westerweel, J., Nieuwstadt, F., Faisst, H., Eckhardt,
B., … Waleffe, F. (2004). Experimental observation of nonlinear traveling waves
in turbulent pipe flow. Science. American Association for the Advancement
of Science. https://doi.org/10.1126/science.1100393
chicago: Hof, Björn, Casimir Van Doorne, Jerry Westerweel, Frans Nieuwstadt, Holger
Faisst, Bruno Eckhardt, Håkan Wedin, Richard Kersweli, and Fabian Waleffe. “Experimental
Observation of Nonlinear Traveling Waves in Turbulent Pipe Flow.” Science.
American Association for the Advancement of Science, 2004. https://doi.org/10.1126/science.1100393.
ieee: B. Hof et al., “Experimental observation of nonlinear traveling waves
in turbulent pipe flow,” Science, vol. 305, no. 5690. American Association
for the Advancement of Science, pp. 1594–1598, 2004.
ista: Hof B, Van Doorne C, Westerweel J, Nieuwstadt F, Faisst H, Eckhardt B, Wedin
H, Kersweli R, Waleffe F. 2004. Experimental observation of nonlinear traveling
waves in turbulent pipe flow. Science. 305(5690), 1594–1598.
mla: Hof, Björn, et al. “Experimental Observation of Nonlinear Traveling Waves in
Turbulent Pipe Flow.” Science, vol. 305, no. 5690, American Association
for the Advancement of Science, 2004, pp. 1594–98, doi:10.1126/science.1100393.
short: B. Hof, C. Van Doorne, J. Westerweel, F. Nieuwstadt, H. Faisst, B. Eckhardt,
H. Wedin, R. Kersweli, F. Waleffe, Science 305 (2004) 1594–1598.
date_created: 2018-12-11T11:59:35Z
date_published: 2004-09-10T00:00:00Z
date_updated: 2021-01-12T06:59:42Z
day: '10'
doi: 10.1126/science.1100393
extern: 1
intvolume: ' 305'
issue: '5690'
month: '09'
page: 1594 - 1598
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '4103'
quality_controlled: 0
status: public
title: Experimental observation of nonlinear traveling waves in turbulent pipe flow
type: journal_article
volume: 305
year: '2004'
...
---
_id: '2787'
abstract:
- lang: eng
text: The results of experimental and numerical investigations of the onset of oscillatory
convection in a sidewall heated rectangular cavity of molten gallium are reported.
Detailed comparisons are made between experimental observations and calculations
from numerical simulations of a three-dimensional Boussinesq model. The onset
of time-dependence takes place through supercritical Hopf bifurcations and the
loci of critical points in the (Gr, Pr)-plane are qualitatively similar with excellent
agreement between the frequencies of the oscillatory motion. This provides a severe
test of the control of the experiment since the mode of oscillation is extremely
sensitive to imperfections. Detailed numerical investigations reveal that there
are a pair of Hopf bifurcations which exist on two asymmetric states which themselves
arise at a subcritical pitchfork from the symmetric state. There is no evidence
for this in the experiment and this qualitative difference is attributed to non-Boussinesq
perturbations which increase with Gr. However, the antisymmetric spatial structure
of the oscillatory state is robust and is present in both the experiment and the
numerical model. Moreover, the detailed analysis of the numerical results reveals
the origins of the oscillatory instability.
author:
- 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: Anne
full_name: Juel, Anne
last_name: Juel
- first_name: Li
full_name: Zhao, Li
last_name: Zhao
- first_name: Daniel
full_name: 'Henry, Daniel '
last_name: Henry
- first_name: Hamda
full_name: Ben Hadid, Hamda
last_name: Ben Hadid
- first_name: Tom
full_name: Mullin, Tom P
last_name: Mullin
citation:
ama: Hof B, Juel A, Zhao L, Henry D, Ben Hadid H, Mullin T. On the onset of oscillatory
convection in molten gallium. Journal of Fluid Mechanics. 2004;515:391-413.
doi:10.1017/S0022112004000527
apa: Hof, B., Juel, A., Zhao, L., Henry, D., Ben Hadid, H., & Mullin, T. (2004).
On the onset of oscillatory convection in molten gallium. Journal of Fluid
Mechanics. Cambridge University Press. https://doi.org/10.1017/S0022112004000527
chicago: Hof, Björn, Anne Juel, Li Zhao, Daniel Henry, Hamda Ben Hadid, and Tom
Mullin. “On the Onset of Oscillatory Convection in Molten Gallium.” Journal
of Fluid Mechanics. Cambridge University Press, 2004. https://doi.org/10.1017/S0022112004000527.
ieee: B. Hof, A. Juel, L. Zhao, D. Henry, H. Ben Hadid, and T. Mullin, “On the onset
of oscillatory convection in molten gallium,” Journal of Fluid Mechanics,
vol. 515. Cambridge University Press, pp. 391–413, 2004.
ista: Hof B, Juel A, Zhao L, Henry D, Ben Hadid H, Mullin T. 2004. On the onset
of oscillatory convection in molten gallium. Journal of Fluid Mechanics. 515,
391–413.
mla: Hof, Björn, et al. “On the Onset of Oscillatory Convection in Molten Gallium.”
Journal of Fluid Mechanics, vol. 515, Cambridge University Press, 2004,
pp. 391–413, doi:10.1017/S0022112004000527.
short: B. Hof, A. Juel, L. Zhao, D. Henry, H. Ben Hadid, T. Mullin, Journal of Fluid
Mechanics 515 (2004) 391–413.
date_created: 2018-12-11T11:59:36Z
date_published: 2004-09-25T00:00:00Z
date_updated: 2021-01-12T06:59:43Z
day: '25'
doi: 10.1017/S0022112004000527
extern: 1
intvolume: ' 515'
month: '09'
page: 391 - 413
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '4102'
quality_controlled: 0
status: public
title: On the onset of oscillatory convection in molten gallium
type: journal_article
volume: 515
year: '2004'
...
---
_id: '2997'
abstract:
- lang: eng
text: Polar transport-dependent local accumulation of auxin provides positional
cues for multiple plant patterning processes. This directional auxin flow depends
on the polar subcellular localization of the PIN auxin efflux regulators. Overexpression
of the PINOID protein kinase induces a basal-to-apical shift in PIN localization,
resulting in the loss of auxin gradients and strong defects in embryo and seedling
roots. Conversely, pid loss of function induces an apical-to-basal shift in PIN1
polar targeting at the inflorescence apex, accompanied by defective organogenesis.
Our results show that a PINOID-dependent binary switch controls PIN polarity and
mediates changes in auxin flow to create local gradients for patterning processes.
author:
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Xiong
full_name: Yang, Xiong
last_name: Yang
- first_name: Marta
full_name: Michniewicz, Marta
last_name: Michniewicz
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Ab
full_name: Quint, Ab
last_name: Quint
- first_name: Olaf
full_name: Tietz, Olaf
last_name: Tietz
- first_name: René
full_name: Benjamins, René
last_name: Benjamins
- first_name: Pieter
full_name: Ouwerkerk, Pieter B
last_name: Ouwerkerk
- first_name: Karin
full_name: Ljung, Karin
last_name: Ljung
- first_name: Göran
full_name: Sandberg, Göran
last_name: Sandberg
- first_name: Paul
full_name: Hooykaas, Paul J
last_name: Hooykaas
- first_name: Klaus
full_name: Palme, Klaus
last_name: Palme
- first_name: Remko
full_name: Offringa, Remko
last_name: Offringa
citation:
ama: Friml J, Yang X, Michniewicz M, et al. A PINOID-dependent binary switch in
apical-basal PIN polar targeting directs auxin efflux. Science. 2004;306(5697):862-865.
doi:10.1126/science.1100618
apa: Friml, J., Yang, X., Michniewicz, M., Weijers, D., Quint, A., Tietz, O., …
Offringa, R. (2004). A PINOID-dependent binary switch in apical-basal PIN polar
targeting directs auxin efflux. Science. American Association for the Advancement
of Science. https://doi.org/10.1126/science.1100618
chicago: Friml, Jiří, Xiong Yang, Marta Michniewicz, Dolf Weijers, Ab Quint, Olaf
Tietz, René Benjamins, et al. “A PINOID-Dependent Binary Switch in Apical-Basal
PIN Polar Targeting Directs Auxin Efflux.” Science. American Association
for the Advancement of Science, 2004. https://doi.org/10.1126/science.1100618.
ieee: J. Friml et al., “A PINOID-dependent binary switch in apical-basal
PIN polar targeting directs auxin efflux,” Science, vol. 306, no. 5697.
American Association for the Advancement of Science, pp. 862–865, 2004.
ista: Friml J, Yang X, Michniewicz M, Weijers D, Quint A, Tietz O, Benjamins R,
Ouwerkerk P, Ljung K, Sandberg G, Hooykaas P, Palme K, Offringa R. 2004. A PINOID-dependent
binary switch in apical-basal PIN polar targeting directs auxin efflux. Science.
306(5697), 862–865.
mla: Friml, Jiří, et al. “A PINOID-Dependent Binary Switch in Apical-Basal PIN Polar
Targeting Directs Auxin Efflux.” Science, vol. 306, no. 5697, American
Association for the Advancement of Science, 2004, pp. 862–65, doi:10.1126/science.1100618.
short: J. Friml, X. Yang, M. Michniewicz, D. Weijers, A. Quint, O. Tietz, R. Benjamins,
P. Ouwerkerk, K. Ljung, G. Sandberg, P. Hooykaas, K. Palme, R. Offringa, Science
306 (2004) 862–865.
date_created: 2018-12-11T12:00:46Z
date_published: 2004-10-29T00:00:00Z
date_updated: 2021-01-12T07:40:20Z
day: '29'
doi: 10.1126/science.1100618
extern: 1
intvolume: ' 306'
issue: '5697'
month: '10'
page: 862 - 865
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '3705'
quality_controlled: 0
status: public
title: A PINOID-dependent binary switch in apical-basal PIN polar targeting directs
auxin efflux
type: journal_article
volume: 306
year: '2004'
...
---
_id: '2998'
abstract:
- lang: eng
text: The packaging of the genomic DNA into chromatin in the cell nucleus requires
machineries that facilitate DNA-dependent processes such as transcription in the
presence of repressive chromatin structures. Using co-immunoprecipitation we have
identified in Arabidopsis thaliana cells the FAcilitates Chromatin Transcription
(FACT) complex, consisting of the 120-kDa Spt16 and the 71-kDa SSRP1 proteins.
Indirect immunofluorecence analyses revealed that both FACT subunits co-localize
to nuclei of the majority of cell types in embryos, shoots and roots, whereas
FACT is not present in terminally differentiated cells such as mature trichoblasts
or cells of the root cap. In the nucleus, Spt16 and SSRP1 are found in the cytologically
defined euchromatin of interphase cells independent of the status of DNA replication,
but the proteins are not associated with heterochromatic chromocentres and condensed
mitotic chromosomes. FACT can be detected by chromatin immunoprecipitation over
the entire transcribed region (5′-UTR, coding sequence, 3′-UTR) of actively transcribed
genes, whereas it does not occur at transcriptionally inactive heterochromatic
regions and intergenic regions. FACT localizes to inducible genes only after induction
of transcription, and the association of the complex with the genes correlates
with the level of transcription. Collectively, these results indicate that FACT
assists transcription elongation through plant chromatin.
author:
- first_name: Meg
full_name: Duroux, Meg
last_name: Duroux
- first_name: Andreas
full_name: Houben, Andreas
last_name: Houben
- first_name: Kamil
full_name: Růžička, Kamil
last_name: Růžička
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Klaus
full_name: Grasser, Klaus D
last_name: Grasser
citation:
ama: Duroux M, Houben A, Růžička K, Friml J, Grasser K. The chromatin remodelling
complex FACT associates with actively transcribed regions of the Arabidopsis genome.
Plant Journal. 2004;40(5):660-671. doi:10.1111/j.1365-313X.2004.02242.x
apa: Duroux, M., Houben, A., Růžička, K., Friml, J., & Grasser, K. (2004). The
chromatin remodelling complex FACT associates with actively transcribed regions
of the Arabidopsis genome. Plant Journal. Wiley-Blackwell. https://doi.org/10.1111/j.1365-313X.2004.02242.x
chicago: Duroux, Meg, Andreas Houben, Kamil Růžička, Jiří Friml, and Klaus Grasser.
“The Chromatin Remodelling Complex FACT Associates with Actively Transcribed Regions
of the Arabidopsis Genome.” Plant Journal. Wiley-Blackwell, 2004. https://doi.org/10.1111/j.1365-313X.2004.02242.x.
ieee: M. Duroux, A. Houben, K. Růžička, J. Friml, and K. Grasser, “The chromatin
remodelling complex FACT associates with actively transcribed regions of the Arabidopsis
genome,” Plant Journal, vol. 40, no. 5. Wiley-Blackwell, pp. 660–671, 2004.
ista: Duroux M, Houben A, Růžička K, Friml J, Grasser K. 2004. The chromatin remodelling
complex FACT associates with actively transcribed regions of the Arabidopsis genome.
Plant Journal. 40(5), 660–671.
mla: Duroux, Meg, et al. “The Chromatin Remodelling Complex FACT Associates with
Actively Transcribed Regions of the Arabidopsis Genome.” Plant Journal,
vol. 40, no. 5, Wiley-Blackwell, 2004, pp. 660–71, doi:10.1111/j.1365-313X.2004.02242.x.
short: M. Duroux, A. Houben, K. Růžička, J. Friml, K. Grasser, Plant Journal 40
(2004) 660–671.
date_created: 2018-12-11T12:00:47Z
date_published: 2004-12-01T00:00:00Z
date_updated: 2021-01-12T07:40:20Z
day: '01'
doi: 10.1111/j.1365-313X.2004.02242.x
extern: 1
intvolume: ' 40'
issue: '5'
month: '12'
page: 660 - 671
publication: Plant Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3703'
quality_controlled: 0
status: public
title: The chromatin remodelling complex FACT associates with actively transcribed
regions of the Arabidopsis genome
type: journal_article
volume: 40
year: '2004'
...
---
_id: '2999'
abstract:
- lang: eng
text: Embryogenesis of flowering plants establishes a basic body plan with apical-basal,
radial and bilateral patterns from the single-celled zygote. Arabidopsis embryogenesis
exhibits a nearly invariant cell division pattern and therefore is an ideal system
for studies of early plant development. However, plant embryos are difficult to
access for experimental manipulation, as they develop deeply inside maternal tissues.
Here we present a method for the culture of zygotic Arabidopsis embryos in vitro.
The technique omits excision of the embryo by culturing the entire ovule, thus
greatly facilitating the time and effort involved. It enables external manipulation
of embryo development and culture from the earliest developmental stages up to
maturity. Administration of various chemical treatments as well as the use of
different molecular markers is demonstrated together with standard techniques
for visualizing gene expression and protein localization in in vitro cultivated
embryos. The presented set of techniques allows for so far unavailable molecular
physiology approaches in the study of early plant development.
author:
- first_name: Michael
full_name: Sauer, Michael
last_name: Sauer
- first_name: Jirí
full_name: Jirí Friml
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Sauer M, Friml J. In vitro culture of Arabidopsis embryos within their ovules.
Plant Journal. 2004;40(5):835-843. doi:10.1111/j.1365-313X.2004.02248.x
apa: Sauer, M., & Friml, J. (2004). In vitro culture of Arabidopsis embryos
within their ovules. Plant Journal. Wiley-Blackwell. https://doi.org/10.1111/j.1365-313X.2004.02248.x
chicago: Sauer, Michael, and Jiří Friml. “In Vitro Culture of Arabidopsis Embryos
within Their Ovules.” Plant Journal. Wiley-Blackwell, 2004. https://doi.org/10.1111/j.1365-313X.2004.02248.x.
ieee: M. Sauer and J. Friml, “In vitro culture of Arabidopsis embryos within their
ovules,” Plant Journal, vol. 40, no. 5. Wiley-Blackwell, pp. 835–843, 2004.
ista: Sauer M, Friml J. 2004. In vitro culture of Arabidopsis embryos within their
ovules. Plant Journal. 40(5), 835–843.
mla: Sauer, Michael, and Jiří Friml. “In Vitro Culture of Arabidopsis Embryos within
Their Ovules.” Plant Journal, vol. 40, no. 5, Wiley-Blackwell, 2004, pp.
835–43, doi:10.1111/j.1365-313X.2004.02248.x.
short: M. Sauer, J. Friml, Plant Journal 40 (2004) 835–843.
date_created: 2018-12-11T12:00:47Z
date_published: 2004-12-01T00:00:00Z
date_updated: 2021-01-12T07:40:20Z
day: '01'
doi: 10.1111/j.1365-313X.2004.02248.x
extern: 1
intvolume: ' 40'
issue: '5'
month: '12'
page: 835 - 843
publication: Plant Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3704'
quality_controlled: 0
status: public
title: In vitro culture of Arabidopsis embryos within their ovules
type: journal_article
volume: 40
year: '2004'
...
---
_id: '3142'
abstract:
- lang: eng
text: Assembly of neuronal circuits is controlled by the sequential acquisition
of neuronal subpopulation-specific identities at progressive developmental steps.
Whereas neuronal features involved in initial phases of differentiation are already
established at cell-cycle exit, recent findings, based mainly on work in the peripheral
nervous system, suggest that the timely integration of signals encountered en
route to targets and from the target region itself is essential to control late
steps in connectivity. As neurons project towards their targets they require target-derived
signals to establish mature axonal projections and acquire neuronal traits such
as the expression of distinct combinations of neurotransmitters. Recent evidence
presented in this review shows that this principle, of a signaling interplay between
target-derived signals and neuronal cell bodies, is often mediated through transcriptional
events and is evolutionarily conserved.
author:
- first_name: Simon
full_name: Simon Hippenmeyer
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Ina
full_name: Kramer, Ina
last_name: Kramer
- first_name: Silvia
full_name: Arber, Silvia
last_name: Arber
citation:
ama: 'Hippenmeyer S, Kramer I, Arber S. Control of neuronal phenotype: What targets
tell the cell bodies. Trends in Neurosciences. 2004;27(8):482-488. doi:10.1016/j.tins.2004.05.012'
apa: 'Hippenmeyer, S., Kramer, I., & Arber, S. (2004). Control of neuronal phenotype:
What targets tell the cell bodies. Trends in Neurosciences. Elsevier. https://doi.org/10.1016/j.tins.2004.05.012'
chicago: 'Hippenmeyer, Simon, Ina Kramer, and Silvia Arber. “Control of Neuronal
Phenotype: What Targets Tell the Cell Bodies.” Trends in Neurosciences.
Elsevier, 2004. https://doi.org/10.1016/j.tins.2004.05.012.'
ieee: 'S. Hippenmeyer, I. Kramer, and S. Arber, “Control of neuronal phenotype:
What targets tell the cell bodies,” Trends in Neurosciences, vol. 27, no.
8. Elsevier, pp. 482–488, 2004.'
ista: 'Hippenmeyer S, Kramer I, Arber S. 2004. Control of neuronal phenotype: What
targets tell the cell bodies. Trends in Neurosciences. 27(8), 482–488.'
mla: 'Hippenmeyer, Simon, et al. “Control of Neuronal Phenotype: What Targets Tell
the Cell Bodies.” Trends in Neurosciences, vol. 27, no. 8, Elsevier, 2004,
pp. 482–88, doi:10.1016/j.tins.2004.05.012.'
short: S. Hippenmeyer, I. Kramer, S. Arber, Trends in Neurosciences 27 (2004) 482–488.
date_created: 2018-12-11T12:01:38Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2019-04-26T07:22:25Z
day: '01'
doi: 10.1016/j.tins.2004.05.012
extern: 1
intvolume: ' 27'
issue: '8'
month: '08'
page: 482 - 488
publication: Trends in Neurosciences
publication_status: published
publisher: Elsevier
publist_id: '3555'
quality_controlled: 0
status: public
title: 'Control of neuronal phenotype: What targets tell the cell bodies'
type: review
volume: 27
year: '2004'
...
---
_id: '3172'
abstract:
- lang: eng
text: The simultaneous multiple volume (SMV) approach in navigator-gated MRI allows
the use of the whole motion range or the entire scan time for the reconstruction
of final images by simultaneously acquiring different image volumes at different
motion states. The motion tolerance range for each volume is kept small, thus
SMV substantially increases the scan efficiency of navigator methods while maintaining
the effectiveness of motion suppression. This article reports a general implementation
of the SMV approach using a multiprocessor scheduling algorithm. Each motion state
is regarded as a processor and each volume is regarded as a job. An efficient
scheduling that completes all jobs in minimal time is maintained even when the
motion pattern changes. Initial experiments demonstrated that SMV significantly
increased the scan efficiency of navigatorgated MRI.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thành
full_name: Nguyen, Thành D
last_name: Nguyen
- first_name: Anthony
full_name: Nuval, Anthony
last_name: Nuval
- first_name: Pascal
full_name: Spincemaille, Pascal
last_name: Spincemaille
- first_name: Martin
full_name: Prince, Martin R
last_name: Prince
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: Kolmogorov V, Nguyen T, Nuval A, et al. Multiprocessor scheduling implementation
of the simultaneous multiple volume SMV navigator method. Magnetic Resonance
in Medicine. 2004;52(2):362-367. doi:10.1002/mrm.20162
apa: Kolmogorov, V., Nguyen, T., Nuval, A., Spincemaille, P., Prince, M., Zabih,
R., & Wang, Y. (2004). Multiprocessor scheduling implementation of the simultaneous
multiple volume SMV navigator method. Magnetic Resonance in Medicine. Wiley-Blackwell.
https://doi.org/10.1002/mrm.20162
chicago: Kolmogorov, Vladimir, Thành Nguyen, Anthony Nuval, Pascal Spincemaille,
Martin Prince, Ramin Zabih, and Yusu Wang. “Multiprocessor Scheduling Implementation
of the Simultaneous Multiple Volume SMV Navigator Method.” Magnetic Resonance
in Medicine. Wiley-Blackwell, 2004. https://doi.org/10.1002/mrm.20162.
ieee: V. Kolmogorov et al., “Multiprocessor scheduling implementation of
the simultaneous multiple volume SMV navigator method,” Magnetic Resonance
in Medicine, vol. 52, no. 2. Wiley-Blackwell, pp. 362–367, 2004.
ista: Kolmogorov V, Nguyen T, Nuval A, Spincemaille P, Prince M, Zabih R, Wang Y.
2004. Multiprocessor scheduling implementation of the simultaneous multiple volume
SMV navigator method. Magnetic Resonance in Medicine. 52(2), 362–367.
mla: Kolmogorov, Vladimir, et al. “Multiprocessor Scheduling Implementation of the
Simultaneous Multiple Volume SMV Navigator Method.” Magnetic Resonance in Medicine,
vol. 52, no. 2, Wiley-Blackwell, 2004, pp. 362–67, doi:10.1002/mrm.20162.
short: V. Kolmogorov, T. Nguyen, A. Nuval, P. Spincemaille, M. Prince, R. Zabih,
Y. Wang, Magnetic Resonance in Medicine 52 (2004) 362–367.
date_created: 2018-12-11T12:01:48Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2021-01-12T07:41:34Z
day: '01'
doi: 10.1002/mrm.20162
extern: 1
intvolume: ' 52'
issue: '2'
month: '08'
page: 362 - 367
publication: Magnetic Resonance in Medicine
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3508'
quality_controlled: 0
status: public
title: Multiprocessor scheduling implementation of the simultaneous multiple volume
SMV navigator method
type: journal_article
volume: 52
year: '2004'
...
---
_id: '3173'
abstract:
- lang: eng
text: In the last few years, several new algorithms based on graph cuts have been
developed to solve energy minimization problems in computer vision. Each of these
techniques constructs a graph such that the minimum cut on the graph also minimizes
the energy. Yet, because these graph constructions are complex and highly specific
to a particular energy function, graph cuts have seen limited application to date.
In this paper, we give a characterization of the energy functions that can be
minimized by graph cuts. Our results are restricted to functions of binary variables.
However, our work generalizes many previous constructions and is easily applicable
to vision problems that involve large numbers of labels, such as stereo, motion,
image restoration, and scene reconstruction. We give a precise characterization
of what energy functions can be minimized using graph cuts, among the energy functions
that can be written as a sum of terms containing three or fewer binary variables.
We also provide a general-purpose construction to minimize such an energy function.
Finally, we give a necessary condition for any energy function of binary variables
to be minimized by graph cuts. Researchers who are considering the use of graph
cuts to optimize a particular energy function can use our results to determine
if this is possible and then follow our construction to create the appropriate
graph. A software implementation is freely available.
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
citation:
ama: Kolmogorov V, Zabih R. What energy functions can be minimized via graph cuts?
. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2004;26(2):147-159.
doi:10.1109/TPAMI.2004.1262177
apa: Kolmogorov, V., & Zabih, R. (2004). What energy functions can be minimized
via graph cuts? . IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE. https://doi.org/10.1109/TPAMI.2004.1262177
chicago: Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized
via Graph Cuts? .” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2004. https://doi.org/10.1109/TPAMI.2004.1262177.
ieee: V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph
cuts? ,” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 26, no. 2. IEEE, pp. 147–159, 2004.
ista: Kolmogorov V, Zabih R. 2004. What energy functions can be minimized via graph
cuts? . IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(2),
147–159.
mla: Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized
via Graph Cuts? .” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 26, no. 2, IEEE, 2004, pp. 147–59, doi:10.1109/TPAMI.2004.1262177.
short: V. Kolmogorov, R. Zabih, IEEE Transactions on Pattern Analysis and Machine
Intelligence 26 (2004) 147–159.
date_created: 2018-12-11T12:01:49Z
date_published: 2004-02-01T00:00:00Z
date_updated: 2021-01-12T07:41:34Z
day: '01'
doi: 10.1109/TPAMI.2004.1262177
extern: 1
intvolume: ' 26'
issue: '2'
month: '02'
page: 147 - 159
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3509'
quality_controlled: 0
status: public
title: 'What energy functions can be minimized via graph cuts? '
type: journal_article
volume: 26
year: '2004'
...
---
_id: '3177'
abstract:
- lang: eng
text: Feature space clustering is a popular approach to image segmentation, in which
a feature vector of local properties (such as intensity, texture or motion) is
computed at each pixel. The feature space is then clustered, and each pixel is
labeled with the cluster that contains its feature vector. A major limitation
of this approach is that feature space clusters generally lack spatial coherence
(i.e., they do not correspond to a compact grouping of pixels). In this paper,
we propose a segmentation algorithm that operates simultaneously in feature space
and in image space. We define an energy function over both a set of clusters and
a labeling of pixels with clusters. In our framework, a pixel is labeled with
a single cluster (rather than, for example, a distribution over clusters). Our
energy function penalizes clusters that are a poor fit to the data in feature
space, and also penalizes clusters whose pixels lack spatial coherence. The energy
function can be efficiently minimized using graph cuts. Our algorithm can incorporate
both parametric and non-parametric clustering methods. It can be applied to many
optimization-based clustering methods, including k-means and k-medians, and can
handle models which are very close in feature space. Preliminary results are presented
on segmenting real and synthetic images, using both parametric and non-parametric
clustering.
author:
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Zabih R, Kolmogorov V. Spatially coherent clustering using graph cuts. In:
Vol 2. IEEE; 2004:437-444. doi:10.1109/CVPR.2004.1315196'
apa: 'Zabih, R., & Kolmogorov, V. (2004). Spatially coherent clustering using
graph cuts (Vol. 2, pp. 437–444). Presented at the CVPR: Computer Vision and Pattern
Recognition, IEEE. https://doi.org/10.1109/CVPR.2004.1315196'
chicago: Zabih, Ramin, and Vladimir Kolmogorov. “Spatially Coherent Clustering Using
Graph Cuts,” 2:437–44. IEEE, 2004. https://doi.org/10.1109/CVPR.2004.1315196.
ieee: 'R. Zabih and V. Kolmogorov, “Spatially coherent clustering using graph cuts,”
presented at the CVPR: Computer Vision and Pattern Recognition, 2004, vol. 2,
pp. 437–444.'
ista: 'Zabih R, Kolmogorov V. 2004. Spatially coherent clustering using graph cuts.
CVPR: Computer Vision and Pattern Recognition vol. 2, 437–444.'
mla: Zabih, Ramin, and Vladimir Kolmogorov. Spatially Coherent Clustering Using
Graph Cuts. Vol. 2, IEEE, 2004, pp. 437–44, doi:10.1109/CVPR.2004.1315196.
short: R. Zabih, V. Kolmogorov, in:, IEEE, 2004, pp. 437–444.
conference:
name: 'CVPR: Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:50Z
date_published: 2004-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:36Z
day: '01'
doi: 10.1109/CVPR.2004.1315196
extern: 1
intvolume: ' 2'
month: '06'
page: 437 - 444
publication_status: published
publisher: IEEE
publist_id: '3506'
quality_controlled: 0
status: public
title: Spatially coherent clustering using graph cuts
type: conference
volume: 2
year: '2004'
...
---
_id: '3178'
abstract:
- lang: eng
text: Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly
useful tool for exactor approximate energy minimization in low-level vision. The
combinatorial optimization literature provides many min-cut/max-flow algorithms
with different polynomial time complexity. Their practical efficiency, however,
has to date been studied mainly outside the scope of computer vision. The goal
of this paper is to provide an experimental comparison of the efficiency of min-cut/max
flow algorithms for applications in vision. We compare the running times of several
standard algorithms, as well as a new algorithm that we have recently developed.
The algorithms we study include both Goldberg-Tarjan style "push -relabel"
methods and algorithms based on Ford-Fulkerson style "augmenting paths."
We benchmark these algorithms on a number of typical graphs in the contexts of
image restoration, stereo, and segmentation. In many cases, our new algorithm
works several times faster than any of the other methods, making near real-time
performance possible. An implementation of our max-flow/min-cut algorithm is available
upon request for research purposes.
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms
for energy minimization in vision. IEEE Transactions on Pattern Analysis and
Machine Intelligence. 2004;26(9):1124-1137. doi:10.1109/TPAMI.2004.60
apa: Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow
algorithms for energy minimization in vision. IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2004.60
chicago: Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow
Algorithms for Energy Minimization in Vision.” IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE, 2004. https://doi.org/10.1109/TPAMI.2004.60.
ieee: Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow
algorithms for energy minimization in vision,” IEEE Transactions on Pattern
Analysis and Machine Intelligence, vol. 26, no. 9. IEEE, pp. 1124–1137, 2004.
ista: Boykov Y, Kolmogorov V. 2004. An experimental comparison of min-cut/max-flow
algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 26(9), 1124–1137.
mla: Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow
Algorithms for Energy Minimization in Vision.” IEEE Transactions on Pattern
Analysis and Machine Intelligence, vol. 26, no. 9, IEEE, 2004, pp. 1124–37,
doi:10.1109/TPAMI.2004.60.
short: Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine
Intelligence 26 (2004) 1124–1137.
date_created: 2018-12-11T12:01:51Z
date_published: 2004-09-01T00:00:00Z
date_updated: 2021-01-12T07:41:36Z
day: '01'
doi: 10.1109/TPAMI.2004.60
extern: 1
intvolume: ' 26'
issue: '9'
month: '09'
page: 1124 - 1137
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3507'
quality_controlled: 0
status: public
title: An experimental comparison of min-cut/max-flow algorithms for energy minimization
in vision
type: journal_article
volume: 26
year: '2004'
...
---
_id: '3179'
abstract:
- lang: eng
text: The problem of efficient, interactive foreground/background segmentation in
still images is of great practical importance in image editing. Classical image
segmentation tools use either texture (colour) information, e.g. Magic Wand, or
edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach
based on optimization by graph-cut has been developed which successfully combines
both types of information. In this paper we extend the graph-cut approach in three
respects. First, we have developed a more powerful, iterative version of the optimisation.
Secondly, the power of the iterative algorithm is used to simplify substantially
the user interaction needed for a given quality of result. Thirdly, a robust algorithm
for "border matting" has been developed to estimate simultaneously the
alpha-matte around an object boundary and the colours of foreground pixels. We
show that for moderately difficult examples the proposed method outperforms competitive
tools.
author:
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
citation:
ama: 'Rother C, Kolmogorov V, Blake A. "GrabCut" - Interactive
foreground extraction using iterated graph cuts . In: Vol 23. ACM; 2004:309-314.
doi:10.1145/1015706.1015720'
apa: 'Rother, C., Kolmogorov, V., & Blake, A. (2004). "GrabCut"
- Interactive foreground extraction using iterated graph cuts (Vol. 23, pp. 309–314).
Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques, ACM. https://doi.org/10.1145/1015706.1015720'
chicago: Rother, Carsten, Vladimir Kolmogorov, and Andrew Blake. “"GrabCut"
- Interactive Foreground Extraction Using Iterated Graph Cuts ,” 23:309–14. ACM,
2004. https://doi.org/10.1145/1015706.1015720.
ieee: 'C. Rother, V. Kolmogorov, and A. Blake, “"GrabCut" - Interactive
foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH:
Special Interest Group on Computer Graphics and Interactive Techniques, 2004,
vol. 23, no. 3, pp. 309–314.'
ista: 'Rother C, Kolmogorov V, Blake A. 2004. "GrabCut" - Interactive
foreground extraction using iterated graph cuts . SIGGRAPH: Special Interest Group
on Computer Graphics and Interactive Techniques vol. 23, 309–314.'
mla: Rother, Carsten, et al. "GrabCut" - Interactive Foreground
Extraction Using Iterated Graph Cuts . Vol. 23, no. 3, ACM, 2004, pp. 309–14,
doi:10.1145/1015706.1015720.
short: C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314.
conference:
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
date_created: 2018-12-11T12:01:51Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2021-01-12T07:41:36Z
day: '01'
doi: 10.1145/1015706.1015720
extern: 1
intvolume: ' 23'
issue: '3'
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/67890/siggraph04-grabcut.pdf
month: '08'
page: 309 - 314
publication_status: published
publisher: ACM
publist_id: '3505'
quality_controlled: 0
status: public
title: '"GrabCut" - Interactive foreground extraction using iterated graph
cuts '
type: conference
volume: 23
year: '2004'
...
---
_id: '3208'
abstract:
- lang: eng
text: |-
A new technique for proving the adaptive indistinguishability of two systems, each composed of some component systems, is presented, using only the fact that corresponding component systems are non-adaptively indistinguishable. The main tool is the definition of a special monotone condition for a random system F, relative to another random system G, whose probability of occurring for a given distinguisher D is closely related to the distinguishing advantage ε of D for F and G, namely it is lower and upper bounded by ε and (1+ln1), respectively.
A concrete instantiation of this result shows that the cascade of two random permutations (with the second one inverted) is indistinguishable from a uniform random permutation by adaptive distinguishers which may query the system from both sides, assuming the components’ security only against non-adaptive one-sided distinguishers.
As applications we provide some results in various fields as almost k-wise independent probability spaces, decorrelation theory and computational indistinguishability (i.e., pseudo-randomness).
alternative_title:
- LNCS
author:
- first_name: Ueli
full_name: Maurer, Ueli M
last_name: Maurer
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one
strong. In: Vol 2951. Springer; 2004:410-427. doi:10.1007/978-3-540-24638-1_23'
apa: 'Maurer, U., & Pietrzak, K. Z. (2004). Composition of random systems: When
two weak make one strong (Vol. 2951, pp. 410–427). Presented at the TCC: Theory
of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-540-24638-1_23'
chicago: 'Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems:
When Two Weak Make One Strong,” 2951:410–27. Springer, 2004. https://doi.org/10.1007/978-3-540-24638-1_23.'
ieee: 'U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak
make one strong,” presented at the TCC: Theory of Cryptography Conference, 2004,
vol. 2951, pp. 410–427.'
ista: 'Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak
make one strong. TCC: Theory of Cryptography Conference, LNCS, vol. 2951, 410–427.'
mla: 'Maurer, Ueli, and Krzysztof Z. Pietrzak. Composition of Random Systems:
When Two Weak Make One Strong. Vol. 2951, Springer, 2004, pp. 410–27, doi:10.1007/978-3-540-24638-1_23.'
short: U. Maurer, K.Z. Pietrzak, in:, Springer, 2004, pp. 410–427.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:01Z
date_published: 2004-03-19T00:00:00Z
date_updated: 2021-01-12T07:41:48Z
day: '19'
doi: 10.1007/978-3-540-24638-1_23
extern: 1
intvolume: ' 2951'
month: '03'
page: 410 - 427
publication_status: published
publisher: Springer
publist_id: '3471'
quality_controlled: 0
status: public
title: 'Composition of random systems: When two weak make one strong'
type: conference
volume: 2951
year: '2004'
...
---
_id: '3419'
abstract:
- lang: eng
text: The folding and stability of transmembrane proteins is a fundamental and unsolved
biological problem. Here, single bacteriorhodopsin molecules were mechanically
unfolded from native purple membranes using atomic force microscopy and force
spectroscopy. The energy landscape of individual transmembrane α helices and polypeptide
loops was mapped by monitoring the pulling speed dependence of the unfolding forces
and applying Monte Carlo simulations. Single helices formed independently stable
units stabilized by a single potential barrier. Mechanical unfolding of the helices
was triggered by 3.9–7.7 Å extension, while natural unfolding rates were of the
order of 10−3 s−1. Besides acting as individually stable units, helices associated
pairwise, establishing a collective potential barrier. The unfolding pathways
of individual proteins reflect distinct pulling speed-dependent unfolding routes
in their energy landscapes. These observations support the two-stage model of
membrane protein folding in which α helices insert into the membrane as stable
units and then assemble into the functional protein.
author:
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Jens
full_name: Struckmeier, Jens
last_name: Struckmeier
- first_name: Maurice
full_name: Hubain, Maurice
last_name: Hubain
- first_name: Max
full_name: Kessler, Max
last_name: Kessler
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. Probing
the energy landscape of the membrane protein bacteriorhodopsin. Structure.
2004;12(5):871-879. doi:10.1016/j.str.2004.03.016
apa: Janovjak, H. L., Struckmeier, J., Hubain, M., Kessler, M., Kedrov, A., &
Mueller, D. (2004). Probing the energy landscape of the membrane protein bacteriorhodopsin.
Structure. Cell Press. https://doi.org/10.1016/j.str.2004.03.016
chicago: Janovjak, Harald L, Jens Struckmeier, Maurice Hubain, Max Kessler, Alexej
Kedrov, and Daniel Mueller. “Probing the Energy Landscape of the Membrane Protein
Bacteriorhodopsin.” Structure. Cell Press, 2004. https://doi.org/10.1016/j.str.2004.03.016.
ieee: H. L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, and D. Mueller,
“Probing the energy landscape of the membrane protein bacteriorhodopsin,” Structure,
vol. 12, no. 5. Cell Press, pp. 871–879, 2004.
ista: Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. 2004.
Probing the energy landscape of the membrane protein bacteriorhodopsin. Structure.
12(5), 871–879.
mla: Janovjak, Harald L., et al. “Probing the Energy Landscape of the Membrane Protein
Bacteriorhodopsin.” Structure, vol. 12, no. 5, Cell Press, 2004, pp. 871–79,
doi:10.1016/j.str.2004.03.016.
short: H.L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, D. Mueller,
Structure 12 (2004) 871–879.
date_created: 2018-12-11T12:03:14Z
date_published: 2004-05-01T00:00:00Z
date_updated: 2021-01-12T07:43:20Z
day: '01'
doi: 10.1016/j.str.2004.03.016
extern: 1
intvolume: ' 12'
issue: '5'
month: '05'
page: 871 - 879
publication: Structure
publication_status: published
publisher: Cell Press
publist_id: '2982'
quality_controlled: 0
status: public
title: Probing the energy landscape of the membrane protein bacteriorhodopsin
type: journal_article
volume: 12
year: '2004'
...
---
_id: '3420'
abstract:
- lang: eng
text: Single-molecule force-spectroscopy was employed to unfold and refold single
sodium-proton antiporters (NhaA) of Escherichia coli from membrane patches. Although
transmembrane α-helices and extracellular polypeptide loops exhibited sufficient
stability to individually establish potential barriers against unfolding, two
helices predominantly unfolded pairwise, thereby acting as one structural unit.
Many of the potential barriers were detected unfolding NhaA either from the C-terminal
or the N-terminal end. It was found that some molecular interactions stabilizing
secondary structural elements were directional, while others were not. Additionally,
some interactions appeared to occur between the secondary structural elements.
After unfolding ten of the 12 helices, the extracted polypeptide was allowed to
refold back into the membrane. After five seconds, the refolded polypeptide established
all secondary structure elements of the native protein. One helical pair showed
a characteristic spring like “snap in” into its folded conformation, while the
refolding process of other helices was not detected in particular. Additionally,
individual helices required characteristic periods of time to fold. Correlating
these results with the primary structure of NhaA allowed us to obtain the first
insights into how potential barriers establish and determine the folding kinetics
of the secondary structure elements.
author:
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Christine
full_name: Ziegler, Christine
last_name: Ziegler
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Werner
full_name: Kühlbrandt, Werner
last_name: Kühlbrandt
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. Controlled unfolding
and refolding of a single sodium/proton antiporter using atomic force microscopy.
Journal of Molecular Biology. 2004;340(5):1143-1152. doi:10.1016/j.jmb.2004.05.026
apa: Kedrov, A., Ziegler, C., Janovjak, H. L., Kühlbrandt, W., & Mueller, D.
(2004). Controlled unfolding and refolding of a single sodium/proton antiporter
using atomic force microscopy. Journal of Molecular Biology. Elsevier.
https://doi.org/10.1016/j.jmb.2004.05.026
chicago: Kedrov, Alexej, Christine Ziegler, Harald L Janovjak, Werner Kühlbrandt,
and Daniel Mueller. “Controlled Unfolding and Refolding of a Single Sodium/Proton
Antiporter Using Atomic Force Microscopy.” Journal of Molecular Biology.
Elsevier, 2004. https://doi.org/10.1016/j.jmb.2004.05.026.
ieee: A. Kedrov, C. Ziegler, H. L. Janovjak, W. Kühlbrandt, and D. Mueller, “Controlled
unfolding and refolding of a single sodium/proton antiporter using atomic force
microscopy,” Journal of Molecular Biology, vol. 340, no. 5. Elsevier, pp.
1143–1152, 2004.
ista: Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. 2004. Controlled
unfolding and refolding of a single sodium/proton antiporter using atomic force
microscopy. Journal of Molecular Biology. 340(5), 1143–1152.
mla: Kedrov, Alexej, et al. “Controlled Unfolding and Refolding of a Single Sodium/Proton
Antiporter Using Atomic Force Microscopy.” Journal of Molecular Biology,
vol. 340, no. 5, Elsevier, 2004, pp. 1143–52, doi:10.1016/j.jmb.2004.05.026.
short: A. Kedrov, C. Ziegler, H.L. Janovjak, W. Kühlbrandt, D. Mueller, Journal
of Molecular Biology 340 (2004) 1143–1152.
date_created: 2018-12-11T12:03:14Z
date_published: 2004-07-23T00:00:00Z
date_updated: 2021-01-12T07:43:21Z
day: '23'
doi: 10.1016/j.jmb.2004.05.026
extern: 1
intvolume: ' 340'
issue: '5'
month: '07'
page: 1143 - 1152
publication: Journal of Molecular Biology
publication_status: published
publisher: Elsevier
publist_id: '2981'
quality_controlled: 0
status: public
title: Controlled unfolding and refolding of a single sodium/proton antiporter using
atomic force microscopy
type: journal_article
volume: 340
year: '2004'
...
---
_id: '3574'
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Edelsbrunner H. Biological applications of computational topology. In: Handbook
of Discrete and Computational Geometry. CRC Press; 2004:1395-1412.'
apa: Edelsbrunner, H. (2004). Biological applications of computational topology.
In Handbook of Discrete and Computational Geometry (pp. 1395–1412). CRC
Press.
chicago: Edelsbrunner, Herbert. “Biological Applications of Computational Topology.”
In Handbook of Discrete and Computational Geometry, 1395–1412. CRC Press,
2004.
ieee: H. Edelsbrunner, “Biological applications of computational topology,” in Handbook
of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–1412.
ista: 'Edelsbrunner H. 2004.Biological applications of computational topology. In:
Handbook of Discrete and Computational Geometry. , 1395–1412.'
mla: Edelsbrunner, Herbert. “Biological Applications of Computational Topology.”
Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–412.
short: H. Edelsbrunner, in:, Handbook of Discrete and Computational Geometry, CRC
Press, 2004, pp. 1395–1412.
date_created: 2018-12-11T12:04:02Z
date_published: 2004-04-15T00:00:00Z
date_updated: 2021-01-12T07:44:24Z
day: '15'
extern: 1
main_file_link:
- open_access: '0'
url: http://www.cs.duke.edu/~edels/Papers/2004-B-01-BiologicalApplicationsTopology.pdf
month: '04'
page: 1395 - 1412
publication: Handbook of Discrete and Computational Geometry
publication_status: published
publisher: CRC Press
publist_id: '2811'
quality_controlled: 0
status: public
title: Biological applications of computational topology
type: book_chapter
year: '2004'
...
---
_id: '3575'
abstract:
- lang: eng
text: The Jacobi set of two Morse functions defined on a common - manifold is the
set of critical points of the restrictions of one func- tion to the level sets
of the other function. Equivalently, it is the set of points where the gradients
of the functions are parallel. For a generic pair of Morse functions, the Jacobi
set is a smoothly embed- ded 1-manifold. We give a polynomial-time algorithm that
com- putes the piecewise linear analog of the Jacobi set for functions specified
at the vertices of a triangulation, and we generalize all results to more than
two but at most Morse functions.
alternative_title:
- London Mathematical Society Lecture Note
author:
- first_name: Herbert
full_name: Herbert Edelsbrunner
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: John
full_name: Harer, John
last_name: Harer
citation:
ama: 'Edelsbrunner H, Harer J. Jacobi sets of multiple Morse functions. In: Foundations
of Computational Mathematics. Vol 312. Springer; 2004:37-57. doi:10.1017/CBO9781139106962.003'
apa: Edelsbrunner, H., & Harer, J. (2004). Jacobi sets of multiple Morse functions.
In Foundations of Computational Mathematics (Vol. 312, pp. 37–57). Springer.
https://doi.org/10.1017/CBO9781139106962.003
chicago: Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.”
In Foundations of Computational Mathematics, 312:37–57. Springer, 2004.
https://doi.org/10.1017/CBO9781139106962.003.
ieee: H. Edelsbrunner and J. Harer, “Jacobi sets of multiple Morse functions,” in
Foundations of Computational Mathematics, vol. 312, Springer, 2004, pp.
37–57.
ista: 'Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In:
Foundations of Computational Mathematics. London Mathematical Society Lecture
Note, vol. 312, 37–57.'
mla: Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.”
Foundations of Computational Mathematics, vol. 312, Springer, 2004, pp.
37–57, doi:10.1017/CBO9781139106962.003.
short: H. Edelsbrunner, J. Harer, in:, Foundations of Computational Mathematics,
Springer, 2004, pp. 37–57.
date_created: 2018-12-11T12:04:02Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2021-01-12T07:44:24Z
day: '01'
doi: 10.1017/CBO9781139106962.003
extern: 1
intvolume: ' 312'
month: '01'
page: 37 - 57
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '2810'
quality_controlled: 0
status: public
title: Jacobi sets of multiple Morse functions
type: book_chapter
volume: 312
year: '2004'
...
---
_id: '3587'
alternative_title:
- Molecular Aspects of Fish and Marine Biology
article_processing_charge: No
author:
- first_name: Florian
full_name: Ulrich, Florian
last_name: Ulrich
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: 'Ulrich F, Heisenberg C-PJ. Gastrulation in zebrafish. In: Korzh V, Gong Z,
eds. Fish Development and Genetics : The Zebrafish and Medaka Models. Vol
2. World Scientific Publishing; 2004:39-86.'
apa: 'Ulrich, F., & Heisenberg, C.-P. J. (2004). Gastrulation in zebrafish.
In V. Korzh & Z. Gong (Eds.), Fish development and genetics : the zebrafish
and medaka models (Vol. 2, pp. 39–86). World Scientific Publishing.'
chicago: 'Ulrich, Florian, and Carl-Philipp J Heisenberg. “Gastrulation in Zebrafish.”
In Fish Development and Genetics : The Zebrafish and Medaka Models, edited
by Vladimir Korzh and Zhiyuan Gong, 2:39–86. World Scientific Publishing, 2004.'
ieee: 'F. Ulrich and C.-P. J. Heisenberg, “Gastrulation in zebrafish,” in Fish
development and genetics : the zebrafish and medaka models, vol. 2, V. Korzh
and Z. Gong, Eds. World Scientific Publishing, 2004, pp. 39–86.'
ista: 'Ulrich F, Heisenberg C-PJ. 2004.Gastrulation in zebrafish. In: Fish development
and genetics : the zebrafish and medaka models. Molecular Aspects of Fish and
Marine Biology, vol. 2, 39–86.'
mla: 'Ulrich, Florian, and Carl-Philipp J. Heisenberg. “Gastrulation in Zebrafish.”
Fish Development and Genetics : The Zebrafish and Medaka Models, edited
by Vladimir Korzh and Zhiyuan Gong, vol. 2, World Scientific Publishing, 2004,
pp. 39–86.'
short: 'F. Ulrich, C.-P.J. Heisenberg, in:, V. Korzh, Z. Gong (Eds.), Fish Development
and Genetics : The Zebrafish and Medaka Models, World Scientific Publishing, 2004,
pp. 39–86.'
date_created: 2018-12-11T12:04:06Z
date_published: 2004-11-01T00:00:00Z
date_updated: 2021-01-12T07:44:29Z
day: '01'
editor:
- first_name: Vladimir
full_name: Korzh, Vladimir
last_name: Korzh
- first_name: Zhiyuan
full_name: Gong, Zhiyuan
last_name: Gong
extern: '1'
intvolume: ' 2'
language:
- iso: eng
month: '11'
oa_version: None
page: 39 - 86
publication: 'Fish development and genetics : the zebrafish and medaka models'
publication_status: published
publisher: World Scientific Publishing
publist_id: '2796'
status: public
title: Gastrulation in zebrafish
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2004'
...
---
_id: '3595'
abstract:
- lang: eng
text: Genome sizes vary enormously. This variation in DNA content correlates with
effective population size, suggesting that deleterious additions to the genome
can accumulate in small populations. On this view, the increased complexity of
biological functions associated with large genomes partly reflects evolutionary
degeneration.
author:
- first_name: Brian
full_name: Charlesworth, Brian
last_name: Charlesworth
- first_name: Nicholas H
full_name: Nicholas Barton
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Charlesworth B, Barton NH. Genome size: Does bigger mean worse? Current
Biology. 2004;14(6):R233-R235. doi:10.1016/j.cub.2004.02.054'
apa: 'Charlesworth, B., & Barton, N. H. (2004). Genome size: Does bigger mean
worse? Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2004.02.054'
chicago: 'Charlesworth, Brian, and Nicholas H Barton. “Genome Size: Does Bigger
Mean Worse?” Current Biology. Cell Press, 2004. https://doi.org/10.1016/j.cub.2004.02.054.'
ieee: 'B. Charlesworth and N. H. Barton, “Genome size: Does bigger mean worse?,”
Current Biology, vol. 14, no. 6. Cell Press, pp. R233–R235, 2004.'
ista: 'Charlesworth B, Barton NH. 2004. Genome size: Does bigger mean worse? Current
Biology. 14(6), R233–R235.'
mla: 'Charlesworth, Brian, and Nicholas H. Barton. “Genome Size: Does Bigger Mean
Worse?” Current Biology, vol. 14, no. 6, Cell Press, 2004, pp. R233–35,
doi:10.1016/j.cub.2004.02.054.'
short: B. Charlesworth, N.H. Barton, Current Biology 14 (2004) R233–R235.
date_created: 2018-12-11T12:04:09Z
date_published: 2004-03-01T00:00:00Z
date_updated: 2019-04-26T07:22:31Z
day: '01'
doi: 10.1016/j.cub.2004.02.054
extern: 1
intvolume: ' 14'
issue: '6'
month: '03'
page: R233 - R235
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '2788'
quality_controlled: 0
status: public
title: 'Genome size: Does bigger mean worse?'
type: review
volume: 14
year: '2004'
...