---
_id: '13409'
abstract:
- lang: eng
text: The immobilization of molecular switches onto inorganic supports has recently
become a hot topic as it can give rise to novel hybrid materials in which the
properties of the two components are mutually enhanced. Even more attractive is
the concept of “transferring” the switchable characteristics of single layers
of organic molecules onto the underlying inorganic components, rendering them
responsive to external stimuli as well. Of the various molecular switches studied,
azobenzene (AB) has arguably attracted most attention due to its simple molecular
structure, and because its “trigger” (light) is a noninvasive one, it can be delivered
instantaneously, and into a precise location. In order to fully realize its potential,
however, it is necessary to immobilize AB onto solid supports. It is the goal
of this manuscript to comprehensively yet concisely review such hybrid systems
which comprise AB forming well-defined self-assembled monolayers (SAMs) on planar
and curved (colloidal and nanoporous) inorganic surfaces. I discuss methods to
immobilize AB derivatives onto surfaces, strategies to ensure efficient AB isomerization,
ways to monitor the switching process, properties of these switchable hybrid materials,
and, last but not least, their emerging applications.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Klajn R. Immobilized azobenzenes for the construction of photoresponsive materials.
Pure and Applied Chemistry. 2010;82(12):2247-2279. doi:10.1351/pac-con-10-09-04
apa: Klajn, R. (2010). Immobilized azobenzenes for the construction of photoresponsive
materials. Pure and Applied Chemistry. De Gruyter. https://doi.org/10.1351/pac-con-10-09-04
chicago: Klajn, Rafal. “Immobilized Azobenzenes for the Construction of Photoresponsive
Materials.” Pure and Applied Chemistry. De Gruyter, 2010. https://doi.org/10.1351/pac-con-10-09-04.
ieee: R. Klajn, “Immobilized azobenzenes for the construction of photoresponsive
materials,” Pure and Applied Chemistry, vol. 82, no. 12. De Gruyter, pp.
2247–2279, 2010.
ista: Klajn R. 2010. Immobilized azobenzenes for the construction of photoresponsive
materials. Pure and Applied Chemistry. 82(12), 2247–2279.
mla: Klajn, Rafal. “Immobilized Azobenzenes for the Construction of Photoresponsive
Materials.” Pure and Applied Chemistry, vol. 82, no. 12, De Gruyter, 2010,
pp. 2247–79, doi:10.1351/pac-con-10-09-04.
short: R. Klajn, Pure and Applied Chemistry 82 (2010) 2247–2279.
date_created: 2023-08-01T09:48:11Z
date_published: 2010-10-15T00:00:00Z
date_updated: 2024-10-14T12:21:48Z
day: '15'
doi: 10.1351/pac-con-10-09-04
extern: '1'
intvolume: ' 82'
issue: '12'
keyword:
- General Chemical Engineering
- General Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1351/pac-con-10-09-04
month: '10'
oa: 1
oa_version: Published Version
page: 2247-2279
publication: Pure and Applied Chemistry
publication_identifier:
eissn:
- 1365-3075
issn:
- 0033-4545
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
scopus_import: '1'
status: public
title: Immobilized azobenzenes for the construction of photoresponsive materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2010'
...
---
_id: '13410'
abstract:
- lang: eng
text: A range (Au, Pt, Pd) of metal nanoparticles (MNPs) has been prepared and functionalized
with (a) redox-active stalks containing tetrathiafulvalene (TTF) units, (b) [2]pseudorotaxanes
formed between these stalks and cyclobis(paraquat-p-phenylene) (CBPQT4+) rings,
and (c) bistable [2]rotaxane molecules where the dumbbell component contains a
1,5-dioxynaphthalene (DNP) unit, as well as a TTF unit, encircled by a CBPQT4+
ring. It transpires that the molecules present in (a) and (c) and the supermolecules
described in (b) retain their switching characteristics, previously observed in
solution, when they are immobilized onto MNPs. Moreover, their oxidation potentials
depend on the fraction, χ, of the molecules or supermolecules on the surface of
the nanoparticles. A variation in χ affects the oxidation potentials of the TTF
units to the extent that switching can be subjected to fine tuning as a result.
Specifically, increasing χ results in positive shifts (i) in the oxidation potentials
of the TTF unit in (a)−(c) and (ii) the reduction potentials of the CBPQT4+ rings
in (c). These shifts can be attributed to an increase in the electrostatic potential
surrounding the MNPs. Both the magnitude and the direction of these shifts are
reproduced by a model, based on the Poisson−Boltzmann equation coupled with charge-regulating
boundary conditions. Furthermore, the kinetics of relaxation from the metastable
state coconformation (MSCC) to the ground-state coconformation (GSCC) of the bistable
[2]rotaxane molecules also depends on χ, as well as on the nanoparticle diameter.
Increasing either of these parameters accelerates the rate of relaxation from
the MSCC to the GSCC. This rate is a function of (i) the activation energy for
the relaxation process associated with the bistable [2]rotaxane molecules in solution
and (ii) the electrostatic potential surrounding the MNPs. The electrostatic potential
depends on (i) the diameter of the MNPs, (ii) the amount of the bistable [2]rotaxane
molecules on the surface of the MNPs, and (iii) the equilibrium distribution of
the CBPQT4+ rings between the DNP and TTF recognition sites in the GSCC. This
electrostatic potential has also been quantified using the Poisson−Boltzmann equation,
leading to faithful estimates of the rate constants.
article_processing_charge: No
article_type: original
author:
- first_name: Ali
full_name: Coskun, Ali
last_name: Coskun
- first_name: Paul J.
full_name: Wesson, Paul J.
last_name: Wesson
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Ali
full_name: Trabolsi, Ali
last_name: Trabolsi
- first_name: Lei
full_name: Fang, Lei
last_name: Fang
- first_name: Mark A.
full_name: Olson, Mark A.
last_name: Olson
- first_name: Sanjeev K.
full_name: Dey, Sanjeev K.
last_name: Dey
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
- first_name: J. Fraser
full_name: Stoddart, J. Fraser
last_name: Stoddart
citation:
ama: 'Coskun A, Wesson PJ, Klajn R, et al. Molecular-mechanical switching at the
nanoparticle−solvent interface: Practice and theory. Journal of the American
Chemical Society. 2010;132(12):4310-4320. doi:10.1021/ja9102327'
apa: 'Coskun, A., Wesson, P. J., Klajn, R., Trabolsi, A., Fang, L., Olson, M. A.,
… Stoddart, J. F. (2010). Molecular-mechanical switching at the nanoparticle−solvent
interface: Practice and theory. Journal of the American Chemical Society.
American Chemical Society. https://doi.org/10.1021/ja9102327'
chicago: 'Coskun, Ali, Paul J. Wesson, Rafal Klajn, Ali Trabolsi, Lei Fang, Mark
A. Olson, Sanjeev K. Dey, Bartosz A. Grzybowski, and J. Fraser Stoddart. “Molecular-Mechanical
Switching at the Nanoparticle−solvent Interface: Practice and Theory.” Journal
of the American Chemical Society. American Chemical Society, 2010. https://doi.org/10.1021/ja9102327.'
ieee: 'A. Coskun et al., “Molecular-mechanical switching at the nanoparticle−solvent
interface: Practice and theory,” Journal of the American Chemical Society,
vol. 132, no. 12. American Chemical Society, pp. 4310–4320, 2010.'
ista: 'Coskun A, Wesson PJ, Klajn R, Trabolsi A, Fang L, Olson MA, Dey SK, Grzybowski
BA, Stoddart JF. 2010. Molecular-mechanical switching at the nanoparticle−solvent
interface: Practice and theory. Journal of the American Chemical Society. 132(12),
4310–4320.'
mla: 'Coskun, Ali, et al. “Molecular-Mechanical Switching at the Nanoparticle−solvent
Interface: Practice and Theory.” Journal of the American Chemical Society,
vol. 132, no. 12, American Chemical Society, 2010, pp. 4310–20, doi:10.1021/ja9102327.'
short: A. Coskun, P.J. Wesson, R. Klajn, A. Trabolsi, L. Fang, M.A. Olson, S.K.
Dey, B.A. Grzybowski, J.F. Stoddart, Journal of the American Chemical Society
132 (2010) 4310–4320.
date_created: 2023-08-01T09:48:27Z
date_published: 2010-03-31T00:00:00Z
date_updated: 2023-08-08T08:00:31Z
day: '31'
doi: 10.1021/ja9102327
extern: '1'
external_id:
pmid:
- '20218598'
intvolume: ' 132'
issue: '12'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '03'
oa_version: None
page: 4310-4320
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: 'Molecular-mechanical switching at the nanoparticle−solvent interface: Practice
and theory'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2010'
...
---
_id: '13411'
abstract:
- lang: eng
text: Photoresponsive gold nanoparticles dispersed in a solid/frozen matrix provide
a basis for sensors that “remember” whether the sample has ever exceeded the melting
temperature of the matrix. The operation of these sensors rests on the ability
to photoinduce metastable electric dipoles on NP surfaces – upon melting, these
dipoles drive NP aggregation, precipitation, and crosslinking. These events are
manifested by a pronounced color change.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Kevin P.
full_name: Browne, Kevin P.
last_name: Browne
- first_name: Siowling
full_name: Soh, Siowling
last_name: Soh
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Browne KP, Soh S, Grzybowski BA. Nanoparticles that “remember” temperature.
Small. 2010;6(13):1385-1387. doi:10.1002/smll.200902272
apa: Klajn, R., Browne, K. P., Soh, S., & Grzybowski, B. A. (2010). Nanoparticles
that “remember” temperature. Small. Wiley. https://doi.org/10.1002/smll.200902272
chicago: Klajn, Rafal, Kevin P. Browne, Siowling Soh, and Bartosz A. Grzybowski.
“Nanoparticles That ‘Remember’ Temperature.” Small. Wiley, 2010. https://doi.org/10.1002/smll.200902272.
ieee: R. Klajn, K. P. Browne, S. Soh, and B. A. Grzybowski, “Nanoparticles that
‘remember’ temperature,” Small, vol. 6, no. 13. Wiley, pp. 1385–1387, 2010.
ista: Klajn R, Browne KP, Soh S, Grzybowski BA. 2010. Nanoparticles that “remember”
temperature. Small. 6(13), 1385–1387.
mla: Klajn, Rafal, et al. “Nanoparticles That ‘Remember’ Temperature.” Small,
vol. 6, no. 13, Wiley, 2010, pp. 1385–87, doi:10.1002/smll.200902272.
short: R. Klajn, K.P. Browne, S. Soh, B.A. Grzybowski, Small 6 (2010) 1385–1387.
date_created: 2023-08-01T09:48:38Z
date_published: 2010-07-05T00:00:00Z
date_updated: 2023-08-08T08:15:25Z
day: '05'
doi: 10.1002/smll.200902272
extern: '1'
external_id:
pmid:
- '20521264'
intvolume: ' 6'
issue: '13'
keyword:
- Biomaterials
- Biotechnology
- General Materials Science
- General Chemistry
language:
- iso: eng
month: '07'
oa_version: None
page: 1385-1387
pmid: 1
publication: Small
publication_identifier:
eissn:
- 1613-6829
issn:
- 1613-6810
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanoparticles that “remember” temperature
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2010'
...
---
_id: '13412'
abstract:
- lang: eng
text: Nanoparticles (NPs) and molecular/supramolecular switches have attracted considerable
interest during the past decade on account of their unique properties and prominent
roles in the fields of organic chemistry and materials science. Materials derived
from the combination of these two components are now emerging in the literature.
This critical review evaluates materials which comprise NPs functionalised with
well-defined self-assembled monolayers of molecular and supramolecular switches.
We draw attention to the fact that immobilisation of switches on NPs does not,
in general, hamper their switching ability, although it can impart new properties
on the supporting particles. This premise leads us to the discussion of systems
in which switching on the surfaces of NPs can be used to modulate reversibly a
range of NP properties—optical, fluorescent, electrical, magnetic—as well as the
controlled release of small molecules. Finally, we discuss examples in which molecular
switches direct reversible self-assembly of NPs (308 references).
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: J. Fraser
full_name: Stoddart, J. Fraser
last_name: Stoddart
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Stoddart JF, Grzybowski BA. Nanoparticles functionalised with reversible
molecular and supramolecular switches. Chemical Society Reviews. 2010;39(6):2203-2237.
doi:10.1039/b920377j
apa: Klajn, R., Stoddart, J. F., & Grzybowski, B. A. (2010). Nanoparticles functionalised
with reversible molecular and supramolecular switches. Chemical Society Reviews.
Royal Society of Chemistry. https://doi.org/10.1039/b920377j
chicago: Klajn, Rafal, J. Fraser Stoddart, and Bartosz A. Grzybowski. “Nanoparticles
Functionalised with Reversible Molecular and Supramolecular Switches.” Chemical
Society Reviews. Royal Society of Chemistry, 2010. https://doi.org/10.1039/b920377j.
ieee: R. Klajn, J. F. Stoddart, and B. A. Grzybowski, “Nanoparticles functionalised
with reversible molecular and supramolecular switches,” Chemical Society Reviews,
vol. 39, no. 6. Royal Society of Chemistry, pp. 2203–2237, 2010.
ista: Klajn R, Stoddart JF, Grzybowski BA. 2010. Nanoparticles functionalised with
reversible molecular and supramolecular switches. Chemical Society Reviews. 39(6),
2203–2237.
mla: Klajn, Rafal, et al. “Nanoparticles Functionalised with Reversible Molecular
and Supramolecular Switches.” Chemical Society Reviews, vol. 39, no. 6,
Royal Society of Chemistry, 2010, pp. 2203–37, doi:10.1039/b920377j.
short: R. Klajn, J.F. Stoddart, B.A. Grzybowski, Chemical Society Reviews 39 (2010)
2203–2237.
date_created: 2023-08-01T09:49:07Z
date_published: 2010-04-21T00:00:00Z
date_updated: 2023-08-08T08:19:00Z
day: '21'
doi: 10.1039/b920377j
extern: '1'
external_id:
pmid:
- '20407689'
intvolume: ' 39'
issue: '6'
keyword:
- General Chemistry
language:
- iso: eng
month: '04'
oa_version: None
page: 2203-2237
pmid: 1
publication: Chemical Society Reviews
publication_identifier:
eissn:
- 1460-4744
issn:
- 0306-0012
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanoparticles functionalised with reversible molecular and supramolecular switches
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2010'
...
---
_id: '1465'
abstract:
- lang: eng
text: We prove a generating function formula for the Betti numbers of Nakajima quiver
varieties. We prove that it is a q-deformation of the Weyl-Kac character formula.
In particular this implies that the constant term of the polynomial counting the
number of absolutely indecomposable representations of a quiver equals the multiplicity
of a certain weight in the corresponding Kac-Moody algebra, which was conjectured
by Kac in 1982.
acknowledgement: This work has been supported by a Royal Society University Research
Fellowship, NSF grants DMS-0305505 and DMS-0604775 and an Alfred Sloan Fellowship
2005-2007.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: Hausel T. Kac’s conjecture from Nakajima quiver varieties. Inventiones Mathematicae.
2010;181(1):21-37. doi:10.1007/s00222-010-0241-3
apa: Hausel, T. (2010). Kac’s conjecture from Nakajima quiver varieties. Inventiones
Mathematicae. Springer. https://doi.org/10.1007/s00222-010-0241-3
chicago: Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” Inventiones
Mathematicae. Springer, 2010. https://doi.org/10.1007/s00222-010-0241-3.
ieee: T. Hausel, “Kac’s conjecture from Nakajima quiver varieties,” Inventiones
Mathematicae, vol. 181, no. 1. Springer, pp. 21–37, 2010.
ista: Hausel T. 2010. Kac’s conjecture from Nakajima quiver varieties. Inventiones
Mathematicae. 181(1), 21–37.
mla: Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” Inventiones
Mathematicae, vol. 181, no. 1, Springer, 2010, pp. 21–37, doi:10.1007/s00222-010-0241-3.
short: T. Hausel, Inventiones Mathematicae 181 (2010) 21–37.
date_created: 2018-12-11T11:52:11Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2021-01-12T06:50:56Z
day: '01'
doi: 10.1007/s00222-010-0241-3
extern: 1
intvolume: ' 181'
issue: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0811.1569
month: '07'
oa: 1
page: 21 - 37
publication: Inventiones Mathematicae
publication_status: published
publisher: Springer
publist_id: '5730'
quality_controlled: 0
status: public
title: Kac's conjecture from Nakajima quiver varieties
type: journal_article
volume: 181
year: '2010'
...
---
_id: '1466'
abstract:
- lang: eng
text: In Hausel et al. (2008) [10] we presented a conjecture generalizing the Cauchy
formula for Macdonald polynomial. This conjecture encodes the mixed Hodge polynomials
of the character varieties of representations of the fundamental group of a punctured
Riemann surface of genus g. We proved several results which support this conjecture.
Here we announce new results which are consequences of those in Hausel et al.
(2008) [10].
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Emmanuel
full_name: Letellier, Emmanuel
last_name: Letellier
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: Hausel T, Letellier E, Rodríguez Villegas F. Topology of character varieties
and representations of quivers. Comptes Rendus Mathematique. 2010;348(3-4):131-135.
doi:10.1016/j.crma.2010.01.025
apa: Hausel, T., Letellier, E., & Rodríguez Villegas, F. (2010). Topology of
character varieties and representations of quivers. Comptes Rendus Mathematique.
Elsevier. https://doi.org/10.1016/j.crma.2010.01.025
chicago: Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Topology
of Character Varieties and Representations of Quivers.” Comptes Rendus Mathematique.
Elsevier, 2010. https://doi.org/10.1016/j.crma.2010.01.025.
ieee: T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Topology of character
varieties and representations of quivers,” Comptes Rendus Mathematique,
vol. 348, no. 3–4. Elsevier, pp. 131–135, 2010.
ista: Hausel T, Letellier E, Rodríguez Villegas F. 2010. Topology of character varieties
and representations of quivers. Comptes Rendus Mathematique. 348(3–4), 131–135.
mla: Hausel, Tamás, et al. “Topology of Character Varieties and Representations
of Quivers.” Comptes Rendus Mathematique, vol. 348, no. 3–4, Elsevier,
2010, pp. 131–35, doi:10.1016/j.crma.2010.01.025.
short: T. Hausel, E. Letellier, F. Rodríguez Villegas, Comptes Rendus Mathematique
348 (2010) 131–135.
date_created: 2018-12-11T11:52:11Z
date_published: 2010-02-01T00:00:00Z
date_updated: 2021-01-12T06:50:56Z
day: '01'
doi: 10.1016/j.crma.2010.01.025
extern: 1
intvolume: ' 348'
issue: 3-4
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0905.3491
month: '02'
oa: 1
page: 131 - 135
publication: Comptes Rendus Mathematique
publication_status: published
publisher: Elsevier
publist_id: '5731'
quality_controlled: 0
status: public
title: Topology of character varieties and representations of quivers
type: journal_article
volume: 348
year: '2010'
...
---
_id: '1468'
abstract:
- lang: eng
text: 'This chapter surveys the motivations, related results, and progress made
towards the following problem, raised by Hitchin in 1995: What is the space of
L2 harmonic forms on the moduli space of Higgs bundles on a Riemann surface?'
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: 'Hausel T. S-Duality in HyperkäHler Hodge Theory. In: The Many Facets of
Geometry: A Tribute to Nigel Hitchin. Oxford University Press; 2010. doi:10.1093/acprof:oso/9780199534920.003.0016'
apa: 'Hausel, T. (2010). S-Duality in HyperkäHler Hodge Theory. In The Many Facets
of Geometry: A Tribute to Nigel Hitchin. Oxford University Press. https://doi.org/10.1093/acprof:oso/9780199534920.003.0016'
chicago: 'Hausel, Tamás. “S-Duality in HyperkäHler Hodge Theory.” In The Many
Facets of Geometry: A Tribute to Nigel Hitchin. Oxford University Press, 2010.
https://doi.org/10.1093/acprof:oso/9780199534920.003.0016.'
ieee: 'T. Hausel, “S-Duality in HyperkäHler Hodge Theory,” in The Many Facets
of Geometry: A Tribute to Nigel Hitchin, Oxford University Press, 2010.'
ista: 'Hausel T. 2010.S-Duality in HyperkäHler Hodge Theory. In: The Many Facets
of Geometry: A Tribute to Nigel Hitchin. .'
mla: 'Hausel, Tamás. “S-Duality in HyperkäHler Hodge Theory.” The Many Facets
of Geometry: A Tribute to Nigel Hitchin, Oxford University Press, 2010, doi:10.1093/acprof:oso/9780199534920.003.0016.'
short: 'T. Hausel, in:, The Many Facets of Geometry: A Tribute to Nigel Hitchin,
Oxford University Press, 2010.'
date_created: 2018-12-11T11:52:12Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2021-01-12T06:50:57Z
day: '01'
doi: 10.1093/acprof:oso/9780199534920.003.0016
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0709.0504
month: '09'
oa: 1
publication: 'The Many Facets of Geometry: A Tribute to Nigel Hitchin'
publication_status: published
publisher: Oxford University Press
publist_id: '5729'
quality_controlled: 0
status: public
title: S-Duality in HyperkäHler Hodge Theory
type: book_chapter
year: '2010'
...
---
_id: '14983'
abstract:
- lang: eng
text: 'This chapter tackles a difficult challenge: presenting signal processing
material to non-experts. This chapter is meant to be comprehensible to people
who have some math background, including a course in linear algebra and basic
statistics, but do not specialize in mathematics, engineering, or related fields.
Some formulas assume the reader is familiar with matrices and basic matrix operations,
but not more advanced material. Furthermore, we tried to make the chapter readable
even if you skip the formulas. Nevertheless, we include some simple methods to
demonstrate the basics of adaptive data processing, then we proceed with some
advanced methods that are fundamental in adaptive signal processing, and are likely
to be useful in a variety of applications. The advanced algorithms are also online
available [30]. In the second part, these techniques are applied to some real-world
BCI data.'
acknowledgement: This work was supported by the EU grants “BrainCom” (FP6-2004-Mobility-5
Grant No 024259) and “Multi-adaptive BCI” (MEIF-CT-2006 Grant No 040666). Furthermore,
we thank Matthias Krauledat for fruitful discussions and tools for generating Fig.
5.
alternative_title:
- The Frontiers Collection
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Carmen
full_name: Vidaurre, Carmen
last_name: Vidaurre
- first_name: Klaus-Robert
full_name: Müller, Klaus-Robert
last_name: Müller
citation:
ama: 'Schlögl A, Vidaurre C, Müller K-R. Adaptive Methods in BCI Research - An Introductory
Tutorial. In: Graimann B, Pfurtscheller G, Allison B, eds. Brain-Computer Interfaces.
1st ed. FRONTCOLL. Berlin, Heidelberg: Springer; 2010:331-355. doi:10.1007/978-3-642-02091-9_18'
apa: 'Schlögl, A., Vidaurre, C., & Müller, K.-R. (2010). Adaptive Methods in
BCI Research - An Introductory Tutorial. In B. Graimann, G. Pfurtscheller, &
B. Allison (Eds.), Brain-Computer Interfaces (1st ed., pp. 331–355). Berlin,
Heidelberg: Springer. https://doi.org/10.1007/978-3-642-02091-9_18'
chicago: 'Schlögl, Alois, Carmen Vidaurre, and Klaus-Robert Müller. “Adaptive Methods
in BCI Research - An Introductory Tutorial.” In Brain-Computer Interfaces,
edited by Bernhard Graimann, Gert Pfurtscheller, and Brendan Allison, 1st ed.,
331–55. FRONTCOLL. Berlin, Heidelberg: Springer, 2010. https://doi.org/10.1007/978-3-642-02091-9_18.'
ieee: 'A. Schlögl, C. Vidaurre, and K.-R. Müller, “Adaptive Methods in BCI Research
- An Introductory Tutorial,” in Brain-Computer Interfaces, 1st ed., B.
Graimann, G. Pfurtscheller, and B. Allison, Eds. Berlin, Heidelberg: Springer,
2010, pp. 331–355.'
ista: 'Schlögl A, Vidaurre C, Müller K-R. 2010.Adaptive Methods in BCI Research
- An Introductory Tutorial. In: Brain-Computer Interfaces. The Frontiers Collection,
, 331–355.'
mla: Schlögl, Alois, et al. “Adaptive Methods in BCI Research - An Introductory
Tutorial.” Brain-Computer Interfaces, edited by Bernhard Graimann et al.,
1st ed., Springer, 2010, pp. 331–55, doi:10.1007/978-3-642-02091-9_18.
short: A. Schlögl, C. Vidaurre, K.-R. Müller, in:, B. Graimann, G. Pfurtscheller,
B. Allison (Eds.), Brain-Computer Interfaces, 1st ed., Springer, Berlin, Heidelberg,
2010, pp. 331–355.
corr_author: '1'
date_created: 2024-02-14T09:56:00Z
date_published: 2010-09-06T00:00:00Z
date_updated: 2024-10-21T06:03:06Z
day: '06'
department:
- _id: ScienComp
doi: 10.1007/978-3-642-02091-9_18
edition: '1'
editor:
- first_name: Bernhard
full_name: Graimann, Bernhard
last_name: Graimann
- first_name: Gert
full_name: Pfurtscheller, Gert
last_name: Pfurtscheller
- first_name: Brendan
full_name: Allison, Brendan
last_name: Allison
language:
- iso: eng
month: '09'
oa_version: None
page: 331-355
place: Berlin, Heidelberg
publication: Brain-Computer Interfaces
publication_identifier:
eisbn:
- '9783642020919'
isbn:
- '9783642020902'
issn:
- 1612-3018
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: FRONTCOLL
status: public
title: Adaptive Methods in BCI Research - An Introductory Tutorial
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '1970'
abstract:
- lang: eng
text: 'Complex I is the first enzyme of the respiratory chain and has a central
role in cellular energy production, coupling electron transfer between NADH and
quinone to proton translocation by an unknown mechanism. Dysfunction of complex
I has been implicated in many human neurodegenerative diseases. We have determined
the structure of its hydrophilic domain previously. Here, we report the α-helical
structure of the membrane domain of complex I from Escherichia coli at 3.9 Å resolution.
The antiporter-like subunits NuoL/M/N each contain 14 conserved transmembrane
(TM) helices. Two of them are discontinuous, as in some transporters. Unexpectedly,
subunit NuoL also contains a 110-Å long amphipathic α-helix, spanning almost the
entire length of the domain. Furthermore, we have determined the structure of
the entire complex I from Thermus thermophilus at 4.5 Å resolution. The L-shaped
assembly consists of the α-helical model for the membrane domain, with 63 TM helices,
and the known structure of the hydrophilic domain. The architecture of the complex
provides strong clues about the coupling mechanism: the conformational changes
at the interface of the two main domains may drive the long amphipathic α-helix
of NuoL in a piston-like motion, tilting nearby discontinuous TM helices, resulting
in proton translocation.'
acknowledgement: This work was funded by the Medical Research Council.
author:
- first_name: Rouslan
full_name: Efremov, Rouslan G
last_name: Efremov
- first_name: Rozbeh
full_name: 'Baradaran, Rozbeh '
last_name: Baradaran
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Efremov R, Baradaran R, Sazanov LA. The architecture of respiratory complex
I. Nature. 2010;465(7297):441-445. doi:10.1038/nature09066
apa: Efremov, R., Baradaran, R., & Sazanov, L. A. (2010). The architecture of
respiratory complex I. Nature. Nature Publishing Group. https://doi.org/10.1038/nature09066
chicago: Efremov, Rouslan, Rozbeh Baradaran, and Leonid A Sazanov. “The Architecture
of Respiratory Complex I.” Nature. Nature Publishing Group, 2010. https://doi.org/10.1038/nature09066.
ieee: R. Efremov, R. Baradaran, and L. A. Sazanov, “The architecture of respiratory
complex I,” Nature, vol. 465, no. 7297. Nature Publishing Group, pp. 441–445,
2010.
ista: Efremov R, Baradaran R, Sazanov LA. 2010. The architecture of respiratory
complex I. Nature. 465(7297), 441–445.
mla: Efremov, Rouslan, et al. “The Architecture of Respiratory Complex I.” Nature,
vol. 465, no. 7297, Nature Publishing Group, 2010, pp. 441–45, doi:10.1038/nature09066.
short: R. Efremov, R. Baradaran, L.A. Sazanov, Nature 465 (2010) 441–445.
date_created: 2018-12-11T11:54:58Z
date_published: 2010-05-27T00:00:00Z
date_updated: 2021-01-12T06:54:25Z
day: '27'
doi: 10.1038/nature09066
extern: 1
intvolume: ' 465'
issue: '7297'
month: '05'
page: 441 - 445
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5113'
quality_controlled: 0
status: public
title: The architecture of respiratory complex I
type: journal_article
volume: 465
year: '2010'
...
---
_id: '4346'
abstract:
- lang: eng
text: With the term "Library 2.0" the editors mean an institution which applies
the principles of the Web 2.0 such as openness, re-use, collaboration and interaction
in the entire organization. Libraries are extending their service offerings and
work processes to include the potential of Web 2.0 technologies. This changes
the job description and self-image of librarians. The collective volume offers
a complete overview of the topic Library 2.0 and the current state of developments
from a technological, sociological, information theoretical and practice-oriented
perspective.
alternative_title:
- Bibliotheks- und Informationspraxis
article_processing_charge: No
citation:
ama: Danowski P, Bergmann J, eds. Handbuch Bibliothek 2.0. Vol 41. De Gruyter;
2010. doi:10.1515/9783110232103
apa: Danowski, P., & Bergmann, J. (Eds.). (2010). Handbuch Bibliothek 2.0
(Vol. 41). De Gruyter. https://doi.org/10.1515/9783110232103
chicago: Danowski, Patrick, and Julia Bergmann, eds. Handbuch Bibliothek 2.0.
Vol. 41. Bibliothekspraxis. De Gruyter, 2010. https://doi.org/10.1515/9783110232103.
ieee: P. Danowski and J. Bergmann, Eds., Handbuch Bibliothek 2.0, vol. 41.
De Gruyter, 2010.
ista: Danowski P, Bergmann J eds. 2010. Handbuch Bibliothek 2.0, De Gruyter, 405p.
mla: Danowski, Patrick, and Julia Bergmann, editors. Handbuch Bibliothek 2.0.
Vol. 41, De Gruyter, 2010, doi:10.1515/9783110232103.
short: P. Danowski, J. Bergmann, eds., Handbuch Bibliothek 2.0, De Gruyter, 2010.
date_created: 2018-12-11T12:08:23Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2025-07-02T11:25:26Z
day: '01'
doi: 10.1515/9783110232103
editor:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Julia
full_name: Bergmann, Julia
last_name: Bergmann
extern: '1'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://www.degruyter.com/document/doi/10.1515/9783110232103/html
month: '09'
oa: 1
oa_version: Published Version
page: '405'
publication_identifier:
eisbn:
- 9-783-1102-3210-3
isbn:
- 9-783-1102-3209-7
publication_status: published
publisher: De Gruyter
publist_id: '1228'
quality_controlled: '1'
series_title: Bibliothekspraxis
status: public
title: Handbuch Bibliothek 2.0
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: book_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: ' 41'
year: '2010'
...
---
_id: '4358'
abstract:
- lang: eng
text: Phenotypic biotyping has traditionally been used to differentiate bacteria
occupying distinct ecological niches such as host species. For example, the capacity
of Staphylococcus aureus from sheep to coagulate ruminant plasma, reported over
60 years ago, led to the description of small ruminant and bovine S. aureus ecovars.
The great majority of small ruminant isolates are represented by a single, widespread
clonal complex (CC133) of S. aureus, but its evolutionary origin and the molecular
basis for its host tropism remain unknown. Here, we provide evidence that the
CC133 clone evolved as the result of a human to ruminant host jump followed by
adaptive genome diversification. Comparative whole-genome sequencing revealed
molecular evidence for host adaptation including gene decay and diversification
of proteins involved in host-pathogen interactions. Importantly, several novel
mobile genetic elements encoding virulence proteins with attenuated or enhanced
activity in ruminants were widely distributed in CC133 isolates, suggesting a
key role in its host-specific interactions. To investigate this further, we examined
the activity of a novel staphylococcal pathogenicity island (SaPIov2) found in
the great majority of CC133 isolates which encodes a variant of the chromosomally
encoded von Willebrand-binding protein (vWbp(Sov2)), previously demonstrated to
have coagulase activity for human plasma. Remarkably, we discovered that SaPIov2
confers the ability to coagulate ruminant plasma suggesting an important role
in ruminant disease pathogenesis and revealing the origin of a defining phenotype
of the classical S. aureus biotyping scheme. Taken together, these data provide
broad new insights into the origin and molecular basis of S. aureus ruminant host
specificity.
author:
- first_name: Caitriona
full_name: Guinane, Caitriona M
last_name: Guinane
- first_name: Nouri
full_name: Ben Zakour, Nouri L
last_name: Ben Zakour
- first_name: Maria
full_name: Tormo-Mas, Maria A
last_name: Tormo Mas
- first_name: Lucy
full_name: Weinert, Lucy A
last_name: Weinert
- first_name: Bethan
full_name: Lowder, Bethan V
last_name: Lowder
- first_name: Robyn
full_name: Cartwright, Robyn A
last_name: Cartwright
- first_name: Davida
full_name: Smyth, Davida S
last_name: Smyth
- first_name: Cyril
full_name: Smyth, Cyril J
last_name: Smyth
- first_name: Jodi
full_name: Lindsay, Jodi A
last_name: Lindsay
- first_name: Katherine
full_name: Gould, Katherine A
last_name: Gould
- first_name: Adam
full_name: Witney, Adam
last_name: Witney
- first_name: Jason
full_name: Hinds, Jason
last_name: Hinds
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Andrew
full_name: Rambaut, Andrew
last_name: Rambaut
- first_name: Jose
full_name: Penades, Jose R
last_name: Penades
- first_name: J Ross
full_name: Fitzgerald, J Ross
last_name: Fitzgerald
citation:
ama: Guinane C, Ben Zakour N, Tormo Mas M, et al. Evolutionary genomics of Staphylococcus
aureus reveals insights into the origin and molecular basis of ruminant host adaptation.
Genome Biology and Evolution. 2010;2:454-466. doi:10.1093/gbe/evq031
apa: Guinane, C., Ben Zakour, N., Tormo Mas, M., Weinert, L., Lowder, B., Cartwright,
R., … Fitzgerald, J. R. (2010). Evolutionary genomics of Staphylococcus aureus
reveals insights into the origin and molecular basis of ruminant host adaptation.
Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evq031
chicago: Guinane, Caitriona, Nouri Ben Zakour, Maria Tormo Mas, Lucy Weinert, Bethan
Lowder, Robyn Cartwright, Davida Smyth, et al. “Evolutionary Genomics of Staphylococcus
Aureus Reveals Insights into the Origin and Molecular Basis of Ruminant Host Adaptation.”
Genome Biology and Evolution. Oxford University Press, 2010. https://doi.org/10.1093/gbe/evq031.
ieee: C. Guinane et al., “Evolutionary genomics of Staphylococcus aureus
reveals insights into the origin and molecular basis of ruminant host adaptation,”
Genome Biology and Evolution, vol. 2. Oxford University Press, pp. 454–466,
2010.
ista: Guinane C, Ben Zakour N, Tormo Mas M, Weinert L, Lowder B, Cartwright R, Smyth
D, Smyth C, Lindsay J, Gould K, Witney A, Hinds J, Bollback JP, Rambaut A, Penades
J, Fitzgerald JR. 2010. Evolutionary genomics of Staphylococcus aureus reveals
insights into the origin and molecular basis of ruminant host adaptation. Genome
Biology and Evolution. 2, 454–466.
mla: Guinane, Caitriona, et al. “Evolutionary Genomics of Staphylococcus Aureus
Reveals Insights into the Origin and Molecular Basis of Ruminant Host Adaptation.”
Genome Biology and Evolution, vol. 2, Oxford University Press, 2010, pp.
454–66, doi:10.1093/gbe/evq031.
short: C. Guinane, N. Ben Zakour, M. Tormo Mas, L. Weinert, B. Lowder, R. Cartwright,
D. Smyth, C. Smyth, J. Lindsay, K. Gould, A. Witney, J. Hinds, J.P. Bollback,
A. Rambaut, J. Penades, J.R. Fitzgerald, Genome Biology and Evolution 2 (2010)
454–466.
date_created: 2018-12-11T12:08:27Z
date_published: 2010-06-09T00:00:00Z
date_updated: 2021-01-12T07:56:23Z
day: '09'
doi: 10.1093/gbe/evq031
extern: 1
intvolume: ' 2'
month: '06'
page: 454 - 466
publication: Genome Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '1100'
quality_controlled: 0
status: public
title: Evolutionary genomics of Staphylococcus aureus reveals insights into the origin
and molecular basis of ruminant host adaptation
type: journal_article
volume: 2
year: '2010'
...
---
_id: '4361'
abstract:
- lang: eng
text: Depth-bounded processes form the most expressive known fragment of the π-calculus
for which interesting verification problems are still decidable. In this paper
we develop an adequate domain of limits for the well-structured transition systems
that are induced by depth-bounded processes. An immediate consequence of our result
is that there exists a forward algorithm that decides the covering problem for
this class. Unlike backward algorithms, the forward algorithm terminates even
if the depth of the process is not known a priori. More importantly, our result
suggests a whole spectrum of forward algorithms that enable the effective verification
of a large class of mobile systems.
alternative_title:
- LNCS
author:
- 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
- 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: 'Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes.
In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:10.1007/978-3-642-12032-9_8'
apa: 'Wies, T., Zufferey, D., & Henzinger, T. A. (2010). Forward analysis of
depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at
the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos,
Cyprus: Springer. https://doi.org/10.1007/978-3-642-12032-9_8'
chicago: Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis
of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010.
https://doi.org/10.1007/978-3-642-12032-9_8.
ieee: 'T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded
processes,” presented at the FoSSaCS: Foundations of Software Science and Computation
Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.'
ista: 'Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded
processes. FoSSaCS: Foundations of Software Science and Computation Structures,
LNCS, vol. 6014, 94–108.'
mla: Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited
by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.
short: T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010,
pp. 94–108.
conference:
end_date: 2010-03-28
location: Paphos, Cyprus
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
start_date: 2010-03-20
corr_author: '1'
date_created: 2018-12-11T12:08:27Z
date_published: 2010-03-01T00:00:00Z
date_updated: 2026-04-09T14:35:23Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-12032-9_8
editor:
- first_name: Luke
full_name: Ong, Luke
last_name: Ong
file:
- access_level: open_access
checksum: 3e610de84937d821316362658239134a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:17Z
date_updated: 2020-07-14T12:46:27Z
file_id: '4677'
file_name: IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf
file_size: 240766
relation: main_file
file_date_updated: 2020-07-14T12:46:27Z
has_accepted_license: '1'
intvolume: ' 6014'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 94 - 108
publication_status: published
publisher: Springer
publist_id: '1099'
pubrep_id: '50'
quality_controlled: '1'
related_material:
record:
- id: '1405'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Forward analysis of depth-bounded processes
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6014
year: '2010'
...
---
_id: '4362'
abstract:
- lang: eng
text: Software transactional memories (STMs) promise simple and efficient concurrent
programming. Several correctness properties have been proposed for STMs. Based
on a bounded conflict graph algorithm for verifying correctness of STMs, we develop
TRACER, a tool for runtime verification of STM implementations. The novelty of
TRACER lies in the way it combines coarse and precise runtime analyses to guarantee
sound and complete verification in an efficient manner. We implement TRACER in
the TL2 STM implementation. We evaluate the performance of TRACER on STAMP benchmarks.
While a precise runtime verification technique based on conflict graphs results
in an average slowdown of 60x, the two-level approach of TRACER performs complete
verification with an average slowdown of around 25x across different benchmarks.
alternative_title:
- LNCS
author:
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Singh V. Runtime verification for software transactional memories. In: Sokolsky
O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:10.1007/978-3-642-16612-9_32'
apa: 'Singh, V. (2010). Runtime verification for software transactional memories.
In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner,
… G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International
Conference on Runtime Verification, St. Julians, Malta: Springer. https://doi.org/10.1007/978-3-642-16612-9_32'
chicago: Singh, Vasu. “Runtime Verification for Software Transactional Memories.”
edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies
Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35.
Springer, 2010. https://doi.org/10.1007/978-3-642-16612-9_32.
ieee: 'V. Singh, “Runtime verification for software transactional memories,” presented
at the RV: International Conference on Runtime Verification, St. Julians, Malta,
2010, vol. 6418, pp. 421–435.'
ista: 'Singh V. 2010. Runtime verification for software transactional memories.
RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435.'
mla: Singh, Vasu. Runtime Verification for Software Transactional Memories.
Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:10.1007/978-3-642-16612-9_32.
short: V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone,
B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.
conference:
end_date: 2010-11-04
location: St. Julians, Malta
name: 'RV: International Conference on Runtime Verification'
start_date: 2010-11-01
corr_author: '1'
date_created: 2018-12-11T12:08:28Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2024-10-09T20:54:01Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-16612-9_32
editor:
- first_name: Oleg
full_name: Sokolsky, Oleg
last_name: Sokolsky
- first_name: Grigore
full_name: Rosu, Grigore
last_name: Rosu
- first_name: Nikolai
full_name: Tilmann, Nikolai
last_name: Tilmann
- first_name: Howard
full_name: Barringer, Howard
last_name: Barringer
- first_name: Ylies
full_name: Falcone, Ylies
last_name: Falcone
- first_name: Bernd
full_name: Finkbeiner, Bernd
last_name: Finkbeiner
- first_name: Klaus
full_name: Havelund, Klaus
last_name: Havelund
- first_name: Insup
full_name: Lee, Insup
last_name: Lee
- first_name: Gordon
full_name: Pace, Gordon
last_name: Pace
intvolume: ' 6418'
language:
- iso: eng
month: '01'
oa_version: None
page: 421 - 435
publication_status: published
publisher: Springer
publist_id: '1096'
quality_controlled: '1'
scopus_import: 1
status: public
title: Runtime verification for software transactional memories
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6418
year: '2010'
...
---
_id: '4364'
author:
- first_name: Andreas
full_name: Podelski,Andreas
last_name: Podelski
- first_name: Thomas
full_name: Thomas Wies
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: 'Podelski A, Wies T. Counterexample-guided focus. In: ACM; 2010:249-260. doi:10.1145/1707801.1706330'
apa: 'Podelski, A., & Wies, T. (2010). Counterexample-guided focus (pp. 249–260).
Presented at the POPL: Principles of Programming Languages, ACM. https://doi.org/10.1145/1707801.1706330'
chicago: Podelski, Andreas, and Thomas Wies. “Counterexample-Guided Focus,” 249–60.
ACM, 2010. https://doi.org/10.1145/1707801.1706330.
ieee: 'A. Podelski and T. Wies, “Counterexample-guided focus,” presented at the
POPL: Principles of Programming Languages, 2010, pp. 249–260.'
ista: 'Podelski A, Wies T. 2010. Counterexample-guided focus. POPL: Principles of
Programming Languages, 249–260.'
mla: Podelski, Andreas, and Thomas Wies. Counterexample-Guided Focus. ACM,
2010, pp. 249–60, doi:10.1145/1707801.1706330.
short: A. Podelski, T. Wies, in:, ACM, 2010, pp. 249–260.
conference:
name: 'POPL: Principles of Programming Languages'
date_created: 2018-12-11T12:08:28Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T07:56:26Z
day: '01'
doi: 10.1145/1707801.1706330
extern: 1
month: '01'
page: 249 - 260
publication_status: published
publisher: ACM
publist_id: '1093'
quality_controlled: 0
status: public
title: Counterexample-guided focus
type: conference
year: '2010'
...
---
_id: '4369'
abstract:
- lang: eng
text: In this paper we propose a novel technique for constructing timed automata
from properties expressed in the logic mtl, under bounded-variability assumptions.
We handle full mtl and include all future operators. Our construction is based
on separation of the continuous time monitoring of the input sequence and discrete
predictions regarding the future. The separation of the continuous from the discrete
allows us to determinize our automata in an exponential construction that does
not increase the number of clocks. This leads to a doubly exponential construction
from mtl to deterministic timed automata, compared with triply exponential using
existing approaches. We offer an alternative to the existing approach to linear
real-time model checking, which has never been implemented. It further offers
a unified framework for model checking, runtime monitoring, and synthesis, in
an approach that can reuse tools, implementations, and insights from the discrete
setting.
alternative_title:
- LNCS
author:
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger
TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:10.1007/978-3-642-15297-9_13'
apa: 'Nickovic, D., & Piterman, N. (2010). From MTL to deterministic timed automata.
In T. A. Henzinger & K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented
at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg,
Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9_13'
chicago: Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.”
edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer,
2010. https://doi.org/10.1007/978-3-642-15297-9_13.
ieee: 'D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,”
presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg,
Austria, 2010, vol. 6246, pp. 152–167.'
ista: 'Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS:
Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.'
mla: Nickovic, Dejan, and Nir Piterman. From MTL to Deterministic Timed Automata.
Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer,
2010, pp. 152–67, doi:10.1007/978-3-642-15297-9_13.
short: D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer,
2010, pp. 152–167.
conference:
end_date: 2010-09-10
location: Klosterneuburg, Austria
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2010-09-08
corr_author: '1'
date_created: 2018-12-11T12:08:30Z
date_published: 2010-09-08T00:00:00Z
date_updated: 2024-10-09T20:54:01Z
day: '08'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-15297-9_13
ec_funded: 1
editor:
- first_name: Thomas A.
full_name: Henzinger, Thomas A.
last_name: Henzinger
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
last_name: Chatterjee
file:
- access_level: open_access
checksum: b0ca5f5fbe8a3d20ccbc6f51a344a459
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:43Z
date_updated: 2020-07-14T12:46:27Z
file_id: '5028'
file_name: IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf
file_size: 249789
relation: main_file
file_date_updated: 2020-07-14T12:46:27Z
has_accepted_license: '1'
intvolume: ' 6246'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 152 - 167
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
publication_status: published
publisher: Springer
publist_id: '1090'
pubrep_id: '49'
quality_controlled: '1'
scopus_import: 1
status: public
title: From MTL to deterministic timed automata
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6246
year: '2010'
...
---
_id: '4378'
abstract:
- lang: eng
text: 'Techniques such as verification condition generation, predicate abstraction,
and expressive type systems reduce software verification to proving formulas in
expressive logics. Programs and their specifications often make use of data structures
such as sets, multisets, algebraic data types, or graphs. Consequently, formulas
generated from verification also involve such data structures. To automate the
proofs of such formulas we propose a logic (a “calculus”) of such data structures.
We build the calculus by starting from decidable logics of individual data structures,
and connecting them through functions and sets, in ways that go beyond the frameworks
such as Nelson-Oppen. The result are new decidable logics that can simultaneously
specify properties of different kinds of data structures and overcome the limitations
of the individual logics. Several of our decidable logics include abstraction
functions that map a data structure into its more abstract view (a tree into a
multiset, a multiset into a set), into a numerical quantity (the size or the height),
or into the truth value of a candidate data structure invariant (sortedness, or
the heap property). For algebraic data types, we identify an asymptotic many-to-one
condition on the abstraction function that guarantees the existence of a decision
procedure. In addition to the combination based on abstraction functions, we can
combine multiple data structure theories if they all reduce to the same data structure
logic. As an instance of this approach, we describe a decidable logic whose formulas
are propositional combinations of formulas in: weak monadic second-order logic
of two successors, two-variable logic with counting, multiset algebra with Presburger
arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the
logic of algebraic data types with the set content function. The subformulas in
this combination can share common variables that refer to sets of objects along
with the common set algebra operations. Such sound and complete combination is
possible because the relations on sets definable in the component logics are all
expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic
and its new extensions play an important role in our decidability results. In
several cases, when we combine logics that belong to NP, we can prove the satisfiability
for the combined logic is still in NP.'
alternative_title:
- LNCS
author:
- first_name: Viktor
full_name: Kuncak, Viktor
last_name: Kuncak
- first_name: Ruzica
full_name: Piskac, Ruzica
last_name: Piskac
- first_name: Philippe
full_name: Suter, Philippe
last_name: Suter
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: 'Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures.
In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:10.1007/978-3-642-11319-2_6'
apa: 'Kuncak, V., Piskac, R., Suter, P., & Wies, T. (2010). Building a calculus
of data structures. In G. Barthe & M. Hermenegildo (Eds.) (Vol. 5944, pp.
26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
Madrid, Spain: Springer. https://doi.org/10.1007/978-3-642-11319-2_6'
chicago: Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building
a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo,
5944:26–44. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_6.
ieee: 'V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data
structures,” presented at the VMCAI: Verification, Model Checking and Abstract
Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.'
ista: 'Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures.
VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944,
26–44.'
mla: Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited
by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44,
doi:10.1007/978-3-642-11319-2_6.
short: V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo
(Eds.), Springer, 2010, pp. 26–44.
conference:
end_date: 2010-01-19
location: Madrid, Spain
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2010-01-17
date_created: 2018-12-11T12:08:33Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T07:56:31Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-11319-2_6
editor:
- first_name: Gilles
full_name: Barthe, Gilles
last_name: Barthe
- first_name: Manuel
full_name: Hermenegildo, Manuel
last_name: Hermenegildo
intvolume: ' 5944'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://infoscience.epfl.ch/record/161290/
month: '01'
oa: 1
oa_version: Submitted Version
page: 26 - 44
publication_status: published
publisher: Springer
publist_id: '1081'
quality_controlled: '1'
scopus_import: 1
status: public
title: Building a calculus of data structures
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 5944
year: '2010'
...
---
_id: '4379'
abstract:
- lang: eng
text: |
The formal specification component of verification can be exported to simulation through the idea of property checkers. The essence of this approach is the automatic construction of an observer from the specification in the form of a program that can be interfaced with a simulator and alert the user if the property is violated by a simulation trace. Although not complete, this lighter approach to formal verification has been effectively used in software and digital hardware to detect errors. Recently, the idea of property checkers has been extended to analog and mixed-signal systems.
In this paper, we apply the property-based checking methodology to an industrial and realistic example of a DDR2 memory interface. The properties describing the DDR2 analog behavior are expressed in the formal specification language stl/psl in form of assertions. The simulation traces generated from an actual DDR2 interface design are checked with respect to the stl/psl assertions using the amt tool. The focus of this paper is on the translation of the official (informal and descriptive) specification of two non-trivial DDR2 properties into stl/psl assertions. We study both the benefits and the current limits of such approach.
acknowledgement: We would like to thank Tom Giovannini from Rambus, Inc. for his detailed
explana- tions of the DDR2 specification and for providing us with simulation traces.
We would also like to thank Oded Maler from Verimag for discussions on the STL/PSL
language and its extensions.
author:
- first_name: Kevin
full_name: Jones, Kevin D
last_name: Jones
- first_name: Victor
full_name: Konrad,Victor
last_name: Konrad
- first_name: Dejan
full_name: Dejan Nickovic
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Jones K, Konrad V, Nickovic D. Analog property checkers: a DDR2 case study.
Formal Methods in System Design. 2010;36(2):114-130. doi:10.1007/s10703-009-0085-x'
apa: 'Jones, K., Konrad, V., & Nickovic, D. (2010). Analog property checkers:
a DDR2 case study. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-009-0085-x'
chicago: 'Jones, Kevin, Victor Konrad, and Dejan Nickovic. “Analog Property Checkers:
A DDR2 Case Study.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-009-0085-x.'
ieee: 'K. Jones, V. Konrad, and D. Nickovic, “Analog property checkers: a DDR2 case
study,” Formal Methods in System Design, vol. 36, no. 2. Springer, pp.
114–130, 2010.'
ista: 'Jones K, Konrad V, Nickovic D. 2010. Analog property checkers: a DDR2 case
study. Formal Methods in System Design. 36(2), 114–130.'
mla: 'Jones, Kevin, et al. “Analog Property Checkers: A DDR2 Case Study.” Formal
Methods in System Design, vol. 36, no. 2, Springer, 2010, pp. 114–30, doi:10.1007/s10703-009-0085-x.'
short: K. Jones, V. Konrad, D. Nickovic, Formal Methods in System Design 36 (2010)
114–130.
date_created: 2018-12-11T12:08:33Z
date_published: 2010-06-01T00:00:00Z
date_updated: 2021-01-12T07:56:31Z
day: '01'
doi: 10.1007/s10703-009-0085-x
extern: 1
intvolume: ' 36'
issue: '2'
main_file_link:
- open_access: '1'
url: http://openaccess.city.ac.uk/1066/
month: '06'
oa: 1
page: 114 - 130
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '1080'
quality_controlled: 0
status: public
title: 'Analog property checkers: a DDR2 case study'
type: journal_article
volume: 36
year: '2010'
...
---
_id: '4380'
abstract:
- lang: eng
text: Cloud computing is an emerging paradigm aimed to offer users pay-per-use computing
resources, while leaving the burden of managing the computing infrastructure to
the cloud provider. We present a new programming and pricing model that gives
the cloud user the flexibility of trading execution speed and price on a per-job
basis. We discuss the scheduling and resource management challenges for the cloud
provider that arise in the implementation of this model. We argue that techniques
from real-time and embedded software can be useful in this context.
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: Tomar, Anmol
id: 3D8D36B6-F248-11E8-B48F-1D18A9856A87
last_name: Tomar
- 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, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud
resources. In: ACM; 2010:1-8. doi:10.1145/1879021.1879022'
apa: 'Henzinger, T. A., Tomar, A., Singh, V., Wies, T., & Zufferey, D. (2010).
A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded
Software , Arizona, USA: ACM. https://doi.org/10.1145/1879021.1879022'
chicago: Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey.
“A Marketplace for Cloud Resources,” 1–8. ACM, 2010. https://doi.org/10.1145/1879021.1879022.
ieee: 'T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace
for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA,
2010, pp. 1–8.'
ista: 'Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. A marketplace for
cloud resources. EMSOFT: Embedded Software , 1–8.'
mla: Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM,
2010, pp. 1–8, doi:10.1145/1879021.1879022.
short: T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010,
pp. 1–8.
conference:
end_date: 2010-10-29
location: Arizona, USA
name: 'EMSOFT: Embedded Software '
start_date: 2010-10-24
corr_author: '1'
date_created: 2018-12-11T12:08:33Z
date_published: 2010-10-24T00:00:00Z
date_updated: 2024-10-09T20:54:01Z
day: '24'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1145/1879021.1879022
file:
- access_level: open_access
checksum: 7680dd24016810710f7c977bc94f85e9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:42Z
date_updated: 2020-07-14T12:46:28Z
file_id: '4767'
file_name: IST-2012-48-v1+1_A_marketplace_for_cloud_resources.pdf
file_size: 222626
relation: main_file
file_date_updated: 2020-07-14T12:46:28Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1 - 8
publication_status: published
publisher: ACM
publist_id: '1078'
pubrep_id: '48'
quality_controlled: '1'
scopus_import: 1
status: public
title: A marketplace for cloud resources
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '4381'
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 claim
that, in order to realize the full potential of cloud computing, the user must
be presented with a pricing model that offers flexibility at the requirements
level, such as a choice between different degrees of execution speed and the cloud
provider must be presented with a programming model that offers flexibility at
the execution level, such as a choice between different scheduling policies. In
such a flexible framework, with each job, the user purchases a virtual computer
with the desired speed and cost characteristics, and the cloud provider can optimize
the utilization of resources across a stream of jobs from different users. We
designed a flexible framework to test our hypothesis, which is called FlexPRICE
(Flexible Provisioning of Resources in a Cloud Environment) and works as follows.
A user presents a job to the cloud. The cloud finds different schedules to execute
the job and presents a set of quotes to the user in terms of price and duration
for the execution. The user then chooses a particular quote and the cloud is obliged
to execute the job according to the chosen quote. FlexPRICE thus hides the complexity
of the actual scheduling decisions from the user, but still provides enough flexibility
to meet the users actual demands. We implemented FlexPRICE in a simulator called
PRICES that allows us to experiment with our framework. We observe that FlexPRICE
provides a wide range of execution options-from fast and expensive to slow and
cheap-- for the whole spectrum of data-intensive and computation-intensive jobs.
We also observe that the set of quotes computed by FlexPRICE do not vary as the
number of simultaneous jobs increases.
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: Tomar, Anmol
id: 3D8D36B6-F248-11E8-B48F-1D18A9856A87
last_name: Tomar
- 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, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning
of resources in a cloud environment. In: IEEE; 2010:83-90. doi:10.1109/CLOUD.2010.71'
apa: 'Henzinger, T. A., Tomar, A., Singh, V., Wies, T., & Zufferey, D. (2010).
FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90).
Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE. https://doi.org/10.1109/CLOUD.2010.71'
chicago: 'Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien
Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,”
83–90. IEEE, 2010. https://doi.org/10.1109/CLOUD.2010.71.'
ieee: 'T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE:
Flexible provisioning of resources in a cloud environment,” presented at the CLOUD:
Cloud Computing, Miami, USA, 2010, pp. 83–90.'
ista: 'Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. 2010. FlexPRICE: Flexible
provisioning of resources in a cloud environment. CLOUD: Cloud Computing, 83–90.'
mla: 'Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources
in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71.'
short: T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010,
pp. 83–90.
conference:
end_date: 2010-07-10
location: Miami, USA
name: 'CLOUD: Cloud Computing'
start_date: 2010-07-05
corr_author: '1'
date_created: 2018-12-11T12:08:33Z
date_published: 2010-08-26T00:00:00Z
date_updated: 2024-10-09T20:54:00Z
day: '26'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1109/CLOUD.2010.71
file:
- access_level: open_access
checksum: 98e534675339a8e2beca08890d048145
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:03Z
date_updated: 2020-07-14T12:46:28Z
file_id: '5188'
file_name: IST-2012-47-v1+1_FlexPRICE-_Flexible_provisioning_of_resources_in_a_cloud_environment.pdf
file_size: 467436
relation: main_file
file_date_updated: 2020-07-14T12:46:28Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 83 - 90
publication_status: published
publisher: IEEE
publist_id: '1077'
pubrep_id: '47'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'FlexPRICE: Flexible provisioning of resources in a cloud environment'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '4382'
abstract:
- lang: eng
text: 'Transactional memory (TM) has shown potential to simplify the task of writing
concurrent programs. Inspired by classical work on databases, formal definitions
of the semantics of TM executions have been proposed. Many of these definitions
assumed that accesses to shared data are solely performed through transactions.
In practice, due to legacy code and concurrency libraries, transactions in a TM
have to share data with non-transactional operations. The semantics of such interaction,
while widely discussed by practitioners, lacks a clear formal specification. Those
interactions can vary, sometimes in subtle ways, between TM implementations and
underlying memory models. We propose a correctness condition for TMs, parametrized
opacity, to formally capture the now folklore notion of strong atomicity by stipulating
the two following intuitive requirements: first, every transaction appears as
if it is executed instantaneously with respect to other transactions and non-transactional
operations, and second, non-transactional operations conform to the given underlying
memory model. We investigate the inherent cost of implementing parametrized opacity.
We first prove that parametrized opacity requires either instrumenting non-transactional
operations (for most memory models) or writing to memory by transactions using
potentially expensive read-modify-write instructions (such as compare-and-swap).
Then, we show that for a class of practical relaxed memory models, parametrized
opacity can indeed be implemented with constant-time instrumentation of non-transactional
writes and no instrumentation of non-transactional reads. We show that, in practice,
parametrizing the notion of correctness allows developing more efficient TM implementations.'
author:
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- 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: Michal
full_name: Kapalka, Michal
last_name: Kapalka
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle.
In: ACM; 2010:263-272. doi:10.1145/1810479.1810529'
apa: 'Guerraoui, R., Henzinger, T. A., Kapalka, M., & Singh, V. (2010). Transactions
in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel
Algorithms and Architectures, Santorini, Greece: ACM. https://doi.org/10.1145/1810479.1810529'
chicago: Guerraoui, Rachid, Thomas A Henzinger, Michal Kapalka, and Vasu Singh.
“Transactions in the Jungle,” 263–72. ACM, 2010. https://doi.org/10.1145/1810479.1810529.
ieee: 'R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in
the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures,
Santorini, Greece, 2010, pp. 263–272.'
ista: 'Guerraoui R, Henzinger TA, Kapalka M, Singh V. 2010. Transactions in the
jungle. SPAA: ACM Symposium on Parallel Algorithms and Architectures, 263–272.'
mla: Guerraoui, Rachid, et al. Transactions in the Jungle. ACM, 2010, pp.
263–72, doi:10.1145/1810479.1810529.
short: R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.
conference:
end_date: 2010-06-15
location: Santorini, Greece
name: 'SPAA: ACM Symposium on Parallel Algorithms and Architectures'
start_date: 2010-06-13
date_created: 2018-12-11T12:08:34Z
date_published: 2010-06-13T00:00:00Z
date_updated: 2024-10-21T06:03:05Z
day: '13'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1145/1810479.1810529
file:
- access_level: open_access
checksum: f2ad6c00a6304da34bf21bcdcfd36c4b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:28Z
date_updated: 2020-07-14T12:46:28Z
file_id: '5080'
file_name: IST-2012-46-v1+1_Transactions_in_the_jungle.pdf
file_size: 246409
relation: main_file
file_date_updated: 2020-07-14T12:46:28Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 263 - 272
publication_status: published
publisher: ACM
publist_id: '1076'
pubrep_id: '46'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transactions in the jungle
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2010'
...