---
_id: '17808'
abstract:
- lang: eng
text: Four recent observational results have challenged our understanding of high--redshift
galaxies, as they require the presence of far more ultraviolet photons than should
be emitted by normal stellar populations. First, there is significant ultraviolet
emission from Lyman Break Galaxies (LBGs) at wavelenghts shorter than 912Å. Second,
there is strong Lyman alpha emission from extended ``blobs'' with little or no
associated apparent ionizing continuum. Third, there is a population of galaxies
with unusually strong Lyman-alpha emission lines. And fourth, there is a strong
HeII (1640 Å) emission line in a composite of LBGs. The proposed explanations
for the first three observations are internally inconsistent, and the fourth puzzle
has remained hitherto unexplained. Here we show that all four problems are resolved
simultaneously if 10-30 percent of the stars in many galaxies at z ~ 3-4 are mainly
primordial - unenriched by elements heavier than helium ('metals'). Most models
of hierarchical galaxy formation assume efficient intra--galactic metal mixing,
and therefore do not predict metal-free star formation at redshifts significantly
below z ~5. Our results imply that micro-mixing of metals within galaxies is inefficient
on a ~ Gyr time-scale, a conclusion that can be verified with higher resolution
simulations, and future observations of the HeII emission line.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Raul
full_name: Jimenez, Raul
last_name: Jimenez
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
citation:
ama: Jimenez R, Haiman Z. Significant primordial star formation at redshifts z ≈
3–4. Nature. 2006;440(7083):501-504. doi:10.1038/nature04580
apa: Jimenez, R., & Haiman, Z. (2006). Significant primordial star formation
at redshifts z ≈ 3–4. Nature. Springer Science and Business Media LLC.
https://doi.org/10.1038/nature04580
chicago: Jimenez, Raul, and Zoltán Haiman. “Significant Primordial Star Formation
at Redshifts z ≈ 3–4.” Nature. Springer Science and Business Media LLC,
2006. https://doi.org/10.1038/nature04580.
ieee: R. Jimenez and Z. Haiman, “Significant primordial star formation at redshifts
z ≈ 3–4,” Nature, vol. 440, no. 7083. Springer Science and Business Media
LLC, pp. 501–504, 2006.
ista: Jimenez R, Haiman Z. 2006. Significant primordial star formation at redshifts
z ≈ 3–4. Nature. 440(7083), 501–504.
mla: Jimenez, Raul, and Zoltán Haiman. “Significant Primordial Star Formation at
Redshifts z ≈ 3–4.” Nature, vol. 440, no. 7083, Springer Science and Business
Media LLC, 2006, pp. 501–04, doi:10.1038/nature04580.
short: R. Jimenez, Z. Haiman, Nature 440 (2006) 501–504.
date_created: 2024-09-06T11:37:20Z
date_published: 2006-03-23T00:00:00Z
date_updated: 2024-09-25T14:01:07Z
day: '23'
doi: 10.1038/nature04580
extern: '1'
external_id:
arxiv:
- '0602450'
fulldoi: https://doi.org/10.1038/nature04580
intvolume: ' 440'
issue: '7083'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.astro-ph/0602450'
month: '03'
oa: 1
oa_version: Preprint
page: 501-504
publication: Nature
publication_identifier:
issn:
- 0028-0836
- 1476-4687
publication_status: published
publisher: Springer Science and Business Media LLC
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/nature04774
scopus_import: '1'
status: public
title: Significant primordial star formation at redshifts z ≈ 3–4
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 440
year: '2006'
...
---
_id: '1796'
abstract:
- lang: eng
text: Drugs that block the entry of human immunodeficiency virus type 1 (HIV-1)
into host cells abrogate the establishment of a productive infection and should
ideally diminish the chances of HIV-1 developing resistance. This review will
give an overview of the mechanism by which the envelope glycoprotein mediates
HIV-1 entry and will summarize current drug developments.
author:
- first_name: Sandra
full_name: Sandra Siegert
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
- first_name: Peter
full_name: Schnierle, Peter
last_name: Schnierle
- first_name: Barbara
full_name: Schnierle, Barbara S
last_name: Schnierle
citation:
ama: 'Siegert S, Schnierle P, Schnierle B. Novel anti-viral therapy: Drugs that
block HIV entry at different target sites. Mini-Reviews in Medicinal Chemistry.
2006;6(5):557-562. doi:10.2174/138955706776876267'
apa: 'Siegert, S., Schnierle, P., & Schnierle, B. (2006). Novel anti-viral therapy:
Drugs that block HIV entry at different target sites. Mini-Reviews in Medicinal
Chemistry. Bentham Science Publishers. https://doi.org/10.2174/138955706776876267'
chicago: 'Siegert, Sandra, Peter Schnierle, and Barbara Schnierle. “Novel Anti-Viral
Therapy: Drugs That Block HIV Entry at Different Target Sites.” Mini-Reviews
in Medicinal Chemistry. Bentham Science Publishers, 2006. https://doi.org/10.2174/138955706776876267.'
ieee: 'S. Siegert, P. Schnierle, and B. Schnierle, “Novel anti-viral therapy: Drugs
that block HIV entry at different target sites,” Mini-Reviews in Medicinal
Chemistry, vol. 6, no. 5. Bentham Science Publishers, pp. 557–562, 2006.'
ista: 'Siegert S, Schnierle P, Schnierle B. 2006. Novel anti-viral therapy: Drugs
that block HIV entry at different target sites. Mini-Reviews in Medicinal Chemistry.
6(5), 557–562.'
mla: 'Siegert, Sandra, et al. “Novel Anti-Viral Therapy: Drugs That Block HIV Entry
at Different Target Sites.” Mini-Reviews in Medicinal Chemistry, vol. 6,
no. 5, Bentham Science Publishers, 2006, pp. 557–62, doi:10.2174/138955706776876267.'
short: S. Siegert, P. Schnierle, B. Schnierle, Mini-Reviews in Medicinal Chemistry
6 (2006) 557–562.
date_created: 2018-12-11T11:54:03Z
date_published: 2006-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:15Z
day: '01'
doi: 10.2174/138955706776876267
extern: 1
fulldoi: https://doi.org/10.2174/138955706776876267
intvolume: ' 6'
issue: '5'
month: '05'
page: 557 - 562
publication: Mini-Reviews in Medicinal Chemistry
publication_status: published
publisher: Bentham Science Publishers
publist_id: '5314'
quality_controlled: 0
status: public
title: 'Novel anti-viral therapy: Drugs that block HIV entry at different target sites'
type: journal_article
volume: 6
year: '2006'
...
---
OA_type: closed access
_id: '18041'
abstract:
- lang: eng
text: Since it was first suggested1 that a single molecule might function as an
active electronic component, a number of techniques have been developed to measure
the charge transport properties of single molecules2,3,4,5,6,7,8,9,10,11,12. Although
scanning tunnelling microscopy observations under high vacuum conditions can allow
stable measurements of electron transport, most measurements of a single molecule
bonded in a metal–molecule–metal junction exhibit relatively large variations
in conductance. As a result, even simple predictions about how molecules behave
in such junctions have still not been rigorously tested. For instance, it is well
known13,14 that the tunnelling current passing through a molecule depends on its
conformation; but although some experiments have verified this effect15,16,17,18,
a comprehensive mapping of how junction conductance changes with molecular conformation
is not yet available. In the simple case of a biphenyl—a molecule with two phenyl
rings linked by a single C–C bond—conductance is expected to change with the relative
twist angle between the two rings, with the planar conformation having the highest
conductance. Here we use amine link groups to form single-molecule junctions with
more reproducible current–voltage characteristics19. This allows us to extract
average conductance values from thousands of individual measurements on a series
of seven biphenyl molecules with different ring substitutions that alter the twist
angle of the molecules. We find that the conductance for the series decreases
with increasing twist angle, consistent with a cosine-squared relation predicted
for transport through π-conjugated biphenyl systems13.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Jennifer E.
full_name: Klare, Jennifer E.
last_name: Klare
- first_name: Colin
full_name: Nuckolls, Colin
last_name: Nuckolls
- first_name: Mark S.
full_name: Hybertsen, Mark S.
last_name: Hybertsen
- first_name: Michael L.
full_name: Steigerwald, Michael L.
last_name: Steigerwald
citation:
ama: Venkataraman L, Klare JE, Nuckolls C, Hybertsen MS, Steigerwald ML. Dependence
of single-molecule junction conductance on molecular conformation. Nature.
2006;442(7105):904-907. doi:10.1038/nature05037
apa: Venkataraman, L., Klare, J. E., Nuckolls, C., Hybertsen, M. S., & Steigerwald,
M. L. (2006). Dependence of single-molecule junction conductance on molecular
conformation. Nature. Springer Nature. https://doi.org/10.1038/nature05037
chicago: Venkataraman, Latha, Jennifer E. Klare, Colin Nuckolls, Mark S. Hybertsen,
and Michael L. Steigerwald. “Dependence of Single-Molecule Junction Conductance
on Molecular Conformation.” Nature. Springer Nature, 2006. https://doi.org/10.1038/nature05037.
ieee: L. Venkataraman, J. E. Klare, C. Nuckolls, M. S. Hybertsen, and M. L. Steigerwald,
“Dependence of single-molecule junction conductance on molecular conformation,”
Nature, vol. 442, no. 7105. Springer Nature, pp. 904–907, 2006.
ista: Venkataraman L, Klare JE, Nuckolls C, Hybertsen MS, Steigerwald ML. 2006.
Dependence of single-molecule junction conductance on molecular conformation.
Nature. 442(7105), 904–907.
mla: Venkataraman, Latha, et al. “Dependence of Single-Molecule Junction Conductance
on Molecular Conformation.” Nature, vol. 442, no. 7105, Springer Nature,
2006, pp. 904–07, doi:10.1038/nature05037.
short: L. Venkataraman, J.E. Klare, C. Nuckolls, M.S. Hybertsen, M.L. Steigerwald,
Nature 442 (2006) 904–907.
date_created: 2024-09-09T15:07:33Z
date_published: 2006-08-24T00:00:00Z
date_updated: 2025-01-03T11:13:23Z
day: '24'
doi: 10.1038/nature05037
extern: '1'
external_id:
pmid:
- '16929295'
fulldoi: https://doi.org/10.1038/nature05037
intvolume: ' 442'
issue: '7105'
language:
- iso: eng
month: '08'
oa_version: None
page: 904-907
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dependence of single-molecule junction conductance on molecular conformation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 442
year: '2006'
...
---
OA_place: repository
OA_type: green
_id: '18042'
abstract:
- lang: eng
text: We have measured electron transport in small bundles of identical conducting
molybdenum selenide nanowires where the number of weakly interacting one-dimensional
chains ranges from 1 to 300. The linear conductance and current in these nanowires
exhibit a power-law dependence on temperature and bias voltage, respectively.
The exponents governing these power laws decrease as the number of conducting
channels increase. These exponents can be related to the electron-electron interaction
parameter for transport in multichannel 1D systems with a few defects.
article_number: '076601'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Yeon Suk
full_name: Hong, Yeon Suk
last_name: Hong
- first_name: Philip
full_name: Kim, Philip
last_name: Kim
citation:
ama: 'Venkataraman L, Hong YS, Kim P. Electron transport in m Multichannel one-dimensional
conductor: Molybdenum selenide nanowires. Physical Review Letters. 2006;96(7).
doi:10.1103/physrevlett.96.076601'
apa: 'Venkataraman, L., Hong, Y. S., & Kim, P. (2006). Electron transport in
m Multichannel one-dimensional conductor: Molybdenum selenide nanowires. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.96.076601'
chicago: 'Venkataraman, Latha, Yeon Suk Hong, and Philip Kim. “Electron Transport
in m Multichannel One-Dimensional Conductor: Molybdenum Selenide Nanowires.” Physical
Review Letters. American Physical Society, 2006. https://doi.org/10.1103/physrevlett.96.076601.'
ieee: 'L. Venkataraman, Y. S. Hong, and P. Kim, “Electron transport in m Multichannel
one-dimensional conductor: Molybdenum selenide nanowires,” Physical Review
Letters, vol. 96, no. 7. American Physical Society, 2006.'
ista: 'Venkataraman L, Hong YS, Kim P. 2006. Electron transport in m Multichannel
one-dimensional conductor: Molybdenum selenide nanowires. Physical Review Letters.
96(7), 076601.'
mla: 'Venkataraman, Latha, et al. “Electron Transport in m Multichannel One-Dimensional
Conductor: Molybdenum Selenide Nanowires.” Physical Review Letters, vol.
96, no. 7, 076601, American Physical Society, 2006, doi:10.1103/physrevlett.96.076601.'
short: L. Venkataraman, Y.S. Hong, P. Kim, Physical Review Letters 96 (2006).
date_created: 2024-09-09T15:08:34Z
date_published: 2006-02-21T00:00:00Z
date_updated: 2025-01-03T11:16:00Z
day: '21'
doi: 10.1103/physrevlett.96.076601
extern: '1'
external_id:
arxiv:
- cond-mat/0601454
pmid:
- '16606116'
fulldoi: https://doi.org/10.1103/physrevlett.96.076601
intvolume: ' 96'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/cond-mat/0601454
month: '02'
oa: 1
oa_version: Preprint
pmid: 1
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Electron transport in m Multichannel one-dimensional conductor: Molybdenum
selenide nanowires'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2006'
...
---
OA_place: repository
OA_type: green
_id: '18043'
abstract:
- lang: eng
text: We measure the conductance of amine-terminated molecules by breaking Au point
contacts in a molecular solution at room temperature. We find that the variability
of the observed conductance for the diamine molecule−Au junctions is much less
than the variability for diisonitrile− and dithiol−Au junctions. This narrow distribution
enables unambiguous conductance measurements of single molecules. For an alkane
diamine series with 2−8 carbon atoms in the hydrocarbon chain, our results show
a systematic trend in the conductance from which we extract a tunneling decay
constant of 0.91 ± 0.03 per methylene group. We hypothesize that the diamine link
binds preferentially to undercoordinated Au atoms in the junction. This is supported
by density functional theory-based calculations that show the amine binding to
a gold adatom with sufficient angular flexibility for easy junction formation
but well-defined electronic coupling of the N lone pair to the Au. Therefore,
the amine linkage leads to well-defined conductance measurements of a single molecule
junction in a statistical study.
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Jennifer E.
full_name: Klare, Jennifer E.
last_name: Klare
- first_name: Iris W.
full_name: Tam, Iris W.
last_name: Tam
- first_name: Colin
full_name: Nuckolls, Colin
last_name: Nuckolls
- first_name: Mark S.
full_name: Hybertsen, Mark S.
last_name: Hybertsen
- first_name: Michael L.
full_name: Steigerwald, Michael L.
last_name: Steigerwald
citation:
ama: Venkataraman L, Klare JE, Tam IW, Nuckolls C, Hybertsen MS, Steigerwald ML.
Single-molecule circuits with well-defined molecular conductance. Nano Letters.
2006;6(3):458-462. doi:10.1021/nl052373+
apa: Venkataraman, L., Klare, J. E., Tam, I. W., Nuckolls, C., Hybertsen, M. S.,
& Steigerwald, M. L. (2006). Single-molecule circuits with well-defined molecular
conductance. Nano Letters. American Chemical Society. https://doi.org/10.1021/nl052373+
chicago: Venkataraman, Latha, Jennifer E. Klare, Iris W. Tam, Colin Nuckolls, Mark
S. Hybertsen, and Michael L. Steigerwald. “Single-Molecule Circuits with Well-Defined
Molecular Conductance.” Nano Letters. American Chemical Society, 2006.
https://doi.org/10.1021/nl052373+.
ieee: L. Venkataraman, J. E. Klare, I. W. Tam, C. Nuckolls, M. S. Hybertsen, and
M. L. Steigerwald, “Single-molecule circuits with well-defined molecular conductance,”
Nano Letters, vol. 6, no. 3. American Chemical Society, pp. 458–462, 2006.
ista: Venkataraman L, Klare JE, Tam IW, Nuckolls C, Hybertsen MS, Steigerwald ML.
2006. Single-molecule circuits with well-defined molecular conductance. Nano Letters.
6(3), 458–462.
mla: Venkataraman, Latha, et al. “Single-Molecule Circuits with Well-Defined Molecular
Conductance.” Nano Letters, vol. 6, no. 3, American Chemical Society, 2006,
pp. 458–62, doi:10.1021/nl052373+.
short: L. Venkataraman, J.E. Klare, I.W. Tam, C. Nuckolls, M.S. Hybertsen, M.L.
Steigerwald, Nano Letters 6 (2006) 458–462.
date_created: 2024-09-09T15:09:24Z
date_published: 2006-02-01T00:00:00Z
date_updated: 2025-01-03T11:19:52Z
day: '01'
doi: 10.1021/nl052373+
extern: '1'
external_id:
arxiv:
- cond-mat/0603281
fulldoi: https://doi.org/10.1021/nl052373+
intvolume: ' 6'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/cond-mat/0603281
month: '02'
oa: 1
oa_version: Preprint
page: 458-462
publication: Nano Letters
publication_identifier:
eissn:
- 1530-6992
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-molecule circuits with well-defined molecular conductance
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2006'
...
---
OA_type: closed access
_id: '18044'
abstract:
- lang: eng
text: The conductance of molecular junctions, formed by breaking gold point contacts
dressed with various thiol functionalized organic molecules, is measured at 293
K and at 30 K. In the presence of molecules, individual conductance traces measured
as a function of increasing gold electrode displacement show clear steps below
the quantum conductance steps of the gold contact. These steps are distributed
over a wide range of molecule-dependent conductance values. Histograms constructed
from all conductance traces therefore do not show clear peaks either at room or
low temperatures. Filtering of the data sets by an objective automated procedure
only marginally improves the visibility of such features. We conclude that the
geometrical junction to junction variations dominate the conductance measurements.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jochen
full_name: Ulrich, Jochen
last_name: Ulrich
- first_name: Donna
full_name: Esrail, Donna
last_name: Esrail
- first_name: William
full_name: Pontius, William
last_name: Pontius
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: David
full_name: Millar, David
last_name: Millar
- first_name: Linda H.
full_name: Doerrer, Linda H.
last_name: Doerrer
citation:
ama: Ulrich J, Esrail D, Pontius W, Venkataraman L, Millar D, Doerrer LH. Variability
of conductance in molecular junctions. The Journal of Physical Chemistry B.
2006;110(6):2462-2466. doi:10.1021/jp056455y
apa: Ulrich, J., Esrail, D., Pontius, W., Venkataraman, L., Millar, D., & Doerrer,
L. H. (2006). Variability of conductance in molecular junctions. The Journal
of Physical Chemistry B. American Chemical Society. https://doi.org/10.1021/jp056455y
chicago: Ulrich, Jochen, Donna Esrail, William Pontius, Latha Venkataraman, David
Millar, and Linda H. Doerrer. “Variability of Conductance in Molecular Junctions.”
The Journal of Physical Chemistry B. American Chemical Society, 2006. https://doi.org/10.1021/jp056455y.
ieee: J. Ulrich, D. Esrail, W. Pontius, L. Venkataraman, D. Millar, and L. H. Doerrer,
“Variability of conductance in molecular junctions,” The Journal of Physical
Chemistry B, vol. 110, no. 6. American Chemical Society, pp. 2462–2466, 2006.
ista: Ulrich J, Esrail D, Pontius W, Venkataraman L, Millar D, Doerrer LH. 2006.
Variability of conductance in molecular junctions. The Journal of Physical Chemistry
B. 110(6), 2462–2466.
mla: Ulrich, Jochen, et al. “Variability of Conductance in Molecular Junctions.”
The Journal of Physical Chemistry B, vol. 110, no. 6, American Chemical
Society, 2006, pp. 2462–66, doi:10.1021/jp056455y.
short: J. Ulrich, D. Esrail, W. Pontius, L. Venkataraman, D. Millar, L.H. Doerrer,
The Journal of Physical Chemistry B 110 (2006) 2462–2466.
date_created: 2024-09-09T15:10:13Z
date_published: 2006-01-21T00:00:00Z
date_updated: 2025-01-03T11:22:15Z
day: '21'
doi: 10.1021/jp056455y
extern: '1'
external_id:
pmid:
- '16471840'
fulldoi: https://doi.org/10.1021/jp056455y
intvolume: ' 110'
issue: '6'
language:
- iso: eng
month: '01'
oa_version: None
page: 2462-2466
pmid: 1
publication: The Journal of Physical Chemistry B
publication_identifier:
eissn:
- 1520-5207
issn:
- 1520-6106
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Variability of conductance in molecular junctions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 110
year: '2006'
...
---
_id: '18318'
abstract:
- lang: eng
text: "Multidimensional scaling (MDS) is a generic name for a family of algorithms
that construct a configuration of points in a target metric space from information
about inter-point distances measured in some other metric space. Large-scale MDS
problems often occur in data analysis, representation and visualization. Solving
such problems efficiently is of key importance in many applications.\r\nIn this
paper we present a multigrid framework for MDS problems. We demonstrate the performance
of our algorithm on dimensionality reduction and isometric embedding problems,
two classical problems requiring efficient large-scale MDS. Simulation results
show that the proposed approach significantly outperforms conventional MDS algorithms."
article_processing_charge: No
article_type: original
author:
- first_name: M. M.
full_name: Bronstein, M. M.
last_name: Bronstein
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: R.
full_name: Kimmel, R.
last_name: Kimmel
- first_name: I.
full_name: Yavneh, I.
last_name: Yavneh
citation:
ama: Bronstein MM, Bronstein AM, Kimmel R, Yavneh I. Multigrid multidimensional
scaling. Numerical Linear Algebra with Applications. 2006;13(2-3):149-171.
doi:10.1002/nla.475
apa: Bronstein, M. M., Bronstein, A. M., Kimmel, R., & Yavneh, I. (2006). Multigrid
multidimensional scaling. Numerical Linear Algebra with Applications. Wiley.
https://doi.org/10.1002/nla.475
chicago: Bronstein, M. M., Alex M. Bronstein, R. Kimmel, and I. Yavneh. “Multigrid
Multidimensional Scaling.” Numerical Linear Algebra with Applications.
Wiley, 2006. https://doi.org/10.1002/nla.475.
ieee: M. M. Bronstein, A. M. Bronstein, R. Kimmel, and I. Yavneh, “Multigrid multidimensional
scaling,” Numerical Linear Algebra with Applications, vol. 13, no. 2–3.
Wiley, pp. 149–171, 2006.
ista: Bronstein MM, Bronstein AM, Kimmel R, Yavneh I. 2006. Multigrid multidimensional
scaling. Numerical Linear Algebra with Applications. 13(2–3), 149–171.
mla: Bronstein, M. M., et al. “Multigrid Multidimensional Scaling.” Numerical
Linear Algebra with Applications, vol. 13, no. 2–3, Wiley, 2006, pp. 149–71,
doi:10.1002/nla.475.
short: M.M. Bronstein, A.M. Bronstein, R. Kimmel, I. Yavneh, Numerical Linear Algebra
with Applications 13 (2006) 149–171.
date_created: 2024-10-15T11:12:06Z
date_published: 2006-03-01T00:00:00Z
date_updated: 2024-11-12T08:45:09Z
day: '01'
doi: 10.1002/nla.475
extern: '1'
fulldoi: https://doi.org/10.1002/nla.475
intvolume: ' 13'
issue: 2-3
language:
- iso: eng
month: '03'
oa_version: None
page: 149-171
publication: Numerical Linear Algebra with Applications
publication_identifier:
eissn:
- 1099-1506
issn:
- 1070-5325
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multigrid multidimensional scaling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2006'
...
---
OA_type: closed access
_id: '18320'
abstract:
- lang: eng
text: Presented here is the problem of recovering a dynamic image superimposed on
a static background. Such a problem is ill-posed and may arise e.g. in imaging
through semireflective media, in separation of an illumination image from a reflectance
image, in imaging with diffraction phenomena, etc. In this work we study regularization
of this problem in spirit of Total Variation and general sparsifying transformations.
alternative_title:
- LNISA
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
citation:
ama: 'Bronstein AM, Bronstein MM, Zibulevsky M. On separation of semitransparent
dynamic images from static background. In: 6th International Conference on
Independent Component Analysis and Signal Separation. Vol 3889. Springer Nature;
2006:934-940. doi:10.1007/11679363_116'
apa: 'Bronstein, A. M., Bronstein, M. M., & Zibulevsky, M. (2006). On separation
of semitransparent dynamic images from static background. In 6th International
Conference on Independent Component Analysis and Signal Separation (Vol. 3889,
pp. 934–940). Charleston, SC, United States: Springer Nature. https://doi.org/10.1007/11679363_116'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Michael Zibulevsky. “On Separation
of Semitransparent Dynamic Images from Static Background.” In 6th International
Conference on Independent Component Analysis and Signal Separation, 3889:934–40.
Springer Nature, 2006. https://doi.org/10.1007/11679363_116.
ieee: A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “On separation of semitransparent
dynamic images from static background,” in 6th International Conference on
Independent Component Analysis and Signal Separation, Charleston, SC, United
States, 2006, vol. 3889, pp. 934–940.
ista: 'Bronstein AM, Bronstein MM, Zibulevsky M. 2006. On separation of semitransparent
dynamic images from static background. 6th International Conference on Independent
Component Analysis and Signal Separation. ICA: International Conference on Independent
Component Analysis and Signal Separation, LNISA, vol. 3889, 934–940.'
mla: Bronstein, Alex M., et al. “On Separation of Semitransparent Dynamic Images
from Static Background.” 6th International Conference on Independent Component
Analysis and Signal Separation, vol. 3889, Springer Nature, 2006, pp. 934–40,
doi:10.1007/11679363_116.
short: A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, in:, 6th International Conference
on Independent Component Analysis and Signal Separation, Springer Nature, 2006,
pp. 934–940.
conference:
end_date: 2006-03-08
location: Charleston, SC, United States
name: 'ICA: International Conference on Independent Component Analysis and Signal
Separation'
start_date: 2006-03-05
date_created: 2024-10-15T11:20:53Z
date_published: 2006-02-13T00:00:00Z
date_updated: 2024-10-22T07:00:45Z
day: '13'
doi: 10.1007/11679363_116
extern: '1'
fulldoi: https://doi.org/10.1007/11679363_116
intvolume: ' 3889'
language:
- iso: eng
month: '02'
oa_version: None
page: 934-940
publication: 6th International Conference on Independent Component Analysis and Signal
Separation
publication_identifier:
eisbn:
- '9783540326311'
eissn:
- 1611-3349
isbn:
- '9783540326304'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On separation of semitransparent dynamic images from static background
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3889
year: '2006'
...
---
OA_type: closed access
_id: '18321'
abstract:
- lang: eng
text: Recent studies on three-dimensional face recognition proposed to model facial
expressions as isometries of the facial surface. Based on this model, expression-invariant
signatures of the face were constructed by means of approximate isometric embedding
into flat spaces. Here, we apply a new method for measuring isometry-invariant
similarity between faces by embedding one facial surface into another. We demonstrate
that our approach has several significant advantages, one of which is the ability
to handle partially missing data. Promising face recognition results are obtained
in numerical experiments even when the facial surfaces are severely occluded.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Robust expression-invariant face recognition
from partially missing data. In: 9th European Conference on Computer Vision.
Vol 3953. Springer Nature; 2006. doi:10.1007/11744078_31'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Robust expression-invariant
face recognition from partially missing data. In 9th European Conference on
Computer Vision (Vol. 3953). Graz, Austria: Springer Nature. https://doi.org/10.1007/11744078_31'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Robust Expression-Invariant
Face Recognition from Partially Missing Data.” In 9th European Conference on
Computer Vision, Vol. 3953. Springer Nature, 2006. https://doi.org/10.1007/11744078_31.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Robust expression-invariant
face recognition from partially missing data,” in 9th European Conference on
Computer Vision, Graz, Austria, 2006, vol. 3953.
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2006. Robust expression-invariant face
recognition from partially missing data. 9th European Conference on Computer Vision.
ECCV: European Conference on Computer Vision, LNCS, vol. 3953.'
mla: Bronstein, Alex M., et al. “Robust Expression-Invariant Face Recognition from
Partially Missing Data.” 9th European Conference on Computer Vision, vol.
3953, Springer Nature, 2006, doi:10.1007/11744078_31.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 9th European Conference on
Computer Vision, Springer Nature, 2006.
conference:
end_date: 2006-05-13
location: Graz, Austria
name: 'ECCV: European Conference on Computer Vision'
start_date: 2006-05-07
date_created: 2024-10-15T11:20:53Z
date_published: 2006-01-01T00:00:00Z
date_updated: 2024-10-22T06:46:14Z
doi: 10.1007/11744078_31
extern: '1'
fulldoi: https://doi.org/10.1007/11744078_31
intvolume: ' 3953'
language:
- iso: eng
month: '01'
oa_version: None
publication: 9th European Conference on Computer Vision
publication_identifier:
eisbn:
- '9783540338376'
eissn:
- 1611-3349
isbn:
- '9783540338369'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Robust expression-invariant face recognition from partially missing data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3953
year: '2006'
...
---
OA_type: closed access
_id: '18322'
abstract:
- lang: eng
text: A geometric framework for finding intrinsic correspondence between animated
3D faces is presented. We model facial expressions as isometries of the facial
surface and find the correspondence between two faces as the minimum-distortion
mapping. Generalized multidimensional scaling is used for this goal. We apply
our approach to texture mapping onto 3D video, expression exaggeration and morphing
between faces.
alternative_title:
- LNIP
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Facetoface: An isometric model for facial
animation. In: 4th International Conference on Articulated Motion and Deformable
Objects. Vol 4069. Springer Nature; 2006:38-47. doi:10.1007/11789239_5'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Facetoface: An
isometric model for facial animation. In 4th International Conference on Articulated
Motion and Deformable Objects (Vol. 4069, pp. 38–47). Mallorca, Spain: Springer
Nature. https://doi.org/10.1007/11789239_5'
chicago: 'Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Facetoface:
An Isometric Model for Facial Animation.” In 4th International Conference on
Articulated Motion and Deformable Objects, 4069:38–47. Springer Nature, 2006.
https://doi.org/10.1007/11789239_5.'
ieee: 'A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Facetoface: An isometric
model for facial animation,” in 4th International Conference on Articulated
Motion and Deformable Objects, Mallorca, Spain, 2006, vol. 4069, pp. 38–47.'
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2006. Facetoface: An isometric model
for facial animation. 4th International Conference on Articulated Motion and Deformable
Objects. AMDO: Conference on Articulated Motion and Deformable Objects, LNIP,
vol. 4069, 38–47.'
mla: 'Bronstein, Alex M., et al. “Facetoface: An Isometric Model for Facial Animation.”
4th International Conference on Articulated Motion and Deformable Objects,
vol. 4069, Springer Nature, 2006, pp. 38–47, doi:10.1007/11789239_5.'
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 4th International Conference
on Articulated Motion and Deformable Objects, Springer Nature, 2006, pp. 38–47.
conference:
end_date: 2006-07-14
location: Mallorca, Spain
name: 'AMDO: Conference on Articulated Motion and Deformable Objects'
start_date: 2006-07-11
date_created: 2024-10-15T11:20:53Z
date_published: 2006-07-18T00:00:00Z
date_updated: 2024-10-22T06:42:42Z
day: '18'
doi: 10.1007/11789239_5
extern: '1'
fulldoi: https://doi.org/10.1007/11789239_5
intvolume: ' 4069'
language:
- iso: eng
month: '07'
oa_version: None
page: 38-47
publication: 4th International Conference on Articulated Motion and Deformable Objects
publication_identifier:
eisbn:
- '9783540360322'
eissn:
- 1611-3349
isbn:
- '9783540360315'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Facetoface: An isometric model for facial animation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4069
year: '2006'
...
---
OA_type: closed access
_id: '18323'
abstract:
- lang: eng
text: We present a theoretical and computational framework for matching of two-dimensional
articulated shapes. Assuming that articulations can be modeled as near-isometries,
we show an axiomatic construction of an articulation-invariant distance between
shapes, formulated as a generalized multidimensional scaling (GMDS) problem and
solved efficiently. Some numerical results demonstrating the accuracy of our method
are presented.
alternative_title:
- LNIP
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Alfred M.
full_name: Bruckstein, Alfred M.
last_name: Bruckstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. Matching two-dimensional
articulated shapes using generalized multidimensional scaling. In: 4th International
Conference on Articulated Motion and Deformable Objects. Vol 4069. Springer
Nature; 2006:48-57. doi:10.1007/11789239_6'
apa: 'Bronstein, A. M., Bronstein, M. M., Bruckstein, A. M., & Kimmel, R. (2006).
Matching two-dimensional articulated shapes using generalized multidimensional
scaling. In 4th International Conference on Articulated Motion and Deformable
Objects (Vol. 4069, pp. 48–57). Mallorca, Spain: Springer Nature. https://doi.org/10.1007/11789239_6'
chicago: Bronstein, Alex M., Michael M. Bronstein, Alfred M. Bruckstein, and Ron
Kimmel. “Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional
Scaling.” In 4th International Conference on Articulated Motion and Deformable
Objects, 4069:48–57. Springer Nature, 2006. https://doi.org/10.1007/11789239_6.
ieee: A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel, “Matching
two-dimensional articulated shapes using generalized multidimensional scaling,”
in 4th International Conference on Articulated Motion and Deformable Objects,
Mallorca, Spain, 2006, vol. 4069, pp. 48–57.
ista: 'Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. 2006. Matching two-dimensional
articulated shapes using generalized multidimensional scaling. 4th International
Conference on Articulated Motion and Deformable Objects. AMDO: Conference on Articulated
Motion and Deformable Objects, LNIP, vol. 4069, 48–57.'
mla: Bronstein, Alex M., et al. “Matching Two-Dimensional Articulated Shapes Using
Generalized Multidimensional Scaling.” 4th International Conference on Articulated
Motion and Deformable Objects, vol. 4069, Springer Nature, 2006, pp. 48–57,
doi:10.1007/11789239_6.
short: A.M. Bronstein, M.M. Bronstein, A.M. Bruckstein, R. Kimmel, in:, 4th International
Conference on Articulated Motion and Deformable Objects, Springer Nature, 2006,
pp. 48–57.
conference:
end_date: 2006-07-14
location: Mallorca, Spain
name: 'AMDO: Conference on Articulated Motion and Deformable Objects'
start_date: 2006-07-11
date_created: 2024-10-15T11:20:53Z
date_published: 2006-07-18T00:00:00Z
date_updated: 2024-10-22T06:35:45Z
day: '18'
doi: 10.1007/11789239_6
extern: '1'
fulldoi: https://doi.org/10.1007/11789239_6
intvolume: ' 4069'
language:
- iso: eng
month: '07'
oa_version: None
page: 48-57
publication: 4th International Conference on Articulated Motion and Deformable Objects
publication_identifier:
eisbn:
- '9783540360322'
eissn:
- 1611-3349
isbn:
- '9783540360315'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Matching two-dimensional articulated shapes using generalized multidimensional
scaling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4069
year: '2006'
...
---
_id: '18370'
abstract:
- lang: eng
text: An efficient algorithm for isometry-invariant matching of surfaces is presented.
The key idea is computing the minimum-distortion mapping between two surfaces.
For this purpose, we introduce the generalized multidimensional scaling, a computationally
efficient continuous optimization algorithm for finding the least distortion embedding
of one surface into another. The generalized multidimensional scaling algorithm
allows for both full and partial surface matching. As an example, it is applied
to the problem of expression-invariant three-dimensional face recognition.
article_processing_charge: No
article_type: original
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Generalized multidimensional scaling:
A framework for isometry-invariant partial surface matching. PNAS. 2006;103(5):1168-1172.
doi:10.1073/pnas.0508601103'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Generalized multidimensional
scaling: A framework for isometry-invariant partial surface matching. PNAS.
National Academy of Sciences. https://doi.org/10.1073/pnas.0508601103'
chicago: 'Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Generalized
Multidimensional Scaling: A Framework for Isometry-Invariant Partial Surface Matching.”
PNAS. National Academy of Sciences, 2006. https://doi.org/10.1073/pnas.0508601103.'
ieee: 'A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Generalized multidimensional
scaling: A framework for isometry-invariant partial surface matching,” PNAS,
vol. 103, no. 5. National Academy of Sciences, pp. 1168–1172, 2006.'
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2006. Generalized multidimensional
scaling: A framework for isometry-invariant partial surface matching. PNAS. 103(5),
1168–1172.'
mla: 'Bronstein, Alex M., et al. “Generalized Multidimensional Scaling: A Framework
for Isometry-Invariant Partial Surface Matching.” PNAS, vol. 103, no. 5,
National Academy of Sciences, 2006, pp. 1168–72, doi:10.1073/pnas.0508601103.'
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, PNAS 103 (2006) 1168–1172.
date_created: 2024-10-15T11:20:54Z
date_published: 2006-01-23T00:00:00Z
date_updated: 2024-10-21T09:09:19Z
day: '23'
doi: 10.1073/pnas.0508601103
extern: '1'
external_id:
pmid:
- '16432211'
fulldoi: https://doi.org/10.1073/pnas.0508601103
intvolume: ' 103'
issue: '5'
language:
- iso: eng
month: '01'
oa_version: None
page: 1168-1172
pmid: 1
publication: PNAS
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Generalized multidimensional scaling: A framework for isometry-invariant partial
surface matching'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2006'
...
---
_id: '18408'
abstract:
- lang: eng
text: Addressed here is the problem of constructing and analyzing expression-invariant
representations of human faces. We demonstrate and justify experimentally a simple
geometric model that allows to describe facial expressions as isometric deformations
of the facial surface. The main step in the construction of expression-invariant
representation of a face involves embedding of the facial intrinsic geometric
structure into some low-dimensional space. We study the influence of the embedding
space geometry and dimensionality choice on the representation accuracy and argue
that compared to its Euclidean counterpart, spherical embedding leads to notably
smaller metric distortions. We experimentally support our claim showing that a
smaller embedding error leads to better recognition.
article_processing_charge: No
article_type: original
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: Bronstein AM, Bronstein MM, Kimmel R. Expression-invariant representations
of faces. IEEE Transactions on Image Processing. 2006;16(1):188-197. doi:10.1109/tip.2006.884940
apa: Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Expression-invariant
representations of faces. IEEE Transactions on Image Processing. Institute
of Electrical and Electronics Engineers. https://doi.org/10.1109/tip.2006.884940
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Expression-Invariant
Representations of Faces.” IEEE Transactions on Image Processing. Institute
of Electrical and Electronics Engineers, 2006. https://doi.org/10.1109/tip.2006.884940.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Expression-invariant representations
of faces,” IEEE Transactions on Image Processing, vol. 16, no. 1. Institute
of Electrical and Electronics Engineers, pp. 188–197, 2006.
ista: Bronstein AM, Bronstein MM, Kimmel R. 2006. Expression-invariant representations
of faces. IEEE Transactions on Image Processing. 16(1), 188–197.
mla: Bronstein, Alex M., et al. “Expression-Invariant Representations of Faces.”
IEEE Transactions on Image Processing, vol. 16, no. 1, Institute of Electrical
and Electronics Engineers, 2006, pp. 188–97, doi:10.1109/tip.2006.884940.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, IEEE Transactions on Image Processing
16 (2006) 188–197.
date_created: 2024-10-15T11:20:54Z
date_published: 2006-12-16T00:00:00Z
date_updated: 2024-10-18T12:04:51Z
day: '16'
doi: 10.1109/tip.2006.884940
extern: '1'
external_id:
pmid:
- '17283777'
fulldoi: https://doi.org/10.1109/tip.2006.884940
intvolume: ' 16'
issue: '1'
language:
- iso: eng
month: '12'
oa_version: None
page: 188-197
pmid: 1
publication: IEEE Transactions on Image Processing
publication_identifier:
issn:
- 1057-7149
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Expression-invariant representations of faces
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 16
year: '2006'
...
---
_id: '18429'
abstract:
- lang: eng
text: We present an efficient computational framework for isometry‐invariant comparison
of smooth surfaces. We formulate the Gromov–Hausdorff distance as a multidimensional
scaling–like continuous optimization problem. In order to construct an efficient
optimization scheme, we develop a numerical tool for interpolating geodesic distances
on a sampled surface from precomputed geodesic distances between the samples.
For isometry‐invariant comparison of surfaces in the case of partially missing
data, we present the partial embedding distance, which is computed using a similar
scheme. The main idea is finding a minimum‐distortion mapping from one surface
to another, while considering only relevant geodesic distances. We discuss numerical
implementation issues and present experimental results that demonstrate its accuracy
and efficiency.
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: Bronstein AM, Bronstein MM, Kimmel R. Efficient computation of isometry-invariant
distances between surfaces. SIAM Journal on Scientific Computing. 2006;28(5):1812-1836.
doi:10.1137/050639296
apa: Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006). Efficient computation
of isometry-invariant distances between surfaces. SIAM Journal on Scientific
Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/050639296
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Efficient Computation
of Isometry-Invariant Distances between Surfaces.” SIAM Journal on Scientific
Computing. Society for Industrial & Applied Mathematics, 2006. https://doi.org/10.1137/050639296.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Efficient computation of
isometry-invariant distances between surfaces,” SIAM Journal on Scientific
Computing, vol. 28, no. 5. Society for Industrial & Applied Mathematics,
pp. 1812–1836, 2006.
ista: Bronstein AM, Bronstein MM, Kimmel R. 2006. Efficient computation of isometry-invariant
distances between surfaces. SIAM Journal on Scientific Computing. 28(5), 1812–1836.
mla: Bronstein, Alex M., et al. “Efficient Computation of Isometry-Invariant Distances
between Surfaces.” SIAM Journal on Scientific Computing, vol. 28, no. 5,
Society for Industrial & Applied Mathematics, 2006, pp. 1812–36, doi:10.1137/050639296.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, SIAM Journal on Scientific Computing
28 (2006) 1812–1836.
date_created: 2024-10-15T11:20:55Z
date_published: 2006-10-01T00:00:00Z
date_updated: 2024-12-18T15:49:10Z
day: '01'
doi: 10.1137/050639296
extern: '1'
fulldoi: https://doi.org/10.1137/050639296
intvolume: ' 28'
issue: '5'
language:
- iso: eng
month: '10'
oa_version: None
page: 1812-1836
publication: SIAM Journal on Scientific Computing
publication_identifier:
eissn:
- 1095-7197
issn:
- 1064-8275
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient computation of isometry-invariant distances between surfaces
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2006'
...
---
OA_place: repository
OA_type: green
_id: '22076'
abstract:
- lang: eng
text: In dimension n > 3 we show the existence of a compactly supported potential
in the differentiability class Cα, α < n-3/2, for which the solutions to the linear
Schrödinger equation in ℝn, ∂tu = - Δ u + Vu, u(0)=f, fail to satisfy an evolution
estimate of the form ||u(t, ̇)||∞ ≤ C |t| -n/2 ||u(0,\̇)||1̇. This contrasts with
known results in dimensions n ≤ 3, where a pointwise decay condition on V is generally
sufficient to imply dispersive bounds. The obstructions in our example are generated
by an expression with scaling law |t|-n+3/2+α, which becomes dominant in the time
interval |t| ≪ 1.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Michael
full_name: Goldberg, Michael
last_name: Goldberg
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Goldberg M, Vişan M. A counterexample to dispersive estimates for Schrödinger
operators in higher dimensions. Communications in Mathematical Physics.
2006;266:211-238. doi:10.1007/s00220-006-0013-5
apa: Goldberg, M., & Vişan, M. (2006). A counterexample to dispersive estimates
for Schrödinger operators in higher dimensions. Communications in Mathematical
Physics. Springer Nature. https://doi.org/10.1007/s00220-006-0013-5
chicago: Goldberg, Michael, and Monica Vişan. “A Counterexample to Dispersive Estimates
for Schrödinger Operators in Higher Dimensions.” Communications in Mathematical
Physics. Springer Nature, 2006. https://doi.org/10.1007/s00220-006-0013-5.
ieee: M. Goldberg and M. Vişan, “A counterexample to dispersive estimates for Schrödinger
operators in higher dimensions,” Communications in Mathematical Physics,
vol. 266. Springer Nature, pp. 211–238, 2006.
ista: Goldberg M, Vişan M. 2006. A counterexample to dispersive estimates for Schrödinger
operators in higher dimensions. Communications in Mathematical Physics. 266, 211–238.
mla: Goldberg, Michael, and Monica Vişan. “A Counterexample to Dispersive Estimates
for Schrödinger Operators in Higher Dimensions.” Communications in Mathematical
Physics, vol. 266, Springer Nature, 2006, pp. 211–38, doi:10.1007/s00220-006-0013-5.
short: M. Goldberg, M. Vişan, Communications in Mathematical Physics 266 (2006)
211–238.
das_tickbox: '1'
date_created: 2026-06-19T08:23:36Z
date_published: 2006-08-01T00:00:00Z
date_updated: 2026-06-30T11:26:34Z
day: '01'
doi: 10.1007/s00220-006-0013-5
extern: '1'
external_id:
arxiv:
- math/0508206
fulldoi: https://doi.org/10.1007/s00220-006-0013-5
intvolume: ' 266'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.math/0508206
month: '08'
oa: 1
oa_version: Preprint
page: 211-238
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A counterexample to dispersive estimates for Schrödinger operators in higher
dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 266
year: '2006'
...
---
OA_type: closed access
_id: '4574'
abstract:
- lang: eng
text: Many software model checkers are based on predicate abstraction. If the verification
goal depends on pointer structures, the approach does not work well, because it
is difficult to find adequate predicate abstractions for the heap. In contrast,
shape analysis, which uses graph-based heap abstractions, can provide a compact
representation of recursive data structures. We integrate shape analysis into
the software model checker Blast. Because shape analysis is expensive, we do not
apply it globally. Instead, we ensure that, like predicates, shape graphs are
computed and stored locally, only where necessary for proving the verification
goal. To achieve this, we extend lazy abstraction refinement, which so far has
been used only for predicate abstractions, to three-valued logical structures.
This approach does not only increase the precision of model checking, but it also
increases the efficiency of shape analysis. We implemented the technique by extending
Blast with calls to Tvla.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Grégory
full_name: Théoduloz, Grégory
last_name: Théoduloz
citation:
ama: 'Beyer D, Henzinger TA, Théoduloz G. Lazy shape analysis. In: Proceedings
of the 18th International Conference on Computer Aided Verification. Vol 4144.
Springer; 2006:532-546. doi:10.1007/11817963_48'
apa: 'Beyer, D., Henzinger, T. A., & Théoduloz, G. (2006). Lazy shape analysis.
In Proceedings of the 18th international conference on Computer Aided Verification
(Vol. 4144, pp. 532–546). Seattle, WA, United States: Springer. https://doi.org/10.1007/11817963_48'
chicago: Beyer, Dirk, Thomas A Henzinger, and Grégory Théoduloz. “Lazy Shape Analysis.”
In Proceedings of the 18th International Conference on Computer Aided Verification,
4144:532–46. Springer, 2006. https://doi.org/10.1007/11817963_48.
ieee: D. Beyer, T. A. Henzinger, and G. Théoduloz, “Lazy shape analysis,” in Proceedings
of the 18th international conference on Computer Aided Verification, Seattle,
WA, United States, 2006, vol. 4144, pp. 532–546.
ista: 'Beyer D, Henzinger TA, Théoduloz G. 2006. Lazy shape analysis. Proceedings
of the 18th international conference on Computer Aided Verification. CAV: Computer
Aided Verification, LNCS, vol. 4144, 532–546.'
mla: Beyer, Dirk, et al. “Lazy Shape Analysis.” Proceedings of the 18th International
Conference on Computer Aided Verification, vol. 4144, Springer, 2006, pp.
532–46, doi:10.1007/11817963_48.
short: D. Beyer, T.A. Henzinger, G. Théoduloz, in:, Proceedings of the 18th International
Conference on Computer Aided Verification, Springer, 2006, pp. 532–546.
conference:
end_date: 2006-08-20
location: Seattle, WA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2006-08-17
date_created: 2018-12-11T12:09:33Z
date_published: 2006-08-08T00:00:00Z
date_updated: 2026-08-21T09:37:53Z
day: '08'
doi: 10.1007/11817963_48
extern: '1'
fulldoi: https://doi.org/10.1007/11817963_48
intvolume: ' 4144'
language:
- iso: eng
month: '08'
oa_version: None
page: 532 - 546
publication: Proceedings of the 18th international conference on Computer Aided Verification
publication_identifier:
eisbn:
- '9783540374114'
isbn:
- '9783540374060'
publication_status: published
publisher: Springer
publist_id: '133'
status: public
title: Lazy shape analysis
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 4144
year: '2006'
...
---
OA_type: closed access
_id: '4539'
abstract:
- lang: eng
text: Games on graphs with ω-regular objectives provide a model for the control
and synthesis of reactive systems. Every ω-regular objective can be decomposed
into a safety part and a liveness part. The liveness part ensures that something
good happens “eventually.” Two main strengths of the classical, infinite-limit
formulation of liveness are robustness (independence from the granularity of transitions)
and simplicity (abstraction of complicated time bounds). However, the classical
liveness formulation suffers from the drawback that the time until something good
happens may be unbounded. A stronger formulation of liveness, so-called finitary
liveness, overcomes this drawback, while still retaining robustness and simplicity.
Finitary liveness requires that there exists an unknown, fixed bound b such that
something good happens within b transitions. While for one-shot liveness (reachability)
objectives, classical and finitary liveness coincide, for repeated liveness (Büchi)
objectives, the finitary formulation is strictly stronger. In this work we study
games with finitary parity and Streett (fairness) objectives. We prove the determinacy
of these games, present algorithms for solving these games, and characterize the
memory requirements of winning strategies. Our algorithms can be used, for example,
for synthesizing controllers that do not let the response time of a system increase
without bound.
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327
and the NSF ITR grant CCR-0225610.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Henzinger TA. Finitary winning in omega-regular games. In: Proceedings
of the 12th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems. Vol 3920. Springer; 2006:257-271. doi:10.1007/11691372_17'
apa: 'Chatterjee, K., & Henzinger, T. A. (2006). Finitary winning in omega-regular
games. In Proceedings of the 12th international conference on Tools and Algorithms
for the Construction and Analysis of Systems (Vol. 3920, pp. 257–271). Vienna,
Austria: Springer. https://doi.org/10.1007/11691372_17'
chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular
Games.” In Proceedings of the 12th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, 3920:257–71. Springer, 2006.
https://doi.org/10.1007/11691372_17.
ieee: K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,”
in Proceedings of the 12th international conference on Tools and Algorithms
for the Construction and Analysis of Systems, Vienna, Austria, 2006, vol.
3920, pp. 257–271.
ista: 'Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games.
Proceedings of the 12th international conference on Tools and Algorithms for the
Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, LNCS, vol. 3920, 257–271.'
mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. “Finitary Winning in Omega-Regular
Games.” Proceedings of the 12th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, vol. 3920, Springer, 2006, pp.
257–71, doi:10.1007/11691372_17.
short: K. Chatterjee, T.A. Henzinger, in:, Proceedings of the 12th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems,
Springer, 2006, pp. 257–271.
conference:
end_date: 2006-04-02
location: Vienna, Austria
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2006-03-25
date_created: 2018-12-11T12:09:22Z
date_published: 2006-03-15T00:00:00Z
date_updated: 2026-08-21T10:38:21Z
day: '15'
doi: 10.1007/11691372_17
extern: '1'
fulldoi: https://doi.org/10.1007/11691372_17
intvolume: ' 3920'
language:
- iso: eng
month: '03'
oa_version: None
page: 257 - 271
publication: Proceedings of the 12th international conference on Tools and Algorithms
for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783540330578'
isbn:
- '9783540330561'
publication_status: published
publisher: Springer
publist_id: '183'
status: public
title: Finitary winning in omega-regular games
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 3920
year: '2006'
...
---
OA_type: closed access
_id: '4551'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) with multiple discounted reward
objectives. Such MDPs occur in design problems where one wishes to simultaneously
optimize several criteria, for example, latency and power. The possible trade-offs
between the different objectives are characterized by the Pareto curve. We show
that every Pareto-optimal point can be achieved by a memoryless strategy; however,
unlike in the single-objective case, the memoryless strategy may require randomization.
Moreover, we show that the Pareto curve can be approximated in polynomial time
in the size of the MDP. Additionally, we study the problem if a given value vector
is realizable by any strategy, and show that it can be decided in polynomial time;
but the question whether it is realizable by a deterministic memoryless strategy
is NP-complete. These results provide efficient algorithms for design exploration
in MDP models with multiple objectives.\r\nThis research was supported in part
by the AFOSR MURI grant F49620-00-1-0327, and the NSF grants CCR-0225610, CCR-0234690,
and CCR-0427202. "
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
and the NSF grants CCR-0225610, CCR-0234690, and CCR-0427202.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Majumdar R, Henzinger TA. Markov decision processes with multiple
objectives. In: Proceedings of the 23rd Annual Conference on Theoretical Aspects
of Computer Science. Vol 3884. Springer; 2006:325-336. doi:10.1007/11672142_26'
apa: 'Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2006). Markov decision
processes with multiple objectives. In Proceedings of the 23rd Annual conference
on Theoretical Aspects of Computer Science (Vol. 3884, pp. 325–336). Marseille,
France: Springer. https://doi.org/10.1007/11672142_26'
chicago: Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Markov
Decision Processes with Multiple Objectives.” In Proceedings of the 23rd Annual
Conference on Theoretical Aspects of Computer Science, 3884:325–36. Springer,
2006. https://doi.org/10.1007/11672142_26.
ieee: K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Markov decision processes
with multiple objectives,” in Proceedings of the 23rd Annual conference on
Theoretical Aspects of Computer Science, Marseille, France, 2006, vol. 3884,
pp. 325–336.
ista: 'Chatterjee K, Majumdar R, Henzinger TA. 2006. Markov decision processes with
multiple objectives. Proceedings of the 23rd Annual conference on Theoretical
Aspects of Computer Science. STACS: Theoretical Aspects of Computer Science, LNCS,
vol. 3884, 325–336.'
mla: Chatterjee, Krishnendu, et al. “Markov Decision Processes with Multiple Objectives.”
Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer
Science, vol. 3884, Springer, 2006, pp. 325–36, doi:10.1007/11672142_26.
short: K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Proceedings of the 23rd
Annual Conference on Theoretical Aspects of Computer Science, Springer, 2006,
pp. 325–336.
conference:
end_date: 2006-02-25
location: Marseille, France
name: 'STACS: Theoretical Aspects of Computer Science'
start_date: 2006-02-23
date_created: 2018-12-11T12:09:26Z
date_published: 2006-02-14T00:00:00Z
date_updated: 2026-08-21T09:46:06Z
day: '14'
doi: 10.1007/11672142_26
extern: '1'
fulldoi: https://doi.org/10.1007/11672142_26
intvolume: ' 3884'
language:
- iso: eng
month: '02'
oa_version: None
page: 325 - 336
publication: Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer
Science
publication_identifier:
eisbn:
- '9783540322887'
isbn:
- '9783540323013'
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '161'
status: public
title: Markov decision processes with multiple objectives
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 3884
year: '2006'
...
---
OA_type: closed access
_id: '4538'
abstract:
- lang: eng
text: A stochastic graph game is played by two players on a game graph with probabilistic
transitions. We consider stochastic graph games with ω-regular winning conditions
specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy
improvement algorithm for stochastic parity games; this is the first non-brute-force
algorithm for solving these games. From the strategy improvement algorithm we
obtain a randomized subexponential-time algorithm to solve such games.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Henzinger TA. Strategy improvement and randomized subexponential
algorithms for stochastic parity games. In: Proceedings of the 23rd Annual
Conference on Theoretical Aspects of Computer Science. Vol 3884. Springer;
2006:512-523. doi:10.1007/11672142_42'
apa: 'Chatterjee, K., & Henzinger, T. A. (2006). Strategy improvement and randomized
subexponential algorithms for stochastic parity games. In Proceedings of the
23rd Annual conference on Theoretical Aspects of Computer Science (Vol. 3884,
pp. 512–523). Marseille, France: Springer. https://doi.org/10.1007/11672142_42'
chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and
Randomized Subexponential Algorithms for Stochastic Parity Games.” In Proceedings
of the 23rd Annual Conference on Theoretical Aspects of Computer Science,
3884:512–23. Springer, 2006. https://doi.org/10.1007/11672142_42.
ieee: K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential
algorithms for stochastic parity games,” in Proceedings of the 23rd Annual
conference on Theoretical Aspects of Computer Science, Marseille, France,
2006, vol. 3884, pp. 512–523.
ista: 'Chatterjee K, Henzinger TA. 2006. Strategy improvement and randomized subexponential
algorithms for stochastic parity games. Proceedings of the 23rd Annual conference
on Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer
Science, LNCS, vol. 3884, 512–523.'
mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. “Strategy Improvement and
Randomized Subexponential Algorithms for Stochastic Parity Games.” Proceedings
of the 23rd Annual Conference on Theoretical Aspects of Computer Science,
vol. 3884, Springer, 2006, pp. 512–23, doi:10.1007/11672142_42.
short: K. Chatterjee, T.A. Henzinger, in:, Proceedings of the 23rd Annual Conference
on Theoretical Aspects of Computer Science, Springer, 2006, pp. 512–523.
conference:
end_date: 2006-02-25
location: Marseille, France
name: 'STACS: Theoretical Aspects of Computer Science'
start_date: 2006-02-23
date_created: 2018-12-11T12:09:22Z
date_published: 2006-02-14T00:00:00Z
date_updated: 2026-08-21T10:42:04Z
day: '14'
doi: 10.1007/11672142_42
extern: '1'
fulldoi: https://doi.org/10.1007/11672142_42
intvolume: ' 3884'
language:
- iso: eng
month: '02'
oa_version: None
page: 512 - 523
publication: Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer
Science
publication_identifier:
eisbn:
- '9783540322887'
eissn:
- 1611-3349
isbn:
- '9783540323013'
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '184'
status: public
title: Strategy improvement and randomized subexponential algorithms for stochastic
parity games
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 3884
year: '2006'
...
---
OA_type: closed access
_id: '4549'
abstract:
- lang: eng
text: We present a compositional theory of system verification, where specifications
assign real-numbered costs to systems. These costs can express a wide variety
of quantitative system properties, such as resource consumption, price, or a measure
of how well a system satisfies its specification. The theory supports the composition
of systems and specifications, and the hiding of variables. Boolean refinement
relations are replaced by real-numbered distances between descriptions of a system
at different levels of detail. We show that the classical Boolean rules for compositional
reasoning have quantitative counterparts in our setting. While our general theory
allows costs to be specified by arbitrary cost functions, we also consider a class
of linear cost functions, which give rise to an instance of our framework where
all operations are computable in polynomial time.
acknowledgement: Supported in part by the NSF grants CCR-0234690, CCR-0208875, and
CCR-0225610; by the NSF grant CCR-0132780 and ARP grant SC20051123.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M.
Compositional quantitative reasoning. In: Proceedings of the 3rd International
Conference on the Quantitative Evaluation of Systems. IEEE; 2006:179-188.
doi:10.1109/QEST.2006.11'
apa: 'Chatterjee, K., De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R.,
& Stoelinga, M. (2006). Compositional quantitative reasoning. In Proceedings
of the 3rd international conference on the Quantitative Evaluation of Systems
(pp. 179–188). Riverside, CA, United States: IEEE. https://doi.org/10.1109/QEST.2006.11'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Thomas A Henzinger,
Ritankar Majumdar, and Mariëlle Stoelinga. “Compositional Quantitative Reasoning.”
In Proceedings of the 3rd International Conference on the Quantitative Evaluation
of Systems, 179–88. IEEE, 2006. https://doi.org/10.1109/QEST.2006.11.
ieee: K. Chatterjee, L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and
M. Stoelinga, “Compositional quantitative reasoning,” in Proceedings of the
3rd international conference on the Quantitative Evaluation of Systems, Riverside,
CA, United States, 2006, pp. 179–188.
ista: 'Chatterjee K, De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga
M. 2006. Compositional quantitative reasoning. Proceedings of the 3rd international
conference on the Quantitative Evaluation of Systems. QEST: Quantitative Evaluation
of Systems, 179–188.'
mla: Chatterjee, Krishnendu, et al. “Compositional Quantitative Reasoning.” Proceedings
of the 3rd International Conference on the Quantitative Evaluation of Systems,
IEEE, 2006, pp. 179–88, doi:10.1109/QEST.2006.11.
short: K. Chatterjee, L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga,
in:, Proceedings of the 3rd International Conference on the Quantitative Evaluation
of Systems, IEEE, 2006, pp. 179–188.
conference:
end_date: 2006-09-14
location: Riverside, CA, United States
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2006-09-11
date_created: 2018-12-11T12:09:26Z
date_published: 2006-09-01T00:00:00Z
date_updated: 2026-08-21T09:55:30Z
day: '01'
doi: 10.1109/QEST.2006.11
extern: '1'
fulldoi: https://doi.org/10.1109/QEST.2006.11
language:
- iso: eng
month: '09'
oa_version: None
page: 179 - 188
publication: Proceedings of the 3rd international conference on the Quantitative Evaluation
of Systems
publication_identifier:
isbn:
- '0769526659'
publication_status: published
publisher: IEEE
publist_id: '163'
status: public
title: Compositional quantitative reasoning
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2006'
...