---
OA_type: closed access
_id: '18017'
abstract:
- lang: eng
text: The conductance of individual 1,4-benzenediamine (BDA)–Au molecular junctions
is measured in different solvent environments using a scanning tunneling microscope
based point-contact technique. Solvents are found to increase the conductance
of these molecular junctions by as much as 50%. Using first principles calculations,
we explain this increase by showing that a shift in the Au contact work function
is induced by solvents binding to undercoordinated Au sites around the junction.
Increasing the Au contact work function reduces the separation between the Au
Fermi energy and the highest occupied molecular orbital of BDA in the junction,
increasing the measured conductance. We demonstrate that the solvent-induced shift
in conductance depends on the affinity of the solvent to Au binding sites and
also on the induced dipole (relative to BDA) upon adsorption. Via this mechanism,
molecular junction level alignment and transport properties can be statistically
altered by solvent molecule binding to the contact surface.
article_processing_charge: No
article_type: letter_note
author:
- first_name: V.
full_name: Fatemi, V.
last_name: Fatemi
- first_name: M.
full_name: Kamenetska, M.
last_name: Kamenetska
- first_name: J. B.
full_name: Neaton, J. B.
last_name: Neaton
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
citation:
ama: Fatemi V, Kamenetska M, Neaton JB, Venkataraman L. Environmental control of
single-molecule junction transport. Nano Letters. 2011;11(5):1988-1992.
doi:10.1021/nl200324e
apa: Fatemi, V., Kamenetska, M., Neaton, J. B., & Venkataraman, L. (2011). Environmental
control of single-molecule junction transport. Nano Letters. American Chemical
Society. https://doi.org/10.1021/nl200324e
chicago: Fatemi, V., M. Kamenetska, J. B. Neaton, and Latha Venkataraman. “Environmental
Control of Single-Molecule Junction Transport.” Nano Letters. American
Chemical Society, 2011. https://doi.org/10.1021/nl200324e.
ieee: V. Fatemi, M. Kamenetska, J. B. Neaton, and L. Venkataraman, “Environmental
control of single-molecule junction transport,” Nano Letters, vol. 11,
no. 5. American Chemical Society, pp. 1988–1992, 2011.
ista: Fatemi V, Kamenetska M, Neaton JB, Venkataraman L. 2011. Environmental control
of single-molecule junction transport. Nano Letters. 11(5), 1988–1992.
mla: Fatemi, V., et al. “Environmental Control of Single-Molecule Junction Transport.”
Nano Letters, vol. 11, no. 5, American Chemical Society, 2011, pp. 1988–92,
doi:10.1021/nl200324e.
short: V. Fatemi, M. Kamenetska, J.B. Neaton, L. Venkataraman, Nano Letters 11 (2011)
1988–1992.
date_created: 2024-09-09T12:35:47Z
date_published: 2011-04-18T00:00:00Z
date_updated: 2025-01-03T09:43:09Z
day: '18'
doi: 10.1021/nl200324e
extern: '1'
external_id:
pmid:
- '21500833'
intvolume: ' 11'
issue: '5'
language:
- iso: eng
month: '04'
oa_version: None
page: 1988-1992
pmid: 1
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: Environmental control of single-molecule junction transport
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2011'
...
---
OA_type: closed access
_id: '18018'
abstract:
- lang: eng
text: Controlling electron transport through a single-molecule device is key to
the realization of nanoscale electronic components. A design requirement for single
molecule electrical devices is that the molecule must be both structurally and
electrically connected to the metallic electrodes. Typically, the mechanical and
electrical contacts are achieved by the same chemical moiety. In this study, we
demonstrate that the structural role may be played by one group (for example,
a sulfide) while the electrical role may be played by another (a conjugated chain
of C═C π-bonds). We can specify the electrical conductance through the molecule
by modulating to which particular site on the oligoene chain the electrode binds.
The result is a device that functions as a potentiometer at the single-molecule
level.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jeffrey S.
full_name: Meisner, Jeffrey S.
last_name: Meisner
- first_name: Masha
full_name: Kamenetska, Masha
last_name: Kamenetska
- first_name: Markrete
full_name: Krikorian, Markrete
last_name: Krikorian
- first_name: Michael L.
full_name: Steigerwald, Michael L.
last_name: Steigerwald
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Colin
full_name: Nuckolls, Colin
last_name: Nuckolls
citation:
ama: Meisner JS, Kamenetska M, Krikorian M, Steigerwald ML, Venkataraman L, Nuckolls
C. A single-molecule potentiometer. Nano Letters. 2011;11(4):1575-1579.
doi:10.1021/nl104411f
apa: Meisner, J. S., Kamenetska, M., Krikorian, M., Steigerwald, M. L., Venkataraman,
L., & Nuckolls, C. (2011). A single-molecule potentiometer. Nano Letters.
American Chemical Society. https://doi.org/10.1021/nl104411f
chicago: Meisner, Jeffrey S., Masha Kamenetska, Markrete Krikorian, Michael L. Steigerwald,
Latha Venkataraman, and Colin Nuckolls. “A Single-Molecule Potentiometer.” Nano
Letters. American Chemical Society, 2011. https://doi.org/10.1021/nl104411f.
ieee: J. S. Meisner, M. Kamenetska, M. Krikorian, M. L. Steigerwald, L. Venkataraman,
and C. Nuckolls, “A single-molecule potentiometer,” Nano Letters, vol.
11, no. 4. American Chemical Society, pp. 1575–1579, 2011.
ista: Meisner JS, Kamenetska M, Krikorian M, Steigerwald ML, Venkataraman L, Nuckolls
C. 2011. A single-molecule potentiometer. Nano Letters. 11(4), 1575–1579.
mla: Meisner, Jeffrey S., et al. “A Single-Molecule Potentiometer.” Nano Letters,
vol. 11, no. 4, American Chemical Society, 2011, pp. 1575–79, doi:10.1021/nl104411f.
short: J.S. Meisner, M. Kamenetska, M. Krikorian, M.L. Steigerwald, L. Venkataraman,
C. Nuckolls, Nano Letters 11 (2011) 1575–1579.
date_created: 2024-09-09T12:36:26Z
date_published: 2011-03-17T00:00:00Z
date_updated: 2025-01-03T09:45:24Z
day: '17'
doi: 10.1021/nl104411f
extern: '1'
external_id:
pmid:
- '21413779'
intvolume: ' 11'
issue: '4'
language:
- iso: eng
month: '03'
oa_version: None
page: 1575-1579
pmid: 1
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: A single-molecule potentiometer
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2011'
...
---
OA_type: closed access
_id: '18019'
abstract:
- lang: eng
text: We simultaneously measure conductance and force across nanoscale junctions.
A new, two-dimensional histogram technique is introduced to statistically extract
bond rupture forces from a large data set of individual junction elongation traces.
For the case of Au point contacts, we find a rupture force of 1.4 ± 0.2 nN, which
is in good agreement with previous measurements. We then study systematic trends
for single gold metal−molecule−metal junctions for a series of molecules terminated
with amine and pyridine linkers. For all molecules studied, single molecule junctions
rupture at the Au−N bond. Selective binding of the linker group allows us to correlate
the N−Au bond-rupture force to the molecular backbone. We find that the rupture
force ranges from 0.8 nN for 4,4′ bipyridine to 0.5 nN in 1,4 diaminobenzene.
These experimental results are in excellent quantitative agreement with density
functional theory based adiabatic molecular junction elongation and rupture calculations.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Michael
full_name: Frei, Michael
last_name: Frei
- first_name: Sriharsha V.
full_name: Aradhya, Sriharsha V.
last_name: Aradhya
- first_name: Max
full_name: Koentopp, Max
last_name: Koentopp
- first_name: Mark S.
full_name: Hybertsen, Mark S.
last_name: Hybertsen
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
citation:
ama: 'Frei M, Aradhya SV, Koentopp M, Hybertsen MS, Venkataraman L. Mechanics and
chemistry: Single molecule bond rupture forces correlate with molecular backbone
structure. Nano Letters. 2011;11(4):1518-1523. doi:10.1021/nl1042903'
apa: 'Frei, M., Aradhya, S. V., Koentopp, M., Hybertsen, M. S., & Venkataraman,
L. (2011). Mechanics and chemistry: Single molecule bond rupture forces correlate
with molecular backbone structure. Nano Letters. American Chemical Society.
https://doi.org/10.1021/nl1042903'
chicago: 'Frei, Michael, Sriharsha V. Aradhya, Max Koentopp, Mark S. Hybertsen,
and Latha Venkataraman. “Mechanics and Chemistry: Single Molecule Bond Rupture
Forces Correlate with Molecular Backbone Structure.” Nano Letters. American
Chemical Society, 2011. https://doi.org/10.1021/nl1042903.'
ieee: 'M. Frei, S. V. Aradhya, M. Koentopp, M. S. Hybertsen, and L. Venkataraman,
“Mechanics and chemistry: Single molecule bond rupture forces correlate with molecular
backbone structure,” Nano Letters, vol. 11, no. 4. American Chemical Society,
pp. 1518–1523, 2011.'
ista: 'Frei M, Aradhya SV, Koentopp M, Hybertsen MS, Venkataraman L. 2011. Mechanics
and chemistry: Single molecule bond rupture forces correlate with molecular backbone
structure. Nano Letters. 11(4), 1518–1523.'
mla: 'Frei, Michael, et al. “Mechanics and Chemistry: Single Molecule Bond Rupture
Forces Correlate with Molecular Backbone Structure.” Nano Letters, vol.
11, no. 4, American Chemical Society, 2011, pp. 1518–23, doi:10.1021/nl1042903.'
short: M. Frei, S.V. Aradhya, M. Koentopp, M.S. Hybertsen, L. Venkataraman, Nano
Letters 11 (2011) 1518–1523.
date_created: 2024-09-09T12:37:10Z
date_published: 2011-03-02T00:00:00Z
date_updated: 2025-01-03T09:47:07Z
day: '02'
doi: 10.1021/nl1042903
extern: '1'
external_id:
pmid:
- '21366230'
intvolume: ' 11'
issue: '4'
language:
- iso: eng
month: '03'
oa_version: None
page: 1518-1523
pmid: 1
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: 'Mechanics and chemistry: Single molecule bond rupture forces correlate with
molecular backbone structure'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2011'
...
---
OA_type: closed access
_id: '18020'
abstract:
- lang: eng
text: Understanding electron transport across π−π-stacked systems will help to answer
fundamental questions about biochemical redox processes and benefit the design
of new materials and molecular devices. Herein we employed the STM break-junction
technique to measure the single-molecule conductance of multiple π−π-stacked aromatic
rings. We studied electron transport through up to four stacked benzene rings
held together in an eclipsed fashion via a paracyclophane scaffold. We found that
the strained hydrocarbons studied herein couple directly to gold electrodes during
the measurements; hence, we did not require any heteroatom binding groups as electrical
contacts. Density functional theory-based calculations suggest that the gold atoms
of the electrodes bind to two neighboring carbon atoms of the outermost cyclophane
benzene rings in η2 fashion. Our measurements show an exponential decay of the
conductance with an increasing number of stacked benzene rings, indicating a nonresonant
tunneling mechanism. Furthermore, STM tip−substrate displacement data provide
additional evidence that the electrodes bind to the outermost benzene rings of
the π−π-stacked molecular wires.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Severin T.
full_name: Schneebeli, Severin T.
last_name: Schneebeli
- first_name: Maria
full_name: Kamenetska, Maria
last_name: Kamenetska
- first_name: Zhanling
full_name: Cheng, Zhanling
last_name: Cheng
- first_name: Rachid
full_name: Skouta, Rachid
last_name: Skouta
- first_name: Richard A.
full_name: Friesner, Richard A.
last_name: Friesner
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Ronald
full_name: Breslow, Ronald
last_name: Breslow
citation:
ama: Schneebeli ST, Kamenetska M, Cheng Z, et al. Single-molecule conductance through
multiple π−π-stacked benzene rings determined with direct electrode-to-benzene
ring connections. Journal of the American Chemical Society. 2011;133(7):2136-2139.
doi:10.1021/ja111320n
apa: Schneebeli, S. T., Kamenetska, M., Cheng, Z., Skouta, R., Friesner, R. A.,
Venkataraman, L., & Breslow, R. (2011). Single-molecule conductance through
multiple π−π-stacked benzene rings determined with direct electrode-to-benzene
ring connections. Journal of the American Chemical Society. American Chemical
Society. https://doi.org/10.1021/ja111320n
chicago: Schneebeli, Severin T., Maria Kamenetska, Zhanling Cheng, Rachid Skouta,
Richard A. Friesner, Latha Venkataraman, and Ronald Breslow. “Single-Molecule
Conductance through Multiple Π−π-Stacked Benzene Rings Determined with Direct
Electrode-to-Benzene Ring Connections.” Journal of the American Chemical Society.
American Chemical Society, 2011. https://doi.org/10.1021/ja111320n.
ieee: S. T. Schneebeli et al., “Single-molecule conductance through multiple
π−π-stacked benzene rings determined with direct electrode-to-benzene ring connections,”
Journal of the American Chemical Society, vol. 133, no. 7. American Chemical
Society, pp. 2136–2139, 2011.
ista: Schneebeli ST, Kamenetska M, Cheng Z, Skouta R, Friesner RA, Venkataraman
L, Breslow R. 2011. Single-molecule conductance through multiple π−π-stacked benzene
rings determined with direct electrode-to-benzene ring connections. Journal of
the American Chemical Society. 133(7), 2136–2139.
mla: Schneebeli, Severin T., et al. “Single-Molecule Conductance through Multiple
Π−π-Stacked Benzene Rings Determined with Direct Electrode-to-Benzene Ring Connections.”
Journal of the American Chemical Society, vol. 133, no. 7, American Chemical
Society, 2011, pp. 2136–39, doi:10.1021/ja111320n.
short: S.T. Schneebeli, M. Kamenetska, Z. Cheng, R. Skouta, R.A. Friesner, L. Venkataraman,
R. Breslow, Journal of the American Chemical Society 133 (2011) 2136–2139.
date_created: 2024-09-09T12:57:08Z
date_published: 2011-01-25T00:00:00Z
date_updated: 2025-01-03T09:49:00Z
day: '25'
doi: 10.1021/ja111320n
extern: '1'
external_id:
pmid:
- '21265533'
intvolume: ' 133'
issue: '7'
language:
- iso: eng
month: '01'
oa_version: None
page: 2136-2139
pmid: 1
publication: Journal of the American Chemical Society
publication_identifier:
eissn:
- 1520-5126
issn:
- 0002-7863
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-molecule conductance through multiple π−π-stacked benzene rings determined
with direct electrode-to-benzene ring connections
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 133
year: '2011'
...
---
OA_type: closed access
_id: '18021'
abstract:
- lang: eng
text: Charge transport across metal–molecule interfaces has an important role in
organic electronics1. Typically, chemical link groups such as thiols2 or amines3
are used to bind organic molecules to metal electrodes in single-molecule circuits,
with these groups controlling both the physical structure and the electronic coupling
at the interface. Direct metal–carbon coupling has been shown through C60, benzene
and π-stacked benzene4,5,6,7, but ideally the carbon backbone of the molecule
should be covalently bonded to the electrode without intervening link groups.
Here, we demonstrate a method to create junctions with such contacts. Trimethyl
tin (SnMe3)-terminated polymethylene chains are used to form single-molecule junctions
with a break-junction technique2,3. Gold atoms at the electrode displace the SnMe3
linkers, leading to the formation of direct Au–C bonded single-molecule junctions
with a conductance that is ∼100 times larger than analogous alkanes with most
other terminations. The conductance of these Au–C bonded alkanes decreases exponentially
with molecular length, with a decay constant of 0.97 per methylene, consistent
with a non-resonant transport mechanism. Control experiments and ab initio calculations
show that high conductances are achieved because a covalent Au–C sigma (σ) bond
is formed. This offers a new method for making reproducible and highly conducting
metal–organic contacts.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Z.-L.
full_name: Cheng, Z.-L.
last_name: Cheng
- first_name: R.
full_name: Skouta, R.
last_name: Skouta
- first_name: H.
full_name: Vazquez, H.
last_name: Vazquez
- first_name: J. R.
full_name: Widawsky, J. R.
last_name: Widawsky
- first_name: S.
full_name: Schneebeli, S.
last_name: Schneebeli
- first_name: W.
full_name: Chen, W.
last_name: Chen
- first_name: M. S.
full_name: Hybertsen, M. S.
last_name: Hybertsen
- first_name: R.
full_name: Breslow, R.
last_name: Breslow
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
citation:
ama: Cheng Z-L, Skouta R, Vazquez H, et al. In situ formation of highly conducting
covalent Au–C contacts for single-molecule junctions. Nature Nanotechnology.
2011;6(6):353-357. doi:10.1038/nnano.2011.66
apa: Cheng, Z.-L., Skouta, R., Vazquez, H., Widawsky, J. R., Schneebeli, S., Chen,
W., … Venkataraman, L. (2011). In situ formation of highly conducting covalent
Au–C contacts for single-molecule junctions. Nature Nanotechnology. Springer
Nature. https://doi.org/10.1038/nnano.2011.66
chicago: Cheng, Z.-L., R. Skouta, H. Vazquez, J. R. Widawsky, S. Schneebeli, W.
Chen, M. S. Hybertsen, R. Breslow, and Latha Venkataraman. “In Situ Formation
of Highly Conducting Covalent Au–C Contacts for Single-Molecule Junctions.” Nature
Nanotechnology. Springer Nature, 2011. https://doi.org/10.1038/nnano.2011.66.
ieee: Z.-L. Cheng et al., “In situ formation of highly conducting covalent
Au–C contacts for single-molecule junctions,” Nature Nanotechnology, vol.
6, no. 6. Springer Nature, pp. 353–357, 2011.
ista: Cheng Z-L, Skouta R, Vazquez H, Widawsky JR, Schneebeli S, Chen W, Hybertsen
MS, Breslow R, Venkataraman L. 2011. In situ formation of highly conducting covalent
Au–C contacts for single-molecule junctions. Nature Nanotechnology. 6(6), 353–357.
mla: Cheng, Z. L., et al. “In Situ Formation of Highly Conducting Covalent Au–C
Contacts for Single-Molecule Junctions.” Nature Nanotechnology, vol. 6,
no. 6, Springer Nature, 2011, pp. 353–57, doi:10.1038/nnano.2011.66.
short: Z.-L. Cheng, R. Skouta, H. Vazquez, J.R. Widawsky, S. Schneebeli, W. Chen,
M.S. Hybertsen, R. Breslow, L. Venkataraman, Nature Nanotechnology 6 (2011) 353–357.
date_created: 2024-09-09T12:57:48Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2025-01-03T09:51:33Z
day: '01'
doi: 10.1038/nnano.2011.66
extern: '1'
external_id:
pmid:
- '21552252'
intvolume: ' 6'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 353-357
pmid: 1
publication: Nature Nanotechnology
publication_identifier:
eissn:
- 1748-3395
issn:
- 1748-3387
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: In situ formation of highly conducting covalent Au–C contacts for single-molecule
junctions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2011'
...
---
_id: '1815'
abstract:
- lang: eng
text: Many membrane channels and receptors exhibit adaptive, or desensitized, response
to a strong sustained input stimulus, often supported by protein activity-dependent
inactivation. Adaptive response is thought to be related to various cellular functions
such as homeostasis and enlargement of dynamic range by background compensation.
Here we study the quantitative relation between adaptive response and background
compensation within a modeling framework. We show that any particular type of
adaptive response is neither sufficient nor necessary for adaptive enlargement
of dynamic range. In particular a precise adaptive response, where system activity
is maintained at a constant level at steady state, does not ensure a large dynamic
range neither in input signal nor in system output. A general mechanism for input
dynamic range enlargement can come about from the activity-dependent modulation
of protein responsiveness by multiple biochemical modification, regardless of
the type of adaptive response it induces. Therefore hierarchical biochemical processes
such as methylation and phosphorylation are natural candidates to induce this
property in signaling systems.
author:
- first_name: Tamar
full_name: Tamar Friedlander
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Naama
full_name: Brenner, Naama
last_name: Brenner
citation:
ama: Friedlander T, Brenner N. Adaptive response and enlargement of dynamic range.
Mathematical Biosciences and Engineering. 2011;8(2):515-526. doi:10.3934/mbe.2011.8.515
apa: Friedlander, T., & Brenner, N. (2011). Adaptive response and enlargement
of dynamic range. Mathematical Biosciences and Engineering. Arizona State
University. https://doi.org/10.3934/mbe.2011.8.515
chicago: Friedlander, Tamar, and Naama Brenner. “Adaptive Response and Enlargement
of Dynamic Range.” Mathematical Biosciences and Engineering. Arizona State
University, 2011. https://doi.org/10.3934/mbe.2011.8.515.
ieee: T. Friedlander and N. Brenner, “Adaptive response and enlargement of dynamic
range,” Mathematical Biosciences and Engineering, vol. 8, no. 2. Arizona
State University, pp. 515–526, 2011.
ista: Friedlander T, Brenner N. 2011. Adaptive response and enlargement of dynamic
range. Mathematical Biosciences and Engineering. 8(2), 515–526.
mla: Friedlander, Tamar, and Naama Brenner. “Adaptive Response and Enlargement of
Dynamic Range.” Mathematical Biosciences and Engineering, vol. 8, no. 2,
Arizona State University, 2011, pp. 515–26, doi:10.3934/mbe.2011.8.515.
short: T. Friedlander, N. Brenner, Mathematical Biosciences and Engineering 8 (2011)
515–526.
date_created: 2018-12-11T11:54:10Z
date_published: 2011-04-02T00:00:00Z
date_updated: 2021-01-12T06:53:23Z
day: '02'
doi: 10.3934/mbe.2011.8.515
extern: 1
intvolume: ' 8'
issue: '2'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1003.2791
month: '04'
oa: 1
page: 515 - 526
publication: Mathematical Biosciences and Engineering
publication_status: published
publisher: Arizona State University
publist_id: '5291'
quality_controlled: 0
status: public
title: Adaptive response and enlargement of dynamic range
type: journal_article
volume: 8
year: '2011'
...
---
OA_place: repository
OA_type: green
_id: '18362'
abstract:
- lang: eng
text: Maximally stable component detection is a very popular method for feature
analysis in images, mainly due to its low computation cost and high repeatability.
With the recent advance of feature-based methods in geometric shape analysis,
there is significant interest in finding analogous approaches in the 3D world.
In this paper, we formulate a diffusion-geometric framework for stable component
detection in non-rigid 3D shapes, which can be used for geometric feature detection
and description. A quantitative evaluation of our method on the SHREC’10 feature
detection benchmark shows its potential as a source of high-quality features.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Roee
full_name: Litman, Roee
last_name: Litman
- 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
citation:
ama: Litman R, Bronstein AM, Bronstein MM. Diffusion-geometric maximally stable
component detection in deformable shapes. Computers & Graphics. 2011;35(3):549-560.
doi:10.1016/j.cag.2011.03.011
apa: Litman, R., Bronstein, A. M., & Bronstein, M. M. (2011). Diffusion-geometric
maximally stable component detection in deformable shapes. Computers &
Graphics. Elsevier. https://doi.org/10.1016/j.cag.2011.03.011
chicago: Litman, Roee, Alex M. Bronstein, and Michael M. Bronstein. “Diffusion-Geometric
Maximally Stable Component Detection in Deformable Shapes.” Computers &
Graphics. Elsevier, 2011. https://doi.org/10.1016/j.cag.2011.03.011.
ieee: R. Litman, A. M. Bronstein, and M. M. Bronstein, “Diffusion-geometric maximally
stable component detection in deformable shapes,” Computers & Graphics,
vol. 35, no. 3. Elsevier, pp. 549–560, 2011.
ista: Litman R, Bronstein AM, Bronstein MM. 2011. Diffusion-geometric maximally
stable component detection in deformable shapes. Computers & Graphics. 35(3),
549–560.
mla: Litman, Roee, et al. “Diffusion-Geometric Maximally Stable Component Detection
in Deformable Shapes.” Computers & Graphics, vol. 35, no. 3, Elsevier,
2011, pp. 549–60, doi:10.1016/j.cag.2011.03.011.
short: R. Litman, A.M. Bronstein, M.M. Bronstein, Computers & Graphics 35 (2011)
549–560.
date_created: 2024-10-15T11:20:54Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2024-11-12T08:40:40Z
day: '01'
doi: 10.1016/j.cag.2011.03.011
extern: '1'
external_id:
arxiv:
- '1012.3951'
intvolume: ' 35'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1012.3951
month: '06'
oa: 1
oa_version: Preprint
page: 549-560
publication: Computers & Graphics
publication_identifier:
issn:
- 0097-8493
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diffusion-geometric maximally stable component detection in deformable shapes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2011'
...
---
OA_place: repository
OA_type: green
_id: '18363'
abstract:
- lang: eng
text: "Natural objects can be subject to various transformations yet still preserve
properties that we refer to as invariants. Here, we use definitions of affine-invariant
arclength for surfaces in \r\n in order to extend the set of existing non-rigid
shape analysis tools. We show that by re-defining the surface metric as its equi-affine
version, the surface with its modified metric tensor can be treated as a canonical
Euclidean object on which most classical Euclidean processing and analysis tools
can be applied. The new definition of a metric is used to extend the fast marching
method technique for computing geodesic distances on surfaces, where now, the
distances are defined with respect to an affine-invariant arclength. Applications
of the proposed framework demonstrate its invariance, efficiency, and accuracy
in shape analysis."
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Dan
full_name: Raviv, Dan
last_name: Raviv
- 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
- first_name: Nir
full_name: Sochen, Nir
last_name: Sochen
citation:
ama: Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. Affine-invariant geodesic
geometry of deformable 3D shapes. Computers & Graphics. 2011;35(3):692-697.
doi:10.1016/j.cag.2011.03.030
apa: Raviv, D., Bronstein, A. M., Bronstein, M. M., Kimmel, R., & Sochen, N.
(2011). Affine-invariant geodesic geometry of deformable 3D shapes. Computers
& Graphics. Elsevier. https://doi.org/10.1016/j.cag.2011.03.030
chicago: Raviv, Dan, Alex M. Bronstein, Michael M. Bronstein, Ron Kimmel, and Nir
Sochen. “Affine-Invariant Geodesic Geometry of Deformable 3D Shapes.” Computers
& Graphics. Elsevier, 2011. https://doi.org/10.1016/j.cag.2011.03.030.
ieee: D. Raviv, A. M. Bronstein, M. M. Bronstein, R. Kimmel, and N. Sochen, “Affine-invariant
geodesic geometry of deformable 3D shapes,” Computers & Graphics, vol.
35, no. 3. Elsevier, pp. 692–697, 2011.
ista: Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. 2011. Affine-invariant
geodesic geometry of deformable 3D shapes. Computers & Graphics. 35(3), 692–697.
mla: Raviv, Dan, et al. “Affine-Invariant Geodesic Geometry of Deformable 3D Shapes.”
Computers & Graphics, vol. 35, no. 3, Elsevier, 2011, pp. 692–97, doi:10.1016/j.cag.2011.03.030.
short: D. Raviv, A.M. Bronstein, M.M. Bronstein, R. Kimmel, N. Sochen, Computers
& Graphics 35 (2011) 692–697.
date_created: 2024-10-15T11:20:54Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2024-11-12T08:37:24Z
day: '01'
doi: 10.1016/j.cag.2011.03.030
extern: '1'
external_id:
arxiv:
- '1012.5936'
intvolume: ' 35'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1012.5936
month: '06'
oa: 1
oa_version: Preprint
page: 692-697
publication: Computers & Graphics
publication_identifier:
issn:
- 0097-8493
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Affine-invariant geodesic geometry of deformable 3D shapes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2011'
...
---
_id: '18377'
abstract:
- lang: eng
text: We introduce an (equi-)affine invariant diffusion geometry by which surfaces
that go through squeeze and shear transformations can still be properly analyzed.
The definition of an affine invariant metric enables us to construct an invariant
Laplacian from which local and global geometric structures are extracted. Applications
of the proposed framework demonstrate its power in generalizing and enriching
the existing set of tools for shape analysis.
article_number: '5995486'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan
full_name: Raviv, Dan
last_name: Raviv
- first_name: Michael M.
full_name: Bronstein, Michael 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: Ron
full_name: Kimmel, Ron
last_name: Kimmel
- first_name: Nir
full_name: Sochen, Nir
last_name: Sochen
citation:
ama: 'Raviv D, Bronstein MM, Bronstein AM, Kimmel R, Sochen N. Affine-invariant
diffusion geometry for the analysis of deformable 3D shapes. In: CVPR 2011.
IEEE; 2011. doi:10.1109/cvpr.2011.5995486'
apa: 'Raviv, D., Bronstein, M. M., Bronstein, A. M., Kimmel, R., & Sochen, N.
(2011). Affine-invariant diffusion geometry for the analysis of deformable 3D
shapes. In CVPR 2011. Colorado Springs, CO, United States: IEEE. https://doi.org/10.1109/cvpr.2011.5995486'
chicago: Raviv, Dan, Michael M. Bronstein, Alex M. Bronstein, Ron Kimmel, and Nir
Sochen. “Affine-Invariant Diffusion Geometry for the Analysis of Deformable 3D
Shapes.” In CVPR 2011. IEEE, 2011. https://doi.org/10.1109/cvpr.2011.5995486.
ieee: D. Raviv, M. M. Bronstein, A. M. Bronstein, R. Kimmel, and N. Sochen, “Affine-invariant
diffusion geometry for the analysis of deformable 3D shapes,” in CVPR 2011,
Colorado Springs, CO, United States, 2011.
ista: Raviv D, Bronstein MM, Bronstein AM, Kimmel R, Sochen N. 2011. Affine-invariant
diffusion geometry for the analysis of deformable 3D shapes. CVPR 2011. IEEE Computer
Vision and Pattern Recognition (CVPR) 2011, 5995486.
mla: Raviv, Dan, et al. “Affine-Invariant Diffusion Geometry for the Analysis of
Deformable 3D Shapes.” CVPR 2011, 5995486, IEEE, 2011, doi:10.1109/cvpr.2011.5995486.
short: D. Raviv, M.M. Bronstein, A.M. Bronstein, R. Kimmel, N. Sochen, in:, CVPR
2011, IEEE, 2011.
conference:
end_date: 2011-06-25
location: Colorado Springs, CO, United States
name: IEEE Computer Vision and Pattern Recognition (CVPR) 2011
start_date: 2011-06-20
date_created: 2024-10-15T11:20:54Z
date_published: 2011-08-22T00:00:00Z
date_updated: 2024-12-05T14:15:22Z
day: '22'
doi: 10.1109/cvpr.2011.5995486
extern: '1'
external_id:
arxiv:
- '1012.5933'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1012.5933
month: '08'
oa: 1
oa_version: Preprint
publication: CVPR 2011
publication_identifier:
eissn:
- 1063-6919
isbn:
- '9781457703942'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Affine-invariant diffusion geometry for the analysis of deformable 3D shapes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '18394'
abstract:
- lang: eng
text: In this paper we present a novel approach for fast search of handwritten Arabic
word-parts within large lexicons. The algorithm runs through three steps to achieve
the required results. First it warps multiple appearances of each word-part in
the lexicon for embedding into the same euclidean space. The embedding is done
based on the warping path produced by the Dynamic Time Warping (DTW) process while
calculating the similarity distance. In the next step, all samples of different
word-parts are resampled uniformly to the same size. The kd-tree structure is
used to store all shapes representing word parts in the lexicon. Fast approximation
of k-nearest neighbors generates a short list of candidates to be presented to
the next step. In the third step, the Active-DTW [15] algorithm is used to examine
each sample in the short list and give final accurate results. We demonstrate
our method on a database of 23,500 images of word-parts extracted from the IFN/ENIT
database [6] and 22,000 images collected from 93 writers. Our method achieves
a speedup of 5 orders of magnitude over the exact method, at the cost of only
a 3.8% reduction in accuracy.
article_number: '6065278'
article_processing_charge: No
author:
- first_name: Raid
full_name: Saabni, Raid
last_name: Saabni
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Saabni R, Bronstein AM. Fast key-word searching via embedding and active-DTW.
In: 2011 International Conference on Document Analysis and Recognition.
IEEE; 2011. doi:10.1109/icdar.2011.23'
apa: 'Saabni, R., & Bronstein, A. M. (2011). Fast key-word searching via embedding
and active-DTW. In 2011 International Conference on Document Analysis and Recognition.
Beijing, China: IEEE. https://doi.org/10.1109/icdar.2011.23'
chicago: Saabni, Raid, and Alex M. Bronstein. “Fast Key-Word Searching via Embedding
and Active-DTW.” In 2011 International Conference on Document Analysis and
Recognition. IEEE, 2011. https://doi.org/10.1109/icdar.2011.23.
ieee: R. Saabni and A. M. Bronstein, “Fast key-word searching via embedding and
active-DTW,” in 2011 International Conference on Document Analysis and Recognition,
Beijing, China, 2011.
ista: Saabni R, Bronstein AM. 2011. Fast key-word searching via embedding and active-DTW.
2011 International Conference on Document Analysis and Recognition. 11th International
Conference on Document Analysis and Recognition, 6065278.
mla: Saabni, Raid, and Alex M. Bronstein. “Fast Key-Word Searching via Embedding
and Active-DTW.” 2011 International Conference on Document Analysis and Recognition,
6065278, IEEE, 2011, doi:10.1109/icdar.2011.23.
short: R. Saabni, A.M. Bronstein, in:, 2011 International Conference on Document
Analysis and Recognition, IEEE, 2011.
conference:
end_date: 2011-09-21
location: Beijing, China
name: 11th International Conference on Document Analysis and Recognition
start_date: 2011-09-18
date_created: 2024-10-15T11:20:54Z
date_published: 2011-11-03T00:00:00Z
date_updated: 2024-12-04T12:08:48Z
day: '03'
doi: 10.1109/icdar.2011.23
extern: '1'
language:
- iso: eng
month: '11'
oa_version: None
publication: 2011 International Conference on Document Analysis and Recognition
publication_identifier:
eissn:
- 2379-2140
isbn:
- '9781457713507'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast key-word searching via embedding and active-DTW
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '18406'
abstract:
- lang: eng
text: Defining a suitable metric is one of the biggest challenges in deformable
image fusion from different modalities. In this paper, we propose a novel approach
for multi-modal metric learning in the deformable registration framework that
consists of embedding data from both modalities into a common metric space whose
metric is used to parametrize the similarity. Specifically, we use image representation
in the Fourier/Gabor space which introduces invariance to the local pose parameters,
and the Hamming metric as the target embedding space, which allows constructing
the embedding using boosted learning algorithms. The resulting metric is incorporated
into a discrete optimization framework. Very promising results demonstrate the
potential of the proposed method.
article_number: '5872619'
article_processing_charge: No
author:
- first_name: Fabrice
full_name: Michel, Fabrice
last_name: Michel
- first_name: Michael
full_name: Bronstein, Michael
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: Nikos
full_name: Paragios, Nikos
last_name: Paragios
citation:
ama: 'Michel F, Bronstein M, Bronstein AM, Paragios N. Boosted metric learning for
3D multi-modal deformable registration. In: 2011 IEEE International Symposium
on Biomedical Imaging: From Nano to Macro. IEEE; 2011. doi:10.1109/isbi.2011.5872619'
apa: 'Michel, F., Bronstein, M., Bronstein, A. M., & Paragios, N. (2011). Boosted
metric learning for 3D multi-modal deformable registration. In 2011 IEEE International
Symposium on Biomedical Imaging: From Nano to Macro. Chicago, IL, United
States: IEEE. https://doi.org/10.1109/isbi.2011.5872619'
chicago: 'Michel, Fabrice, Michael Bronstein, Alex M. Bronstein, and Nikos Paragios.
“Boosted Metric Learning for 3D Multi-Modal Deformable Registration.” In 2011
IEEE International Symposium on Biomedical Imaging: From Nano to Macro. IEEE,
2011. https://doi.org/10.1109/isbi.2011.5872619.'
ieee: 'F. Michel, M. Bronstein, A. M. Bronstein, and N. Paragios, “Boosted metric
learning for 3D multi-modal deformable registration,” in 2011 IEEE International
Symposium on Biomedical Imaging: From Nano to Macro, Chicago, IL, United
States, 2011.'
ista: 'Michel F, Bronstein M, Bronstein AM, Paragios N. 2011. Boosted metric learning
for 3D multi-modal deformable registration. 2011 IEEE International Symposium
on Biomedical Imaging: From Nano to Macro. 8th IEEE International Symposium on
Biomedical Imaging: From Nano to Macro, 5872619.'
mla: 'Michel, Fabrice, et al. “Boosted Metric Learning for 3D Multi-Modal Deformable
Registration.” 2011 IEEE International Symposium on Biomedical Imaging: From
Nano to Macro, 5872619, IEEE, 2011, doi:10.1109/isbi.2011.5872619.'
short: 'F. Michel, M. Bronstein, A.M. Bronstein, N. Paragios, in:, 2011 IEEE International
Symposium on Biomedical Imaging: From Nano to Macro, IEEE, 2011.'
conference:
end_date: 2011-04-02
location: ' Chicago, IL, United States'
name: '8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro'
start_date: 2011-03-30
date_created: 2024-10-15T11:20:54Z
date_published: 2011-06-09T00:00:00Z
date_updated: 2024-12-04T11:55:42Z
day: '09'
doi: 10.1109/isbi.2011.5872619
extern: '1'
language:
- iso: eng
month: '06'
oa_version: None
publication: '2011 IEEE International Symposium on Biomedical Imaging: From Nano to
Macro'
publication_identifier:
eissn:
- 1945-8452
isbn:
- '9781424441280'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Boosted metric learning for 3D multi-modal deformable registration
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
OA_type: closed access
_id: '18411'
abstract:
- lang: eng
text: Recent works have shown the use of diffusion geometry for various pattern
recognition applications, including nonrigid shape analysis. In this paper, we
introduce spectral shape distance as a general framework for distribution-based
shape similarity and show that two recent methods for shape similarity due to
Rustamov and Mahmoudi and Sapiro are particular cases thereof.
article_processing_charge: No
article_type: original
author:
- first_name: Michael M
full_name: Bronstein, Michael 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
citation:
ama: Bronstein MM, Bronstein AM. Shape recognition with spectral distances. IEEE
Transactions on Pattern Analysis and Machine Intelligence. 2011;33(5):1065-1071.
doi:10.1109/tpami.2010.210
apa: Bronstein, M. M., & Bronstein, A. M. (2011). Shape recognition with spectral
distances. IEEE Transactions on Pattern Analysis and Machine Intelligence.
Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/tpami.2010.210
chicago: Bronstein, Michael M, and Alex M. Bronstein. “Shape Recognition with Spectral
Distances.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
Institute of Electrical and Electronics Engineers, 2011. https://doi.org/10.1109/tpami.2010.210.
ieee: M. M. Bronstein and A. M. Bronstein, “Shape recognition with spectral distances,”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33,
no. 5. Institute of Electrical and Electronics Engineers, pp. 1065–1071, 2011.
ista: Bronstein MM, Bronstein AM. 2011. Shape recognition with spectral distances.
IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(5), 1065–1071.
mla: Bronstein, Michael M., and Alex M. Bronstein. “Shape Recognition with Spectral
Distances.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 33, no. 5, Institute of Electrical and Electronics Engineers, 2011, pp. 1065–71,
doi:10.1109/tpami.2010.210.
short: M.M. Bronstein, A.M. Bronstein, IEEE Transactions on Pattern Analysis and
Machine Intelligence 33 (2011) 1065–1071.
date_created: 2024-10-15T11:20:54Z
date_published: 2011-05-01T00:00:00Z
date_updated: 2024-10-22T08:02:31Z
day: '01'
doi: 10.1109/tpami.2010.210
extern: '1'
external_id:
pmid:
- '21135442'
intvolume: ' 33'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 1065-1071
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- 0162-8828
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shape recognition with spectral distances
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2011'
...
---
_id: '18433'
abstract:
- lang: eng
text: The computer vision and pattern recognition communities have recently witnessed
a surge of feature-based methods in object recognition and image retrieval applications.
These methods allow representing images as collections of “visual words” and treat
them using text search approaches following the “bag of features” paradigm. In
this article, we explore analogous approaches in the 3D world applied to the problem
of nonrigid shape retrieval in large databases. Using multiscale diffusion heat
kernels as “geometric words,” we construct compact and informative shape descriptors
by means of the “bag of features” approach. We also show that considering pairs
of “geometric words” (“geometric expressions”) allows creating spatially sensitive
bags of features with better discriminative power. Finally, adopting metric learning
approaches, we show that shapes can be efficiently represented as binary codes.
Our approach achieves state-of-the-art results on the SHREC 2010 large-scale shape
retrieval benchmark.
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: Leonidas J.
full_name: Guibas, Leonidas J.
last_name: Guibas
- first_name: Maks
full_name: Ovsjanikov, Maks
last_name: Ovsjanikov
citation:
ama: 'Bronstein AM, Bronstein MM, Guibas LJ, Ovsjanikov M. Shape google: Geometric
words and expressions for invariant shape retrieval. ACM Transactions on Graphics.
2011;30(1):1-20. doi:10.1145/1899404.1899405'
apa: 'Bronstein, A. M., Bronstein, M. M., Guibas, L. J., & Ovsjanikov, M. (2011).
Shape google: Geometric words and expressions for invariant shape retrieval. ACM
Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/1899404.1899405'
chicago: 'Bronstein, Alex M., Michael M. Bronstein, Leonidas J. Guibas, and Maks
Ovsjanikov. “Shape Google: Geometric Words and Expressions for Invariant Shape
Retrieval.” ACM Transactions on Graphics. Association for Computing Machinery,
2011. https://doi.org/10.1145/1899404.1899405.'
ieee: 'A. M. Bronstein, M. M. Bronstein, L. J. Guibas, and M. Ovsjanikov, “Shape
google: Geometric words and expressions for invariant shape retrieval,” ACM
Transactions on Graphics, vol. 30, no. 1. Association for Computing Machinery,
pp. 1–20, 2011.'
ista: 'Bronstein AM, Bronstein MM, Guibas LJ, Ovsjanikov M. 2011. Shape google:
Geometric words and expressions for invariant shape retrieval. ACM Transactions
on Graphics. 30(1), 1–20.'
mla: 'Bronstein, Alex M., et al. “Shape Google: Geometric Words and Expressions
for Invariant Shape Retrieval.” ACM Transactions on Graphics, vol. 30,
no. 1, Association for Computing Machinery, 2011, pp. 1–20, doi:10.1145/1899404.1899405.'
short: A.M. Bronstein, M.M. Bronstein, L.J. Guibas, M. Ovsjanikov, ACM Transactions
on Graphics 30 (2011) 1–20.
date_created: 2024-10-15T11:20:55Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2024-12-18T14:59:43Z
day: '01'
doi: 10.1145/1899404.1899405
extern: '1'
intvolume: ' 30'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 1-20
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Shape google: Geometric words and expressions for invariant shape retrieval'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2011'
...
---
OA_place: repository
OA_type: green
_id: '22061'
abstract:
- lang: eng
text: "We consider the defocusing nonlinear wave equation utt − Δu +\r\n|u|\r\npu
= 0 with spherically-symmetric initial data in the regime 4\r\nd−2 4\r\nd−2 . The principal result is that\r\nblowup
(or failure to scatter) must be accompanied by blowup of the critical\r\nSobolev
norm. An equivalent formulation is that maximal-lifespan solutions\r\nwith bounded
critical Sobolev norm are global and scatter"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Vişan M. The radial defocusing energy-supercritical nonlinear wave
equation in all space dimensions. Proceedings of the American Mathematical
Society. 2011;139(5):1805-1817. doi:10.1090/s0002-9939-2010-10615-9
apa: Killip, R., & Vişan, M. (2011). The radial defocusing energy-supercritical
nonlinear wave equation in all space dimensions. Proceedings of the American
Mathematical Society. American Mathematical Society. https://doi.org/10.1090/s0002-9939-2010-10615-9
chicago: Killip, Rowan, and Monica Vişan. “The Radial Defocusing Energy-Supercritical
Nonlinear Wave Equation in All Space Dimensions.” Proceedings of the American
Mathematical Society. American Mathematical Society, 2011. https://doi.org/10.1090/s0002-9939-2010-10615-9.
ieee: R. Killip and M. Vişan, “The radial defocusing energy-supercritical nonlinear
wave equation in all space dimensions,” Proceedings of the American Mathematical
Society, vol. 139, no. 5. American Mathematical Society, pp. 1805–1817, 2011.
ista: Killip R, Vişan M. 2011. The radial defocusing energy-supercritical nonlinear
wave equation in all space dimensions. Proceedings of the American Mathematical
Society. 139(5), 1805–1817.
mla: Killip, Rowan, and Monica Vişan. “The Radial Defocusing Energy-Supercritical
Nonlinear Wave Equation in All Space Dimensions.” Proceedings of the American
Mathematical Society, vol. 139, no. 5, American Mathematical Society, 2011,
pp. 1805–17, doi:10.1090/s0002-9939-2010-10615-9.
short: R. Killip, M. Vişan, Proceedings of the American Mathematical Society 139
(2011) 1805–1817.
das_tickbox: '1'
date_created: 2026-06-19T08:11:09Z
date_published: 2011-05-01T00:00:00Z
date_updated: 2026-06-29T10:44:15Z
day: '01'
doi: 10.1090/s0002-9939-2010-10615-9
extern: '1'
external_id:
arxiv:
- '1002.1756'
intvolume: ' 139'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1002.1756
mathsc:
- 35L71
month: '05'
oa: 1
oa_version: Preprint
page: 1805-1817
publication: Proceedings of the American Mathematical Society
publication_identifier:
eissn:
- 1088-6826
issn:
- 0002-9939
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: The radial defocusing energy-supercritical nonlinear wave equation in all space
dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2011'
...
---
_id: '3315'
abstract:
- lang: eng
text: We consider two-player games played in real time on game structures with clocks
where the objectives of players are described using parity conditions. The games
are concurrent in that at each turn, both players independently propose a time
delay and an action, and the action with the shorter delay is chosen. To prevent
a player from winning by blocking time, we restrict each player to play strategies
that ensure that the player cannot be responsible for causing a zeno run. First,
we present an efficient reduction of these games to turn-based (i.e., not concurrent)
finite-state (i.e., untimed) parity games. Our reduction improves the best known
complexity for solving timed parity games. Moreover, the rich class of algorithms
for classical parity games can now be applied to timed parity games. The states
of the resulting game are based on clock regions of the original game, and the
state space of the finite game is linear in the size of the region graph. Second,
we consider two restricted classes of strategies for the player that represents
the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust
winning strategies. Using a limit-robust winning strategy, the controller cannot
choose an exact real-valued time delay but must allow for some nonzero jitter
in each of its actions. If there is a given lower bound on the jitter, then the
strategy is bounded-robust winning. We show that exact strategies are more powerful
than limit-robust strategies, which are more powerful than bounded-robust winning
strategies for any bound. For both kinds of robust strategies, we present efficient
reductions to standard timed automaton games. These reductions provide algorithms
for the synthesis of robust real-time controllers.
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
- first_name: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness.
Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games:
Complexity and robustness. Logical Methods in Computer Science. International
Federation for Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
Parity Games: Complexity and Robustness.” Logical Methods in Computer Science.
International Federation for Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.'
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity
and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International
Federation for Computational Logic, 2011.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity
and robustness. Logical Methods in Computer Science. 7(4).'
mla: 'Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”
Logical Methods in Computer Science, vol. 7, no. 4, International Federation
for Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.'
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science
7 (2011).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:37Z
date_published: 2011-12-14T00:00:00Z
date_updated: 2026-07-06T13:25:39Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-7(4:8)2011
ec_funded: 1
file:
- access_level: open_access
checksum: 3480e1594bbef25ff7462fa93a8a814e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:42Z
date_updated: 2020-07-14T12:46:07Z
file_id: '5231'
file_name: IST-2016-86-v2+1_1011.0688_3_.pdf
file_size: 588863
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation for Computational Logic
publist_id: '3324'
pubrep_id: '506'
quality_controlled: '1'
related_material:
record:
- id: '3876'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Timed parity games: Complexity and robustness'
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2011'
...
---
_id: '3302'
abstract:
- lang: eng
text: Cloud computing aims to give users virtually unlimited pay-per-use computing
resources without the burden of managing the underlying infrastructure. We present
a new job execution environment Flextic that exploits scal- able static scheduling
techniques to provide the user with a flexible pricing model, such as a tradeoff
between dif- ferent degrees of execution speed and execution price, and at the
same time, reduce scheduling overhead for the cloud provider. We have evaluated
a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various
data parallel jobs from machine learning, im- age processing, and gene sequencing
that we considered, Flextic has low scheduling overhead and reduces job du- ration
by up to 15% compared to Hadoop, a dynamic cloud scheduler.
article_processing_charge: No
author:
- 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: Anmol
full_name: Singh, Anmol
id: 72A86902-E99F-11E9-9F62-915534D1B916
last_name: Singh
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds.
In: 3rd USENIX Workshop on Hot Topics in Cloud Computing. Usenix Association;
2011:1-6.'
apa: 'Henzinger, T. A., Singh, A., Singh, V., Wies, T., & Zufferey, D. (2011).
Static scheduling in clouds. In 3rd USENIX Workshop on Hot Topics in Cloud
Computing (pp. 1–6). Portland, OR, United States: Usenix Association.'
chicago: Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey.
“Static Scheduling in Clouds.” In 3rd USENIX Workshop on Hot Topics in Cloud
Computing, 1–6. Usenix Association, 2011.
ieee: T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling
in clouds,” in 3rd USENIX Workshop on Hot Topics in Cloud Computing, Portland,
OR, United States, 2011, pp. 1–6.
ista: 'Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling
in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop
on Hot Topics in Cloud Computing, 1–6.'
mla: Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” 3rd USENIX Workshop
on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.
short: T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX
Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.
conference:
end_date: 2011-06-15
location: Portland, OR, United States
name: 'HotCloud: Workshop on Hot Topics in Cloud Computing'
start_date: 2011-06-14
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:33Z
date_published: 2011-06-14T00:00:00Z
date_updated: 2026-07-07T06:07:16Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: ToHe
file:
- access_level: open_access
checksum: 21a461ac004bb535c83320fe79b30375
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:14Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5333'
file_name: IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf
file_size: 232770
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 1 - 6
publication: 3rd USENIX Workshop on Hot Topics in Cloud Computing
publication_status: published
publisher: Usenix Association
publist_id: '3338'
pubrep_id: '90'
quality_controlled: '1'
status: public
title: Static scheduling in clouds
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3356'
abstract:
- lang: eng
text: There is recently a significant effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions, aiming for a general and flexible
framework for quantitative-oriented specifications. In the heart of quantitative
objectives lies the accumulation of values along a computation. It is either the
accumulated summation, as with the energy objectives, or the accumulated average,
as with the mean-payoff objectives. We investigate the extension of temporal logics
with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
a numeric variable of the system, c is a constant rational number, and Sum(v)
and Avg(v) denote the accumulated sum and average of the values of v from the
beginning of the computation up to the current point of time. We also allow the
path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
to the average value along an entire computation. We study the border of decidability
for extensions of various temporal logics. In particular, we show that extending
the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
prefix-accumulation assertions and extending LTL with path-accumulation assertions,
result in temporal logics whose model-checking problem is decidable. The extended
logics allow to significantly extend the currently known energy and mean-payoff
objectives. Moreover, the prefix-accumulation assertions may be refined with "controlled-accumulation",
allowing, for example, to specify constraints on the average waiting time between
a request and a grant. On the negative side, we show that the fragment we point
to is, in a sense, the maximal logic whose extension with prefix-accumulation
assertions permits a decidable model-checking procedure. Extending a temporal
logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
problem undecidable.
article_number: '5970226'
article_processing_charge: No
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications
with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33'
apa: 'Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal
specifications with accumulative values. Presented at the LICS: Logic in Computer
Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33'
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
“Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
ieee: 'U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications
with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto,
Canada, 2011.'
ista: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
with accumulative values. LICS: Logic in Computer Science, 5970226.'
mla: Boker, Udi, et al. Temporal Specifications with Accumulative Values.
5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
conference:
end_date: 2011-06-24
location: Toronto, Canada
name: 'LICS: Logic in Computer Science'
start_date: 2011-06-21
date_created: 2018-12-11T12:02:52Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '21'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1109/LICS.2011.33
ec_funded: 1
external_id:
isi:
- '000297350400007'
file:
- access_level: open_access
checksum: 792128f5455f0f40f1105f0398e05fa9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:42Z
date_updated: 2020-07-14T12:46:09Z
file_id: '4960'
file_name: IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf
file_size: 225426
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3259'
pubrep_id: '83'
related_material:
record:
- id: '5385'
relation: earlier_version
status: public
- id: '2038'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Temporal specifications with accumulative values
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2011'
...
---
_id: '5385'
abstract:
- lang: eng
text: There is recently a significant effort to add quantitative objectives to formal
verification and synthesis. We introduce and investigate the extension of temporal
logics with quantitative atomic assertions, aiming for a general and flexible
framework for quantitative-oriented specifications. In the heart of quantitative
objectives lies the accumulation of values along a computation. It is either the
accumulated summation, as with the energy objectives, or the accumulated average,
as with the mean-payoff objectives. We investigate the extension of temporal logics
with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
a numeric variable of the system, c is a constant rational number, and Sum(v)
and Avg(v) denote the accumulated sum and average of the values of v from the
beginning of the computation up to the current point of time. We also allow the
path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
to the average value along an entire computation. We study the border of decidability
for extensions of various temporal logics. In particular, we show that extending
the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
prefix-accumulation assertions and extending LTL with path-accumulation assertions,
result in temporal logics whose model-checking problem is decidable. The extended
logics allow to significantly extend the currently known energy and mean-payoff
objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”,
allowing, for example, to specify constraints on the average waiting time between
a request and a grant. On the negative side, we show that the fragment we point
to is, in a sense, the maximal logic whose extension with prefix-accumulation
assertions permits a decidable model-checking procedure. Extending a temporal
logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
problem undecidable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications
with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003
apa: Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal
specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.
ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications
with accumulative values. IST Austria, 2011.
ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
with accumulative values, IST Austria, 14p.
mla: Boker, Udi, et al. Temporal Specifications with Accumulative Values.
IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.
short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications
with Accumulative Values, IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-04-04T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '04'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.15479/AT:IST-2011-0003
ec_funded: 1
file:
- access_level: open_access
checksum: 8491d0d48c4911620ecd5350b413c11e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:00Z
date_updated: 2020-07-14T12:46:41Z
file_id: '5461'
file_name: IST-2011-0003_IST-2011-0003.pdf
file_size: 366281
relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '14'
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '21'
related_material:
record:
- id: '3356'
relation: later_version
status: public
- id: '2038'
relation: later_version
status: public
status: public
title: Temporal specifications with accumulative values
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distri- bution over the successor
states. The game is played for infinitely many rounds and thus the players construct
an infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or pos- itively (i.e., with positive probability), no matter the
strategy of the second player.\r\n\r\nWe classify such games according to the
information and to the power of randomization available to the players. On the
basis of information, the game can be one-sided with either (a) player 1, or (b)
player 2 having partial observation (and the other player has perfect observation),
or two- sided with (c) both players having partial observation. On the basis of
randomization, (a) the players may not be allowed to use randomization (pure strategies),
or (b) they may choose a probability distribution over actions but the actual
random choice is external and not visible to the player (actions invisible), or
(c) they may use full randomization.\r\n\r\nOur main results for pure strategies
are as follows: (1) For one-sided games with player 2 perfect observation we show
that (in contrast to full randomized strategies) belief-based (subset-construction
based) strate- gies are not sufficient, and present an exponential upper bound
on mem- ory both for almost-sure and positive winning strategies; we show that
the problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
the explicit exponential construction. (2) For one-sided games with player 1 perfect
observation we show that non-elementary memory is both necessary and sufficient
for both almost-sure and posi- tive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least non-elementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence re- sult exhibit
serious flaws in previous results in the literature: we show a non-elementary
memory lower bound for almost-sure winning whereas an exponential upper bound
was previously claimed."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win
When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007'
apa: 'Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic
games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.'
ieee: 'K. Chatterjee and L. Doyen, Partial-observation stochastic games: How
to win when belief fails. IST Austria, 2011.'
ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
win when belief fails, IST Austria, 43p.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.'
short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2026-07-07T14:01:25Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:27Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5488'
file_name: IST-2011-0007_IST-2011-0007.pdf
file_size: 574055
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
record:
- id: '1903'
relation: later_version
status: public
- id: '2955'
relation: later_version
status: public
- id: '2211'
relation: later_version
status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3353'
abstract:
- lang: eng
text: 'Compositional theories are crucial when designing large and complex systems
from smaller components. In this work we propose such a theory for synchronous
concurrent systems. Our approach follows so-called interface theories, which use
game-theoretic interpretations of composition and refinement. These are appropriate
for systems with distinct inputs and outputs, and explicit conditions on inputs
that must be enforced during composition. Our interfaces model systems that execute
in an infinite sequence of synchronous rounds. At each round, a contract must
be satisfied. The contract is simply a relation specifying the set of valid input/output
pairs. Interfaces can be composed by parallel, serial or feedback composition.
A refinement relation between interfaces is defined, and shown to have two main
properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability,
namely, the ability to replace an interface by another one in any context. Shared
refinement and abstraction operators, corresponding to greatest lower and least
upper bounds with respect to refinement, are also defined. Input-complete interfaces,
that impose no restrictions on inputs, and deterministic interfaces, that produce
a unique output for any legal input, are discussed as special cases, and an interesting
duality between the two classes is exposed. A number of illustrative examples
are provided, as well as algorithms to compute compositions, check refinement,
and so on, for finite-state interfaces.'
article_number: '14'
article_processing_charge: No
author:
- first_name: Stavros
full_name: Tripakis, Stavros
last_name: Tripakis
- first_name: Ben
full_name: Lickly, Ben
last_name: Lickly
- 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: Edward
full_name: Lee, Edward
last_name: Lee
citation:
ama: Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational
interfaces. ACM Transactions on Programming Languages and Systems. 2011;33(4).
doi:10.1145/1985342.1985345
apa: Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory
of synchronous relational interfaces. ACM Transactions on Programming Languages
and Systems. ACM. https://doi.org/10.1145/1985342.1985345
chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory
of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages
and Systems. ACM, 2011. https://doi.org/10.1145/1985342.1985345.
ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous
relational interfaces,” ACM Transactions on Programming Languages and Systems,
vol. 33, no. 4. ACM, 2011.
ista: Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational
interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.
mla: Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”
ACM Transactions on Programming Languages and Systems, vol. 33, no. 4,
14, ACM, 2011, doi:10.1145/1985342.1985345.
short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming
Languages and Systems 33 (2011).
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-07T14:03:34Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1145/1985342.1985345
ec_funded: 1
external_id:
isi:
- '000292766400003'
file:
- access_level: open_access
checksum: 5d44a8aa81e33210649beae507602138
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:45Z
date_updated: 2020-07-14T12:46:09Z
file_id: '5235'
file_name: IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf
file_size: 775662
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
publist_id: '3263'
pubrep_id: '85'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A theory of synchronous relational interfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2011'
...