---
_id: '5771'
abstract:
- lang: eng
text: Retroviruses such as HIV-1 assemble and bud from infected cells in an immature,
non-infectious form. Subsequently, a series of proteolytic cleavages catalysed
by the viral protease leads to a spectacular structural rearrangement of the viral
particle into a mature form that is competent to fuse with and infect a new cell.
Maturation involves changes in the structures of protein domains, in the interactions
between protein domains, and in the architecture of the viral components that
are assembled by the proteins. Tight control of proteolytic cleavages at different
sites is required for successful maturation, and the process is a major target
of antiretroviral drugs. Here we will describe what is known about the structures
of immature and mature retrovirus particles, and about the maturation process
by which one transitions into the other. Despite a wealth of available data, fundamental
questions about retroviral maturation remain unanswered.
author:
- first_name: Simone
full_name: Mattei, Simone
last_name: Mattei
- first_name: Florian
full_name: Schur, Florian
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: John AG
full_name: Briggs, John AG
last_name: Briggs
citation:
ama: Mattei S, Schur FK, Briggs JA. Retrovirus maturation—an extraordinary structural
transformation. Current Opinion in Virology. 2016;18(6):27-35. doi:10.1016/j.coviro.2016.02.008
apa: Mattei, S., Schur, F. K., & Briggs, J. A. (2016). Retrovirus maturation—an
extraordinary structural transformation. Current Opinion in Virology. Elsevier.
https://doi.org/10.1016/j.coviro.2016.02.008
chicago: Mattei, Simone, Florian KM Schur, and John AG Briggs. “Retrovirus Maturation—an
Extraordinary Structural Transformation.” Current Opinion in Virology.
Elsevier, 2016. https://doi.org/10.1016/j.coviro.2016.02.008.
ieee: S. Mattei, F. K. Schur, and J. A. Briggs, “Retrovirus maturation—an extraordinary
structural transformation,” Current Opinion in Virology, vol. 18, no. 6.
Elsevier, pp. 27–35, 2016.
ista: Mattei S, Schur FK, Briggs JA. 2016. Retrovirus maturation—an extraordinary
structural transformation. Current Opinion in Virology. 18(6), 27–35.
mla: Mattei, Simone, et al. “Retrovirus Maturation—an Extraordinary Structural Transformation.”
Current Opinion in Virology, vol. 18, no. 6, Elsevier, 2016, pp. 27–35,
doi:10.1016/j.coviro.2016.02.008.
short: S. Mattei, F.K. Schur, J.A. Briggs, Current Opinion in Virology 18 (2016)
27–35.
date_created: 2018-12-20T21:13:59Z
date_published: 2016-03-22T00:00:00Z
date_updated: 2021-01-12T08:03:22Z
day: '22'
ddc:
- '570'
doi: 10.1016/j.coviro.2016.02.008
extern: '1'
file:
- access_level: open_access
checksum: 320939d28ebd1adfb122338019892508
content_type: application/pdf
creator: dernst
date_created: 2019-01-09T13:05:44Z
date_updated: 2020-07-14T12:47:11Z
file_id: '5812'
file_name: 2016_CurrentOpinion_Mattei.pdf
file_size: 1773842
relation: main_file
file_date_updated: 2020-07-14T12:47:11Z
has_accepted_license: '1'
intvolume: ' 18'
issue: '6'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 27-35
publication: Current Opinion in Virology
publication_identifier:
issn:
- 1879-6257
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Retrovirus maturation—an extraordinary structural transformation
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2016'
...
---
_id: '5805'
abstract:
- lang: eng
text: Discretization of sphere in the integer space follows a particular discretization
scheme, which, in principle, conforms to some topological model. This eventually
gives rise to interesting topological properties of a discrete spherical surface,
which need to be investigated for its analytical characterization. This paper
presents some novel results on the local topological properties of the naive model
of discrete sphere. They follow from the bijection of each quadraginta octant
of naive sphere with its projection map called f -map on the corresponding functional
plane and from the characterization of certain jumps in the f-map. As an application,
we have shown how these properties can be used in designing an efficient reconstruction
algorithm for a naive spherical surface from an input voxel set when it is sparse
or noisy.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nabhasmita
full_name: Sen, Nabhasmita
last_name: Sen
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Sen N, Biswas R, Bhowmick P. On some local topological properties of naive
discrete sphere. In: Computational Topology in Image Context. Vol 9667.
Cham: Springer Nature; 2016:253-264. doi:10.1007/978-3-319-39441-1_23'
apa: 'Sen, N., Biswas, R., & Bhowmick, P. (2016). On some local topological
properties of naive discrete sphere. In Computational Topology in Image Context
(Vol. 9667, pp. 253–264). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-39441-1_23'
chicago: 'Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological
Properties of Naive Discrete Sphere.” In Computational Topology in Image Context,
9667:253–64. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-39441-1_23.'
ieee: 'N. Sen, R. Biswas, and P. Bhowmick, “On some local topological properties
of naive discrete sphere,” in Computational Topology in Image Context,
vol. 9667, Cham: Springer Nature, 2016, pp. 253–264.'
ista: 'Sen N, Biswas R, Bhowmick P. 2016.On some local topological properties of
naive discrete sphere. In: Computational Topology in Image Context. LNCS, vol.
9667, 253–264.'
mla: Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete
Sphere.” Computational Topology in Image Context, vol. 9667, Springer Nature,
2016, pp. 253–64, doi:10.1007/978-3-319-39441-1_23.
short: N. Sen, R. Biswas, P. Bhowmick, in:, Computational Topology in Image Context,
Springer Nature, Cham, 2016, pp. 253–264.
conference:
end_date: 2016-06-17
location: Marseille, France
name: 'CTIC: Computational Topology in Image Context'
start_date: 2016-06-15
date_created: 2019-01-08T20:44:24Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2022-01-28T08:01:22Z
day: '02'
department:
- _id: HeEd
doi: 10.1007/978-3-319-39441-1_23
extern: '1'
intvolume: ' 9667'
language:
- iso: eng
month: '06'
oa_version: None
page: 253-264
place: Cham
publication: Computational Topology in Image Context
publication_identifier:
eisbn:
- 978-3-319-39441-1
eissn:
- 1611-3349
isbn:
- 978-3-319-39440-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On some local topological properties of naive discrete sphere
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9667
year: '2016'
...
---
_id: '5806'
abstract:
- lang: eng
text: Although the concept of functional plane for naive plane is studied and reported
in the literature in great detail, no similar study is yet found for naive sphere.
This article exposes the first study in this line, opening up further prospects
of analyzing the topological properties of sphere in the discrete space. We show
that each quadraginta octant Q of a naive sphere forms a bijection with its projected
pixel set on a unique coordinate plane, which thereby serves as the functional
plane of Q, and hence gives rise to merely mono-jumps during back projection.
The other two coordinate planes serve as para-functional and dia-functional planes
for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds
neither of the two. Owing to this, the quadraginta octants form symmetry groups
and subgroups with equivalent jump conditions. We also show a potential application
in generating a special class of discrete 3D circles based on back projection
and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry,
uniqueness, and bounded distance from the underlying real sphere and real plane.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere
with application to circle drawing. In: Discrete Geometry for Computer Imagery.
Vol 9647. Cham: Springer Nature; 2016:256-267. doi:10.1007/978-3-319-32360-2_20'
apa: 'Biswas, R., & Bhowmick, P. (2016). On functionality of quadraginta octants
of naive sphere with application to circle drawing. In Discrete Geometry for
Computer Imagery (Vol. 9647, pp. 256–267). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-32360-2_20'
chicago: 'Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta
Octants of Naive Sphere with Application to Circle Drawing.” In Discrete Geometry
for Computer Imagery, 9647:256–67. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-32360-2_20.'
ieee: R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive
sphere with application to circle drawing,” in Discrete Geometry for Computer
Imagery, Nantes, France, 2016, vol. 9647, pp. 256–267.
ista: 'Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive
sphere with application to circle drawing. Discrete Geometry for Computer Imagery.
DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS,
vol. 9647, 256–267.'
mla: Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants
of Naive Sphere with Application to Circle Drawing.” Discrete Geometry for
Computer Imagery, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:10.1007/978-3-319-32360-2_20.
short: R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer
Nature, Cham, 2016, pp. 256–267.
conference:
end_date: 2016-04-20
location: Nantes, France
name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
start_date: 2016-04-18
date_created: 2019-01-08T20:44:37Z
date_published: 2016-04-09T00:00:00Z
date_updated: 2022-01-28T08:10:11Z
day: '09'
department:
- _id: HeEd
doi: 10.1007/978-3-319-32360-2_20
extern: '1'
intvolume: ' 9647'
language:
- iso: eng
month: '04'
oa_version: None
page: 256-267
place: Cham
publication: Discrete Geometry for Computer Imagery
publication_identifier:
eisbn:
- 978-3-319-32360-2
isbn:
- 978-3-319-32359-6
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On functionality of quadraginta octants of naive sphere with application to
circle drawing
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9647
year: '2016'
...
---
_id: '5809'
abstract:
- lang: eng
text: A discrete spherical circle is a topologically well-connected 3D circle in
the integer space, which belongs to a discrete sphere as well as a discrete plane.
It is one of the most important 3D geometric primitives, but has not possibly
yet been studied up to its merit. This paper is a maiden exposition of some of
its elementary properties, which indicates a sense of its profound theoretical
prospects in the framework of digital geometry. We have shown how different types
of discretization can lead to forbidden and admissible classes, when one attempts
to define the discretization of a spherical circle in terms of intersection between
a discrete sphere and a discrete plane. Several fundamental theoretical results
have been presented, the algorithm for construction of discrete spherical circles
has been discussed, and some test results have been furnished to demonstrate its
practicality and usefulness.
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
- first_name: Valentin E.
full_name: Brimkov, Valentin E.
last_name: Brimkov
citation:
ama: 'Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete
spherical circles. In: Combinatorial Image Analysis. Vol 9448. Cham: Springer
Nature; 2016:86-100. doi:10.1007/978-3-319-26145-4_7'
apa: 'Biswas, R., Bhowmick, P., & Brimkov, V. E. (2016). On the connectivity
and smoothness of discrete spherical circles. In Combinatorial image analysis
(Vol. 9448, pp. 86–100). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-26145-4_7'
chicago: 'Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity
and Smoothness of Discrete Spherical Circles.” In Combinatorial Image Analysis,
9448:86–100. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-26145-4_7.'
ieee: 'R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness
of discrete spherical circles,” in Combinatorial image analysis, vol. 9448,
Cham: Springer Nature, 2016, pp. 86–100.'
ista: 'Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness
of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.'
mla: Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical
Circles.” Combinatorial Image Analysis, vol. 9448, Springer Nature, 2016,
pp. 86–100, doi:10.1007/978-3-319-26145-4_7.
short: R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis,
Springer Nature, Cham, 2016, pp. 86–100.
conference:
end_date: 2015-11-27
location: Kolkata, India
name: 'IWCIA: International Workshop on Combinatorial Image Analysis'
start_date: 2015-11-24
date_created: 2019-01-08T20:45:19Z
date_published: 2016-01-06T00:00:00Z
date_updated: 2022-01-28T08:13:03Z
day: '06'
department:
- _id: HeEd
doi: 10.1007/978-3-319-26145-4_7
extern: '1'
intvolume: ' 9448'
language:
- iso: eng
month: '01'
oa_version: None
page: 86-100
place: Cham
publication: Combinatorial image analysis
publication_identifier:
eisbn:
- 978-3-319-26145-4
eissn:
- 1611-3349
isbn:
- 978-3-319-26144-7
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On the connectivity and smoothness of discrete spherical circles
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9448
year: '2016'
...
---
_id: '587'
abstract:
- lang: eng
text: Quantum metrology exploits entangled states of particles to improve sensing
precision beyond the limit achievable with uncorrelated particles. All previous
methods required detection noise levels below this standard quantum limit to realize
the benefits of the intrinsic sensitivity provided by these states.We experimentally
demonstrate a widely applicable method for entanglement-enhanced measurements
without low-noise detection. The method involves an intermediate quantum phase
magnification step that eases implementation complexity. We used it to perform
squeezed-state metrology 8 decibels below the standard quantum limit with a detection
system that has a noise floor 10 decibels above the standard quantum limit.
author:
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Rajiv
full_name: Krishnakumar, Rajiv
last_name: Krishnakumar
- first_name: Nils
full_name: Engelsen, Nils J
last_name: Engelsen
- first_name: Mark
full_name: Kasevich, Mark A
last_name: Kasevich
citation:
ama: Hosten O, Krishnakumar R, Engelsen N, Kasevich M. Quantum phase magnification.
Science. 2016;352(6293):1552-1555. doi:10.1126/science.aaf3397
apa: Hosten, O., Krishnakumar, R., Engelsen, N., & Kasevich, M. (2016). Quantum
phase magnification. Science. American Association for the Advancement
of Science. https://doi.org/10.1126/science.aaf3397
chicago: Hosten, Onur, Rajiv Krishnakumar, Nils Engelsen, and Mark Kasevich. “Quantum
Phase Magnification.” Science. American Association for the Advancement
of Science, 2016. https://doi.org/10.1126/science.aaf3397.
ieee: O. Hosten, R. Krishnakumar, N. Engelsen, and M. Kasevich, “Quantum phase magnification,”
Science, vol. 352, no. 6293. American Association for the Advancement of
Science, pp. 1552–1555, 2016.
ista: Hosten O, Krishnakumar R, Engelsen N, Kasevich M. 2016. Quantum phase magnification.
Science. 352(6293), 1552–1555.
mla: Hosten, Onur, et al. “Quantum Phase Magnification.” Science, vol. 352,
no. 6293, American Association for the Advancement of Science, 2016, pp. 1552–55,
doi:10.1126/science.aaf3397.
short: O. Hosten, R. Krishnakumar, N. Engelsen, M. Kasevich, Science 352 (2016)
1552–1555.
date_created: 2018-12-11T11:47:21Z
date_published: 2016-06-24T00:00:00Z
date_updated: 2021-01-12T08:05:06Z
day: '24'
doi: 10.1126/science.aaf3397
extern: 1
intvolume: ' 352'
issue: '6293'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1601.07683
month: '06'
oa: 1
page: 1552 - 1555
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7214'
quality_controlled: 0
status: public
title: Quantum phase magnification
type: journal_article
volume: 352
year: '2016'
...
---
_id: '588'
abstract:
- lang: eng
text: Quantum metrology uses quantum entanglement - correlations in the properties
of microscopic systems - to improve the statistical precision of physical measurements.
When measuring a signal, such as the phase shift of a light beam or an atomic
state, a prominent limitation to achievable precision arises from the noise associated
with the counting of uncorrelated probe particles. This noise, commonly referred
to as shot noise or projection noise, gives rise to the standard quantum limit
(SQL) to phase resolution. However, it can be mitigated down to the fundamental
Heisenberg limit by entangling the probe particles. Despite considerable experimental
progress in a variety of physical systems, a question that persists is whether
these methods can achieve performance levels that compare favourably with optimized
conventional (non-entangled) systems. Here we demonstrate an approach that achieves
unprecedented levels of metrological improvement using half a million 87Rb atoms
in their 'clock' states. The ensemble is 20.1 ± 0.3 decibels (100-fold) spin-squeezed
via an optical-cavity-based measurement. We directly resolve small microwave-induced
rotations 18.5 ± 0.3 decibels (70-fold) beyond the SQL. The single-shot phase
resolution of 147 microradians achieved by the apparatus is better than that achieved
by the best engineered cold atom sensors despite lower atom numbers. We infer
entanglement of more than 680 ± 35 particles in the atomic ensemble. Applications
include atomic clocks, inertial sensors, and fundamental physics experiments such
as tests of general relativity or searches for electron electric dipole moment.
To this end, we demonstrate an atomic clock measurement with a quantum enhancement
of 10.5 ± 0.3 decibels (11-fold), limited by the phase noise of our microwave
source.
author:
- first_name: Onur
full_name: Onur Hosten
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Nils
full_name: Engelsen, Nils J
last_name: Engelsen
- first_name: Rajiv
full_name: Krishnakumar, Rajiv
last_name: Krishnakumar
- first_name: Mark
full_name: Kasevich, Mark A
last_name: Kasevich
citation:
ama: Hosten O, Engelsen N, Krishnakumar R, Kasevich M. Measurement noise 100 times
lower than the quantum-projection limit using entangled atoms. Nature.
2016;529(7587):505-508. doi:10.1038/nature16176
apa: Hosten, O., Engelsen, N., Krishnakumar, R., & Kasevich, M. (2016). Measurement
noise 100 times lower than the quantum-projection limit using entangled atoms.
Nature. Nature Publishing Group. https://doi.org/10.1038/nature16176
chicago: Hosten, Onur, Nils Engelsen, Rajiv Krishnakumar, and Mark Kasevich. “Measurement
Noise 100 Times Lower than the Quantum-Projection Limit Using Entangled Atoms.”
Nature. Nature Publishing Group, 2016. https://doi.org/10.1038/nature16176.
ieee: O. Hosten, N. Engelsen, R. Krishnakumar, and M. Kasevich, “Measurement noise
100 times lower than the quantum-projection limit using entangled atoms,” Nature,
vol. 529, no. 7587. Nature Publishing Group, pp. 505–508, 2016.
ista: Hosten O, Engelsen N, Krishnakumar R, Kasevich M. 2016. Measurement noise
100 times lower than the quantum-projection limit using entangled atoms. Nature.
529(7587), 505–508.
mla: Hosten, Onur, et al. “Measurement Noise 100 Times Lower than the Quantum-Projection
Limit Using Entangled Atoms.” Nature, vol. 529, no. 7587, Nature Publishing
Group, 2016, pp. 505–08, doi:10.1038/nature16176.
short: O. Hosten, N. Engelsen, R. Krishnakumar, M. Kasevich, Nature 529 (2016) 505–508.
date_created: 2018-12-11T11:47:21Z
date_published: 2016-01-28T00:00:00Z
date_updated: 2021-01-12T08:05:07Z
day: '28'
doi: 10.1038/nature16176
extern: 1
intvolume: ' 529'
issue: '7587'
month: '01'
page: 505 - 508
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '7215'
quality_controlled: 0
status: public
title: Measurement noise 100 times lower than the quantum-projection limit using entangled
atoms
type: journal_article
volume: 529
year: '2016'
...
---
_id: '592'
abstract:
- lang: eng
text: We create up to 20 dB spin-squeezed states of atomic ensembles using an optical
cavity-based measurement. The prepared states are suitable for atomic sensors
that require free space release of the atoms.
article_processing_charge: No
author:
- first_name: Nils
full_name: Engelsen, Nils
last_name: Engelsen
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Rajiv
full_name: Krishnakumar, Rajiv
last_name: Krishnakumar
- first_name: Mark
full_name: Kasevich, Mark
last_name: Kasevich
citation:
ama: 'Engelsen N, Hosten O, Krishnakumar R, Kasevich M. Engineering spin squeezed
states for quantum-enhanced atom interferometry. In: IEEE; 2016.'
apa: 'Engelsen, N., Hosten, O., Krishnakumar, R., & Kasevich, M. (2016). Engineering
spin squeezed states for quantum-enhanced atom interferometry. Presented at the
CLEO: Conference on Lasers and Electro Optics, San Jose, CA, United States: IEEE.'
chicago: Engelsen, Nils, Onur Hosten, Rajiv Krishnakumar, and Mark Kasevich. “Engineering
Spin Squeezed States for Quantum-Enhanced Atom Interferometry.” IEEE, 2016.
ieee: 'N. Engelsen, O. Hosten, R. Krishnakumar, and M. Kasevich, “Engineering spin
squeezed states for quantum-enhanced atom interferometry,” presented at the CLEO:
Conference on Lasers and Electro Optics, San Jose, CA, United States, 2016.'
ista: 'Engelsen N, Hosten O, Krishnakumar R, Kasevich M. 2016. Engineering spin
squeezed states for quantum-enhanced atom interferometry. CLEO: Conference on
Lasers and Electro Optics.'
mla: Engelsen, Nils, et al. Engineering Spin Squeezed States for Quantum-Enhanced
Atom Interferometry. IEEE, 2016.
short: N. Engelsen, O. Hosten, R. Krishnakumar, M. Kasevich, in:, IEEE, 2016.
conference:
end_date: 2016-06-10
location: San Jose, CA, United States
name: 'CLEO: Conference on Lasers and Electro Optics'
start_date: 2016-06-05
date_created: 2018-12-11T11:47:23Z
date_published: 2016-12-16T00:00:00Z
date_updated: 2021-01-12T08:05:15Z
day: '16'
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://ieeexplore.ieee.org/document/7787611/
month: '12'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '7213'
quality_controlled: '1'
status: public
title: Engineering spin squeezed states for quantum-enhanced atom interferometry
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '602'
abstract:
- lang: eng
text: RNA polymerase (Pol) II produces messenger RNA during transcription of protein-coding
genes in all eukaryotic cells. The Pol II structure is known at high resolution
from X-ray crystallography for two yeast species1-3. Structural studies of mammalian
Pol II, however, remain limited to low-resolution electron microscopy analysis
of human Pol II and its complexes with various proteins4-10. Here we report the
3.4 Å resolution cryo-electron microscopy structure of mammalian Pol II in the
form of a transcribing complex comprising DNA template and RNA transcript. We
use bovine Pol II, which is identical to the human enzyme except for seven amino-acid
residues. The obtained atomic model closely resembles its yeast counterpart, but
also reveals unknown features. Binding of nucleic acids to the polymerase involves
'induced fit' of the mobile Pol II clamp and active centre region. DNA downstream
of the transcription bubble contacts a conserved 'TPSA motif' in the jaw domain
of the Pol II subunit RPB5, an interaction that is apparently already established
during transcription initiation7. Upstream DNA emanates from the active centre
cleft at an angle of approximately 105° with respect to downstream DNA. This position
of upstream DNA allows for binding of the general transcription elongation factor
DSIF (SPT4-SPT5) that we localize over the active centre cleft in a conserved
position on the clamp domain of Pol II. Our results define the structure of mammalian
Pol II in its functional state, indicate that previous crystallographic analysis
of yeast Pol II is relevant for understanding gene transcription in all eukaryotes,
and provide a starting point for a mechanistic analysis of human transcription.
article_processing_charge: No
author:
- first_name: Carrie A
full_name: Bernecky, Carrie A
id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87
last_name: Bernecky
orcid: 0000-0003-0893-7036
- first_name: Franz
full_name: Herzog, Franz
last_name: Herzog
- first_name: Wolfgang
full_name: Baumeister, Wolfgang
last_name: Baumeister
- first_name: Jürgen
full_name: Plitzko, Jürgen
last_name: Plitzko
- first_name: Patrick
full_name: Cramer, Patrick
last_name: Cramer
citation:
ama: Bernecky C, Herzog F, Baumeister W, Plitzko J, Cramer P. Structure of transcribing
mammalian RNA polymerase II. Nature. 2016;529(7587):551-554. doi:10.1038/nature16482
apa: Bernecky, C., Herzog, F., Baumeister, W., Plitzko, J., & Cramer, P. (2016).
Structure of transcribing mammalian RNA polymerase II. Nature. Nature Publishing
Group. https://doi.org/10.1038/nature16482
chicago: Bernecky, Carrie, Franz Herzog, Wolfgang Baumeister, Jürgen Plitzko, and
Patrick Cramer. “Structure of Transcribing Mammalian RNA Polymerase II.” Nature.
Nature Publishing Group, 2016. https://doi.org/10.1038/nature16482.
ieee: C. Bernecky, F. Herzog, W. Baumeister, J. Plitzko, and P. Cramer, “Structure
of transcribing mammalian RNA polymerase II,” Nature, vol. 529, no. 7587.
Nature Publishing Group, pp. 551–554, 2016.
ista: Bernecky C, Herzog F, Baumeister W, Plitzko J, Cramer P. 2016. Structure of
transcribing mammalian RNA polymerase II. Nature. 529(7587), 551–554.
mla: Bernecky, Carrie, et al. “Structure of Transcribing Mammalian RNA Polymerase
II.” Nature, vol. 529, no. 7587, Nature Publishing Group, 2016, pp. 551–54,
doi:10.1038/nature16482.
short: C. Bernecky, F. Herzog, W. Baumeister, J. Plitzko, P. Cramer, Nature 529
(2016) 551–554.
date_created: 2018-12-11T11:47:26Z
date_published: 2016-01-28T00:00:00Z
date_updated: 2021-01-12T08:05:43Z
day: '28'
doi: 10.1038/nature16482
extern: '1'
intvolume: ' 529'
issue: '7587'
language:
- iso: eng
month: '01'
oa_version: None
page: 551 - 554
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '7205'
status: public
title: Structure of transcribing mammalian RNA polymerase II
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 529
year: '2016'
...
---
_id: '1431'
abstract:
- lang: eng
text: The rare socially parasitic butterfly Maculinea alcon occurs in two forms,
which are characteristic of hygric or xeric habitats and which exploit different
host plants and host ants. The status of these two forms has been the subject
of considerable controversy. Populations of the two forms are usually spatially
distinct, but at Răscruci in Romania both forms occur on the same site (syntopically).
We examined the genetic differentiation between the two forms using eight microsatellite
markers, and compared with a nearby hygric site, Şardu. Our results showed that
while the two forms are strongly differentiated at Răscruci, it is the xeric form
there that is most similar to the hygric form at Şardu, and Bayesian clustering
algorithms suggest that these two populations have exchanged genes relatively
recently. We found strong evidence for population substructuring, caused by high
within host ant nest relatedness, indicating very limited dispersal of most ovipositing
females, but not association with particular host ant species. Our results are
consistent with the results of larger scale phylogeographic studies that suggest
that the two forms represent local ecotypes specialising on different host plants,
each with a distinct flowering phenology, providing a temporal rather than spatial
barrier to gene flow.
article_number: '1865'
author:
- first_name: András
full_name: Tartally, András
last_name: Tartally
- first_name: Andreas
full_name: Kelager, Andreas
last_name: Kelager
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
- first_name: David
full_name: Nash, David
last_name: Nash
citation:
ama: Tartally A, Kelager A, Fürst M, Nash D. Host plant use drives genetic differentiation
in syntopic populations of Maculinea alcon. PeerJ. 2016;2016(3). doi:10.7717/peerj.1865
apa: Tartally, A., Kelager, A., Fürst, M., & Nash, D. (2016). Host plant use
drives genetic differentiation in syntopic populations of Maculinea alcon. PeerJ.
PeerJ. https://doi.org/10.7717/peerj.1865
chicago: Tartally, András, Andreas Kelager, Matthias Fürst, and David Nash. “Host
Plant Use Drives Genetic Differentiation in Syntopic Populations of Maculinea
Alcon.” PeerJ. PeerJ, 2016. https://doi.org/10.7717/peerj.1865.
ieee: A. Tartally, A. Kelager, M. Fürst, and D. Nash, “Host plant use drives genetic
differentiation in syntopic populations of Maculinea alcon,” PeerJ, vol.
2016, no. 3. PeerJ, 2016.
ista: Tartally A, Kelager A, Fürst M, Nash D. 2016. Host plant use drives genetic
differentiation in syntopic populations of Maculinea alcon. PeerJ. 2016(3), 1865.
mla: Tartally, András, et al. “Host Plant Use Drives Genetic Differentiation in
Syntopic Populations of Maculinea Alcon.” PeerJ, vol. 2016, no. 3, 1865,
PeerJ, 2016, doi:10.7717/peerj.1865.
short: A. Tartally, A. Kelager, M. Fürst, D. Nash, PeerJ 2016 (2016).
date_created: 2018-12-11T11:51:59Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:41Z
day: '01'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.7717/peerj.1865
file:
- access_level: open_access
checksum: c27d898598a1e3d7f629607a309254e1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:19Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5272'
file_name: IST-2016-584-v1+1_peerj-1865.pdf
file_size: 1216360
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 2016'
issue: '3'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '5767'
pubrep_id: '584'
quality_controlled: '1'
scopus_import: 1
status: public
title: Host plant use drives genetic differentiation in syntopic populations of Maculinea
alcon
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: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2016
year: '2016'
...
---
_id: '1432'
abstract:
- lang: eng
text: CA3–CA3 recurrent excitatory synapses are thought to play a key role in memory
storage and pattern completion. Whether the plasticity properties of these synapses
are consistent with their proposed network functions remains unclear. Here, we
examine the properties of spike timing-dependent plasticity (STDP) at CA3–CA3
synapses. Low-frequency pairing of excitatory postsynaptic potentials (EPSPs)
and action potentials (APs) induces long-term potentiation (LTP), independent
of temporal order. The STDP curve is symmetric and broad (half-width ~150 ms).
Consistent with these STDP induction properties, AP–EPSP sequences lead to supralinear
summation of spine [Ca2+] transients. Furthermore, afterdepolarizations (ADPs)
following APs efficiently propagate into dendrites of CA3 pyramidal neurons, and
EPSPs summate with dendritic ADPs. In autoassociative network models, storage
and recall are more robust with symmetric than with asymmetric STDP rules. Thus,
a specialized STDP induction rule allows reliable storage and recall of information
in the hippocampal CA3 network.
acknowledgement: 'We thank Jozsef Csicsvari and Nelson Spruston for critically reading
the manuscript. We also thank A. Schlögl for programming, F. Marr for technical
assistance and E. Kramberger for manuscript editing. '
article_number: '11552'
author:
- first_name: Rajiv Kumar
full_name: Mishra, Rajiv Kumar
id: 46CB58F2-F248-11E8-B48F-1D18A9856A87
last_name: Mishra
- first_name: Sooyun
full_name: Kim, Sooyun
id: 394AB1C8-F248-11E8-B48F-1D18A9856A87
last_name: Kim
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
orcid: 0000-0003-2209-5242
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Mishra RK, Kim S, Guzmán J, Jonas PM. Symmetric spike timing-dependent plasticity
at CA3–CA3 synapses optimizes storage and recall in autoassociative networks.
Nature Communications. 2016;7. doi:10.1038/ncomms11552
apa: Mishra, R. K., Kim, S., Guzmán, J., & Jonas, P. M. (2016). Symmetric spike
timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in
autoassociative networks. Nature Communications. Nature Publishing Group.
https://doi.org/10.1038/ncomms11552
chicago: Mishra, Rajiv Kumar, Sooyun Kim, José Guzmán, and Peter M Jonas. “Symmetric
Spike Timing-Dependent Plasticity at CA3–CA3 Synapses Optimizes Storage and Recall
in Autoassociative Networks.” Nature Communications. Nature Publishing
Group, 2016. https://doi.org/10.1038/ncomms11552.
ieee: R. K. Mishra, S. Kim, J. Guzmán, and P. M. Jonas, “Symmetric spike timing-dependent
plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative
networks,” Nature Communications, vol. 7. Nature Publishing Group, 2016.
ista: Mishra RK, Kim S, Guzmán J, Jonas PM. 2016. Symmetric spike timing-dependent
plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative
networks. Nature Communications. 7, 11552.
mla: Mishra, Rajiv Kumar, et al. “Symmetric Spike Timing-Dependent Plasticity at
CA3–CA3 Synapses Optimizes Storage and Recall in Autoassociative Networks.” Nature
Communications, vol. 7, 11552, Nature Publishing Group, 2016, doi:10.1038/ncomms11552.
short: R.K. Mishra, S. Kim, J. Guzmán, P.M. Jonas, Nature Communications 7 (2016).
date_created: 2018-12-11T11:51:59Z
date_published: 2016-05-13T00:00:00Z
date_updated: 2023-09-07T11:55:25Z
day: '13'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1038/ncomms11552
ec_funded: 1
file:
- access_level: open_access
checksum: 7e84d0392348c874d473b62f1042de22
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:33Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5355'
file_name: IST-2016-582-v1+1_ncomms11552.pdf
file_size: 4510512
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 7'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '5766'
pubrep_id: '582'
quality_controlled: '1'
related_material:
record:
- id: '1396'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage
and recall in autoassociative networks
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: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2016'
...
---
_id: '1434'
abstract:
- lang: eng
text: We prove that the system of subordination equations, defining the free additive
convolution of two probability measures, is stable away from the edges of the
support and blow-up singularities by showing that the recent smoothness condition
of Kargin is always satisfied. As an application, we consider the local spectral
statistics of the random matrix ensemble A+UBU⁎A+UBU⁎, where U is a Haar distributed
random unitary or orthogonal matrix, and A and B are deterministic matrices.
In the bulk regime, we prove that the empirical spectral distribution of A+UBU⁎A+UBU⁎
concentrates around the free additive convolution of the spectral distributions
of A and B on scales down to N−2/3N−2/3.
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Bao Z, Erdös L, Schnelli K. Local stability of the free additive convolution.
Journal of Functional Analysis. 2016;271(3):672-719. doi:10.1016/j.jfa.2016.04.006
apa: Bao, Z., Erdös, L., & Schnelli, K. (2016). Local stability of the free
additive convolution. Journal of Functional Analysis. Academic Press. https://doi.org/10.1016/j.jfa.2016.04.006
chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Stability of the
Free Additive Convolution.” Journal of Functional Analysis. Academic Press,
2016. https://doi.org/10.1016/j.jfa.2016.04.006.
ieee: Z. Bao, L. Erdös, and K. Schnelli, “Local stability of the free additive convolution,”
Journal of Functional Analysis, vol. 271, no. 3. Academic Press, pp. 672–719,
2016.
ista: Bao Z, Erdös L, Schnelli K. 2016. Local stability of the free additive convolution.
Journal of Functional Analysis. 271(3), 672–719.
mla: Bao, Zhigang, et al. “Local Stability of the Free Additive Convolution.” Journal
of Functional Analysis, vol. 271, no. 3, Academic Press, 2016, pp. 672–719,
doi:10.1016/j.jfa.2016.04.006.
short: Z. Bao, L. Erdös, K. Schnelli, Journal of Functional Analysis 271 (2016)
672–719.
date_created: 2018-12-11T11:52:00Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:50:42Z
day: '01'
department:
- _id: LaEr
doi: 10.1016/j.jfa.2016.04.006
ec_funded: 1
intvolume: ' 271'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1508.05905
month: '08'
oa: 1
oa_version: Preprint
page: 672 - 719
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Journal of Functional Analysis
publication_status: published
publisher: Academic Press
publist_id: '5764'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local stability of the free additive convolution
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 271
year: '2016'
...
---
_id: '1435'
abstract:
- lang: eng
text: ATP released from neurons and astrocytes during neuronal activity or under
pathophysiological circumstances is able to influence information flow in neuronal
circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent
modulation of cellular excitability, synaptic strength, and plasticity. In the
present paper we review cellular and network effects of P2Y receptors in the brain.
We show that P2Y receptors inhibit the release of neurotransmitters, modulate
voltage- and ligand-gated ion channels, and differentially influence the induction
of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum.
The findings discussed here may explain how P2Y1 receptor activation during brain
injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to
an impairment of cognitive processes. Hence, it is suggested that the blockade
of P2Y1 receptors may have therapeutic potential against cognitive disturbances
in these states.
article_number: '1207393'
author:
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
- first_name: Zoltan
full_name: Gerevich, Zoltan
last_name: Gerevich
citation:
ama: 'Guzmán J, Gerevich Z. P2Y receptors in synaptic transmission and plasticity:
Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016;2016.
doi:10.1155/2016/1207393'
apa: 'Guzmán, J., & Gerevich, Z. (2016). P2Y receptors in synaptic transmission
and plasticity: Therapeutic potential in cognitive dysfunction. Neural Plasticity.
Hindawi Publishing Corporation. https://doi.org/10.1155/2016/1207393'
chicago: 'Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission
and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” Neural Plasticity.
Hindawi Publishing Corporation, 2016. https://doi.org/10.1155/2016/1207393.'
ieee: 'J. Guzmán and Z. Gerevich, “P2Y receptors in synaptic transmission and plasticity:
Therapeutic potential in cognitive dysfunction,” Neural Plasticity, vol.
2016. Hindawi Publishing Corporation, 2016.'
ista: 'Guzmán J, Gerevich Z. 2016. P2Y receptors in synaptic transmission and plasticity:
Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016, 1207393.'
mla: 'Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission
and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” Neural Plasticity,
vol. 2016, 1207393, Hindawi Publishing Corporation, 2016, doi:10.1155/2016/1207393.'
short: J. Guzmán, Z. Gerevich, Neural Plasticity 2016 (2016).
date_created: 2018-12-11T11:52:00Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:43Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1155/2016/1207393
file:
- access_level: open_access
checksum: 8dc5c2f3d44d4775a6e7e3edb0d7a0da
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:17Z
date_updated: 2020-07-14T12:44:54Z
file_id: '4740'
file_name: IST-2016-580-v1+1_1207393.pdf
file_size: 1395180
relation: main_file
file_date_updated: 2020-07-14T12:44:54Z
has_accepted_license: '1'
intvolume: ' 2016'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Neural Plasticity
publication_status: published
publisher: Hindawi Publishing Corporation
publist_id: '5762'
pubrep_id: '580'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'P2Y receptors in synaptic transmission and plasticity: Therapeutic potential
in cognitive dysfunction'
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: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2016
year: '2016'
...
---
_id: '1436'
abstract:
- lang: eng
text: We study the time evolution of a system of N spinless fermions in R3 which
interact through a pair potential, e.g., the Coulomb potential. We compare the
dynamics given by the solution to Schrödinger's equation with the time-dependent
Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation
in terms of the kinetic energy of the system. This leads, in turn, to bounds in
terms of the initial total energy of the system.
author:
- first_name: Volker
full_name: Bach, Volker
last_name: Bach
- first_name: Sébastien
full_name: Breteaux, Sébastien
last_name: Breteaux
- first_name: Sören P
full_name: Petrat, Sören P
id: 40AC02DC-F248-11E8-B48F-1D18A9856A87
last_name: Petrat
orcid: 0000-0002-9166-5889
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
- first_name: Tim
full_name: Tzaneteas, Tim
last_name: Tzaneteas
citation:
ama: Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. Kinetic energy estimates
for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb
interaction. Journal de Mathématiques Pures et Appliquées. 2016;105(1):1-30.
doi:10.1016/j.matpur.2015.09.003
apa: Bach, V., Breteaux, S., Petrat, S. P., Pickl, P., & Tzaneteas, T. (2016).
Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation
with Coulomb interaction. Journal de Mathématiques Pures et Appliquées.
Elsevier. https://doi.org/10.1016/j.matpur.2015.09.003
chicago: Bach, Volker, Sébastien Breteaux, Sören P Petrat, Peter Pickl, and Tim
Tzaneteas. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock
Approximation with Coulomb Interaction.” Journal de Mathématiques Pures et
Appliquées. Elsevier, 2016. https://doi.org/10.1016/j.matpur.2015.09.003.
ieee: V. Bach, S. Breteaux, S. P. Petrat, P. Pickl, and T. Tzaneteas, “Kinetic energy
estimates for the accuracy of the time-dependent Hartree-Fock approximation with
Coulomb interaction,” Journal de Mathématiques Pures et Appliquées, vol.
105, no. 1. Elsevier, pp. 1–30, 2016.
ista: Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. 2016. Kinetic energy
estimates for the accuracy of the time-dependent Hartree-Fock approximation with
Coulomb interaction. Journal de Mathématiques Pures et Appliquées. 105(1), 1–30.
mla: Bach, Volker, et al. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent
Hartree-Fock Approximation with Coulomb Interaction.” Journal de Mathématiques
Pures et Appliquées, vol. 105, no. 1, Elsevier, 2016, pp. 1–30, doi:10.1016/j.matpur.2015.09.003.
short: V. Bach, S. Breteaux, S.P. Petrat, P. Pickl, T. Tzaneteas, Journal de Mathématiques
Pures et Appliquées 105 (2016) 1–30.
date_created: 2018-12-11T11:52:00Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:43Z
day: '01'
ddc:
- '510'
- '530'
department:
- _id: RoSe
doi: 10.1016/j.matpur.2015.09.003
ec_funded: 1
file:
- access_level: open_access
checksum: c5afe1f6935bc7f2b546adbde1d31a35
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:36Z
date_updated: 2020-07-14T12:44:54Z
file_id: '4825'
file_name: IST-2016-581-v1+1_1-s2.0-S0021782415001191-main.pdf
file_size: 658491
relation: main_file
file_date_updated: 2020-07-14T12:44:54Z
has_accepted_license: '1'
intvolume: ' 105'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 1 - 30
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal de Mathématiques Pures et Appliquées
publication_status: published
publisher: Elsevier
publist_id: '5763'
pubrep_id: '581'
quality_controlled: '1'
scopus_import: 1
status: public
title: Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock
approximation with Coulomb interaction
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 105
year: '2016'
...
---
_id: '1437'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
alternative_title:
- POPL
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for
algebraic path properties in concurrent systems of constant treewidth components.
In: Vol 20-22. ACM; 2016:733-747. doi:10.1145/2837614.2837624'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A.
(2016). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles
of Programming Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837624'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,”
presented at the POPL: Principles of Programming Languages, St. Petersburg, FL,
USA, 2016, vol. 20–22, pp. 733–747.'
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.'
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. Vol. 20–22, ACM, 2016,
pp. 733–47, doi:10.1145/2837614.2837624.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM,
2016, pp. 733–747.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2024-03-25T23:30:18Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/2837614.2837624
ec_funded: 1
external_id:
arxiv:
- '1510.07565'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.07565
month: '01'
oa: 1
oa_version: Preprint
page: 733 - 747
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: ACM
publist_id: '5761'
quality_controlled: '1'
related_material:
record:
- id: '5441'
relation: earlier_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '821'
relation: dissertation_contains
status: public
- id: '6009'
relation: later_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1438'
abstract:
- lang: eng
text: 'In this paper, we consider termination of probabilistic programs with real-valued
variables. The questions concerned are: (a) qualitative ones that ask (i) whether
the program terminates with probability 1 (almost-sure termination) and (ii) whether
the expected termination time is finite (finite termination); (b) quantitative
ones that ask (i) to approximate the expected termination time (expectation problem)
and (ii) to compute a bound B such that the probability to terminate after B steps
decreases exponentially (concentration problem). To solve these questions, we
utilize the notion of ranking supermartingales which is a powerful approach for
proving termination of probabilistic programs. In detail, we focus on algorithmic
synthesis of linear ranking-supermartingales over affine probabilistic programs
(APP''s) with both angelic and demonic non-determinism. An important subclass
of APP''s is LRAPP which is defined as the class of all APP''s over which a linear
ranking-supermartingale exists. Our main contributions are as follows. Firstly,
we show that the membership problem of LRAPP (i) can be decided in polynomial
time for APP''s with at most demonic non-determinism, and (ii) is NP-hard and
in PSPACE for APP''s with angelic non-determinism; moreover, the NP-hardness result
holds already for APP''s without probability and demonic non-determinism. Secondly,
we show that the concentration problem over LRAPP can be solved in the same complexity
as for the membership problem of LRAPP. Finally, we show that the expectation
problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP''s
without probability and non-determinism (i.e., deterministic programs). Our experimental
results demonstrate the effectiveness of our approach to answer the qualitative
and quantitative questions over APP''s with at most demonic non-determinism.'
acknowledgement: 'Supported by the Natural Science Foundation of China (NSFC) under
Grant No. 61532019 '
alternative_title:
- POPL
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Rouzbeh
full_name: Hasheminezhad, Rouzbeh
last_name: Hasheminezhad
citation:
ama: 'Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative
and quantitative termination problems for affine probabilistic programs. In: Vol
20-22. ACM; 2016:327-342. doi:10.1145/2837614.2837639'
apa: 'Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2016). Algorithmic
analysis of qualitative and quantitative termination problems for affine probabilistic
programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming
Languages, St. Petersburg, FL, USA: ACM. https://doi.org/10.1145/2837614.2837639'
chicago: Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad.
“Algorithmic Analysis of Qualitative and Quantitative Termination Problems for
Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. https://doi.org/10.1145/2837614.2837639.
ieee: 'K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis
of qualitative and quantitative termination problems for affine probabilistic
programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg,
FL, USA, 2016, vol. 20–22, pp. 327–342.'
ista: 'Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis
of qualitative and quantitative termination problems for affine probabilistic
programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.'
mla: Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative
Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016,
pp. 327–42, doi:10.1145/2837614.2837639.
short: K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2023-09-19T14:38:41Z
day: '11'
department:
- _id: KrCh
doi: 10.1145/2837614.2837639
ec_funded: 1
external_id:
arxiv:
- '1510.08517'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.08517
month: '01'
oa: 1
oa_version: Preprint
page: 327 - 342
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: ACM
publist_id: '5760'
quality_controlled: '1'
related_material:
record:
- id: '5993'
relation: later_version
status: public
scopus_import: 1
status: public
title: Algorithmic analysis of qualitative and quantitative termination problems for
affine probabilistic programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1439'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly,
due to asynchronous communication and the occurrence of faults, such as the network
dropping messages or computers crashing. We introduce PSYNC, a domain specific
language based on the Heard-Of model, which views asynchronous faulty systems
as synchronous ones with an adversarial environment that simulates asynchrony
and faults by dropping messages. We define a runtime system for PSYNC that efficiently
executes on asynchronous networks. We formalize the relation between the runtime
system and PSYNC in terms of observational refinement. The high-level lockstep
abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant
distributed algorithms and enables automated formal verification. We have implemented
an embedding of PSYNC in the SCALA programming language with a runtime system
for asynchronous networks. We show the applicability of PSYNC by implementing
several important fault-tolerant distributed algorithms and we compare the implementation
of consensus algorithms in PSYNC against implementations in other languages in
terms of code size, runtime efficiency, and verification.
acknowledgement: 'Damien Zufferey was supported by DARPA (Grants FA8650-11-C-7192
and FA8650-15-C-7564) and NSF (Grant CCF-1138967). '
alternative_title:
- ACM SIGPLAN Notices
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- 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: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Dragoi C, Henzinger TA, Zufferey D. PSYNC: A partially synchronous language
for fault-tolerant distributed algorithms. In: Vol 20-22. ACM; 2016:400-415. doi:10.1145/2837614.2837650'
apa: 'Dragoi, C., Henzinger, T. A., & Zufferey, D. (2016). PSYNC: A partially
synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp.
400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg,
FL, USA: ACM. https://doi.org/10.1145/2837614.2837650'
chicago: 'Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially
Synchronous Language for Fault-Tolerant Distributed Algorithms,” 20–22:400–415.
ACM, 2016. https://doi.org/10.1145/2837614.2837650.'
ieee: 'C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous
language for fault-tolerant distributed algorithms,” presented at the POPL: Principles
of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415.'
ista: 'Dragoi C, Henzinger TA, Zufferey D. 2016. PSYNC: A partially synchronous
language for fault-tolerant distributed algorithms. POPL: Principles of Programming
Languages, ACM SIGPLAN Notices, vol. 20–22, 400–415.'
mla: 'Dragoi, Cezara, et al. PSYNC: A Partially Synchronous Language for Fault-Tolerant
Distributed Algorithms. Vol. 20–22, ACM, 2016, pp. 400–15, doi:10.1145/2837614.2837650.'
short: C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.
conference:
end_date: 2016-01-22
location: St. Petersburg, FL, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2016-01-20
date_created: 2018-12-11T11:52:01Z
date_published: 2016-01-11T00:00:00Z
date_updated: 2021-01-12T06:50:45Z
day: '11'
department:
- _id: ToHe
doi: 10.1145/2837614.2837650
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.inria.fr/hal-01251199/
month: '01'
oa: 1
oa_version: Preprint
page: 400 - 415
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: ACM
publist_id: '5759'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'PSYNC: A partially synchronous language for fault-tolerant distributed algorithms'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 20-22
year: '2016'
...
---
_id: '1440'
acknowledgement: The author thanks Banerjee et al. (2016) for providing coordinates
prior to public release and apologizes to colleagues whose work was not cited or
discussed due to the limited space available. The author is supported by grants
from EU FP7 (CIG-303564), HFSP (RGY0084_2012), and FWF (W1232).
author:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: 'Janovjak HL. Light at the end of the protein: Crystal structure of a C-terminal
light-sensing domain. Structure. 2016;24(2):213-215. doi:10.1016/j.str.2016.01.002'
apa: 'Janovjak, H. L. (2016). Light at the end of the protein: Crystal structure
of a C-terminal light-sensing domain. Structure. Cell Press. https://doi.org/10.1016/j.str.2016.01.002'
chicago: 'Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure
of a C-Terminal Light-Sensing Domain.” Structure. Cell Press, 2016. https://doi.org/10.1016/j.str.2016.01.002.'
ieee: 'H. L. Janovjak, “Light at the end of the protein: Crystal structure of a
C-terminal light-sensing domain,” Structure, vol. 24, no. 2. Cell Press,
pp. 213–215, 2016.'
ista: 'Janovjak HL. 2016. Light at the end of the protein: Crystal structure of
a C-terminal light-sensing domain. Structure. 24(2), 213–215.'
mla: 'Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of
a C-Terminal Light-Sensing Domain.” Structure, vol. 24, no. 2, Cell Press,
2016, pp. 213–15, doi:10.1016/j.str.2016.01.002.'
short: H.L. Janovjak, Structure 24 (2016) 213–215.
date_created: 2018-12-11T11:52:02Z
date_published: 2016-02-02T00:00:00Z
date_updated: 2021-01-12T06:50:46Z
day: '02'
department:
- _id: HaJa
doi: 10.1016/j.str.2016.01.002
ec_funded: 1
intvolume: ' 24'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 213 - 215
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors (HFSP Young Investigator)
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255A6082-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Structure
publication_status: published
publisher: Cell Press
publist_id: '5756'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Light at the end of the protein: Crystal structure of a C-terminal light-sensing
domain'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2016'
...
---
_id: '1441'
abstract:
- lang: eng
text: 'Optogenetics and photopharmacology enable the spatio-temporal control of
cell and animal behavior by light. Although red light offers deep-tissue penetration
and minimal phototoxicity, very few red-light-sensitive optogenetic methods are
currently available. We have now developed a red-light-induced homodimerization
domain. We first showed that an optimized sensory domain of the cyanobacterial
phytochrome 1 can be expressed robustly and without cytotoxicity in human cells.
We then applied this domain to induce the dimerization of two receptor tyrosine
kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor
trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway
non-invasively in mammalian tissue and in multicolor cell-signaling experiments.
The light-controlled dimerizer and red-light-activated receptor tyrosine kinases
will prove useful to regulate a variety of cellular processes with light. Go deep
with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was
repurposed to induce the homodimerization of proteins in living cells by red light.
By using this domain, light-activated protein kinases were engineered that can
be activated orthogonally from many fluorescent proteins and through mammalian
tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1.'
acknowledgement: 'A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by
the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W1232) and
a FemTech fellowship (Austrian Research Promotion Agency: 3580812).'
author:
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Alexandra-Madelaine
full_name: Tichy, Alexandra-Madelaine
id: 29D8BB2C-F248-11E8-B48F-1D18A9856A87
last_name: Tichy
- first_name: Catherine
full_name: Mckenzie, Catherine
id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87
last_name: Mckenzie
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL.
A phytochrome sensory domain permits receptor activation by red light. Angewandte
Chemie - International Edition. 2016;55(21):6339-6342. doi:10.1002/anie.201601736
apa: Gschaider-Reichhart, E., Inglés Prieto, Á., Tichy, A.-M., Mckenzie, C., &
Janovjak, H. L. (2016). A phytochrome sensory domain permits receptor activation
by red light. Angewandte Chemie - International Edition. Wiley. https://doi.org/10.1002/anie.201601736
chicago: Gschaider-Reichhart, Eva, Álvaro Inglés Prieto, Alexandra-Madelaine Tichy,
Catherine Mckenzie, and Harald L Janovjak. “A Phytochrome Sensory Domain Permits
Receptor Activation by Red Light.” Angewandte Chemie - International Edition.
Wiley, 2016. https://doi.org/10.1002/anie.201601736.
ieee: E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, and H.
L. Janovjak, “A phytochrome sensory domain permits receptor activation by red
light,” Angewandte Chemie - International Edition, vol. 55, no. 21. Wiley,
pp. 6339–6342, 2016.
ista: Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL.
2016. A phytochrome sensory domain permits receptor activation by red light. Angewandte
Chemie - International Edition. 55(21), 6339–6342.
mla: Gschaider-Reichhart, Eva, et al. “A Phytochrome Sensory Domain Permits Receptor
Activation by Red Light.” Angewandte Chemie - International Edition, vol.
55, no. 21, Wiley, 2016, pp. 6339–42, doi:10.1002/anie.201601736.
short: E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, H.L.
Janovjak, Angewandte Chemie - International Edition 55 (2016) 6339–6342.
date_created: 2018-12-11T11:52:02Z
date_published: 2016-05-17T00:00:00Z
date_updated: 2023-09-07T12:49:08Z
day: '17'
ddc:
- '571'
- '576'
department:
- _id: HaJa
doi: 10.1002/anie.201601736
ec_funded: 1
file:
- access_level: open_access
checksum: 26da07960e57ac4750b54179197ce57f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:03Z
date_updated: 2020-07-14T12:44:55Z
file_id: '5255'
file_name: IST-2017-840-v1+1_reichhart.pdf
file_size: 1268662
relation: main_file
file_date_updated: 2020-07-14T12:44:55Z
has_accepted_license: '1'
intvolume: ' 55'
issue: '21'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 6339 - 6342
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255A6082-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Angewandte Chemie - International Edition
publication_status: published
publisher: Wiley
publist_id: '5755'
pubrep_id: '840'
quality_controlled: '1'
related_material:
record:
- id: '418'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: A phytochrome sensory domain permits receptor activation by red light
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1446'
abstract:
- lang: eng
text: The accuracy of interdisciplinarity measurements is directly related to the
quality of the underlying bibliographic data. Existing indicators of interdisciplinarity
are not capable of reflecting the inaccuracies introduced by incorrect and incomplete
records because correct and complete bibliographic data can rarely be obtained.
This is the case for the Rao–Stirling index, which cannot handle references that
are not categorized into disciplinary fields. We introduce a method that addresses
this problem. It extends the Rao–Stirling index to acknowledge missing data by
calculating its interval of uncertainty using computational optimization. The
evaluation of our method indicates that the uncertainty interval is not only useful
for estimating the inaccuracy of interdisciplinarity measurements, but it also
delivers slightly more accurate aggregated interdisciplinarity measurements than
the Rao–Stirling index.
article_processing_charge: No
author:
- first_name: Maria
full_name: Calatrava Moreno, Maria
last_name: Calatrava Moreno
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Hannes
full_name: Werthner, Hannes
last_name: Werthner
citation:
ama: Calatrava Moreno M, Auzinger T, Werthner H. On the uncertainty of interdisciplinarity
measurements due to incomplete bibliographic data. Scientometrics. 2016;107(1):213-232.
doi:10.1007/s11192-016-1842-4
apa: Calatrava Moreno, M., Auzinger, T., & Werthner, H. (2016). On the uncertainty
of interdisciplinarity measurements due to incomplete bibliographic data. Scientometrics.
Springer. https://doi.org/10.1007/s11192-016-1842-4
chicago: Calatrava Moreno, Maria, Thomas Auzinger, and Hannes Werthner. “On the
Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic
Data.” Scientometrics. Springer, 2016. https://doi.org/10.1007/s11192-016-1842-4.
ieee: M. Calatrava Moreno, T. Auzinger, and H. Werthner, “On the uncertainty of
interdisciplinarity measurements due to incomplete bibliographic data,” Scientometrics,
vol. 107, no. 1. Springer, pp. 213–232, 2016.
ista: Calatrava Moreno M, Auzinger T, Werthner H. 2016. On the uncertainty of interdisciplinarity
measurements due to incomplete bibliographic data. Scientometrics. 107(1), 213–232.
mla: Calatrava Moreno, Maria, et al. “On the Uncertainty of Interdisciplinarity
Measurements Due to Incomplete Bibliographic Data.” Scientometrics, vol.
107, no. 1, Springer, 2016, pp. 213–32, doi:10.1007/s11192-016-1842-4.
short: M. Calatrava Moreno, T. Auzinger, H. Werthner, Scientometrics 107 (2016)
213–232.
date_created: 2018-12-11T11:52:04Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2021-11-16T08:29:11Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1007/s11192-016-1842-4
file:
- access_level: open_access
checksum: 32d46268588b87d9b686492018e6a2b2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:56Z
date_updated: 2020-07-14T12:44:55Z
file_id: '4848'
file_name: IST-2016-530-v1+1_s11192-016-1842-4.pdf
file_size: 806035
relation: main_file
file_date_updated: 2020-07-14T12:44:55Z
has_accepted_license: '1'
intvolume: ' 107'
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 213 - 232
publication: Scientometrics
publication_status: published
publisher: Springer
publist_id: '5750'
pubrep_id: '530'
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s11192-016-1902-9
scopus_import: '1'
status: public
title: On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic
data
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: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 107
year: '2016'
...
---
_id: '1448'
abstract:
- lang: eng
text: We develop a new and systematic method for proving entropic Ricci curvature
lower bounds for Markov chains on discrete sets. Using different methods, such
bounds have recently been obtained in several examples (e.g., 1-dimensional birth
and death chains, product chains, Bernoulli–Laplace models, and random transposition
models). However, a general method to obtain discrete Ricci bounds had been lacking.
Our method covers all of the examples above. In addition we obtain new Ricci curvature
bounds for zero-range processes on the complete graph. The method is inspired
by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities.
acknowledgement: "Supported by the German Research Foundation through the Collaborative
Research Center 1060\r\nThe Mathematics of Emergent Effects and the Hausdorff Center
for Mathematics. Part of this work has been done while M. Fathi visited J. Maas
at the University of Bonn in July 2014.We would like to thank the referees for their
careful reading of the manuscript. "
author:
- first_name: Max
full_name: Fathi, Max
last_name: Fathi
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Fathi M, Maas J. Entropic Ricci curvature bounds for discrete interacting systems.
The Annals of Applied Probability. 2016;26(3):1774-1806. doi:10.1214/15-AAP1133
apa: Fathi, M., & Maas, J. (2016). Entropic Ricci curvature bounds for discrete
interacting systems. The Annals of Applied Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/15-AAP1133
chicago: Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete
Interacting Systems.” The Annals of Applied Probability. Institute of Mathematical
Statistics, 2016. https://doi.org/10.1214/15-AAP1133.
ieee: M. Fathi and J. Maas, “Entropic Ricci curvature bounds for discrete interacting
systems,” The Annals of Applied Probability, vol. 26, no. 3. Institute
of Mathematical Statistics, pp. 1774–1806, 2016.
ista: Fathi M, Maas J. 2016. Entropic Ricci curvature bounds for discrete interacting
systems. The Annals of Applied Probability. 26(3), 1774–1806.
mla: Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting
Systems.” The Annals of Applied Probability, vol. 26, no. 3, Institute
of Mathematical Statistics, 2016, pp. 1774–806, doi:10.1214/15-AAP1133.
short: M. Fathi, J. Maas, The Annals of Applied Probability 26 (2016) 1774–1806.
date_created: 2018-12-11T11:52:05Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2021-01-12T06:50:49Z
day: '01'
department:
- _id: JaMa
doi: 10.1214/15-AAP1133
intvolume: ' 26'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.00562
month: '06'
oa: 1
oa_version: Preprint
page: 1774 - 1806
publication: The Annals of Applied Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5748'
quality_controlled: '1'
scopus_import: 1
status: public
title: Entropic Ricci curvature bounds for discrete interacting systems
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2016'
...