---
_id: '6148'
author:
- first_name: Jan E.
full_name: Kammenga, Jan E.
last_name: Kammenga
- first_name: Patrick C.
full_name: Phillips, Patrick C.
last_name: Phillips
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: Agnieszka
full_name: Doroszuk, Agnieszka
last_name: Doroszuk
citation:
ama: 'Kammenga JE, Phillips PC, de Bono M, Doroszuk A. Beyond induced mutants: using
worms to study natural variation in genetic pathways. Trends in Genetics.
2008;24(4):178-185. doi:10.1016/j.tig.2008.01.001'
apa: 'Kammenga, J. E., Phillips, P. C., de Bono, M., & Doroszuk, A. (2008).
Beyond induced mutants: using worms to study natural variation in genetic pathways.
Trends in Genetics. Elsevier. https://doi.org/10.1016/j.tig.2008.01.001'
chicago: 'Kammenga, Jan E., Patrick C. Phillips, Mario de Bono, and Agnieszka Doroszuk.
“Beyond Induced Mutants: Using Worms to Study Natural Variation in Genetic Pathways.”
Trends in Genetics. Elsevier, 2008. https://doi.org/10.1016/j.tig.2008.01.001.'
ieee: 'J. E. Kammenga, P. C. Phillips, M. de Bono, and A. Doroszuk, “Beyond induced
mutants: using worms to study natural variation in genetic pathways,” Trends
in Genetics, vol. 24, no. 4. Elsevier, pp. 178–185, 2008.'
ista: 'Kammenga JE, Phillips PC, de Bono M, Doroszuk A. 2008. Beyond induced mutants:
using worms to study natural variation in genetic pathways. Trends in Genetics.
24(4), 178–185.'
mla: 'Kammenga, Jan E., et al. “Beyond Induced Mutants: Using Worms to Study Natural
Variation in Genetic Pathways.” Trends in Genetics, vol. 24, no. 4, Elsevier,
2008, pp. 178–85, doi:10.1016/j.tig.2008.01.001.'
short: J.E. Kammenga, P.C. Phillips, M. de Bono, A. Doroszuk, Trends in Genetics
24 (2008) 178–185.
date_created: 2019-03-21T08:19:45Z
date_published: 2008-04-01T00:00:00Z
date_updated: 2021-01-12T08:06:21Z
day: '01'
doi: 10.1016/j.tig.2008.01.001
extern: '1'
external_id:
pmid:
- '18325626'
intvolume: ' 24'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 178-185
pmid: 1
publication: Trends in Genetics
publication_identifier:
issn:
- 0168-9525
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'Beyond induced mutants: using worms to study natural variation in genetic
pathways'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2008'
...
---
_id: '6149'
article_processing_charge: No
author:
- first_name: Birgitta
full_name: Olofsson, Birgitta
last_name: Olofsson
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: 'Olofsson B, de Bono M. Sleep: dozy worms and sleepy flies. Current Biology.
2008;18(5):R204-R206. doi:10.1016/j.cub.2008.01.002'
apa: 'Olofsson, B., & de Bono, M. (2008). Sleep: dozy worms and sleepy flies.
Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2008.01.002'
chicago: 'Olofsson, Birgitta, and Mario de Bono. “Sleep: Dozy Worms and Sleepy Flies.”
Current Biology. Elsevier, 2008. https://doi.org/10.1016/j.cub.2008.01.002.'
ieee: 'B. Olofsson and M. de Bono, “Sleep: dozy worms and sleepy flies,” Current
Biology, vol. 18, no. 5. Elsevier, pp. R204–R206, 2008.'
ista: 'Olofsson B, de Bono M. 2008. Sleep: dozy worms and sleepy flies. Current
Biology. 18(5), R204–R206.'
mla: 'Olofsson, Birgitta, and Mario de Bono. “Sleep: Dozy Worms and Sleepy Flies.”
Current Biology, vol. 18, no. 5, Elsevier, 2008, pp. R204–06, doi:10.1016/j.cub.2008.01.002.'
short: B. Olofsson, M. de Bono, Current Biology 18 (2008) R204–R206.
date_created: 2019-03-21T08:23:24Z
date_published: 2008-03-11T00:00:00Z
date_updated: 2022-08-25T15:03:41Z
day: '11'
doi: 10.1016/j.cub.2008.01.002
extern: '1'
external_id:
pmid:
- '18334193'
intvolume: ' 18'
issue: '5'
language:
- iso: eng
month: '03'
oa_version: None
page: R204-R206
pmid: 1
publication: Current Biology
publication_identifier:
issn:
- 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'Sleep: dozy worms and sleepy flies'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2008'
...
---
_id: '1982'
abstract:
- lang: eng
text: In the bacterium Escherichia coli, the Min proteins oscillate between the
cell poles to select the cell center as division site. This dynamic pattern has
been proposed to arise by self-organization of these proteins, and several models
have suggested a reaction-diffusion type mechanism. Here, we found that the Min
proteins spontaneously formed planar surface waves on a flat membrane in vitro.
The formation and maintenance of these patterns, which extended for hundreds of
micrometers, required adenosine 5′-triphosphate (ATP), and they persisted for
hours. We present a reaction-diffusion model of the MinD and MinE dynamics that
accounts for our experimental observations and also captures the in vivo oscillations.
acknowledgement: 'This work was supported by the Max-Planck-Society (M.L., P.S., E.F.). '
author:
- first_name: Martin
full_name: Martin Loose
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Elisabeth
full_name: Fischer-Friedrich, Elisabeth
last_name: Fischer Friedrich
- first_name: Jonas
full_name: 'Ries, Jonas '
last_name: Ries
- first_name: Karsten
full_name: Kruse, Karsten
last_name: Kruse
- first_name: Petra
full_name: 'Schwille, Petra '
last_name: Schwille
citation:
ama: Loose M, Fischer Friedrich E, Ries J, Kruse K, Schwille P. Spatial regulators
for bacterial cell division self-organize into surface waves in vitro. Science.
2008;320(5877):789-792. doi:10.1126/science.1154413
apa: Loose, M., Fischer Friedrich, E., Ries, J., Kruse, K., & Schwille, P. (2008).
Spatial regulators for bacterial cell division self-organize into surface waves
in vitro. Science. American Association for the Advancement of Science.
https://doi.org/10.1126/science.1154413
chicago: Loose, Martin, Elisabeth Fischer Friedrich, Jonas Ries, Karsten Kruse,
and Petra Schwille. “Spatial Regulators for Bacterial Cell Division Self-Organize
into Surface Waves in Vitro.” Science. American Association for the Advancement
of Science, 2008. https://doi.org/10.1126/science.1154413.
ieee: M. Loose, E. Fischer Friedrich, J. Ries, K. Kruse, and P. Schwille, “Spatial
regulators for bacterial cell division self-organize into surface waves in vitro,”
Science, vol. 320, no. 5877. American Association for the Advancement of
Science, pp. 789–792, 2008.
ista: Loose M, Fischer Friedrich E, Ries J, Kruse K, Schwille P. 2008. Spatial regulators
for bacterial cell division self-organize into surface waves in vitro. Science.
320(5877), 789–792.
mla: Loose, Martin, et al. “Spatial Regulators for Bacterial Cell Division Self-Organize
into Surface Waves in Vitro.” Science, vol. 320, no. 5877, American Association
for the Advancement of Science, 2008, pp. 789–92, doi:10.1126/science.1154413.
short: M. Loose, E. Fischer Friedrich, J. Ries, K. Kruse, P. Schwille, Science 320
(2008) 789–792.
date_created: 2018-12-11T11:55:02Z
date_published: 2008-05-09T00:00:00Z
date_updated: 2021-01-12T06:54:30Z
day: '09'
doi: 10.1126/science.1154413
extern: 1
intvolume: ' 320'
issue: '5877'
month: '05'
page: 789 - 792
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '5101'
quality_controlled: 0
status: public
title: Spatial regulators for bacterial cell division self-organize into surface waves
in vitro
type: journal_article
volume: 320
year: '2008'
...
---
_id: '2065'
abstract:
- lang: eng
text: 'Population genetics models show that, under certain conditions, the X chromosome
is expected to be under more efficient selection than the autosomes. This could
lead to ''faster-X evolution'', if a large proportion of mutations are fixed by
positive selection, as suggested by recent studies in Drosophila. We used a multispecies
approach to test this: Muller''s element D, an autosomal arm, is fused to the
ancestral X chromosome in Drosophila pseudoobscura and its sister species, Drosophila
affinis. We tested whether the same set of genes had higher rates of non-synonymous
evolution when they were X-linked (in the D. pseudoobscura/D. affinis comparison)
than when they were autosomal (in Drosophila melanogaster/Drosophila yakuba).
Although not significant, our results suggest this may be the case, but only for
genes under particularly strong positive selection/weak purifying selection. They
also suggest that genes that have become X-linked have higher levels of codon
bias and slower synonymous site evolution, consistent with more effective selection
on codon usage at X-linked sites.'
acknowledgement: B.V. was supported by the Portuguese Foundation for Science and Technology,
P.R.H. is supported by the Natural Environmental Research Council (UK) and B.C.
was supported by the Royal Society (UK)
author:
- first_name: Beatriz
full_name: Beatriz Vicoso
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
- first_name: Penelope
full_name: Haddrill, Penelope R
last_name: Haddrill
- first_name: Brian
full_name: Charlesworth, Brian
last_name: Charlesworth
citation:
ama: Vicoso B, Haddrill P, Charlesworth B. A multispecies approach for comparing
sequence evolution of X-linked and autosomal sites in Drosophila. Genetical
Research. 2008;90(5):421-431. doi:10.1017/S0016672308009804
apa: Vicoso, B., Haddrill, P., & Charlesworth, B. (2008). A multispecies approach
for comparing sequence evolution of X-linked and autosomal sites in Drosophila.
Genetical Research. Cambridge University Press. https://doi.org/10.1017/S0016672308009804
chicago: Vicoso, Beatriz, Penelope Haddrill, and Brian Charlesworth. “A Multispecies
Approach for Comparing Sequence Evolution of X-Linked and Autosomal Sites in Drosophila.”
Genetical Research. Cambridge University Press, 2008. https://doi.org/10.1017/S0016672308009804.
ieee: B. Vicoso, P. Haddrill, and B. Charlesworth, “A multispecies approach for
comparing sequence evolution of X-linked and autosomal sites in Drosophila,” Genetical
Research, vol. 90, no. 5. Cambridge University Press, pp. 421–431, 2008.
ista: Vicoso B, Haddrill P, Charlesworth B. 2008. A multispecies approach for comparing
sequence evolution of X-linked and autosomal sites in Drosophila. Genetical Research.
90(5), 421–431.
mla: Vicoso, Beatriz, et al. “A Multispecies Approach for Comparing Sequence Evolution
of X-Linked and Autosomal Sites in Drosophila.” Genetical Research, vol.
90, no. 5, Cambridge University Press, 2008, pp. 421–31, doi:10.1017/S0016672308009804.
short: B. Vicoso, P. Haddrill, B. Charlesworth, Genetical Research 90 (2008) 421–431.
date_created: 2018-12-11T11:55:30Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:05Z
day: '01'
doi: 10.1017/S0016672308009804
extern: 1
intvolume: ' 90'
issue: '5'
month: '10'
page: 421 - 431
publication: Genetical Research
publication_status: published
publisher: Cambridge University Press
publist_id: '4972'
quality_controlled: 0
status: public
title: A multispecies approach for comparing sequence evolution of X-linked and autosomal
sites in Drosophila
type: journal_article
volume: 90
year: '2008'
...
---
_id: '2078'
abstract:
- lang: eng
text: 'This paper presents a novel method for real-time animation of highly-detailed
facial expressions based on a multi-scale decomposition of facial geometry into
large-scale motion and fine-scale details, such as expression wrinkles. Our hybrid
animation is tailored to the specific characteristics of large- and fine-scale
facial deformations: Large-scale deformations are computed with a fast linear
shell model, which is intuitively and accurately controlled through a sparse set
of motion-capture markers or user-defined handle points. Fine-scale facial details
are incorporated using a novel pose-space deformation technique, which learns
the correspondence of sparse measurements of skin strain to wrinkle formation
from a small set of example poses. Our hybrid method features real-time animation
of highly-detailed faces with realistic wrinkle formation, and allows both large-scale
deformations and fine-scale wrinkles to be edited intuitively. Furthermore, our
pose-space representation enables the transfer of facial details to novel expressions
or other facial models.'
acknowledgement: This research was supported by the NCCR Co-Me of the Swiss National
Science Foundation.
author:
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Manuel
full_name: Lang, Manuel
last_name: Lang
- first_name: Mario
full_name: Botsch, Mario
last_name: Botsch
- first_name: Miguel
full_name: Otaduy, Miguel
last_name: Otaduy
- first_name: Markus
full_name: Gross, Markus
last_name: Gross
citation:
ama: 'Bickel B, Lang M, Botsch M, Otaduy M, Gross M. Pose-space animation and transfer
of facial details. In: ACM; 2008:57-66. doi:10.2312/SCA/SCA08/057-066'
apa: 'Bickel, B., Lang, M., Botsch, M., Otaduy, M., & Gross, M. (2008). Pose-space
animation and transfer of facial details (pp. 57–66). Presented at the SIGGRAPH:
Eurographics Symposium on Computer Animation, ACM. https://doi.org/10.2312/SCA/SCA08/057-066'
chicago: Bickel, Bernd, Manuel Lang, Mario Botsch, Miguel Otaduy, and Markus Gross.
“Pose-Space Animation and Transfer of Facial Details,” 57–66. ACM, 2008. https://doi.org/10.2312/SCA/SCA08/057-066.
ieee: 'B. Bickel, M. Lang, M. Botsch, M. Otaduy, and M. Gross, “Pose-space animation
and transfer of facial details,” presented at the SIGGRAPH: Eurographics Symposium
on Computer Animation, 2008, pp. 57–66.'
ista: 'Bickel B, Lang M, Botsch M, Otaduy M, Gross M. 2008. Pose-space animation
and transfer of facial details. SIGGRAPH: Eurographics Symposium on Computer Animation,
57–66.'
mla: Bickel, Bernd, et al. Pose-Space Animation and Transfer of Facial Details.
ACM, 2008, pp. 57–66, doi:10.2312/SCA/SCA08/057-066.
short: B. Bickel, M. Lang, M. Botsch, M. Otaduy, M. Gross, in:, ACM, 2008, pp. 57–66.
conference:
name: 'SIGGRAPH: Eurographics Symposium on Computer Animation'
date_created: 2018-12-11T11:55:35Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:10Z
doi: 10.2312/SCA/SCA08/057-066
extern: '1'
language:
- iso: eng
oa_version: None
page: 57 - 66
publication_status: published
publisher: ACM
publist_id: '4960'
status: public
title: Pose-space animation and transfer of facial details
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2008'
...
---
_id: '1036'
abstract:
- lang: eng
text: We report on the control of interaction-induced dephasing of Bloch oscillations
for an atomic Bose-Einstein condensate in an optical lattice. We quantify the
dephasing in terms of the width of the quasimomentum distribution and measure
its dependence on time for different interaction strengths which we control by
means of a Feshbach resonance. For minimal interaction, the dephasing time is
increased from a few to more than 20 thousand Bloch oscillation periods, allowing
us to realize a BEC-based atom interferometer in the noninteracting limit.
acknowledgement: "We thank A. Daley for theoretical support and for help with\r\nsetting
\ up the numerical calculations and A. Buchleitner\r\nand his group for useful
\ discussions. We are grateful to\r\nA. Liem and H. Zellmer for valuable assistance
in setting\r\nup the 1064 nm fiber amplifier system. We acknowledge\r\ncontributions
\ by P. Unterwaditzer and T. Flir during the\r\nearly stages of the
\ experiment. We are indebted to\r\nR. Grimm for generous support and
\ gratefully acknowledge funding by the Austrian Ministry of Science and\r\nResearch
(BMWF) and the Austrian Science Fund (FWF)."
article_processing_charge: No
arxiv: 1
author:
- first_name: Mattias
full_name: Gustavsson, Mattias
last_name: Gustavsson
- first_name: Elmar
full_name: Haller, Elmar
last_name: Haller
- first_name: Manfred
full_name: Mark, Manfred
last_name: Mark
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Gabriel
full_name: Rojas Kopeinig, Gabriel
last_name: Rojas Kopeinig
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
citation:
ama: Gustavsson M, Haller E, Mark M, Danzl JG, Rojas Kopeinig G, Nägerl H. Control
of interaction-induced dephasing of bloch oscillations. Physical Review Letters.
2008;100(8). doi:10.1103/PhysRevLett.100.080404
apa: Gustavsson, M., Haller, E., Mark, M., Danzl, J. G., Rojas Kopeinig, G., &
Nägerl, H. (2008). Control of interaction-induced dephasing of bloch oscillations.
Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.100.080404
chicago: Gustavsson, Mattias, Elmar Haller, Manfred Mark, Johann G Danzl, Gabriel
Rojas Kopeinig, and Hanns Nägerl. “Control of Interaction-Induced Dephasing of
Bloch Oscillations.” Physical Review Letters. American Physical Society,
2008. https://doi.org/10.1103/PhysRevLett.100.080404.
ieee: M. Gustavsson, E. Haller, M. Mark, J. G. Danzl, G. Rojas Kopeinig, and H.
Nägerl, “Control of interaction-induced dephasing of bloch oscillations,” Physical
Review Letters, vol. 100, no. 8. American Physical Society, 2008.
ista: Gustavsson M, Haller E, Mark M, Danzl JG, Rojas Kopeinig G, Nägerl H. 2008.
Control of interaction-induced dephasing of bloch oscillations. Physical Review
Letters. 100(8).
mla: Gustavsson, Mattias, et al. “Control of Interaction-Induced Dephasing of Bloch
Oscillations.” Physical Review Letters, vol. 100, no. 8, American Physical
Society, 2008, doi:10.1103/PhysRevLett.100.080404.
short: M. Gustavsson, E. Haller, M. Mark, J.G. Danzl, G. Rojas Kopeinig, H. Nägerl,
Physical Review Letters 100 (2008).
date_created: 2018-12-11T11:49:48Z
date_published: 2008-02-28T00:00:00Z
date_updated: 2021-01-12T06:47:49Z
day: '28'
doi: 10.1103/PhysRevLett.100.080404
extern: '1'
external_id:
arxiv:
- '0710.5083'
intvolume: ' 100'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0710.5083
month: '02'
oa: 1
oa_version: None
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '6353'
status: public
title: Control of interaction-induced dephasing of bloch oscillations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 100
year: '2008'
...
---
_id: '1037'
abstract:
- lang: eng
text: We experimentally demonstrate Cs2 Feshbach molecules well above the dissociation
threshold, which are stable against spontaneous decay on the time scale of 1s.
An optically trapped sample of ultracold dimers is prepared in a high rotational
state and magnetically tuned into a region with a negative binding energy. The
metastable character of these molecules arises from the large centrifugal barrier
in combination with negligible coupling to states with low rotational angular
momentum. A sharp onset of dissociation with increasing magnetic field is mediated
by a crossing with a lower rotational dimer state and facilitates dissociation
on demand with a well-defined energy.
acknowledgement: We thank S. Du ̈rr and T. Volz for fruitful discussions. We acknowledge
support by the Austrian Science Fund (FWF) within No. SFB 15 (project part 16).
S.K. is supported within the Marie Curie Intra-European Program of the European
Commission. F.F. is supported within the Lise Meitner program of the FWF.
article_processing_charge: No
arxiv: 1
author:
- first_name: Steven
full_name: Knoop, Steven
last_name: Knoop
- first_name: Michael
full_name: Mark, Michael
last_name: Mark
- first_name: Francesca
full_name: Ferlaino, Francesca
last_name: Ferlaino
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Tobias
full_name: Kraemer, Tobias
last_name: Kraemer
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
- first_name: Rudolf
full_name: Grimm, Rudolf
last_name: Grimm
citation:
ama: Knoop S, Mark M, Ferlaino F, et al. Metastable feshbach molecules in high rotational
states. Physical Review Letters. 2008;100(8). doi:10.1103/PhysRevLett.100.083002
apa: Knoop, S., Mark, M., Ferlaino, F., Danzl, J. G., Kraemer, T., Nägerl, H., &
Grimm, R. (2008). Metastable feshbach molecules in high rotational states. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.100.083002
chicago: Knoop, Steven, Michael Mark, Francesca Ferlaino, Johann G Danzl, Tobias
Kraemer, Hanns Nägerl, and Rudolf Grimm. “Metastable Feshbach Molecules in High
Rotational States.” Physical Review Letters. American Physical Society,
2008. https://doi.org/10.1103/PhysRevLett.100.083002.
ieee: S. Knoop et al., “Metastable feshbach molecules in high rotational
states,” Physical Review Letters, vol. 100, no. 8. American Physical Society,
2008.
ista: Knoop S, Mark M, Ferlaino F, Danzl JG, Kraemer T, Nägerl H, Grimm R. 2008.
Metastable feshbach molecules in high rotational states. Physical Review Letters.
100(8).
mla: Knoop, Steven, et al. “Metastable Feshbach Molecules in High Rotational States.”
Physical Review Letters, vol. 100, no. 8, American Physical Society, 2008,
doi:10.1103/PhysRevLett.100.083002.
short: S. Knoop, M. Mark, F. Ferlaino, J.G. Danzl, T. Kraemer, H. Nägerl, R. Grimm,
Physical Review Letters 100 (2008).
date_created: 2018-12-11T11:49:49Z
date_published: 2008-02-29T00:00:00Z
date_updated: 2021-01-12T06:47:50Z
day: '29'
doi: 10.1103/PhysRevLett.100.083002
extern: '1'
external_id:
arxiv:
- '0710.4052'
intvolume: ' 100'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0710.4052
month: '02'
oa: 1
oa_version: None
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '6352'
status: public
title: Metastable feshbach molecules in high rotational states
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 100
year: '2008'
...
---
_id: '1039'
abstract:
- lang: eng
text: Molecular cooling techniques face the hurdle of dissipating translational
as well as internal energy in the presence of a rich electronic, vibrational,
and rotational energy spectrum. In our experiment, we create a translationally
ultracold, dense quantum gas of molecules bound by more than 1000 wave numbers
in the electronic ground state. Specifically, we stimulate with 80% efficiency,
a two-photon transfer of molecules associated on a Feshbach resonance from a Bose-Einstein
condensate of cesium atoms. In the process, the initial loose, long-range electrostatic
bond of the Feshbach molecule is coherently transformed into a tight chemical
bond. We demonstrate coherence of the transfer in a Ramsey-type experiment and
show that the molecular sample is not heated during the transfer. Our results
show that the preparation of a quantum gas of molecules in specific rovibrational
states is possible and that the creation of a Bose-Einstein condensate of molecules
in their rovibronic ground state is within reach.
acknowledgement: " We thank the team of J. Hecker Denschlag, the LevT team in our
group, and T. Bergeman for very helpful discussions and M. Prevedelli for technical
assistance. We are indebted to R. Grimm for generous support and gratefully acknowledge
funding by the Austrian Ministry of Science and Research (Bundesministerium für
Wissenschaft und Forschung) and the Austrian Science Fund (Fonds zur Förderung der
wissenschaftlichen Forschung) in the form of a START prize grant and by the European
Science Foundation in the framework of the EuroQUAM collective research project
QuDipMol.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Elmar
full_name: Haller, Elmar
last_name: Haller
- first_name: Mattias
full_name: Gustavsson, Mattias
last_name: Gustavsson
- first_name: Manfred
full_name: Mark, Manfred
last_name: Mark
- first_name: Russell
full_name: Hart, Russell
last_name: Hart
- first_name: Nadia
full_name: Bouloufa, Nadia
last_name: Bouloufa
- first_name: Olivier
full_name: Dulieu, Olivier
last_name: Dulieu
- first_name: Helmut
full_name: Ritsch, Helmut
last_name: Ritsch
- first_name: Hanns
full_name: Nägerl, Hanns
last_name: Nägerl
citation:
ama: Danzl JG, Haller E, Gustavsson M, et al. Quantum gas of deeply bound ground
state molecules. Science. 2008;321(5892):1062-1066. doi:10.1126/science.1159909
apa: Danzl, J. G., Haller, E., Gustavsson, M., Mark, M., Hart, R., Bouloufa, N.,
… Nägerl, H. (2008). Quantum gas of deeply bound ground state molecules. Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.1159909
chicago: Danzl, Johann G, Elmar Haller, Mattias Gustavsson, Manfred Mark, Russell
Hart, Nadia Bouloufa, Olivier Dulieu, Helmut Ritsch, and Hanns Nägerl. “Quantum
Gas of Deeply Bound Ground State Molecules.” Science. American Association
for the Advancement of Science, 2008. https://doi.org/10.1126/science.1159909.
ieee: J. G. Danzl et al., “Quantum gas of deeply bound ground state molecules,”
Science, vol. 321, no. 5892. American Association for the Advancement of
Science, pp. 1062–1066, 2008.
ista: Danzl JG, Haller E, Gustavsson M, Mark M, Hart R, Bouloufa N, Dulieu O, Ritsch
H, Nägerl H. 2008. Quantum gas of deeply bound ground state molecules. Science.
321(5892), 1062–1066.
mla: Danzl, Johann G., et al. “Quantum Gas of Deeply Bound Ground State Molecules.”
Science, vol. 321, no. 5892, American Association for the Advancement of
Science, 2008, pp. 1062–66, doi:10.1126/science.1159909.
short: J.G. Danzl, E. Haller, M. Gustavsson, M. Mark, R. Hart, N. Bouloufa, O. Dulieu,
H. Ritsch, H. Nägerl, Science 321 (2008) 1062–1066.
date_created: 2018-12-11T11:49:49Z
date_published: 2008-08-22T00:00:00Z
date_updated: 2021-01-12T06:47:50Z
day: '22'
doi: 10.1126/science.1159909
extern: '1'
external_id:
arxiv:
- '0806.2284'
intvolume: ' 321'
issue: '5892'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0806.2284
month: '08'
oa: 1
oa_version: None
page: 1062 - 1066
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '6351'
status: public
title: Quantum gas of deeply bound ground state molecules
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 321
year: '2008'
...
---
_id: '10392'
abstract:
- lang: eng
text: Protonated formylmetallocenes [M(C5H5)(C5H4-CHOH)]+ (M = Fe, Ru) and their
isomers have been studied at the BP86 and B3LYP levels of density functional theory.
Oxygen-protonated isomers are the most stable forms in each case, with a plethora
of ring- or metal-protonated species at least ca. 14 and 10 kcal/mol higher in
energy for M = Fe and Ru, respectively. The computed rotational barriers around
the C−C bond connecting the cyclopentadienyl and protonated formyl moieties, ca.
18 kcal/mol, are indicative of substantial conjugation between these moieties.
Some of the ring- and iron-protonated species are models for possible intermediates
in Friedel–Crafts acylation of ferrocene, and the computations provide further
evidence that exo attack is clearly favored over endo attack of the electrophile
in this reaction. The structures of the most stable mono- and diprotonated formylferrocenes
are corroborated by the good agreement between GIAO-B3LYP-computed and experimental
NMR chemical shifts.
acknowledgement: M.B. wishes to thank Prof. W. Thiel and the Max-Planck-Institut für
Kohlenforschung for continuing support. A Humboldt fellowship for V.V. is gratefully
acknowledged. Computations were performed on Compaq XP1000 and ES40 workstations
as well as on an Intel Xeon PC cluster at the MPI Mülheim. A.S. thanks the Computing
Center of the University of Zagreb SRCE for allocating computer time on the Isabella
cluster.
article_processing_charge: No
article_type: original
author:
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Valerije
full_name: Vrček, Valerije
last_name: Vrček
- first_name: Michael
full_name: Bühl, Michael
last_name: Bühl
citation:
ama: Šarić A, Vrček V, Bühl M. Density functional study of protonated formylmetallocenes.
Organometallics. 2008;27(3):394-401. doi:10.1021/om700916f
apa: Šarić, A., Vrček, V., & Bühl, M. (2008). Density functional study of protonated
formylmetallocenes. Organometallics. American Chemical Society. https://doi.org/10.1021/om700916f
chicago: Šarić, Anđela, Valerije Vrček, and Michael Bühl. “Density Functional Study
of Protonated Formylmetallocenes.” Organometallics. American Chemical Society,
2008. https://doi.org/10.1021/om700916f.
ieee: A. Šarić, V. Vrček, and M. Bühl, “Density functional study of protonated formylmetallocenes,”
Organometallics, vol. 27, no. 3. American Chemical Society, pp. 394–401,
2008.
ista: Šarić A, Vrček V, Bühl M. 2008. Density functional study of protonated formylmetallocenes.
Organometallics. 27(3), 394–401.
mla: Šarić, Anđela, et al. “Density Functional Study of Protonated Formylmetallocenes.”
Organometallics, vol. 27, no. 3, American Chemical Society, 2008, pp. 394–401,
doi:10.1021/om700916f.
short: A. Šarić, V. Vrček, M. Bühl, Organometallics 27 (2008) 394–401.
date_created: 2021-11-29T15:31:06Z
date_published: 2008-01-15T00:00:00Z
date_updated: 2021-11-30T08:04:44Z
day: '15'
doi: 10.1021/om700916f
extern: '1'
intvolume: ' 27'
issue: '3'
keyword:
- Inorganic Chemistry
- Organic Chemistry
- Physical and Theoretical Chemistry
language:
- iso: eng
main_file_link:
- url: https://pubs.acs.org/doi/10.1021/om700916f
month: '01'
oa_version: None
page: 394-401
publication: Organometallics
publication_identifier:
eissn:
- 1520-6041
issn:
- 0276-7333
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Density functional study of protonated formylmetallocenes
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 27
year: '2008'
...
---
OA_place: repository
OA_type: green
_id: '3170'
abstract:
- lang: eng
text: Geodesic active contours and graph cuts are two standard image segmentation
techniques. We introduce a new segmentation method combining some of their benefits.
Our main intuition is that any cut on a graph embedded in some continuous space
can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build
a grid graph and set its edge weights so that the cost of cuts is arbitrarily
close to the length (area) of the corresponding contours (surfaces) for any anisotropic
Riemannian metric. There are two interesting consequences of this technical result.
First, graph cut algorithms can be used to find globally minimum geodesic contours
(minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of
boundary conditions. Second, we show how to minimize metrication artifacts in
existing graph-cut based methods in vision. Theoretically speaking, our work provides
an interesting link between several branches of mathematics -differential geometry,
integral geometry, and combinatorial optimization. The main technical problem
is solved using Cauchy-Crofton formula from integral geometry.
article_processing_charge: No
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph
cuts. In: Vol 1. IEEE; 2008:26-33. doi:10.1109/ICCV.2003.1238310'
apa: 'Boykov, Y., & Kolmogorov, V. (2008). Computing geodesics and minimal surfaces
via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference
on Computer Vision, Nice, France: IEEE. https://doi.org/10.1109/ICCV.2003.1238310'
chicago: Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal
Surfaces via Graph Cuts,” 1:26–33. IEEE, 2008. https://doi.org/10.1109/ICCV.2003.1238310.
ieee: 'Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via
graph cuts,” presented at the ICCV: International Conference on Computer Vision,
Nice, France, 2008, vol. 1, pp. 26–33.'
ista: 'Boykov Y, Kolmogorov V. 2008. Computing geodesics and minimal surfaces via
graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.'
mla: Boykov, Yuri, and Vladimir Kolmogorov. Computing Geodesics and Minimal Surfaces
via Graph Cuts. Vol. 1, IEEE, 2008, pp. 26–33, doi:10.1109/ICCV.2003.1238310.
short: Y. Boykov, V. Kolmogorov, in:, IEEE, 2008, pp. 26–33.
conference:
end_date: 2003-10-16
location: Nice, France
name: 'ICCV: International Conference on Computer Vision'
start_date: 2003-10-13
date_created: 2018-12-11T12:01:48Z
date_published: 2008-04-03T00:00:00Z
date_updated: 2026-05-21T12:25:56Z
day: '03'
doi: 10.1109/ICCV.2003.1238310
extern: '1'
intvolume: ' 1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.cs.cornell.edu/people/vnk/papers/BK-ICCV03.pdf
month: '04'
oa: 1
oa_version: Preprint
page: 26 - 33
publication_identifier:
isbn:
- '0769519504'
publication_status: published
publisher: IEEE
publist_id: '3511'
quality_controlled: '1'
status: public
title: Computing geodesics and minimal surfaces via graph cuts
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 1
year: '2008'
...
---
OA_place: repository
OA_type: green
_id: '3174'
abstract:
- lang: eng
text: We address visual correspondence problems without assuming that scene points
have similar intensities in different views. This situation is common, usually
due to non-lambertian scenes or to differences between cameras. We use maximization
of mutual information, a powerful technique for registering images that requires
no a priori model of the relationship between scene intensities in different views.
However, it has proven difficult to use mutual information to compute dense visual
correspondence. Comparing fixed-size windows via mutual information suffers from
the well-known problems of fixed windows, namely poor performance at discontinuities
and in low-texture regions. In this paper, we show how to compute visual correspondence
using mutual information without suffering from these problems. Using 'a simple
approximation, mutual information can be incorporated into the standard energy
minimization framework used in early vision. The energy can then be efficiently
minimized using graph cuts, which preserve discontinuities and handle low-texture
regions. The resulting algorithm combines the accurate disparity maps that come
from graph cuts with the tolerance for intensity changes that comes from mutual
information.
article_processing_charge: No
author:
- first_name: Junhwan
full_name: Kim, Junhwan
last_name: Kim
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
citation:
ama: 'Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization
and mutual information. In: Proceedings Ninth International Conference on Computer
Vision. Vol 2. IEEE; 2008:1033-1040. doi:10.1109/ICCV.2003.1238463'
apa: 'Kim, J., Kolmogorov, V., & Zabih, R. (2008). Visual correspondence using
energy minimization and mutual information. In Proceedings Ninth International
Conference on Computer Vision (Vol. 2, pp. 1033–1040). Nice, France: IEEE.
https://doi.org/10.1109/ICCV.2003.1238463'
chicago: Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence
Using Energy Minimization and Mutual Information.” In Proceedings Ninth International
Conference on Computer Vision, 2:1033–40. IEEE, 2008. https://doi.org/10.1109/ICCV.2003.1238463.
ieee: J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization
and mutual information,” in Proceedings Ninth International Conference on Computer
Vision, Nice, France, 2008, vol. 2, pp. 1033–1040.
ista: 'Kim J, Kolmogorov V, Zabih R. 2008. Visual correspondence using energy minimization
and mutual information. Proceedings Ninth International Conference on Computer
Vision. ICCV: International Conference on Computer Vision vol. 2, 1033–1040.'
mla: Kim, Junhwan, et al. “Visual Correspondence Using Energy Minimization and Mutual
Information.” Proceedings Ninth International Conference on Computer Vision,
vol. 2, IEEE, 2008, pp. 1033–40, doi:10.1109/ICCV.2003.1238463.
short: J. Kim, V. Kolmogorov, R. Zabih, in:, Proceedings Ninth International Conference
on Computer Vision, IEEE, 2008, pp. 1033–1040.
conference:
end_date: 2003-10-16
location: Nice, France
name: 'ICCV: International Conference on Computer Vision'
start_date: 2003-10-13
date_created: 2018-12-11T12:01:49Z
date_published: 2008-04-03T00:00:00Z
date_updated: 2026-05-21T12:22:19Z
day: '03'
doi: 10.1109/ICCV.2003.1238463
extern: '1'
intvolume: ' 2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.cs.cornell.edu/people/vnk/papers/KKZ-ICCV03.pdf
month: '04'
oa: 1
oa_version: Preprint
page: 1033 - 1040
publication: Proceedings Ninth International Conference on Computer Vision
publication_identifier:
isbn:
- '0769519504'
publication_status: published
publisher: IEEE
publist_id: '3510'
quality_controlled: '1'
status: public
title: Visual correspondence using energy minimization and mutual information
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2
year: '2008'
...
---
_id: '3194'
abstract:
- lang: eng
text: We consider the problem of optimizing multilabel MRFs, which is in general
NP-hard and ubiquitous in low-level computer vision. One approach for its solution
is to formulate it as an integer linear programming and relax the integrality
constraints. The approach we consider in this paper is to first convert the multi-label
MRF into an equivalent binary-label MRF and then to relax it. The resulting relaxation
can be efficiently solved using a maximum flow algorithm. Its solution provides
us with a partially optimal labelling of the binary variables. This partial labelling
is then easily transferred to the multi-label problem. We study the theoretical
properties of the new relaxation and compare it with the standard one. Specifically,
we compare tightness, and characterize a subclass of problems where the two relaxations
coincide. We propose several combined algorithms based on the technique and demonstrate
their performance on challenging computer vision problems.
author:
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- 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: Philip
full_name: Torr, Philip H
last_name: Torr
citation:
ama: 'Kohli P, Shekhovtsov A, Rother C, Kolmogorov V, Torr P. On partial optimality
in multi label MRFs. In: Omnipress; 2008:480-487. doi:10.1145/1390156.1390217'
apa: 'Kohli, P., Shekhovtsov, A., Rother, C., Kolmogorov, V., & Torr, P. (2008).
On partial optimality in multi label MRFs (pp. 480–487). Presented at the ICML:
International Conference on Machine Learning, Omnipress. https://doi.org/10.1145/1390156.1390217'
chicago: Kohli, Pushmeet, Alexander Shekhovtsov, Carsten Rother, Vladimir Kolmogorov,
and Philip Torr. “On Partial Optimality in Multi Label MRFs,” 480–87. Omnipress,
2008. https://doi.org/10.1145/1390156.1390217.
ieee: 'P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. Torr, “On partial
optimality in multi label MRFs,” presented at the ICML: International Conference
on Machine Learning, 2008, pp. 480–487.'
ista: 'Kohli P, Shekhovtsov A, Rother C, Kolmogorov V, Torr P. 2008. On partial
optimality in multi label MRFs. ICML: International Conference on Machine Learning,
480–487.'
mla: Kohli, Pushmeet, et al. On Partial Optimality in Multi Label MRFs. Omnipress,
2008, pp. 480–87, doi:10.1145/1390156.1390217.
short: P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, P. Torr, in:, Omnipress,
2008, pp. 480–487.
conference:
name: 'ICML: International Conference on Machine Learning'
date_created: 2018-12-11T12:01:56Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:41:42Z
day: '01'
doi: 10.1145/1390156.1390217
extern: 1
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/77356/icml08-partoptmrf.pdf
month: '01'
page: 480 - 487
publication_status: published
publisher: Omnipress
publist_id: '3486'
quality_controlled: 0
status: public
title: On partial optimality in multi label MRFs
type: conference
year: '2008'
...
---
_id: '3195'
abstract:
- lang: eng
text: 'Graph cut is a popular technique for interactive image segmentation. However,
it has certain shortcomings. In particular, graph cut has problems with segmenting
thin elongated objects due to the ldquoshrinking biasrdquo. To overcome this problem,
we propose to impose an additional connectivity prior, which is a very natural
assumption about objects. We formulate several versions of the connectivity constraint
and show that the corresponding optimization problems are all NP-hard. For some
of these versions we propose two optimization algorithms: (i) a practical heuristic
technique which we call DijkstraGC, and (ii) a slow method based on problem decomposition
which provides a lower bound on the problem. We use the second technique to verify
that for some practical examples DijkstraGC is able to find the global minimum.'
author:
- first_name: Sara
full_name: Vicente, Sara
last_name: Vicente
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Vicente S, Kolmogorov V, Rother C. Graph cut based image segmentation with
connectivity priors. In: IEEE; 2008. doi:10.1109/CVPR.2008.4587440'
apa: 'Vicente, S., Kolmogorov, V., & Rother, C. (2008). Graph cut based image
segmentation with connectivity priors. Presented at the CVPR: Computer Vision
and Pattern Recognition, IEEE. https://doi.org/10.1109/CVPR.2008.4587440'
chicago: Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph Cut Based
Image Segmentation with Connectivity Priors.” IEEE, 2008. https://doi.org/10.1109/CVPR.2008.4587440.
ieee: 'S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation
with connectivity priors,” presented at the CVPR: Computer Vision and Pattern
Recognition, 2008.'
ista: 'Vicente S, Kolmogorov V, Rother C. 2008. Graph cut based image segmentation
with connectivity priors. CVPR: Computer Vision and Pattern Recognition.'
mla: Vicente, Sara, et al. Graph Cut Based Image Segmentation with Connectivity
Priors. IEEE, 2008, doi:10.1109/CVPR.2008.4587440.
short: S. Vicente, V. Kolmogorov, C. Rother, in:, IEEE, 2008.
conference:
name: 'CVPR: Computer Vision and Pattern Recognition'
date_created: 2018-12-11T12:01:57Z
date_published: 2008-08-05T00:00:00Z
date_updated: 2021-01-12T07:41:43Z
day: '05'
doi: 10.1109/CVPR.2008.4587440
extern: 1
main_file_link:
- open_access: '0'
url: http://research.microsoft.com/pubs/80485/CVPR08-ConnectedGC.pdf
month: '08'
publication_status: published
publisher: IEEE
publist_id: '3487'
quality_controlled: 0
status: public
title: Graph cut based image segmentation with connectivity priors
type: conference
year: '2008'
...
---
_id: '3196'
abstract:
- lang: eng
text: 'Among the most exciting advances in early vision has been the development
of efficient energy minimization algorithms for pixel-labeling tasks such as depth
or texture computation. It has been known for decades that such problems can be
elegantly expressed as Markov random fields, yet the resulting energy minimization
problems have been widely viewed as intractable. Algorithms such as graph cuts
and loopy belief propagation (LBP) have proven to be very powerful: For example,
such methods form the basis for almost all the top-performing stereo methods.
However, the trade-offs among different energy minimization algorithms are still
not well understood. In this paper, we describe a set of energy minimization benchmarks
and use them to compare the solution quality and runtime of several common energy
minimization algorithms. We investigate three promising methods-graph cuts, LBP,
and tree-reweighted message passing-in addition to the well-known older iterated
conditional mode (ICM) algorithm. Our benchmark problems are drawn from published
energy functions used for stereo, image stitching, interactive segmentation, and
denoising. We also provide a general-purpose software interface that allows vision
researchers to easily switch between optimization methods. The benchmarks, code,
images, and results are available at http://vision.middlebury.edu/MRF/.'
author:
- first_name: Richard
full_name: Szeliski, Richard S
last_name: Szeliski
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Daniel
full_name: Scharstein, Daniel
last_name: Scharstein
- first_name: Olga
full_name: Veksler, Olga
last_name: Veksler
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Aseem
full_name: Agarwala, Aseem
last_name: Agarwala
- first_name: Marshall
full_name: Tappen, Marshall F
last_name: Tappen
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: Szeliski R, Zabih R, Scharstein D, et al. A comparative study of energy minimization
methods for Markov random fields with smoothness-based priors. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2008;30(6):1068-1080. doi:10.1109/TPAMI.2007.70844
apa: Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala,
A., … Rother, C. (2008). A comparative study of energy minimization methods for
Markov random fields with smoothness-based priors. IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2007.70844
chicago: Szeliski, Richard, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir
Kolmogorov, Aseem Agarwala, Marshall Tappen, and Carsten Rother. “A Comparative
Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based
Priors.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2008. https://doi.org/10.1109/TPAMI.2007.70844.
ieee: R. Szeliski et al., “A comparative study of energy minimization methods
for Markov random fields with smoothness-based priors,” IEEE Transactions on
Pattern Analysis and Machine Intelligence, vol. 30, no. 6. IEEE, pp. 1068–1080,
2008.
ista: Szeliski R, Zabih R, Scharstein D, Veksler O, Kolmogorov V, Agarwala A, Tappen
M, Rother C. 2008. A comparative study of energy minimization methods for Markov
random fields with smoothness-based priors. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 30(6), 1068–1080.
mla: Szeliski, Richard, et al. “A Comparative Study of Energy Minimization Methods
for Markov Random Fields with Smoothness-Based Priors.” IEEE Transactions on
Pattern Analysis and Machine Intelligence, vol. 30, no. 6, IEEE, 2008, pp.
1068–80, doi:10.1109/TPAMI.2007.70844.
short: R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala,
M. Tappen, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence
30 (2008) 1068–1080.
date_created: 2018-12-11T12:01:57Z
date_published: 2008-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:43Z
day: '01'
doi: 10.1109/TPAMI.2007.70844
extern: 1
intvolume: ' 30'
issue: '6'
month: '06'
page: 1068 - 1080
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '3488'
quality_controlled: 0
status: public
title: A comparative study of energy minimization methods for Markov random fields
with smoothness-based priors
type: journal_article
volume: 30
year: '2008'
...
---
_id: '3198'
abstract:
- lang: eng
text: 'In this paper we present a new approach for establishing correspondences
between sparse image features related by an unknown non-rigid mapping and corrupted
by clutter and occlusion, such as points extracted from a pair of images containing
a human figure in distinct poses. We formulate this matching task as an energy
minimization problem by defining a complex objective function of the appearance
and the spatial arrangement of the features. Optimization of this energy is an
instance of graph matching, which is in general a NP-hard problem. We describe
a novel graph matching optimization technique, which we refer to as dual decomposition
(DD), and demonstrate on a variety of examples that this method outperforms existing
graph matching algorithms. In the majority of our examples DD is able to find
the global minimum within a minute. The ability to globally optimize the objective
allows us to accurately learn the parameters of our matching model from training
examples. We show on several matching tasks that our learned model yields results
superior to those of state-of-the-art methods. '
alternative_title:
- LNCS
author:
- first_name: Lorenzo
full_name: Torresani, Lorenzo
last_name: Torresani
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Torresani L, Kolmogorov V, Rother C. Feature correspondence via graph matching:
Models and global optimization. In: Vol 5303. Springer; 2008:596-609. doi:10.1007/978-3-540-88688-4_44'
apa: 'Torresani, L., Kolmogorov, V., & Rother, C. (2008). Feature correspondence
via graph matching: Models and global optimization (Vol. 5303, pp. 596–609). Presented
at the ECCV: European Conference on Computer Vision, Springer. https://doi.org/10.1007/978-3-540-88688-4_44'
chicago: 'Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “Feature
Correspondence via Graph Matching: Models and Global Optimization,” 5303:596–609.
Springer, 2008. https://doi.org/10.1007/978-3-540-88688-4_44.'
ieee: 'L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph
matching: Models and global optimization,” presented at the ECCV: European Conference
on Computer Vision, 2008, vol. 5303, pp. 596–609.'
ista: 'Torresani L, Kolmogorov V, Rother C. 2008. Feature correspondence via graph
matching: Models and global optimization. ECCV: European Conference on Computer
Vision, LNCS, vol. 5303, 596–609.'
mla: 'Torresani, Lorenzo, et al. Feature Correspondence via Graph Matching: Models
and Global Optimization. Vol. 5303, Springer, 2008, pp. 596–609, doi:10.1007/978-3-540-88688-4_44.'
short: L. Torresani, V. Kolmogorov, C. Rother, in:, Springer, 2008, pp. 596–609.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:58Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:41:44Z
day: '01'
doi: 10.1007/978-3-540-88688-4_44
extern: 1
intvolume: ' 5303'
main_file_link:
- open_access: '0'
url: http://research-srv.microsoft.com/pubs/70610/eccv08-MatchingMRF.pdf
month: '01'
page: 596 - 609
publication_status: published
publisher: Springer
publist_id: '3485'
quality_controlled: 0
status: public
title: 'Feature correspondence via graph matching: Models and global optimization'
type: conference
volume: 5303
year: '2008'
...
---
_id: '3224'
abstract:
- lang: eng
text: 'We propose a new mode of operation, enciphered CBC, for domain extension
of length-preserving functions (like block ciphers), which is a variation on the
popular CBC mode of operation. Our new mode is twice slower than CBC, but has
many (property-preserving) properties not enjoyed by CBC and other known modes.
Most notably, it yields the first constant-rate Variable Input Length (VIL) MAC
from any length preserving Fixed Input Length (FIL) MAC. This answers the question
of Dodis and Puniya from Eurocrypt 2007. Further, our mode is a secure domain
extender for PRFs (with basically the same security as encrypted CBC). This provides
a hedge against the security of the block cipher: if the block cipher is pseudorandom,
one gets a VIL-PRF, while if it is "only" unpredictable, one "at
least" gets a VIL-MAC. Additionally, our mode yields a VIL random oracle
(and, hence, a collision-resistant hash function) when instantiated with length-preserving
random functions, or even random permutations (which can be queried from both
sides). This means that one does not have to re-key the block cipher during the
computation, which was critically used in most previous constructions (analyzed
in the ideal cipher model). '
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Prashant
full_name: Puniya, Prashant
last_name: Puniya
citation:
ama: 'Dodis Y, Pietrzak KZ, Puniya P. A new mode of operation for block ciphers
and length preserving MACs. In: Vol 4965. Springer; 2008:198-219. doi:10.1007/978-3-540-78967-3_12'
apa: 'Dodis, Y., Pietrzak, K. Z., & Puniya, P. (2008). A new mode of operation
for block ciphers and length preserving MACs (Vol. 4965, pp. 198–219). Presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer.
https://doi.org/10.1007/978-3-540-78967-3_12'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Prashant Puniya. “A New Mode
of Operation for Block Ciphers and Length Preserving MACs,” 4965:198–219. Springer,
2008. https://doi.org/10.1007/978-3-540-78967-3_12.
ieee: 'Y. Dodis, K. Z. Pietrzak, and P. Puniya, “A new mode of operation for block
ciphers and length preserving MACs,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, 2008, vol. 4965, pp. 198–219.'
ista: 'Dodis Y, Pietrzak KZ, Puniya P. 2008. A new mode of operation for block ciphers
and length preserving MACs. EUROCRYPT: Theory and Applications of Cryptographic
Techniques, LNCS, vol. 4965, 198–219.'
mla: Dodis, Yevgeniy, et al. A New Mode of Operation for Block Ciphers and Length
Preserving MACs. Vol. 4965, Springer, 2008, pp. 198–219, doi:10.1007/978-3-540-78967-3_12.
short: Y. Dodis, K.Z. Pietrzak, P. Puniya, in:, Springer, 2008, pp. 198–219.
conference:
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-04-28T00:00:00Z
date_updated: 2021-01-12T07:41:55Z
day: '28'
doi: 10.1007/978-3-540-78967-3_12
extern: 1
intvolume: ' 4965'
month: '04'
page: 198 - 219
publication_status: published
publisher: Springer
publist_id: '3456'
quality_controlled: 0
status: public
title: A new mode of operation for block ciphers and length preserving MACs
type: conference
volume: 4965
year: '2008'
...
---
_id: '3225'
abstract:
- lang: eng
text: 'A robust multi-property combiner for a set of security properties merges
two hash functions such that the resulting function satisfies each of the properties
which at least one of the two starting functions has. Fischlin and Lehmann (TCC
2008) recently constructed a combiner which simultaneously preserves collision-resistance,
target collision-resistance, message authentication, pseudorandomness and indifferentiability
from a random oracle (IRO). Their combiner produces outputs of 5n bits, where
n denotes the output length of the underlying hash functions. In this paper we
propose improved combiners with shorter outputs. By sacrificing the indifferentiability
from random oracles we obtain a combiner which preserves all of the other aforementioned
properties but with output length 2n only. This matches a lower bound for black-box
combiners for collision-resistance as the only property, showing that the other
properties can be achieved without penalizing the length of the hash values. We
then propose a combiner which also preserves the IRO property, slightly increasing
the output length to 2n + ω(logn). Finally, we show that a twist on our combiners
also makes them robust for one-wayness (but at the price of a fixed input length). '
alternative_title:
- LNCS
author:
- first_name: Marc
full_name: Fischlin, Marc
last_name: Fischlin
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Fischlin M, Lehmann A, Pietrzak KZ. Robust multi property combiners for hash
functions revisited. In: Vol 5126. Springer; 2008:655-666. doi:10.1007/978-3-540-70583-3_53'
apa: 'Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2008). Robust multi property
combiners for hash functions revisited (Vol. 5126, pp. 655–666). Presented at
the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/978-3-540-70583-3_53'
chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi Property
Combiners for Hash Functions Revisited,” 5126:655–66. Springer, 2008. https://doi.org/10.1007/978-3-540-70583-3_53.
ieee: 'M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi property combiners
for hash functions revisited,” presented at the ICALP: Automata, Languages and
Programming, 2008, vol. 5126, no. PART 2, pp. 655–666.'
ista: 'Fischlin M, Lehmann A, Pietrzak KZ. 2008. Robust multi property combiners
for hash functions revisited. ICALP: Automata, Languages and Programming, LNCS,
vol. 5126, 655–666.'
mla: Fischlin, Marc, et al. Robust Multi Property Combiners for Hash Functions
Revisited. Vol. 5126, no. PART 2, Springer, 2008, pp. 655–66, doi:10.1007/978-3-540-70583-3_53.
short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, in:, Springer, 2008, pp. 655–666.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-08-06T00:00:00Z
date_updated: 2025-09-29T11:09:55Z
day: '06'
doi: 10.1007/978-3-540-70583-3_53
extern: 1
intvolume: ' 5126'
issue: PART 2
month: '08'
page: 655 - 666
publication_status: published
publisher: Springer
publist_id: '3454'
quality_controlled: 0
related_material:
record:
- id: '2852'
relation: later_version
status: public
status: public
title: Robust multi property combiners for hash functions revisited
type: conference
volume: 5126
year: '2008'
...
---
_id: '3226'
abstract:
- lang: eng
text: 'A family of functions is weakly pseudorandom if a random member of the family
is indistinguishable from a uniform random function when queried on random inputs.
We point out a subtle ambiguity in the definition of weak PRFs: there are natural
weak PRFs whose security breaks down if the randomness used to sample the inputs
is revealed. To capture this ambiguity we distinguish between public-coin and
secret-coin weak PRFs. We show that the existence of a secret-coin weak PRF which
is not also a public-coin weak PRF implies the existence of two pass key-agreement
(i.e. public-key encryption). So in Minicrypt, i.e. under the assumption that
one-way functions exist but public-key cryptography does not, the notion of public-
and secret-coin weak PRFs coincide. Previous to this paper all positive cryptographic
statements known to hold exclusively in Minicrypt concerned the adaptive security
of constructions using non-adaptively secure components. Weak PRFs give rise to
a new set of statements having this property. As another example we consider the
problem of range extension for weak PRFs. We show that in Minicrypt one can beat
the best possible range expansion factor (using a fixed number of distinct keys)
for a very general class of constructions (in particular, this class contains
all constructions that are known today). '
acknowledgement: This work was partially supported by the Zurich Information Security
Center.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Johan
full_name: Sjödin, Johan
last_name: Sjödin
citation:
ama: 'Pietrzak KZ, Sjödin J. Weak pseudorandom functions in minicrypt. In: Vol 5126.
Springer; 2008:423-436. doi:10.1007/978-3-540-70583-3_35'
apa: 'Pietrzak, K. Z., & Sjödin, J. (2008). Weak pseudorandom functions in minicrypt
(Vol. 5126, pp. 423–436). Presented at the ICALP: Automata, Languages and Programming,
Springer. https://doi.org/10.1007/978-3-540-70583-3_35'
chicago: Pietrzak, Krzysztof Z, and Johan Sjödin. “Weak Pseudorandom Functions in
Minicrypt,” 5126:423–36. Springer, 2008. https://doi.org/10.1007/978-3-540-70583-3_35.
ieee: 'K. Z. Pietrzak and J. Sjödin, “Weak pseudorandom functions in minicrypt,”
presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126,
no. PART 2, pp. 423–436.'
ista: 'Pietrzak KZ, Sjödin J. 2008. Weak pseudorandom functions in minicrypt. ICALP:
Automata, Languages and Programming, LNCS, vol. 5126, 423–436.'
mla: Pietrzak, Krzysztof Z., and Johan Sjödin. Weak Pseudorandom Functions in
Minicrypt. Vol. 5126, no. PART 2, Springer, 2008, pp. 423–36, doi:10.1007/978-3-540-70583-3_35.
short: K.Z. Pietrzak, J. Sjödin, in:, Springer, 2008, pp. 423–436.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-08-06T00:00:00Z
date_updated: 2021-01-12T07:41:56Z
day: '06'
doi: 10.1007/978-3-540-70583-3_35
extern: 1
intvolume: ' 5126'
issue: PART 2
month: '08'
page: 423 - 436
publication_status: published
publisher: Springer
publist_id: '3455'
quality_controlled: 0
status: public
title: Weak pseudorandom functions in minicrypt
type: conference
volume: 5126
year: '2008'
...
---
_id: '3227'
abstract:
- lang: eng
text: Large amount of data management can cause a lot of troubles which can be solved
by dedicated computer system. To facilitate management of measurement data which
are gathered in Institute of Power Engineering - Insulation Department a special
system called Elektrowiz® was developed. It allows storing measurement results
which concern partial discharges in insulation of turbo- and hydrogenerators in
power stations. Multilayer architecture of the system allows reaching gathered
data independently on user localization. There are possible different access methods
to the system and dependency on current requirements data exploration can be realized
with read-only or edit rights.
author:
- first_name: Piotr
full_name: Zubielik, Piotr
last_name: Zubielik
- first_name: Jerzy
full_name: Nadaczny, Jerzy
last_name: Nadaczny
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Marcin
full_name: Lawenda, Marcin
last_name: Lawenda
citation:
ama: Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. Elektrowiz – system of measurement
data management. Przeglad Elektrotechniczny. 2008;84(10):239-242.
apa: Zubielik, P., Nadaczny, J., Pietrzak, K. Z., & Lawenda, M. (2008). Elektrowiz
– system of measurement data management. Przeglad Elektrotechniczny. SIGMA-NOT.
chicago: Zubielik, Piotr, Jerzy Nadaczny, Krzysztof Z Pietrzak, and Marcin Lawenda.
“Elektrowiz – System of Measurement Data Management.” Przeglad Elektrotechniczny.
SIGMA-NOT, 2008.
ieee: P. Zubielik, J. Nadaczny, K. Z. Pietrzak, and M. Lawenda, “Elektrowiz – system
of measurement data management,” Przeglad Elektrotechniczny, vol. 84, no.
10. SIGMA-NOT, pp. 239–242, 2008.
ista: Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. 2008. Elektrowiz – system
of measurement data management. Przeglad Elektrotechniczny. 84(10), 239–242.
mla: Zubielik, Piotr, et al. “Elektrowiz – System of Measurement Data Management.”
Przeglad Elektrotechniczny, vol. 84, no. 10, SIGMA-NOT, 2008, pp. 239–42.
short: P. Zubielik, J. Nadaczny, K.Z. Pietrzak, M. Lawenda, Przeglad Elektrotechniczny
84 (2008) 239–242.
date_created: 2018-12-11T12:02:08Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2021-01-12T07:41:56Z
day: '01'
extern: 1
intvolume: ' 84'
issue: '10'
main_file_link:
- open_access: '0'
url: http://pe.org.pl/abstract_pl.php?nid=1917
month: '10'
page: 239 - 242
publication: Przeglad Elektrotechniczny
publication_status: published
publisher: SIGMA-NOT
publist_id: '3452'
quality_controlled: 0
status: public
title: Elektrowiz – system of measurement data management
type: journal_article
volume: 84
year: '2008'
...
---
_id: '3228'
abstract:
- lang: eng
text: |2-
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of the components is collision resistant. In this paper we prove a lower bound on the output length of black-box combiners for CRHFs. The bound we prove is basically tight as it is achieved by a recent construction of Canetti et al [Crypto'07]. The best previously known lower bounds only ruled out a very restricted class of combiners having a very strong security reduction: the reduction was required to output collisions for both underlying candidate hash-functions given a single collision for the combiner (Canetti et al [Crypto'07] building on Boneh and Boyen [Crypto'06] and Pietrzak [Eurocrypt'07]). Our proof uses a lemma similar to the elegant "reconstruction lemma" of Gennaro and Trevisan [FOCS'00], which states that any function which is not one-way is compressible (and thus uniformly random function must be one-way). In a similar vein we show that a function which is not collision resistant is compressible. We also borrow ideas from recent work by Haitner et al. [FOCS'07], who show that one can prove the reconstruction lemma even relative to some very powerful oracles (in our case this will be an exponential time collision-finding oracle). © 2008 Springer-Verlag Berlin Heidelberg.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Compression from collisions or why CRHF combiners have a long
output. In: Vol 5157. Springer; 2008:413-432. doi:10.1007/978-3-540-85174-5_23'
apa: 'Pietrzak, K. Z. (2008). Compression from collisions or why CRHF combiners
have a long output (Vol. 5157, pp. 413–432). Presented at the CRYPTO: International
Cryptology Conference, Springer. https://doi.org/10.1007/978-3-540-85174-5_23'
chicago: Pietrzak, Krzysztof Z. “Compression from Collisions or Why CRHF Combiners
Have a Long Output,” 5157:413–32. Springer, 2008. https://doi.org/10.1007/978-3-540-85174-5_23.
ieee: 'K. Z. Pietrzak, “Compression from collisions or why CRHF combiners have a
long output,” presented at the CRYPTO: International Cryptology Conference, 2008,
vol. 5157, pp. 413–432.'
ista: 'Pietrzak KZ. 2008. Compression from collisions or why CRHF combiners have
a long output. CRYPTO: International Cryptology Conference, LNCS, vol. 5157, 413–432.'
mla: Pietrzak, Krzysztof Z. Compression from Collisions or Why CRHF Combiners
Have a Long Output. Vol. 5157, Springer, 2008, pp. 413–32, doi:10.1007/978-3-540-85174-5_23.
short: K.Z. Pietrzak, in:, Springer, 2008, pp. 413–432.
conference:
name: 'CRYPTO: International Cryptology Conference'
date_created: 2018-12-11T12:02:08Z
date_published: 2008-09-11T00:00:00Z
date_updated: 2021-01-12T07:41:57Z
day: '11'
doi: 10.1007/978-3-540-85174-5_23
extern: 1
intvolume: ' 5157'
month: '09'
page: 413 - 432
publication_status: published
publisher: Springer
publist_id: '3453'
quality_controlled: 0
status: public
title: Compression from collisions or why CRHF combiners have a long output
type: conference
volume: 5157
year: '2008'
...