---
_id: '13420'
abstract:
- lang: eng
text: Weakly protected metal nanoparticles (MNPs) are used as precursors for the
preparation of catenane- and pseudorotaxane-decorated NPs of various compositions
(gold, palladium, platinum). When attached to the surface of MNPs, the molecular
switches retain their switching abilities. The redox potentials of these switches
depend on and can be regulated by the composition of the mixed self-assembled
monolayers covering the MNPs.
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: Lei
full_name: Fang, Lei
last_name: Fang
- first_name: Ali
full_name: Coskun, Ali
last_name: Coskun
- first_name: Mark A.
full_name: Olson, Mark A.
last_name: Olson
- first_name: Paul J.
full_name: Wesson, Paul J.
last_name: Wesson
- 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, Fang L, Coskun A, et al. Metal nanoparticles functionalized with molecular
and supramolecular switches. Journal of the American Chemical Society.
2009;131(12):4233-4235. doi:10.1021/ja9001585
apa: Klajn, R., Fang, L., Coskun, A., Olson, M. A., Wesson, P. J., Stoddart, J.
F., & Grzybowski, B. A. (2009). Metal nanoparticles functionalized with molecular
and supramolecular switches. Journal of the American Chemical Society.
American Chemical Society. https://doi.org/10.1021/ja9001585
chicago: Klajn, Rafal, Lei Fang, Ali Coskun, Mark A. Olson, Paul J. Wesson, J. Fraser
Stoddart, and Bartosz A. Grzybowski. “Metal Nanoparticles Functionalized with
Molecular and Supramolecular Switches.” Journal of the American Chemical Society.
American Chemical Society, 2009. https://doi.org/10.1021/ja9001585.
ieee: R. Klajn et al., “Metal nanoparticles functionalized with molecular
and supramolecular switches,” Journal of the American Chemical Society,
vol. 131, no. 12. American Chemical Society, pp. 4233–4235, 2009.
ista: Klajn R, Fang L, Coskun A, Olson MA, Wesson PJ, Stoddart JF, Grzybowski BA.
2009. Metal nanoparticles functionalized with molecular and supramolecular switches.
Journal of the American Chemical Society. 131(12), 4233–4235.
mla: Klajn, Rafal, et al. “Metal Nanoparticles Functionalized with Molecular and
Supramolecular Switches.” Journal of the American Chemical Society, vol.
131, no. 12, American Chemical Society, 2009, pp. 4233–35, doi:10.1021/ja9001585.
short: R. Klajn, L. Fang, A. Coskun, M.A. Olson, P.J. Wesson, J.F. Stoddart, B.A.
Grzybowski, Journal of the American Chemical Society 131 (2009) 4233–4235.
date_created: 2023-08-01T10:30:17Z
date_published: 2009-04-01T00:00:00Z
date_updated: 2023-08-08T09:06:00Z
day: '01'
doi: 10.1021/ja9001585
extern: '1'
external_id:
pmid:
- '19265400'
intvolume: ' 131'
issue: '12'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '04'
oa_version: None
page: 4233-4235
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: Metal nanoparticles functionalized with molecular and supramolecular switches
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 131
year: '2009'
...
---
_id: '13421'
abstract:
- lang: eng
text: Side-chain poly[2]catenanes at the click of a switch! A bistable side-chain
poly[2]catenane has been synthesized and found to form hierarchical self-assembled
hollow superstructures of nanoscale dimensions in solution. Molecular electromechanical
switching (see picture) of the material is demonstrated, and the ground-state
equilibrium thermodynamics and switching kinetics are examined as the initial
steps towards processible molecular-based electronic devices and nanoelectromechanical
systems.
article_processing_charge: No
article_type: original
author:
- first_name: Mark A.
full_name: Olson, Mark A.
last_name: Olson
- first_name: Adam B.
full_name: Braunschweig, Adam B.
last_name: Braunschweig
- first_name: Lei
full_name: Fang, Lei
last_name: Fang
- first_name: Taichi
full_name: Ikeda, Taichi
last_name: Ikeda
- 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: Paul J.
full_name: Wesson, Paul J.
last_name: Wesson
- first_name: Diego
full_name: Benítez, Diego
last_name: Benítez
- first_name: Chad A.
full_name: Mirkin, Chad A.
last_name: Mirkin
- 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: Olson MA, Braunschweig AB, Fang L, et al. A bistable poly[2]catenane forms
nanosuperstructures. Angewandte Chemie International Edition. 2009;48(10):1792-1797.
doi:10.1002/anie.200804558
apa: Olson, M. A., Braunschweig, A. B., Fang, L., Ikeda, T., Klajn, R., Trabolsi,
A., … Stoddart, J. F. (2009). A bistable poly[2]catenane forms nanosuperstructures.
Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.200804558
chicago: Olson, Mark A., Adam B. Braunschweig, Lei Fang, Taichi Ikeda, Rafal Klajn,
Ali Trabolsi, Paul J. Wesson, et al. “A Bistable Poly[2]Catenane Forms Nanosuperstructures.”
Angewandte Chemie International Edition. Wiley, 2009. https://doi.org/10.1002/anie.200804558.
ieee: M. A. Olson et al., “A bistable poly[2]catenane forms nanosuperstructures,”
Angewandte Chemie International Edition, vol. 48, no. 10. Wiley, pp. 1792–1797,
2009.
ista: Olson MA, Braunschweig AB, Fang L, Ikeda T, Klajn R, Trabolsi A, Wesson PJ,
Benítez D, Mirkin CA, Grzybowski BA, Stoddart JF. 2009. A bistable poly[2]catenane
forms nanosuperstructures. Angewandte Chemie International Edition. 48(10), 1792–1797.
mla: Olson, Mark A., et al. “A Bistable Poly[2]Catenane Forms Nanosuperstructures.”
Angewandte Chemie International Edition, vol. 48, no. 10, Wiley, 2009,
pp. 1792–97, doi:10.1002/anie.200804558.
short: M.A. Olson, A.B. Braunschweig, L. Fang, T. Ikeda, R. Klajn, A. Trabolsi,
P.J. Wesson, D. Benítez, C.A. Mirkin, B.A. Grzybowski, J.F. Stoddart, Angewandte
Chemie International Edition 48 (2009) 1792–1797.
date_created: 2023-08-01T10:30:30Z
date_published: 2009-02-23T00:00:00Z
date_updated: 2023-08-08T11:12:29Z
day: '23'
doi: 10.1002/anie.200804558
extern: '1'
external_id:
pmid:
- '19180620'
intvolume: ' 48'
issue: '10'
keyword:
- General Chemistry
- Catalysis
language:
- iso: eng
month: '02'
oa_version: None
page: 1792-1797
pmid: 1
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: A bistable poly[2]catenane forms nanosuperstructures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2009'
...
---
_id: '164'
abstract:
- lang: eng
text: Let g be a cubic polynomial with integer coefficients and n>9 variables,
and assume that the congruence g=0 modulo p^k is soluble for all prime powers
p^k. We show that the equation g=0 has infinitely many integer solutions when
the cubic part of g defines a projective hypersurface with singular locus of dimension
<n-10. The proof is based on the Hardy-Littlewood circle method.
article_processing_charge: No
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Roger
full_name: Heath Brown, Roger
last_name: Heath Brown
citation:
ama: 'Browning TD, Heath Brown R. Integral points on cubic hypersurfaces. In: Analytic
Number Theory: Essays in Honour of Klaus Roth. Cambridge University Press;
2009:75-90.'
apa: 'Browning, T. D., & Heath Brown, R. (2009). Integral points on cubic hypersurfaces.
In Analytic Number Theory: Essays in honour of Klaus Roth (pp. 75–90).
Cambridge University Press.'
chicago: 'Browning, Timothy D, and Roger Heath Brown. “Integral Points on Cubic
Hypersurfaces.” In Analytic Number Theory: Essays in Honour of Klaus Roth,
75–90. Cambridge University Press, 2009.'
ieee: 'T. D. Browning and R. Heath Brown, “Integral points on cubic hypersurfaces,”
in Analytic Number Theory: Essays in honour of Klaus Roth, Cambridge University
Press, 2009, pp. 75–90.'
ista: 'Browning TD, Heath Brown R. 2009.Integral points on cubic hypersurfaces.
In: Analytic Number Theory: Essays in honour of Klaus Roth. , 75–90.'
mla: 'Browning, Timothy D., and Roger Heath Brown. “Integral Points on Cubic Hypersurfaces.”
Analytic Number Theory: Essays in Honour of Klaus Roth, Cambridge University
Press, 2009, pp. 75–90.'
short: 'T.D. Browning, R. Heath Brown, in:, Analytic Number Theory: Essays in Honour
of Klaus Roth, Cambridge University Press, 2009, pp. 75–90.'
date_created: 2018-12-11T11:44:58Z
date_published: 2009-01-31T00:00:00Z
date_updated: 2021-01-12T06:52:11Z
day: '31'
extern: '1'
external_id:
arxiv:
- '0611086'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/math/0611086
month: '01'
oa: 1
oa_version: Preprint
page: 75 - 90
publication: 'Analytic Number Theory: Essays in honour of Klaus Roth'
publication_status: published
publisher: Cambridge University Press
publist_id: '7757'
quality_controlled: '1'
status: public
title: Integral points on cubic hypersurfaces
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '165'
abstract:
- lang: eng
text: We survey the state of affairs for the distribution of ℚ-rational points on
non-singular del Pezzo surfaces of low degree, highlighting the recent resolution
of Manin's conjecture for a non-singular del Pezzo surface of degree 4 by la Bretèche
and Browning.
acknowledgement: Proceedings of the 5th China-Japan Seminar
alternative_title:
- Series on number theory and its application
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: 'Browning TD. Resent progress on the quantitative arithmetic of del Pezzo surfaces.
In: Aoki T, Kanemitsu S, Liu J, eds. Vol 6. World Scientific Publishing; 2009:1-18.
doi:https://doi.org/10.1142/9789814289924_0001'
apa: 'Browning, T. D. (2009). Resent progress on the quantitative arithmetic of
del Pezzo surfaces. In T. Aoki, S. Kanemitsu, & J. Liu (Eds.) (Vol. 6, pp.
1–18). Presented at the Number Theory: Dreaming in dreams, World Scientific Publishing.
https://doi.org/10.1142/9789814289924_0001'
chicago: Browning, Timothy D. “Resent Progress on the Quantitative Arithmetic of
Del Pezzo Surfaces.” edited by Takashi Aoki, Shigeru Kanemitsu, and Jianya Liu,
6:1–18. World Scientific Publishing, 2009. https://doi.org/10.1142/9789814289924_0001.
ieee: 'T. D. Browning, “Resent progress on the quantitative arithmetic of del Pezzo
surfaces,” presented at the Number Theory: Dreaming in dreams, 2009, vol. 6, pp.
1–18.'
ista: 'Browning TD. 2009. Resent progress on the quantitative arithmetic of del
Pezzo surfaces. Number Theory: Dreaming in dreams, Series on number theory and
its application, vol. 6, 1–18.'
mla: Browning, Timothy D. Resent Progress on the Quantitative Arithmetic of Del
Pezzo Surfaces. Edited by Takashi Aoki et al., vol. 6, World Scientific Publishing,
2009, pp. 1–18, doi:https://doi.org/10.1142/9789814289924_0001.
short: T.D. Browning, in:, T. Aoki, S. Kanemitsu, J. Liu (Eds.), World Scientific
Publishing, 2009, pp. 1–18.
conference:
name: 'Number Theory: Dreaming in dreams'
date_created: 2018-12-11T11:44:58Z
date_published: 2009-08-24T00:00:00Z
date_updated: 2021-01-12T06:52:15Z
day: '24'
doi: https://doi.org/10.1142/9789814289924_0001
editor:
- first_name: Takashi
full_name: Aoki, Takashi
last_name: Aoki
- first_name: Shigeru
full_name: Kanemitsu, Shigeru
last_name: Kanemitsu
- first_name: Jianya
full_name: Liu, Jianya
last_name: Liu
extern: 1
intvolume: ' 6'
month: '08'
page: 1 - 18
publication_status: published
publisher: World Scientific Publishing
publist_id: '7756'
quality_controlled: 0
status: public
title: Resent progress on the quantitative arithmetic of del Pezzo surfaces
type: conference
volume: 6
year: '2009'
...
---
_id: '168'
abstract:
- lang: eng
text: The arithmetic of ternary diagonal equation is considered for degree d >1,
with the outcome that the set of coefficients for which the equation admits a
non-zero integer solution is shown to have density zero.
alternative_title:
- Contemporary Mathematics
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Rainer
full_name: Dietmann, Rainer
last_name: Dietmann
citation:
ama: 'Browning TD, Dietmann R. Solubility of Fermat equations. In: Quadratic
Forms - Algebra, Arithmetic and Geometry. Vol 493. American Mathematical Society;
2009:99-106. doi:http://dx.doi.org/10.1090/conm/493'
apa: Browning, T. D., & Dietmann, R. (2009). Solubility of Fermat equations.
In Quadratic Forms - algebra, arithmetic and geometry (Vol. 493, pp. 99–106).
American Mathematical Society. http://dx.doi.org/10.1090/conm/493
chicago: Browning, Timothy D, and Rainer Dietmann. “Solubility of Fermat Equations.”
In Quadratic Forms - Algebra, Arithmetic and Geometry, 493:99–106. American
Mathematical Society, 2009. http://dx.doi.org/10.1090/conm/493.
ieee: T. D. Browning and R. Dietmann, “Solubility of Fermat equations,” in Quadratic
Forms - algebra, arithmetic and geometry, vol. 493, American Mathematical
Society, 2009, pp. 99–106.
ista: 'Browning TD, Dietmann R. 2009.Solubility of Fermat equations. In: Quadratic
Forms - algebra, arithmetic and geometry. Contemporary Mathematics, vol. 493,
99–106.'
mla: Browning, Timothy D., and Rainer Dietmann. “Solubility of Fermat Equations.”
Quadratic Forms - Algebra, Arithmetic and Geometry, vol. 493, American
Mathematical Society, 2009, pp. 99–106, doi:http://dx.doi.org/10.1090/conm/493.
short: T.D. Browning, R. Dietmann, in:, Quadratic Forms - Algebra, Arithmetic and
Geometry, American Mathematical Society, 2009, pp. 99–106.
date_created: 2018-12-11T11:44:59Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:29Z
day: '01'
doi: http://dx.doi.org/10.1090/conm/493
extern: 1
intvolume: ' 493'
main_file_link:
- open_access: '0'
url: https://arxiv.org/abs/0805.3354
month: '01'
page: 99 - 106
publication: Quadratic Forms - algebra, arithmetic and geometry
publication_status: published
publisher: American Mathematical Society
publist_id: '7753'
quality_controlled: 0
status: public
title: Solubility of Fermat equations
type: book_chapter
volume: 493
year: '2009'
...
---
_id: '1718'
abstract:
- lang: eng
text: Morphogens act as graded positional cues to control cell fate specification
in many developing tissues. This concept, in which a signaling gradient regulates
differential gene expression in a concentration-dependent manner, has received
considerable experimental support. Nevertheless, several recent studies have challenged
the straightforward model of morphogen activity. In particular, the observation
that pattern formation is a dynamic process has raised questions about the influence
of time on morphogen activity. Here we propose that the spatiotemporal dynamics
of the cellular response to a morphogen gradient depend on a combination of temporal
alterations to the morphogen gradient itself, the dynamics of its signal transduction
and downstream interactions between target genes.
acknowledgement: EK is supported by an EMBO LTF, AK by a FEBS fellowship, and JB by
MRC (UK) and the Wellcome Trust
author:
- first_name: Eva
full_name: Kutějová, Eva
last_name: Kutějová
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
- first_name: Anna
full_name: Anna Kicheva
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
citation:
ama: Kutějová E, Briscoe J, Kicheva A. Temporal dynamics of patterning by morphogen
gradients. Current Opinion in Genetics & Development. 2009;19(4):315-322.
doi:10.1016/j.gde.2009.05.004
apa: Kutějová, E., Briscoe, J., & Kicheva, A. (2009). Temporal dynamics of patterning
by morphogen gradients. Current Opinion in Genetics & Development.
Elsevier. https://doi.org/10.1016/j.gde.2009.05.004
chicago: Kutějová, Eva, James Briscoe, and Anna Kicheva. “Temporal Dynamics of Patterning
by Morphogen Gradients.” Current Opinion in Genetics & Development.
Elsevier, 2009. https://doi.org/10.1016/j.gde.2009.05.004.
ieee: E. Kutějová, J. Briscoe, and A. Kicheva, “Temporal dynamics of patterning
by morphogen gradients,” Current Opinion in Genetics & Development,
vol. 19, no. 4. Elsevier, pp. 315–322, 2009.
ista: Kutějová E, Briscoe J, Kicheva A. 2009. Temporal dynamics of patterning by
morphogen gradients. Current Opinion in Genetics & Development. 19(4), 315–322.
mla: Kutějová, Eva, et al. “Temporal Dynamics of Patterning by Morphogen Gradients.”
Current Opinion in Genetics & Development, vol. 19, no. 4, Elsevier,
2009, pp. 315–22, doi:10.1016/j.gde.2009.05.004.
short: E. Kutějová, J. Briscoe, A. Kicheva, Current Opinion in Genetics & Development
19 (2009) 315–322.
date_created: 2018-12-11T11:53:38Z
date_published: 2009-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:44Z
day: '01'
doi: 10.1016/j.gde.2009.05.004
extern: 1
intvolume: ' 19'
issue: '4'
month: '08'
page: 315 - 322
publication: Current Opinion in Genetics & Development
publication_status: published
publisher: Elsevier
publist_id: '5410'
quality_controlled: 0
status: public
title: Temporal dynamics of patterning by morphogen gradients
type: journal_article
volume: 19
year: '2009'
...
---
_id: '1720'
abstract:
- lang: eng
text: How morphogen gradients are formed in target tissues is a key question for
understanding the mechanisms of morphological patterning. Here, we review different
mechanisms of morphogen gradient formation from theoretical and experimental points
of view. First, a simple, comprehensive overview of the underlying biophysical
principles of several mechanisms of gradient formation is provided. We then discuss
the advantages and limitations of different experimental approaches to gradient
formation analysis.
author:
- first_name: Ortrud
full_name: Wartlick, Ortrud
last_name: Wartlick
- first_name: Anna
full_name: Anna Kicheva
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: Marcos
full_name: González-Gaitán, Marcos A
last_name: González Gaitán
citation:
ama: Wartlick O, Kicheva A, González Gaitán M. Morphogen gradient formation . Cold
Spring Harbor perspectives in biology. 2009;1(3). doi:10.1101/cshperspect.a001255
apa: Wartlick, O., Kicheva, A., & González Gaitán, M. (2009). Morphogen gradient
formation . Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor
Laboratory Press. https://doi.org/10.1101/cshperspect.a001255
chicago: Wartlick, Ortrud, Anna Kicheva, and Marcos González Gaitán. “Morphogen
Gradient Formation .” Cold Spring Harbor Perspectives in Biology. Cold
Spring Harbor Laboratory Press, 2009. https://doi.org/10.1101/cshperspect.a001255.
ieee: O. Wartlick, A. Kicheva, and M. González Gaitán, “Morphogen gradient formation
,” Cold Spring Harbor perspectives in biology, vol. 1, no. 3. Cold Spring
Harbor Laboratory Press, 2009.
ista: Wartlick O, Kicheva A, González Gaitán M. 2009. Morphogen gradient formation
. Cold Spring Harbor perspectives in biology. 1(3).
mla: Wartlick, Ortrud, et al. “Morphogen Gradient Formation .” Cold Spring Harbor
Perspectives in Biology, vol. 1, no. 3, Cold Spring Harbor Laboratory Press,
2009, doi:10.1101/cshperspect.a001255.
short: O. Wartlick, A. Kicheva, M. González Gaitán, Cold Spring Harbor Perspectives
in Biology 1 (2009).
date_created: 2018-12-11T11:53:39Z
date_published: 2009-09-01T00:00:00Z
date_updated: 2021-01-12T06:52:45Z
day: '01'
doi: 10.1101/cshperspect.a001255
extern: 1
intvolume: ' 1'
issue: '3'
month: '09'
publication: Cold Spring Harbor perspectives in biology
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
publist_id: '5409'
quality_controlled: 0
status: public
title: 'Morphogen gradient formation '
type: journal_article
volume: 1
year: '2009'
...
---
OA_place: repository
OA_type: green
_id: '18726'
abstract:
- lang: eng
text: The high sensitivity of JWST will open a new window on the end of the cosmological
dark ages. Small stellar clusters, with a stellar mass of several × 106 M⊙, and
low-mass black holes (BHs), with a mass of several $× 105 M⊙ should be directly
detectable out to redshift z = 10, and individual supernovae (SNe) and gamma ray
burst GRB afterglows are bright enough to be visible beyond this redshift. Dense
primordial gas, in the process of collapsing from large scales to form protogalaxies,
may also be possible to image through diffuse recombination line emission, possibly
even before stars or BHs are formed. In this article, I discuss the key physical
processes that are expected to have determined the sizes of the first star–clusters
and black holes, and the prospect of studying these objects by direct detections
with JWST and with other instruments. The direct light emitted by the very first
stellar clusters and intermediate-mass black holes at z > 10 will likely fall
below JWST’s detection threshold. However, JWST could reveal a decline at the
faint-end of the high-redshift luminosity function, and thereby shed light on
radiative and other feedback effects that operate at these early epochs. JWST
will also have the sensitivity to detect individual SNe from beyond z = 10. In
a dedicated survey lasting for several weeks, thousands of SNe could be detected
at z > 6, with a redshift distribution extending to the formation of the very
first stars at z ≳ 15. Using these SNe as tracers may be the only method to map
out the earliest stages of the cosmic star–formation history. Finally, we point
out that studying the earliest objects at high redshift will also offer a new
window on the primordial power spectrum, on ∼100 times smaller scales than probed
by current large-scale structure data.
alternative_title:
- Astrophysics and Space Science Proceedings
article_processing_charge: No
arxiv: 1
author:
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
orcid: 0000-0003-3633-5403
citation:
ama: 'Haiman Z. Observing the first stars and black holes. In: Astrophysics and
Space Science Proceedings. Dordrecht: Springer Nature; 2009:385-418. doi:10.1007/978-1-4020-9457-6_15'
apa: 'Haiman, Z. (2009). Observing the first stars and black holes. In Astrophysics
and Space Science Proceedings (pp. 385–418). Dordrecht: Springer Nature. https://doi.org/10.1007/978-1-4020-9457-6_15'
chicago: 'Haiman, Zoltán. “Observing the First Stars and Black Holes.” In Astrophysics
and Space Science Proceedings, 385–418. Dordrecht: Springer Nature, 2009.
https://doi.org/10.1007/978-1-4020-9457-6_15.'
ieee: Z. Haiman, “Observing the first stars and black holes,” in Astrophysics
and Space Science Proceedings, 2009, pp. 385–418.
ista: Haiman Z. 2009. Observing the first stars and black holes. Astrophysics and
Space Science Proceedings. , Astrophysics and Space Science Proceedings, , 385–418.
mla: Haiman, Zoltán. “Observing the First Stars and Black Holes.” Astrophysics
and Space Science Proceedings, Springer Nature, 2009, pp. 385–418, doi:10.1007/978-1-4020-9457-6_15.
short: Z. Haiman, in:, Astrophysics and Space Science Proceedings, Springer Nature,
Dordrecht, 2009, pp. 385–418.
date_created: 2025-01-03T12:09:18Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2025-01-03T12:14:49Z
day: '01'
doi: 10.1007/978-1-4020-9457-6_15
extern: '1'
external_id:
arxiv:
- '0809.3926'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0809.3926
month: '01'
oa: 1
oa_version: Preprint
page: 385-418
place: Dordrecht
publication: Astrophysics and Space Science Proceedings
publication_identifier:
eisbn:
- '9781402094576'
eissn:
- 1570-6605
isbn:
- '9781402094569'
issn:
- 1570-6591
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Observing the first stars and black holes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
OA_place: repository
OA_type: green
_id: '18735'
abstract:
- lang: eng
text: The high sensitivity of JWST will open a new window on the end of the cosmological
dark ages. Small stellar clusters, with a stellar mass of several × 106 M⊙, and
low-mass black holes (BHs), with a mass of several $× 105 M⊙ should be directly
detectable out to redshift z = 10, and individual supernovae (SNe) and gamma ray
burst GRB afterglows are bright enough to be visible beyond this redshift. Dense
primordial gas, in the process of collapsing from large scales to form protogalaxies,
may also be possible to image through diffuse recombination line emission, possibly
even before stars or BHs are formed. In this article, I discuss the key physical
processes that are expected to have determined the sizes of the first star–clusters
and black holes, and the prospect of studying these objects by direct detections
with JWST and with other instruments. The direct light emitted by the very first
stellar clusters and intermediate-mass black holes at z > 10 will likely fall
below JWST’s detection threshold. However, JWST could reveal a decline at the
faint-end of the high-redshift luminosity function, and thereby shed light on
radiative and other feedback effects that operate at these early epochs. JWST
will also have the sensitivity to detect individual SNe from beyond z = 10. In
a dedicated survey lasting for several weeks, thousands of SNe could be detected
at z > 6, with a redshift distribution extending to the formation of the very
first stars at z ≳ 15. Using these SNe as tracers may be the only method to map
out the earliest stages of the cosmic star–formation history. Finally, we point
out that studying the earliest objects at high redshift will also offer a new
window on the primordial power spectrum, on ∼100 times smaller scales than probed
by current large-scale structure data.
alternative_title:
- Astrophysics and Space Science Proceedings
article_processing_charge: No
arxiv: 1
author:
- first_name: Zoltán
full_name: Haiman, Zoltán
id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
last_name: Haiman
orcid: 0000-0003-3633-5403
citation:
ama: 'Haiman Z. Observing the First Stars and Black Holes. In: Thronson HA, Stiavelli
M, Tielens A, eds. Astrophysics in the Next Decade. Springer Nature; 2009:385-418.
doi:10.1007/978-1-4020-9457-6_15'
apa: Haiman, Z. (2009). Observing the First Stars and Black Holes. In H. A. Thronson,
M. Stiavelli, & A. Tielens (Eds.), Astrophysics in the Next Decade
(pp. 385–418). Springer Nature. https://doi.org/10.1007/978-1-4020-9457-6_15
chicago: Haiman, Zoltán. “Observing the First Stars and Black Holes.” In Astrophysics
in the Next Decade, edited by Harley A. Thronson, Massimo Stiavelli, and Alexander
Tielens, 385–418. Springer Nature, 2009. https://doi.org/10.1007/978-1-4020-9457-6_15.
ieee: Z. Haiman, “Observing the First Stars and Black Holes,” in Astrophysics
in the Next Decade, H. A. Thronson, M. Stiavelli, and A. Tielens, Eds. Springer
Nature, 2009, pp. 385–418.
ista: 'Haiman Z. 2009.Observing the First Stars and Black Holes. In: Astrophysics
in the Next Decade. Astrophysics and Space Science Proceedings, , 385–418.'
mla: Haiman, Zoltán. “Observing the First Stars and Black Holes.” Astrophysics
in the Next Decade, edited by Harley A. Thronson et al., Springer Nature,
2009, pp. 385–418, doi:10.1007/978-1-4020-9457-6_15.
short: Z. Haiman, in:, H.A. Thronson, M. Stiavelli, A. Tielens (Eds.), Astrophysics
in the Next Decade, Springer Nature, 2009, pp. 385–418.
date_created: 2025-01-03T12:29:16Z
date_published: 2009-02-11T00:00:00Z
date_updated: 2025-01-07T12:52:13Z
day: '11'
doi: 10.1007/978-1-4020-9457-6_15
editor:
- first_name: Harley A.
full_name: Thronson, Harley A.
last_name: Thronson
- first_name: Massimo
full_name: Stiavelli, Massimo
last_name: Stiavelli
- first_name: Alexander
full_name: Tielens, Alexander
last_name: Tielens
extern: '1'
external_id:
arxiv:
- '0809.3926'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0809.3926
month: '02'
oa: 1
oa_version: Preprint
page: 385-418
publication: Astrophysics in the Next Decade
publication_identifier:
eisbn:
- '9781402094576'
eissn:
- 1570-6605
isbn:
- '9781402094569'
issn:
- 1570-6591
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Observing the First Stars and Black Holes
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '1971'
abstract:
- lang: eng
text: Complex I plays a central role in cellular energy production, coupling electron
transfer between NADH and quinone to proton translocation. The mechanism of this
highly efficient enzyme is currently unknown. Mitochondrial complex I is a major
source of reactive oxygen species, which may be one of the causes of aging. Dysfunction
of complex I is implicated in many human neurodegenerative diseases. We have determined
several x-ray structures of the oxidized and reduced hydrophilic domain of complex
I from Thermus thermophilus at up to 3.1 Å resolution. The structures reveal the
mode of interaction of complex I with NADH, explaining known kinetic data and
providing implications for the mechanism of reactive oxygen species production
at the flavin site of complex I. Bound metals were identified in the channel at
the interface with the frataxin-like subunit Nqo15, indicating possible iron-binding
sites. Conformational changes upon reduction of the complex involve adjustments
in the nucleotide-binding pocket, as well as small but significant shifts of several
α-helices at the interface with the membrane domain. These shifts are likely to
be driven by the reduction of nearby iron-sulfur clusters N2 and N6a/b. Cluster
N2 is the electron donor to quinone and is coordinated by unique motif involving
two consecutive (tandem) cysteines. An unprecedented "on/off switch"
(disconnection) of coordinating bonds between the tandem cysteines and this cluster
was observed upon reduction. Comparison of the structures suggests a novel mechanism
of coupling between electron transfer and proton translocation, combining conformational
changes and protonation/deprotonation of tandem cysteines.
acknowledgement: 'This work was supported by the Medical Research Council. '
author:
- first_name: John
full_name: Berrisford, John M
last_name: Berrisford
- first_name: Leonid A
full_name: Leonid Sazanov
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Berrisford J, Sazanov LA. Structural basis for the mechanism of respiratory
complex I. Journal of Biological Chemistry. 2009;284(43):29773-29783. doi:10.1074/jbc.M109.032144
apa: Berrisford, J., & Sazanov, L. A. (2009). Structural basis for the mechanism
of respiratory complex I. Journal of Biological Chemistry. American Society
for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M109.032144
chicago: Berrisford, John, and Leonid A Sazanov. “Structural Basis for the Mechanism
of Respiratory Complex I.” Journal of Biological Chemistry. American Society
for Biochemistry and Molecular Biology, 2009. https://doi.org/10.1074/jbc.M109.032144.
ieee: J. Berrisford and L. A. Sazanov, “Structural basis for the mechanism of respiratory
complex I,” Journal of Biological Chemistry, vol. 284, no. 43. American
Society for Biochemistry and Molecular Biology, pp. 29773–29783, 2009.
ista: Berrisford J, Sazanov LA. 2009. Structural basis for the mechanism of respiratory
complex I. Journal of Biological Chemistry. 284(43), 29773–29783.
mla: Berrisford, John, and Leonid A. Sazanov. “Structural Basis for the Mechanism
of Respiratory Complex I.” Journal of Biological Chemistry, vol. 284, no.
43, American Society for Biochemistry and Molecular Biology, 2009, pp. 29773–83,
doi:10.1074/jbc.M109.032144.
short: J. Berrisford, L.A. Sazanov, Journal of Biological Chemistry 284 (2009) 29773–29783.
date_created: 2018-12-11T11:54:59Z
date_published: 2009-10-23T00:00:00Z
date_updated: 2021-01-12T06:54:26Z
day: '23'
doi: 10.1074/jbc.M109.032144
extern: 1
intvolume: ' 284'
issue: '43'
month: '10'
page: 29773 - 29783
publication: Journal of Biological Chemistry
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '5114'
quality_controlled: 0
status: public
title: Structural basis for the mechanism of respiratory complex I
type: journal_article
volume: 284
year: '2009'
...
---
_id: '4357'
abstract:
- lang: eng
text: Parallel evolution is the acquisition of identical adaptive traits in independently
evolving populations. Understanding whether the genetic changes underlying adaptation
to a common selective environment are parallel within and between species is interesting
because it sheds light on the degree of evolutionary constraints. If parallel
evolution is perfect, then the implication is that forces such as functional constraints,
epistasis, and pleiotropy play an important role in shaping the outcomes of adaptive
evolution. In addition, population genetic theory predicts that the probability
of parallel evolution will decline with an increase in the number of adaptive
solutions-if a single adaptive solution exists, then parallel evolution will be
observed among highly divergent species. For this reason, it is predicted that
close relatives-which likely overlap more in the details of their adaptive solutions-will
show more parallel evolution. By adapting three related bacteriophage species
to a novel environment we find (1) a high rate of parallel genetic evolution at
orthologous nucleotide and amino acid residues within species, (2) parallel beneficial
mutations do not occur in a common order in which they fix or appear in an evolving
population, (3) low rates of parallel evolution and convergent evolution between
species, and (4) the probability of parallel and convergent evolution between
species is strongly effected by divergence.
author:
- first_name: Jonathan P
full_name: Jonathan Bollback
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: John
full_name: Huelsenbeck, John P
last_name: Huelsenbeck
citation:
ama: Bollback JP, Huelsenbeck J. Parallel genetic evolution within and between bacteriophage
species of varying degrees of divergence. Genetics. 2009;181(1):225-234.
doi:10.1534/genetics.107.085225
apa: Bollback, J. P., & Huelsenbeck, J. (2009). Parallel genetic evolution within
and between bacteriophage species of varying degrees of divergence. Genetics.
Genetics Society of America. https://doi.org/10.1534/genetics.107.085225
chicago: Bollback, Jonathan P, and John Huelsenbeck. “Parallel Genetic Evolution
within and between Bacteriophage Species of Varying Degrees of Divergence.” Genetics.
Genetics Society of America, 2009. https://doi.org/10.1534/genetics.107.085225.
ieee: J. P. Bollback and J. Huelsenbeck, “Parallel genetic evolution within and
between bacteriophage species of varying degrees of divergence,” Genetics,
vol. 181, no. 1. Genetics Society of America, pp. 225–234, 2009.
ista: Bollback JP, Huelsenbeck J. 2009. Parallel genetic evolution within and between
bacteriophage species of varying degrees of divergence. Genetics. 181(1), 225–234.
mla: Bollback, Jonathan P., and John Huelsenbeck. “Parallel Genetic Evolution within
and between Bacteriophage Species of Varying Degrees of Divergence.” Genetics,
vol. 181, no. 1, Genetics Society of America, 2009, pp. 225–34, doi:10.1534/genetics.107.085225.
short: J.P. Bollback, J. Huelsenbeck, Genetics 181 (2009) 225–234.
date_created: 2018-12-11T12:08:26Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T07:56:22Z
day: '01'
doi: 10.1534/genetics.107.085225
extern: 1
intvolume: ' 181'
issue: '1'
month: '01'
page: 225 - 234
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '1101'
quality_controlled: 0
status: public
title: Parallel genetic evolution within and between bacteriophage species of varying
degrees of divergence
type: journal_article
volume: 181
year: '2009'
...
---
_id: '4360'
abstract:
- lang: eng
text: 'Motivated by applications in software verification, we explore automated
reasoning about the non-disjoint combination of theories of infinitely many finite
structures, where the theories share set variables and set operations. We prove
a combination theorem and apply it to show the decidability of the satisfiability
problem for a class of formulas obtained by applying propositional connectives
to formulas belonging to: 1) Boolean Algebra with Presburger Arithmetic (with
quantifiers over sets and integers), 2) weak monadic second-order logic over trees
(with monadic second-order quantifiers), 3) two-variable logic with counting quantifiers
(ranging over elements), 4) the Bernays-Schönfinkel-Ramsey class of first-order
logic with equality (with ∃ * ∀ * quantifier prefix), and 5) the quantifier-free
logic of multisets with cardinality constraints.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Ruzica
full_name: Piskac, Ruzica
last_name: Piskac
- first_name: Viktor
full_name: Kuncak, Viktor
last_name: Kuncak
citation:
ama: 'Wies T, Piskac R, Kuncak V. Combining theories with shared set operations.
In: 7th International Symposium on Frontiers of Combining Systems. Vol
5749. Springer; 2009:366-382. doi:10.1007/978-3-642-04222-5_23'
apa: 'Wies, T., Piskac, R., & Kuncak, V. (2009). Combining theories with shared
set operations. In 7th International Symposium on Frontiers of Combining Systems
(Vol. 5749, pp. 366–382). Trento, Italy: Springer. https://doi.org/10.1007/978-3-642-04222-5_23'
chicago: Wies, Thomas, Ruzica Piskac, and Viktor Kuncak. “Combining Theories with
Shared Set Operations.” In 7th International Symposium on Frontiers of Combining
Systems, 5749:366–82. Springer, 2009. https://doi.org/10.1007/978-3-642-04222-5_23.
ieee: T. Wies, R. Piskac, and V. Kuncak, “Combining theories with shared set operations,”
in 7th International Symposium on Frontiers of Combining Systems, Trento,
Italy, 2009, vol. 5749, pp. 366–382.
ista: 'Wies T, Piskac R, Kuncak V. 2009. Combining theories with shared set operations.
7th International Symposium on Frontiers of Combining Systems. FroCoS: Frontiers
of Combining Systems, LNCS, vol. 5749, 366–382.'
mla: Wies, Thomas, et al. “Combining Theories with Shared Set Operations.” 7th
International Symposium on Frontiers of Combining Systems, vol. 5749, Springer,
2009, pp. 366–82, doi:10.1007/978-3-642-04222-5_23.
short: T. Wies, R. Piskac, V. Kuncak, in:, 7th International Symposium on Frontiers
of Combining Systems, Springer, 2009, pp. 366–382.
conference:
end_date: 2009-09-18
location: Trento, Italy
name: 'FroCoS: Frontiers of Combining Systems'
start_date: 2009-09-16
date_created: 2018-12-11T12:08:27Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2025-07-02T06:21:09Z
day: '01'
doi: 10.1007/978-3-642-04222-5_23
extern: '1'
intvolume: ' 5749'
language:
- iso: eng
month: '01'
oa_version: None
page: 366 - 382
publication: 7th International Symposium on Frontiers of Combining Systems
publication_status: published
publisher: Springer
publist_id: '1098'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Combining theories with shared set operations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5749
year: '2009'
...
---
_id: '4363'
author:
- first_name: Vasu
full_name: Vasu Singh
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: Singh V. Formalizing and Verifying Transactional Memories. Formalizing and
Verifying Transactional Memories. 2009.
apa: Singh, V. (2009). Formalizing and Verifying Transactional Memories.
Formalizing and Verifying Transactional Memories. EPFL Lausanne.
chicago: Singh, Vasu. “Formalizing and Verifying Transactional Memories.” Formalizing
and Verifying Transactional Memories. EPFL Lausanne, 2009.
ieee: V. Singh, “Formalizing and Verifying Transactional Memories,” EPFL Lausanne,
2009.
ista: Singh V. 2009. Formalizing and Verifying Transactional Memories. EPFL Lausanne.
mla: Singh, Vasu. “Formalizing and Verifying Transactional Memories.” Formalizing
and Verifying Transactional Memories, EPFL Lausanne, 2009.
short: V. Singh, Formalizing and Verifying Transactional Memories, EPFL Lausanne,
2009.
date_created: 2018-12-11T12:08:28Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T07:56:25Z
day: '01'
extern: 1
month: '01'
publication: Formalizing and Verifying Transactional Memories
publication_status: published
publisher: EPFL Lausanne
publist_id: '1095'
quality_controlled: 0
status: public
title: Formalizing and Verifying Transactional Memories
type: dissertation
year: '2009'
...
---
_id: '4365'
abstract:
- lang: eng
text: We present an abstraction refinement technique for the verification of universally
quantified array assertions such as “all elements in the array are sorted”. Our
technique can be seamlessly combined with existing software model checking algorithms.
We implemented our technique in the ACSAR software model checker and successfully
verified quantified array assertions for both text book examples and real-life
examples taken from the Linux operating system kernel.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Mohamed
full_name: Seghir, Mohamed
last_name: Seghir
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: 'Seghir M, Podelski A, Wies T. Abstraction refinement for quantified array
assertions. In: 16th International Symposium on Static Analysis. Vol 5673.
Springer; 2009:3-18. doi:10.1007/978-3-642-03237-0_3'
apa: 'Seghir, M., Podelski, A., & Wies, T. (2009). Abstraction refinement for
quantified array assertions. In 16th International Symposium on Static Analysis
(Vol. 5673, pp. 3–18). Los Angeles, CA, United States: Springer. https://doi.org/10.1007/978-3-642-03237-0_3'
chicago: Seghir, Mohamed, Andreas Podelski, and Thomas Wies. “Abstraction Refinement
for Quantified Array Assertions.” In 16th International Symposium on Static
Analysis, 5673:3–18. Springer, 2009. https://doi.org/10.1007/978-3-642-03237-0_3.
ieee: M. Seghir, A. Podelski, and T. Wies, “Abstraction refinement for quantified
array assertions,” in 16th International Symposium on Static Analysis,
Los Angeles, CA, United States, 2009, vol. 5673, pp. 3–18.
ista: 'Seghir M, Podelski A, Wies T. 2009. Abstraction refinement for quantified
array assertions. 16th International Symposium on Static Analysis. SAS: Static
Analysis Symposium, LNCS, vol. 5673, 3–18.'
mla: Seghir, Mohamed, et al. “Abstraction Refinement for Quantified Array Assertions.”
16th International Symposium on Static Analysis, vol. 5673, Springer, 2009,
pp. 3–18, doi:10.1007/978-3-642-03237-0_3.
short: M. Seghir, A. Podelski, T. Wies, in:, 16th International Symposium on Static
Analysis, Springer, 2009, pp. 3–18.
conference:
end_date: 2009-08-11
location: Los Angeles, CA, United States
name: 'SAS: Static Analysis Symposium'
start_date: 2009-08-09
date_created: 2018-12-11T12:08:29Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2025-07-02T06:45:01Z
day: '01'
doi: 10.1007/978-3-642-03237-0_3
extern: '1'
intvolume: ' 5673'
language:
- iso: eng
month: '01'
oa_version: None
page: 3 - 18
publication: 16th International Symposium on Static Analysis
publication_status: published
publisher: Springer
publist_id: '1094'
status: public
title: Abstraction refinement for quantified array assertions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5673
year: '2009'
...
---
_id: '4375'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shuvendu
full_name: Lahiri, Shuvendu
last_name: Lahiri
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Juan
full_name: Galeotti, Juan
last_name: Galeotti
- first_name: Jan
full_name: Voung, Jan
last_name: Voung
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: 'Lahiri S, Qadeer S, Galeotti J, Voung J, Wies T. Intra-module inference. In:
21st International Conference on Computer Aided Verification. Vol 5643.
Springer; 2009:493-508. doi:10.1007/978-3-642-02658-4_37'
apa: 'Lahiri, S., Qadeer, S., Galeotti, J., Voung, J., & Wies, T. (2009). Intra-module
inference. In 21st International Conference on Computer Aided Verification
(Vol. 5643, pp. 493–508). Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-02658-4_37'
chicago: Lahiri, Shuvendu, Shaz Qadeer, Juan Galeotti, Jan Voung, and Thomas Wies.
“Intra-Module Inference.” In 21st International Conference on Computer Aided
Verification, 5643:493–508. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_37.
ieee: S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, and T. Wies, “Intra-module inference,”
in 21st International Conference on Computer Aided Verification, Grenoble,
France, 2009, vol. 5643, pp. 493–508.
ista: 'Lahiri S, Qadeer S, Galeotti J, Voung J, Wies T. 2009. Intra-module inference.
21st International Conference on Computer Aided Verification. CAV: Computer Aided
Verification, LNCS, vol. 5643, 493–508.'
mla: Lahiri, Shuvendu, et al. “Intra-Module Inference.” 21st International Conference
on Computer Aided Verification, vol. 5643, Springer, 2009, pp. 493–508, doi:10.1007/978-3-642-02658-4_37.
short: S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, T. Wies, in:, 21st International
Conference on Computer Aided Verification, Springer, 2009, pp. 493–508.
conference:
end_date: 2009-07-02
location: Grenoble, France
name: 'CAV: Computer Aided Verification'
start_date: 2009-06-26
date_created: 2018-12-11T12:08:32Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2025-07-02T06:41:41Z
day: '01'
doi: 10.1007/978-3-642-02658-4_37
extern: '1'
intvolume: ' 5643'
language:
- iso: eng
month: '01'
oa_version: None
page: 493 - 508
publication: 21st International Conference on Computer Aided Verification
publication_identifier:
eisbn:
- 978-3-642-02658-4
publication_status: published
publisher: Springer
publist_id: '1082'
status: public
title: Intra-module inference
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5643
year: '2009'
...
---
_id: '4376'
abstract:
- lang: eng
text: "We present Chorus, a high-level parallel programming model suitable for irregular,
heap-manipulating applications like mesh refinement and epidemic simulations,
and JChorus, an implementation of the model on top of Java. One goal of Chorus
is to express the dynamic and instance-dependent patterns of memory access that
are common in typical irregular applications. Its other focus is locality of effects:
the property that in many of the same applications, typical imperative commands
only affect small, local regions in the shared heap.\r\nChorus addresses dynamism
and locality through the unifying abstraction of an object assembly: a local region
in a shared data structure equipped with a short-lived, speculative thread of
control. The thread of control in an assembly can only access objects within the
assembly. While objects can migrate from assembly to assembly, such migration
is local--i.e., objects only move from one assembly to a neighboring one--and
does not lead to aliasing. Programming primitives include a merge operation, by
which an assembly merges with an adjacent assembly, and a split operation, which
splits an assembly into smaller ones. Our abstractions are race and deadlock-free,
and inherently data-centric.\r\nWe demonstrate that Chorus and JChorus allow natural
programming of several important applications exhibiting irregular data-parallelism.
We also present an implementation of JChorus based on a many-to-one mapping of
assemblies to lower-level threads, and report on preliminary performance numbers."
article_processing_charge: No
author:
- first_name: Roberto
full_name: Lublinerman, Roberto
last_name: Lublinerman
- first_name: Swarat
full_name: Chaudhuri, Swarat
last_name: Chaudhuri
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
citation:
ama: Lublinerman R, Chaudhuri S, Cerny P. Parallel programming with object assemblies.
ACM SIGPLAN Notices. 2009;44(10):61-80. doi:10.1145/1639949.164009
apa: Lublinerman, R., Chaudhuri, S., & Cerny, P. (2009). Parallel programming
with object assemblies. ACM SIGPLAN Notices. ACM. https://doi.org/10.1145/1639949.164009
chicago: Lublinerman, Roberto, Swarat Chaudhuri, and Pavol Cerny. “Parallel Programming
with Object Assemblies.” ACM SIGPLAN Notices. ACM, 2009. https://doi.org/10.1145/1639949.164009.
ieee: R. Lublinerman, S. Chaudhuri, and P. Cerny, “Parallel programming with object
assemblies,” ACM SIGPLAN Notices, vol. 44, no. 10. ACM, pp. 61–80, 2009.
ista: Lublinerman R, Chaudhuri S, Cerny P. 2009. Parallel programming with object
assemblies. ACM SIGPLAN Notices. 44(10), 61–80.
mla: Lublinerman, Roberto, et al. “Parallel Programming with Object Assemblies.”
ACM SIGPLAN Notices, vol. 44, no. 10, ACM, 2009, pp. 61–80, doi:10.1145/1639949.164009.
short: R. Lublinerman, S. Chaudhuri, P. Cerny, ACM SIGPLAN Notices 44 (2009) 61–80.
date_created: 2018-12-11T12:08:32Z
date_published: 2009-10-25T00:00:00Z
date_updated: 2025-07-02T06:17:51Z
day: '25'
doi: 10.1145/1639949.164009
extern: '1'
intvolume: ' 44'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 61 - 80
publication: ACM SIGPLAN Notices
publication_status: published
publisher: ACM
publist_id: '1083'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parallel programming with object assemblies
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 44
year: '2009'
...
---
_id: '4377'
abstract:
- lang: eng
text: Programming errors found early are the cheapest. Tools applying to the early
stage of code development exist but either they suffer from false positives (“noise”)
or they require strong user interaction. We propose to avoid this deficiency by
defining a new class of errors. A program fragment is doomed if its execution
will inevitably fail, in whatever state it is started. We use a formal verification
method to identify such errors fully automatically and, most significantly, without
producing noise. We report on preliminary experiments with a prototype tool.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jochen
full_name: Hoenicke, Jochen
last_name: Hoenicke
- first_name: K Rustan
full_name: Leino, K Rustan
last_name: Leino
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Martin
full_name: Schäf, Martin
last_name: Schäf
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: 'Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. It’s doomed; we can prove
it. In: Second World Congress on Formal Methods. Vol 5850. Springer; 2009:338-353.
doi:10.1007/978-3-642-05089-3_22'
apa: 'Hoenicke, J., Leino, K. R., Podelski, A., Schäf, M., & Wies, T. (2009).
It’s doomed; we can prove it. In Second World Congress on Formal Methods
(Vol. 5850, pp. 338–353). Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/978-3-642-05089-3_22'
chicago: Hoenicke, Jochen, K Rustan Leino, Andreas Podelski, Martin Schäf, and Thomas
Wies. “It’s Doomed; We Can Prove It.” In Second World Congress on Formal Methods,
5850:338–53. Springer, 2009. https://doi.org/10.1007/978-3-642-05089-3_22.
ieee: J. Hoenicke, K. R. Leino, A. Podelski, M. Schäf, and T. Wies, “It’s doomed;
we can prove it,” in Second World Congress on Formal Methods, Eindhoven,
The Netherlands, 2009, vol. 5850, pp. 338–353.
ista: 'Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. 2009. It’s doomed; we
can prove it. Second World Congress on Formal Methods. FM: Formal Methods, LNCS,
vol. 5850, 338–353.'
mla: Hoenicke, Jochen, et al. “It’s Doomed; We Can Prove It.” Second World Congress
on Formal Methods, vol. 5850, Springer, 2009, pp. 338–53, doi:10.1007/978-3-642-05089-3_22.
short: J. Hoenicke, K.R. Leino, A. Podelski, M. Schäf, T. Wies, in:, Second World
Congress on Formal Methods, Springer, 2009, pp. 338–353.
conference:
end_date: 2009-11-06
location: Eindhoven, The Netherlands
name: 'FM: Formal Methods'
start_date: 2009-11-02
date_created: 2018-12-11T12:08:32Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2025-07-02T06:38:22Z
day: '01'
doi: 10.1007/978-3-642-05089-3_22
extern: '1'
intvolume: ' 5850'
language:
- iso: eng
month: '01'
oa_version: None
page: 338 - 353
publication: Second World Congress on Formal Methods
publication_status: published
publisher: Springer
publist_id: '1079'
quality_controlled: '1'
scopus_import: '1'
status: public
title: It's doomed; we can prove it
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5850
year: '2009'
...
---
_id: '4383'
abstract:
- lang: eng
text: Pseudo-code descriptions of STMs assume sequentially consistent program execution
and atomicity of high-level STM operations like read, write, and commit. These
assumptions are often violated in realistic settings, as STM implementations run
on relaxed memory models, with the atomicity of operations as provided by the
hardware. This paper presents the first approach to verify STMs under relaxed
memory models with atomicity of 32 bit loads and stores, and read-modify-write
operations. We present RML, a new high-level language for expressing concurrent
algorithms with a hardware-level atomicity of instructions, and whose semantics
is parametrized by various relaxed memory models. We then present our tool, FOIL,
which takes as input the RML description of an STM algorithm and the description
of a memory model, and automatically determines the locations of fences, which
if inserted, ensure the correctness of the STM algorithm under the given memory
model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of
sequential consistency, total store order, partial store order, and relaxed memory
order.
acknowledgement: This research was supported by the Swiss National Science Foundation.
alternative_title:
- LNCS
author:
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Vasu
full_name: Vasu Singh
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Guerraoui R, Henzinger TA, Singh V. Software transactional memory on relaxed
memory models. In: Vol 5643. Springer; 2009:321-336. doi:10.1007/978-3-642-02658-4_26'
apa: 'Guerraoui, R., Henzinger, T. A., & Singh, V. (2009). Software transactional
memory on relaxed memory models (Vol. 5643, pp. 321–336). Presented at the CAV:
Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-642-02658-4_26'
chicago: Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Software Transactional
Memory on Relaxed Memory Models,” 5643:321–36. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_26.
ieee: 'R. Guerraoui, T. A. Henzinger, and V. Singh, “Software transactional memory
on relaxed memory models,” presented at the CAV: Computer Aided Verification,
2009, vol. 5643, pp. 321–336.'
ista: 'Guerraoui R, Henzinger TA, Singh V. 2009. Software transactional memory on
relaxed memory models. CAV: Computer Aided Verification, LNCS, vol. 5643, 321–336.'
mla: Guerraoui, Rachid, et al. Software Transactional Memory on Relaxed Memory
Models. Vol. 5643, Springer, 2009, pp. 321–36, doi:10.1007/978-3-642-02658-4_26.
short: R. Guerraoui, T.A. Henzinger, V. Singh, in:, Springer, 2009, pp. 321–336.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2018-12-11T12:08:34Z
date_published: 2009-06-19T00:00:00Z
date_updated: 2021-01-12T07:56:34Z
day: '19'
doi: 10.1007/978-3-642-02658-4_26
extern: 1
file:
- access_level: open_access
checksum: df3c3e6306afd3f630a9146f91642f0a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:50Z
date_updated: 2020-07-14T12:46:28Z
file_id: '5105'
file_name: IST-2012-45-v1+1_Software_transactional_memory_on_relaxed_memory_models.pdf
file_size: 265763
relation: main_file
file_date_updated: 2020-07-14T12:46:28Z
intvolume: ' 5643'
month: '06'
oa: 1
page: 321 - 336
publication_status: published
publisher: Springer
publist_id: '1074'
pubrep_id: '45'
quality_controlled: 0
status: public
title: Software transactional memory on relaxed memory models
type: conference
volume: 5643
year: '2009'
...
---
_id: '4385'
abstract:
- lang: eng
text: "Transactional memories are typically speculative and rely on contention managers
to cure conflicts. This paper explores a complementary approach that prevents
conflicts by scheduling transactions according to predictions on their access
sets.\r\nWe first explore the theoretical boundaries of this approach and prove
that (1) a TM scheduler with an accurate prediction can be 2-competitive with
an optimal offline TM scheduler, but (2) even a slight inaccuracy in prediction
makes the competitive ratio of the TM scheduler in the order of the number of
transactions.\r\nWe then show that, in practice, there is room for a pragmatic
approach with good average case performance. We present Shrink, a scheduler that
(1) bases its prediction of transactional accesses on the access patterns of the
past transactions from the same thread, and (2) uses a novel heuristic, which
we call serialization affinity, to schedule transactions with a probability proportional
to the current amount of contention. Shrink obtains roughly 70% accurate read
and write access predictions on STMBench7 and STAMP. In our experimental evaluation,
Shrink significantly improves STM performance in cases the number of executing
threads is higher than the number of available CPU cores. For SwissTM, Shrink
improves the performance by up to 55% on STMBench7, and up to 120% on STAMP. For
TinySTM, Shrink drastically improves the performance on STMBench7 and STAMP benchmarks."
article_processing_charge: No
author:
- first_name: Aleksandar
full_name: Dragojevic, Aleksandar
last_name: Dragojevic
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Anmol
full_name: Singh, Anmol
last_name: Singh
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Dragojevic A, Guerraoui R, Singh A, Singh V. Preventing versus curing: Avoiding
conflicts in transactional memories. In: Proceedings of the 28th ACM Symposium
on Principles of Distributed Computing. ACM; 2009:7-16. doi:10.1145/1582716.1582725'
apa: 'Dragojevic, A., Guerraoui, R., Singh, A., & Singh, V. (2009). Preventing
versus curing: Avoiding conflicts in transactional memories. In Proceedings
of the 28th ACM symposium on Principles of distributed computing (pp. 7–16).
Calgary, Canada: ACM. https://doi.org/10.1145/1582716.1582725'
chicago: 'Dragojevic, Aleksandar, Rachid Guerraoui, Anmol Singh, and Vasu Singh.
“Preventing versus Curing: Avoiding Conflicts in Transactional Memories.” In Proceedings
of the 28th ACM Symposium on Principles of Distributed Computing, 7–16. ACM,
2009. https://doi.org/10.1145/1582716.1582725.'
ieee: 'A. Dragojevic, R. Guerraoui, A. Singh, and V. Singh, “Preventing versus curing:
Avoiding conflicts in transactional memories,” in Proceedings of the 28th ACM
symposium on Principles of distributed computing, Calgary, Canada, 2009, pp.
7–16.'
ista: 'Dragojevic A, Guerraoui R, Singh A, Singh V. 2009. Preventing versus curing:
Avoiding conflicts in transactional memories. Proceedings of the 28th ACM symposium
on Principles of distributed computing. POPL: Principles of Programming Languages,
7–16.'
mla: 'Dragojevic, Aleksandar, et al. “Preventing versus Curing: Avoiding Conflicts
in Transactional Memories.” Proceedings of the 28th ACM Symposium on Principles
of Distributed Computing, ACM, 2009, pp. 7–16, doi:10.1145/1582716.1582725.'
short: A. Dragojevic, R. Guerraoui, A. Singh, V. Singh, in:, Proceedings of the
28th ACM Symposium on Principles of Distributed Computing, ACM, 2009, pp. 7–16.
conference:
end_date: 2009-08-12
location: Calgary, Canada
name: 'POPL: Principles of Programming Languages'
start_date: 2009-08-10
date_created: 2018-12-11T12:08:35Z
date_published: 2009-08-10T00:00:00Z
date_updated: 2025-07-02T06:35:49Z
day: '10'
doi: 10.1145/1582716.1582725
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 7 - 16
publication: Proceedings of the 28th ACM symposium on Principles of distributed computing
publication_status: published
publisher: ACM
publist_id: '1070'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Preventing versus curing: Avoiding conflicts in transactional memories'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '4391'
abstract:
- lang: eng
text: We address the problem of analyzing programs such as J2ME midlets for mobile
devices, where a central correctness requirement concerns confidentiality of data
that the user wants to keep secret. Existing software model checking tools analyze
individual program executions, and are not applicable to checking confidentiality
properties that require reasoning about equivalence among executions. We develop
an automated analysis technique for such properties. We show that both over- and
under- approximation is needed for sound analysis. Given a program and a confidentiality
requirement, our technique produces a formula that is satisfiable if the requirement
holds. We evaluate the approach by analyzing bytecode of a set of Java (J2ME)
methods.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
citation:
ama: 'Cerny P, Alur R. Automated analysis of Java methods for confidentiality. In:
21st International Conference on Computer Aided Verification. Vol 5643.
Springer; 2009:173-187. doi:10.1007/978-3-642-02658-4_16'
apa: Cerny, P., & Alur, R. (2009). Automated analysis of Java methods for confidentiality.
In 21st International Conference on Computer Aided Verification (Vol. 5643,
pp. 173–187). Springer. https://doi.org/10.1007/978-3-642-02658-4_16
chicago: Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for
Confidentiality.” In 21st International Conference on Computer Aided Verification,
5643:173–87. Springer, 2009. https://doi.org/10.1007/978-3-642-02658-4_16.
ieee: P. Cerny and R. Alur, “Automated analysis of Java methods for confidentiality,”
in 21st International Conference on Computer Aided Verification, 2009,
vol. 5643, pp. 173–187.
ista: 'Cerny P, Alur R. 2009. Automated analysis of Java methods for confidentiality.
21st International Conference on Computer Aided Verification. CAV: Computer Aided
Verification, LNCS, vol. 5643, 173–187.'
mla: Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality.”
21st International Conference on Computer Aided Verification, vol. 5643,
Springer, 2009, pp. 173–87, doi:10.1007/978-3-642-02658-4_16.
short: P. Cerny, R. Alur, in:, 21st International Conference on Computer Aided Verification,
Springer, 2009, pp. 173–187.
conference:
name: 'CAV: Computer Aided Verification'
date_created: 2018-12-11T12:08:36Z
date_published: 2009-07-01T00:00:00Z
date_updated: 2025-07-02T06:32:32Z
day: '01'
doi: 10.1007/978-3-642-02658-4_16
extern: '1'
intvolume: ' 5643'
language:
- iso: eng
month: '07'
oa_version: None
page: 173 - 187
publication: 21st International Conference on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '1067'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Automated analysis of Java methods for confidentiality
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5643
year: '2009'
...