---
_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: '11762'
abstract:
- lang: eng
text: 'In this paper, we describe six algorithmic problems that arise in web search
engines and that are not or only partially solved: (1) Uniformly sampling of web
pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top
gainers and losers in data streams; (5) finding large dense bipartite graphs; and
(6) understanding how eigenvectors partition the web.'
article_processing_charge: No
article_type: original
author:
- 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: Henzinger MH. Algorithmic challenges in web search engines. Internet Mathematics.
2004;1(1):115-123. doi:10.1080/15427951.2004.10129079
apa: Henzinger, M. H. (2004). Algorithmic challenges in web search engines. Internet
Mathematics. Internet Mathematics. https://doi.org/10.1080/15427951.2004.10129079
chicago: Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” Internet
Mathematics. Internet Mathematics, 2004. https://doi.org/10.1080/15427951.2004.10129079.
ieee: M. H. Henzinger, “Algorithmic challenges in web search engines,” Internet
Mathematics, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.
ista: Henzinger MH. 2004. Algorithmic challenges in web search engines. Internet
Mathematics. 1(1), 115–123.
mla: Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” Internet
Mathematics, vol. 1, no. 1, Internet Mathematics, 2004, pp. 115–23, doi:10.1080/15427951.2004.10129079.
short: M.H. Henzinger, Internet Mathematics 1 (2004) 115–123.
date_created: 2022-08-08T11:55:53Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2023-02-10T07:47:21Z
day: '01'
doi: 10.1080/15427951.2004.10129079
extern: '1'
intvolume: ' 1'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1080/15427951.2004.10129079
month: '01'
oa: 1
oa_version: Published Version
page: 115-123
publication: Internet Mathematics
publication_identifier:
eissn:
- 1944-9488
issn:
- 1542-7951
publication_status: published
publisher: Internet Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic challenges in web search engines
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2004'
...
---
_id: '8517'
abstract:
- lang: eng
text: We consider the evolution of a connected set on the plane carried by a space
periodic incompressible stochastic flow. While for almost every realization of
the stochastic flow at time t most of the particles are at a distance of order
equation image away from the origin, there is a measure zero set of points that
escape to infinity at the linear rate. We study the set of points visited by the
original set by time t and show that such a set, when scaled down by the factor
of t, has a limiting nonrandom shape.
article_processing_charge: No
article_type: original
author:
- first_name: Dmitry
full_name: Dolgopyat, Dmitry
last_name: Dolgopyat
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Leonid
full_name: Koralov, Leonid
last_name: Koralov
citation:
ama: Dolgopyat D, Kaloshin V, Koralov L. A limit shape theorem for periodic stochastic
dispersion. Communications on Pure and Applied Mathematics. 2004;57(9):1127-1158.
doi:10.1002/cpa.20032
apa: Dolgopyat, D., Kaloshin, V., & Koralov, L. (2004). A limit shape theorem
for periodic stochastic dispersion. Communications on Pure and Applied Mathematics.
Wiley. https://doi.org/10.1002/cpa.20032
chicago: Dolgopyat, Dmitry, Vadim Kaloshin, and Leonid Koralov. “A Limit Shape Theorem
for Periodic Stochastic Dispersion.” Communications on Pure and Applied Mathematics.
Wiley, 2004. https://doi.org/10.1002/cpa.20032.
ieee: D. Dolgopyat, V. Kaloshin, and L. Koralov, “A limit shape theorem for periodic
stochastic dispersion,” Communications on Pure and Applied Mathematics,
vol. 57, no. 9. Wiley, pp. 1127–1158, 2004.
ista: Dolgopyat D, Kaloshin V, Koralov L. 2004. A limit shape theorem for periodic
stochastic dispersion. Communications on Pure and Applied Mathematics. 57(9),
1127–1158.
mla: Dolgopyat, Dmitry, et al. “A Limit Shape Theorem for Periodic Stochastic Dispersion.”
Communications on Pure and Applied Mathematics, vol. 57, no. 9, Wiley,
2004, pp. 1127–58, doi:10.1002/cpa.20032.
short: D. Dolgopyat, V. Kaloshin, L. Koralov, Communications on Pure and Applied
Mathematics 57 (2004) 1127–1158.
date_created: 2020-09-18T10:49:12Z
date_published: 2004-09-01T00:00:00Z
date_updated: 2021-01-12T08:19:50Z
day: '01'
doi: 10.1002/cpa.20032
extern: '1'
intvolume: ' 57'
issue: '9'
keyword:
- Applied Mathematics
- General Mathematics
language:
- iso: eng
month: '09'
oa_version: None
page: 1127-1158
publication: Communications on Pure and Applied Mathematics
publication_identifier:
issn:
- 0010-3640
- 1097-0312
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: A limit shape theorem for periodic stochastic dispersion
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2004'
...
---
_id: '8518'
article_processing_charge: No
article_type: original
author:
- first_name: Leonid
full_name: Koralov, Leonid
last_name: Koralov
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Dmitry
full_name: Dolgopyat, Dmitry
last_name: Dolgopyat
citation:
ama: Koralov L, Kaloshin V, Dolgopyat D. Sample path properties of the stochastic
flows. The Annals of Probability. 2004;32(1A):1-27. doi:10.1214/aop/1078415827
apa: Koralov, L., Kaloshin, V., & Dolgopyat, D. (2004). Sample path properties
of the stochastic flows. The Annals of Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/aop/1078415827
chicago: Koralov, Leonid, Vadim Kaloshin, and Dmitry Dolgopyat. “Sample Path Properties
of the Stochastic Flows.” The Annals of Probability. Institute of Mathematical
Statistics, 2004. https://doi.org/10.1214/aop/1078415827.
ieee: L. Koralov, V. Kaloshin, and D. Dolgopyat, “Sample path properties of the
stochastic flows,” The Annals of Probability, vol. 32, no. 1A. Institute
of Mathematical Statistics, pp. 1–27, 2004.
ista: Koralov L, Kaloshin V, Dolgopyat D. 2004. Sample path properties of the stochastic
flows. The Annals of Probability. 32(1A), 1–27.
mla: Koralov, Leonid, et al. “Sample Path Properties of the Stochastic Flows.” The
Annals of Probability, vol. 32, no. 1A, Institute of Mathematical Statistics,
2004, pp. 1–27, doi:10.1214/aop/1078415827.
short: L. Koralov, V. Kaloshin, D. Dolgopyat, The Annals of Probability 32 (2004)
1–27.
date_created: 2020-09-18T10:49:19Z
date_published: 2004-03-04T00:00:00Z
date_updated: 2021-01-12T08:19:50Z
day: '04'
doi: 10.1214/aop/1078415827
extern: '1'
intvolume: ' 32'
issue: 1A
language:
- iso: eng
month: '03'
oa_version: None
page: 1-27
publication: The Annals of Probability
publication_identifier:
issn:
- 0091-1798
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
status: public
title: Sample path properties of the stochastic flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2004'
...
---
_id: '864'
abstract:
- lang: eng
text: 'We present a method for prediction of functional sites in a set of aligned
protein sequences. The method selects sites which are both well conserved and
clustered together in space, as inferred from the 3D structures of proteins included
in the alignment. We tested the method using 86 alignments from the NCBI CDD database,
where the sites of experimentally determined ligand and/or macromolecular interactions
are annotated. In agreement with earlier investigations, we found that functional
site predictions are most successful when overall background sequence conservation
is low, such that sites under evolutionary constraint become apparent. In addition,
we found that averaging of conservation values across spatially clustered sites
improves predictions under certain conditions: that is, when overall conservation
is relatively high and when the site in question involves a large macromolecular
binding interface. Under these conditions it is better to look for clusters of
conserved sites than to look for particular conserved sites.'
acknowledgement: We thank John Spouge, Ben Shoemaker, and Michael Galperin forhelpful
suggestions, and the NIH Intramural Research Program forsupport.
author:
- first_name: Anna
full_name: Panchenko, Anna R
last_name: Panchenko
- first_name: Fyodor
full_name: Fyodor Kondrashov
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Stephen
full_name: Bryant, Stephen H
last_name: Bryant
citation:
ama: Panchenko A, Kondrashov F, Bryant S. Prediction of functional sites by analysis
of sequence and structure conservation. Protein Science. 2004;13(4):884-892.
doi:10.1110/ps.03465504
apa: Panchenko, A., Kondrashov, F., & Bryant, S. (2004). Prediction of functional
sites by analysis of sequence and structure conservation. Protein Science.
Wiley-Blackwell. https://doi.org/10.1110/ps.03465504
chicago: Panchenko, Anna, Fyodor Kondrashov, and Stephen Bryant. “Prediction of
Functional Sites by Analysis of Sequence and Structure Conservation.” Protein
Science. Wiley-Blackwell, 2004. https://doi.org/10.1110/ps.03465504.
ieee: A. Panchenko, F. Kondrashov, and S. Bryant, “Prediction of functional sites
by analysis of sequence and structure conservation,” Protein Science, vol.
13, no. 4. Wiley-Blackwell, pp. 884–892, 2004.
ista: Panchenko A, Kondrashov F, Bryant S. 2004. Prediction of functional sites
by analysis of sequence and structure conservation. Protein Science. 13(4), 884–892.
mla: Panchenko, Anna, et al. “Prediction of Functional Sites by Analysis of Sequence
and Structure Conservation.” Protein Science, vol. 13, no. 4, Wiley-Blackwell,
2004, pp. 884–92, doi:10.1110/ps.03465504.
short: A. Panchenko, F. Kondrashov, S. Bryant, Protein Science 13 (2004) 884–892.
date_created: 2018-12-11T11:48:55Z
date_published: 2004-04-01T00:00:00Z
date_updated: 2021-01-12T08:20:22Z
day: '01'
doi: 10.1110/ps.03465504
extern: 1
intvolume: ' 13'
issue: '4'
month: '04'
page: 884 - 892
publication: Protein Science
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6786'
quality_controlled: 0
status: public
title: Prediction of functional sites by analysis of sequence and structure conservation
type: journal_article
volume: 13
year: '2004'
...
---
_id: '870'
abstract:
- lang: eng
text: Only a fraction of eukaryotic genes affect the phenotype drastically. We compared
18 parameters in 1273 human morbid genes, known to cause diseases, and in the
remaining 16 580 unambiguous human genes. Morbid genes evolve more slowly, have
wider phylogenetic distributions, are more similar to essential genes of Drosophila
melanogaster, code for longer proteins containing more alanine and glycine and
less histidine, lysine and methionine, possess larger numbers of longer introns
with more accurate splicing signals and have higher and broader expressions. These
differences make it possible to classify as non-morbid 34% of human genes with
unknown morbidity, when only 5% of known morbid genes are incorrectly classified
as non-morbid. This classification can help to identify disease-causing genes
among multiple candidates.
author:
- first_name: Fyodor
full_name: Fyodor Kondrashov
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Aleksey
full_name: Ogurtsov, Aleksey Yu
last_name: Ogurtsov
- first_name: Alexey
full_name: Kondrashov, Alexey S
last_name: Kondrashov
citation:
ama: Kondrashov F, Ogurtsov A, Kondrashov A. Bioinformatical assay of human gene
morbidity. Nucleic Acids Research. 2004;32(5):1731-1737. doi:10.1093/nar/gkh330
apa: Kondrashov, F., Ogurtsov, A., & Kondrashov, A. (2004). Bioinformatical
assay of human gene morbidity. Nucleic Acids Research. Oxford University
Press. https://doi.org/10.1093/nar/gkh330
chicago: Kondrashov, Fyodor, Aleksey Ogurtsov, and Alexey Kondrashov. “Bioinformatical
Assay of Human Gene Morbidity.” Nucleic Acids Research. Oxford University
Press, 2004. https://doi.org/10.1093/nar/gkh330.
ieee: F. Kondrashov, A. Ogurtsov, and A. Kondrashov, “Bioinformatical assay of human
gene morbidity,” Nucleic Acids Research, vol. 32, no. 5. Oxford University
Press, pp. 1731–1737, 2004.
ista: Kondrashov F, Ogurtsov A, Kondrashov A. 2004. Bioinformatical assay of human
gene morbidity. Nucleic Acids Research. 32(5), 1731–1737.
mla: Kondrashov, Fyodor, et al. “Bioinformatical Assay of Human Gene Morbidity.”
Nucleic Acids Research, vol. 32, no. 5, Oxford University Press, 2004,
pp. 1731–37, doi:10.1093/nar/gkh330.
short: F. Kondrashov, A. Ogurtsov, A. Kondrashov, Nucleic Acids Research 32 (2004)
1731–1737.
date_created: 2018-12-11T11:48:56Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2021-01-12T08:20:37Z
day: '01'
doi: 10.1093/nar/gkh330
extern: 1
intvolume: ' 32'
issue: '5'
month: '01'
page: 1731 - 1737
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '6780'
quality_controlled: 0
status: public
title: Bioinformatical assay of human gene morbidity
type: journal_article
volume: 32
year: '2004'
...
---
_id: '875'
abstract:
- lang: eng
text: The dominance of wild-type alleles and the concomitant recessivity of deleterious
mutant alleles might have evolved by natural selection or could be a by-product
of the molecular and physiological mechanisms of gene action. We compared the
properties of human haplosufficient genes, whose wild-type alleles are dominant
over loss-of-function alleles, with haploinsufficient (recessive wild-type) genes,
which produce an abnormal phenotype when heterozygous for a loss-of-function allele.
The fraction of haplosufficient genes is the highest among the genes that encode
enzymes, which is best compatible with the physiological theory. Haploinsufficient
genes, on average, have more paralogs than haplosufficient genes, supporting the
idea that gene dosage could be important for the initial fixation of duplications.
Thus, haplo(in)sufficiency of a gene and its propensity for duplication might
have a common evolutionary basis.
author:
- first_name: Fyodor
full_name: Fyodor Kondrashov
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Eugene
full_name: Koonin, Eugene V
last_name: Koonin
citation:
ama: Kondrashov F, Koonin E. A common framework for understanding the origin of
genetic dominance and evolutionary fates of gene duplications. Trends in Genetics.
2004;20(7):287-291. doi:10.1016/j.tig.2004.05.001
apa: Kondrashov, F., & Koonin, E. (2004). A common framework for understanding
the origin of genetic dominance and evolutionary fates of gene duplications. Trends
in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2004.05.001
chicago: Kondrashov, Fyodor, and Eugene Koonin. “A Common Framework for Understanding
the Origin of Genetic Dominance and Evolutionary Fates of Gene Duplications.”
Trends in Genetics. Elsevier, 2004. https://doi.org/10.1016/j.tig.2004.05.001.
ieee: F. Kondrashov and E. Koonin, “A common framework for understanding the origin
of genetic dominance and evolutionary fates of gene duplications,” Trends in
Genetics, vol. 20, no. 7. Elsevier, pp. 287–291, 2004.
ista: Kondrashov F, Koonin E. 2004. A common framework for understanding the origin
of genetic dominance and evolutionary fates of gene duplications. Trends in Genetics.
20(7), 287–291.
mla: Kondrashov, Fyodor, and Eugene Koonin. “A Common Framework for Understanding
the Origin of Genetic Dominance and Evolutionary Fates of Gene Duplications.”
Trends in Genetics, vol. 20, no. 7, Elsevier, 2004, pp. 287–91, doi:10.1016/j.tig.2004.05.001.
short: F. Kondrashov, E. Koonin, Trends in Genetics 20 (2004) 287–291.
date_created: 2018-12-11T11:48:58Z
date_published: 2004-07-01T00:00:00Z
date_updated: 2021-01-12T08:20:54Z
day: '01'
doi: 10.1016/j.tig.2004.05.001
extern: 1
intvolume: ' 20'
issue: '7'
month: '07'
page: 287 - 291
publication: Trends in Genetics
publication_status: published
publisher: Elsevier
publist_id: '6775'
quality_controlled: 0
status: public
title: A common framework for understanding the origin of genetic dominance and evolutionary
fates of gene duplications
type: journal_article
volume: 20
year: '2004'
...