---
_id: '993'
abstract:
- lang: eng
text: In real-world applications, observations are often constrained to a small
fraction of a system. Such spatial subsampling can be caused by the inaccessibility
or the sheer size of the system, and cannot be overcome by longer sampling. Spatial
subsampling can strongly bias inferences about a system’s aggregated properties.
To overcome the bias, we derive analytically a subsampling scaling framework that
is applicable to different observables, including distributions of neuronal avalanches,
of number of people infected during an epidemic outbreak, and of node degrees.
We demonstrate how to infer the correct distributions of the underlying full system,
how to apply it to distinguish critical from subcritical systems, and how to disentangle
subsampling and finite size effects. Lastly, we apply subsampling scaling to neuronal
avalanche models and to recordings from developing neural networks. We show that
only mature, but not young networks follow power-law scaling, indicating self-organization
to criticality during development.
article_number: '15140'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Anna
full_name: Levina (Martius), Anna
id: 35AF8020-F248-11E8-B48F-1D18A9856A87
last_name: Levina (Martius)
- first_name: Viola
full_name: Priesemann, Viola
last_name: Priesemann
citation:
ama: Levina (Martius) A, Priesemann V. Subsampling scaling. Nature Communications.
2017;8. doi:10.1038/ncomms15140
apa: Levina (Martius), A., & Priesemann, V. (2017). Subsampling scaling. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms15140
chicago: Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature
Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms15140.
ieee: A. Levina (Martius) and V. Priesemann, “Subsampling scaling,” Nature Communications,
vol. 8. Nature Publishing Group, 2017.
ista: Levina (Martius) A, Priesemann V. 2017. Subsampling scaling. Nature Communications.
8, 15140.
mla: Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature
Communications, vol. 8, 15140, Nature Publishing Group, 2017, doi:10.1038/ncomms15140.
short: A. Levina (Martius), V. Priesemann, Nature Communications 8 (2017).
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-04T00:00:00Z
date_updated: 2023-09-22T09:54:07Z
day: '04'
ddc:
- '005'
- '571'
department:
- _id: GaTk
- _id: JoCs
doi: 10.1038/ncomms15140
ec_funded: 1
external_id:
isi:
- '000400560700001'
file:
- access_level: open_access
checksum: 9880212f8c4c53404c7c6fbf9023c53a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:05Z
date_updated: 2020-07-14T12:48:19Z
file_id: '5122'
file_name: IST-2017-819-v1+1_2017_Levina_SubsamplingScaling.pdf
file_size: 746224
relation: main_file
file_date_updated: 2020-07-14T12:48:19Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '6406'
pubrep_id: '819'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Subsampling scaling
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2017'
...
---
_id: '994'
abstract:
- lang: eng
text: The formation of vortices is usually considered to be the main mechanism of
angular momentum disposal in superfluids. Recently, it was predicted that a superfluid
can acquire angular momentum via an alternative, microscopic route -- namely,
through interaction with rotating impurities, forming so-called `angulon quasiparticles'
[Phys. Rev. Lett. 114, 203001 (2015)]. The angulon instabilities correspond to
transfer of a small number of angular momentum quanta from the impurity to the
superfluid, as opposed to vortex instabilities, where angular momentum is quantized
in units of ℏ per atom. Furthermore, since conventional impurities (such as molecules)
represent three-dimensional (3D) rotors, the angular momentum transferred is intrinsically
3D as well, as opposed to a merely planar rotation which is inherent to vortices.
Herein we show that the angulon theory can explain the anomalous broadening of
the spectroscopic lines observed for CH 3 and NH 3 molecules in superfluid
helium nanodroplets, thereby providing a fingerprint of the emerging angulon instabilities
in experiment.
article_processing_charge: No
author:
- first_name: Igor
full_name: Cherepanov, Igor
id: 339C7E5A-F248-11E8-B48F-1D18A9856A87
last_name: Cherepanov
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Cherepanov I, Lemeshko M. Fingerprints of angulon instabilities in the spectra
of matrix-isolated molecules. Physical Review Materials. 2017;1(3). doi:10.1103/PhysRevMaterials.1.035602
apa: Cherepanov, I., & Lemeshko, M. (2017). Fingerprints of angulon instabilities
in the spectra of matrix-isolated molecules. Physical Review Materials.
American Physical Society. https://doi.org/10.1103/PhysRevMaterials.1.035602
chicago: Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities
in the Spectra of Matrix-Isolated Molecules.” Physical Review Materials.
American Physical Society, 2017. https://doi.org/10.1103/PhysRevMaterials.1.035602.
ieee: I. Cherepanov and M. Lemeshko, “Fingerprints of angulon instabilities in the
spectra of matrix-isolated molecules,” Physical Review Materials, vol.
1, no. 3. American Physical Society, 2017.
ista: Cherepanov I, Lemeshko M. 2017. Fingerprints of angulon instabilities in the
spectra of matrix-isolated molecules. Physical Review Materials. 1(3).
mla: Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities
in the Spectra of Matrix-Isolated Molecules.” Physical Review Materials,
vol. 1, no. 3, American Physical Society, 2017, doi:10.1103/PhysRevMaterials.1.035602.
short: I. Cherepanov, M. Lemeshko, Physical Review Materials 1 (2017).
date_created: 2018-12-11T11:49:35Z
date_published: 2017-08-08T00:00:00Z
date_updated: 2023-09-22T09:53:42Z
day: '08'
department:
- _id: MiLe
doi: 10.1103/PhysRevMaterials.1.035602
ec_funded: 1
external_id:
isi:
- '000416564000004'
intvolume: ' 1'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.09220
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Physical Review Materials
publication_status: published
publisher: American Physical Society
publist_id: '6405'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 1
year: '2017'
...
---
_id: '995'
abstract:
- lang: eng
text: Recently it was shown that an impurity exchanging orbital angular momentum
with a surrounding bath can be described in terms of the angulon quasiparticle
[Phys. Rev. Lett. 118, 095301 (2017)]. The angulon consists of a quantum rotor
dressed by a many-particle field of boson excitations, and can be formed out of,
for example, a molecule or a nonspherical atom in superfluid helium, or out of
an electron coupled to lattice phonons or a Bose condensate. Here we develop an
approach to the angulon based on the path-integral formalism, which sets the ground
for a systematic, perturbative treatment of the angulon problem. The resulting
perturbation series can be interpreted in terms of Feynman diagrams, from which,
in turn, one can derive a set of diagrammatic rules. These rules extend the machinery
of the graphical theory of angular momentum - well known from theoretical atomic
spectroscopy - to the case where an environment with an infinite number of degrees
of freedom is present. In particular, we show that each diagram can be interpreted
as a 'skeleton', which enforces angular momentum conservation, dressed by an additional
many-body contribution. This connection between the angulon theory and the graphical
theory of angular momentum is particularly important as it allows to systematically
and substantially simplify the analytical representation of each diagram. In order
to exemplify the technique, we calculate the 1- and 2-loop contributions to the
angulon self-energy, the spectral function, and the quasiparticle weight. The
diagrammatic theory we develop paves the way to investigate next-to-leading order
quantities in a more compact way compared to the variational approaches.
article_number: '085410'
article_processing_charge: No
author:
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Bighin G, Lemeshko M. Diagrammatic approach to orbital quantum impurities interacting
with a many-particle environment. Physical Review B - Condensed Matter and
Materials Physics. 2017;96(8). doi:10.1103/PhysRevB.96.085410
apa: Bighin, G., & Lemeshko, M. (2017). Diagrammatic approach to orbital quantum
impurities interacting with a many-particle environment. Physical Review B
- Condensed Matter and Materials Physics. American Physical Society. https://doi.org/10.1103/PhysRevB.96.085410
chicago: Bighin, Giacomo, and Mikhail Lemeshko. “Diagrammatic Approach to Orbital
Quantum Impurities Interacting with a Many-Particle Environment.” Physical
Review B - Condensed Matter and Materials Physics. American Physical Society,
2017. https://doi.org/10.1103/PhysRevB.96.085410.
ieee: G. Bighin and M. Lemeshko, “Diagrammatic approach to orbital quantum impurities
interacting with a many-particle environment,” Physical Review B - Condensed
Matter and Materials Physics, vol. 96, no. 8. American Physical Society, 2017.
ista: Bighin G, Lemeshko M. 2017. Diagrammatic approach to orbital quantum impurities
interacting with a many-particle environment. Physical Review B - Condensed Matter
and Materials Physics. 96(8), 085410.
mla: Bighin, Giacomo, and Mikhail Lemeshko. “Diagrammatic Approach to Orbital Quantum
Impurities Interacting with a Many-Particle Environment.” Physical Review B
- Condensed Matter and Materials Physics, vol. 96, no. 8, 085410, American
Physical Society, 2017, doi:10.1103/PhysRevB.96.085410.
short: G. Bighin, M. Lemeshko, Physical Review B - Condensed Matter and Materials
Physics 96 (2017).
date_created: 2018-12-11T11:49:36Z
date_published: 2017-08-07T00:00:00Z
date_updated: 2023-09-22T09:53:17Z
day: '07'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.96.085410
external_id:
isi:
- '000407017100009'
intvolume: ' 96'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.02616
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review B - Condensed Matter and Materials Physics
publication_identifier:
issn:
- '24699950'
publication_status: published
publisher: American Physical Society
publist_id: '6404'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diagrammatic approach to orbital quantum impurities interacting with a many-particle
environment
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 96
year: '2017'
...
---
_id: '996'
abstract:
- lang: eng
text: 'Iodine (I 2 ) molecules embedded in He nanodroplets are aligned by a 160
ps long laser pulse. The highest degree of alignment, occurring at the peak of
the pulse and quantified by ⟨cos 2 θ 2D ⟩ , is measured as a function of the laser
intensity. The results are well described by ⟨cos 2 θ 2D ⟩ calculated for a gas
of isolated molecules each with an effective rotational constant of 0.6 times
the gas-phase value, and at a temperature of 0.4 K. Theoretical analysis using
the angulon quasiparticle to describe rotating molecules in superfluid helium
rationalizes why the alignment mechanism is similar to that of isolated molecules
with an effective rotational constant. A major advantage of molecules in He droplets
is that their 0.4 K temperature leads to stronger alignment than what can generally
be achieved for gas phase molecules -- here demonstrated by a direct comparison
of the droplet results to measurements on a ∼ 1 K supersonic beam of isolated
molecules. This point is further illustrated for more complex system by measurements
on 1,4-diiodobenzene and 1,4-dibromobenzene. For all three molecular species studied
the highest values of ⟨cos 2 θ 2D ⟩ achieved in He droplets exceed 0.96. '
article_number: '013946'
article_processing_charge: No
author:
- first_name: Benjamin
full_name: Shepperson, Benjamin
last_name: Shepperson
- first_name: Adam
full_name: Chatterley, Adam
last_name: Chatterley
- first_name: Anders
full_name: Søndergaard, Anders
last_name: Søndergaard
- first_name: Lars
full_name: Christiansen, Lars
last_name: Christiansen
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Henrik
full_name: Stapelfeldt, Henrik
last_name: Stapelfeldt
citation:
ama: Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt
H. Strongly aligned molecules inside helium droplets in the near-adiabatic regime.
The Journal of Chemical Physics. 2017;147(1). doi:10.1063/1.4983703
apa: Shepperson, B., Chatterley, A., Søndergaard, A., Christiansen, L., Lemeshko,
M., & Stapelfeldt, H. (2017). Strongly aligned molecules inside helium droplets
in the near-adiabatic regime. The Journal of Chemical Physics. AIP Publishing.
https://doi.org/10.1063/1.4983703
chicago: Shepperson, Benjamin, Adam Chatterley, Anders Søndergaard, Lars Christiansen,
Mikhail Lemeshko, and Henrik Stapelfeldt. “Strongly Aligned Molecules inside Helium
Droplets in the Near-Adiabatic Regime.” The Journal of Chemical Physics.
AIP Publishing, 2017. https://doi.org/10.1063/1.4983703.
ieee: B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko,
and H. Stapelfeldt, “Strongly aligned molecules inside helium droplets in the
near-adiabatic regime,” The Journal of Chemical Physics, vol. 147, no.
1. AIP Publishing, 2017.
ista: Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt
H. 2017. Strongly aligned molecules inside helium droplets in the near-adiabatic
regime. The Journal of Chemical Physics. 147(1), 013946.
mla: Shepperson, Benjamin, et al. “Strongly Aligned Molecules inside Helium Droplets
in the Near-Adiabatic Regime.” The Journal of Chemical Physics, vol. 147,
no. 1, 013946, AIP Publishing, 2017, doi:10.1063/1.4983703.
short: B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko,
H. Stapelfeldt, The Journal of Chemical Physics 147 (2017).
date_created: 2018-12-11T11:49:36Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2024-02-28T13:02:26Z
day: '01'
department:
- _id: MiLe
doi: 10.1063/1.4983703
external_id:
isi:
- '000405089400047'
intvolume: ' 147'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.03684
month: '06'
oa: 1
oa_version: Submitted Version
publication: The Journal of Chemical Physics
publication_identifier:
issn:
- '00219606'
publication_status: published
publisher: AIP Publishing
publist_id: '6403'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strongly aligned molecules inside helium droplets in the near-adiabatic regime
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 147
year: '2017'
...
---
_id: '997'
abstract:
- lang: eng
text: Recently it was shown that molecules rotating in superfluid helium can be
described in terms of the angulon quasiparticles (Phys. Rev. Lett. 118, 095301
(2017)). Here we demonstrate that in the experimentally realized regime the angulon
can be seen as a point charge on a 2-sphere interacting with a gauge field of
a non-abelian magnetic monopole. Unlike in several other settings, the gauge fields
of the angulon problem emerge in the real coordinate space, as opposed to the
momentum space or some effective parameter space. Furthermore, we find a topological
transition associated with making the monopole abelian, which takes place in the
vicinity of the previously reported angulon instabilities. These results pave
the way for studying topological phenomena in experiments on molecules trapped
in superfluid helium nanodroplets, as well as on other realizations of orbital
impurity problems.
article_number: '235301'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Yakaboylu E, Deuchert A, Lemeshko M. Emergence of non-abelian magnetic monopoles
in a quantum impurity problem. Physical Review Letters. 2017;119(23). doi:10.1103/PhysRevLett.119.235301
apa: Yakaboylu, E., Deuchert, A., & Lemeshko, M. (2017). Emergence of non-abelian
magnetic monopoles in a quantum impurity problem. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.119.235301
chicago: Yakaboylu, Enderalp, Andreas Deuchert, and Mikhail Lemeshko. “Emergence
of Non-Abelian Magnetic Monopoles in a Quantum Impurity Problem.” Physical
Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.235301.
ieee: E. Yakaboylu, A. Deuchert, and M. Lemeshko, “Emergence of non-abelian magnetic
monopoles in a quantum impurity problem,” Physical Review Letters, vol.
119, no. 23. American Physical Society, 2017.
ista: Yakaboylu E, Deuchert A, Lemeshko M. 2017. Emergence of non-abelian magnetic
monopoles in a quantum impurity problem. Physical Review Letters. 119(23), 235301.
mla: Yakaboylu, Enderalp, et al. “Emergence of Non-Abelian Magnetic Monopoles in
a Quantum Impurity Problem.” Physical Review Letters, vol. 119, no. 23,
235301, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.235301.
short: E. Yakaboylu, A. Deuchert, M. Lemeshko, Physical Review Letters 119 (2017).
date_created: 2018-12-11T11:49:36Z
date_published: 2017-12-06T00:00:00Z
date_updated: 2023-10-10T13:31:54Z
day: '06'
department:
- _id: MiLe
- _id: RoSe
doi: 10.1103/PhysRevLett.119.235301
ec_funded: 1
external_id:
arxiv:
- '1705.05162'
isi:
- '000417132100007'
intvolume: ' 119'
isi: 1
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.05162
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review Letters
publication_identifier:
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
publist_id: '6401'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emergence of non-abelian magnetic monopoles in a quantum impurity problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2017'
...
---
_id: '998'
abstract:
- lang: eng
text: 'A major open problem on the road to artificial intelligence is the development
of incrementally learning systems that learn about more and more concepts over
time from a stream of data. In this work, we introduce a new training strategy,
iCaRL, that allows learning in such a class-incremental way: only the training
data for a small number of classes has to be present at the same time and new
classes can be added progressively. iCaRL learns strong classifiers and a data
representation simultaneously. This distinguishes it from earlier works that were
fundamentally limited to fixed data representations and therefore incompatible
with deep learning architectures. We show by experiments on CIFAR-100 and ImageNet
ILSVRC 2012 data that iCaRL can learn many classes incrementally over a long period
of time where other strategies quickly fail. '
article_processing_charge: No
author:
- first_name: Sylvestre Alvise
full_name: Rebuffi, Sylvestre Alvise
last_name: Rebuffi
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Georg
full_name: Sperl, Georg
id: 4DD40360-F248-11E8-B48F-1D18A9856A87
last_name: Sperl
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. iCaRL: Incremental classifier
and representation learning. In: Vol 2017. IEEE; 2017:5533-5542. doi:10.1109/CVPR.2017.587'
apa: 'Rebuffi, S. A., Kolesnikov, A., Sperl, G., & Lampert, C. (2017). iCaRL:
Incremental classifier and representation learning (Vol. 2017, pp. 5533–5542).
Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States: IEEE. https://doi.org/10.1109/CVPR.2017.587'
chicago: 'Rebuffi, Sylvestre Alvise, Alexander Kolesnikov, Georg Sperl, and Christoph
Lampert. “ICaRL: Incremental Classifier and Representation Learning,” 2017:5533–42.
IEEE, 2017. https://doi.org/10.1109/CVPR.2017.587.'
ieee: 'S. A. Rebuffi, A. Kolesnikov, G. Sperl, and C. Lampert, “iCaRL: Incremental
classifier and representation learning,” presented at the CVPR: Computer Vision
and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 5533–5542.'
ista: 'Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. 2017. iCaRL: Incremental classifier
and representation learning. CVPR: Computer Vision and Pattern Recognition vol.
2017, 5533–5542.'
mla: 'Rebuffi, Sylvestre Alvise, et al. ICaRL: Incremental Classifier and Representation
Learning. Vol. 2017, IEEE, 2017, pp. 5533–42, doi:10.1109/CVPR.2017.587.'
short: S.A. Rebuffi, A. Kolesnikov, G. Sperl, C. Lampert, in:, IEEE, 2017, pp. 5533–5542.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:37Z
date_published: 2017-04-14T00:00:00Z
date_updated: 2023-09-22T09:51:58Z
day: '14'
department:
- _id: ChLa
- _id: ChWo
doi: 10.1109/CVPR.2017.587
ec_funded: 1
external_id:
isi:
- '000418371405066'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.07725
month: '04'
oa: 1
oa_version: Submitted Version
page: 5533 - 5542
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6400'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'iCaRL: Incremental classifier and representation learning'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '999'
abstract:
- lang: eng
text: 'In multi-task learning, a learner is given a collection of prediction tasks
and needs to solve all of them. In contrast to previous work, which required that
annotated training data must be available for all tasks, we consider a new setting,
in which for some tasks, potentially most of them, only unlabeled training data
is provided. Consequently, to solve all tasks, information must be transferred
between tasks with labels and tasks without labels. Focusing on an instance-based
transfer method we analyze two variants of this setting: when the set of labeled
tasks is fixed, and when it can be actively selected by the learner. We state
and prove a generalization bound that covers both scenarios and derive from it
an algorithm for making the choice of labeled tasks (in the active case) and for
transferring information between the tasks in a principled way. We also illustrate
the effectiveness of the algorithm on synthetic and real data. '
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Lampert C. Multi-task learning with labeled and unlabeled tasks.
In: Vol 70. ML Research Press; 2017:2807-2816.'
apa: 'Pentina, A., & Lampert, C. (2017). Multi-task learning with labeled and
unlabeled tasks (Vol. 70, pp. 2807–2816). Presented at the ICML: International
Conference on Machine Learning, Sydney, Australia: ML Research Press.'
chicago: Pentina, Anastasia, and Christoph Lampert. “Multi-Task Learning with Labeled
and Unlabeled Tasks,” 70:2807–16. ML Research Press, 2017.
ieee: 'A. Pentina and C. Lampert, “Multi-task learning with labeled and unlabeled
tasks,” presented at the ICML: International Conference on Machine Learning, Sydney,
Australia, 2017, vol. 70, pp. 2807–2816.'
ista: 'Pentina A, Lampert C. 2017. Multi-task learning with labeled and unlabeled
tasks. ICML: International Conference on Machine Learning, PMLR, vol. 70, 2807–2816.'
mla: Pentina, Anastasia, and Christoph Lampert. Multi-Task Learning with Labeled
and Unlabeled Tasks. Vol. 70, ML Research Press, 2017, pp. 2807–16.
short: A. Pentina, C. Lampert, in:, ML Research Press, 2017, pp. 2807–2816.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
date_created: 2018-12-11T11:49:37Z
date_published: 2017-06-08T00:00:00Z
date_updated: 2023-10-17T11:53:32Z
day: '08'
department:
- _id: ChLa
ec_funded: 1
external_id:
isi:
- '000683309502093'
intvolume: ' 70'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.06518
month: '06'
oa: 1
oa_version: Submitted Version
page: 2807 - 2816
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
isbn:
- '9781510855144'
publication_status: published
publisher: ML Research Press
publist_id: '6399'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-task learning with labeled and unlabeled tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2017'
...
---
_id: '424'
abstract:
- lang: eng
text: 'We show that very weak topological assumptions are enough to ensure the existence
of a Helly-type theorem. More precisely, we show that for any non-negative integers
b and d there exists an integer h(b, d) such that the following holds. If F is
a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤
i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced
Z2-Betti numbers (with singular homology). These topological conditions are sharp:
not controlling any of these [d/2] first Betti numbers allow for families with
unbounded Helly number. Our proofs combine homological non-embeddability results
with a Ramsey-based approach to build, given an arbitrary simplicial complex K,
some well-behaved chain map C*(K)→C*(Rd).'
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via
betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. A Journey through Discrete
Mathematics: A Tribute to Jiri Matousek. A Journey Through Discrete Mathematics.
Springer; 2017:407-447. doi:10.1007/978-3-319-44479-6_17'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). Bounding
helly numbers via betti numbers. In M. Loebl, J. Nešetřil, & R. Thomas (Eds.),
A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp.
407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17'
chicago: 'Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Bounding Helly Numbers via Betti Numbers.” In A Journey through Discrete Mathematics:
A Tribute to Jiri Matousek, edited by Martin Loebl, Jaroslav Nešetřil, and
Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017.
https://doi.org/10.1007/978-3-319-44479-6_17.'
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly
numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017,
pp. 407–447.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers
via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri
Matousek. , 407–447.'
mla: 'Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” A Journey
through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin
Loebl et al., Springer, 2017, pp. 407–47, doi:10.1007/978-3-319-44479-6_17.'
short: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J.
Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, Springer, 2017, pp. 407–447.'
date_created: 2018-12-11T11:46:24Z
date_published: 2017-10-06T00:00:00Z
date_updated: 2024-02-28T12:59:37Z
day: '06'
department:
- _id: UlWa
doi: 10.1007/978-3-319-44479-6_17
editor:
- first_name: Martin
full_name: Loebl, Martin
last_name: Loebl
- first_name: Jaroslav
full_name: Nešetřil, Jaroslav
last_name: Nešetřil
- first_name: Robin
full_name: Thomas, Robin
last_name: Thomas
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.4613v3
month: '10'
oa: 1
oa_version: Published Version
page: 407 - 447
publication: 'A Journey through Discrete Mathematics: A Tribute to Jiri Matousek'
publication_identifier:
isbn:
- 978-331944479-6
publication_status: published
publisher: Springer
publist_id: '7399'
quality_controlled: '1'
related_material:
record:
- id: '1512'
relation: earlier_version
status: public
scopus_import: 1
series_title: A Journey Through Discrete Mathematics
status: public
title: Bounding helly numbers via betti numbers
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '431'
abstract:
- lang: eng
text: 'Parallel implementations of stochastic gradient descent (SGD) have received
significant research attention, thanks to its excellent scalability properties.
A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating
gradient updates between nodes; consequently, several lossy compresion heuristics
have been proposed, by which nodes only communicate quantized gradients. Although
effective in practice, these heuristics do not always converge. In this paper,
we propose Quantized SGD (QSGD), a family of compression schemes with convergence
guarantees and good practical performance. QSGD allows the user to smoothly trade
off communication bandwidth and convergence time: nodes can adjust the number
of bits sent per iteration, at the cost of possibly higher variance. We show that
this trade-off is inherent, in the sense that improving it past some threshold
would violate information-theoretic lower bounds. QSGD guarantees convergence
for convex and non-convex objectives, under asynchrony, and can be extended to
stochastic variance-reduced techniques. When applied to training deep neural networks
for image classification and automated speech recognition, QSGD leads to significant
reductions in end-to-end training time. For instance, on 16GPUs, we can train
the ResNet-152 network to full accuracy on ImageNet 1.8 × faster than the full-precision
variant. '
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Ryota
full_name: Tomioka, Ryota
last_name: Tomioka
- first_name: Milan
full_name: Vojnović, Milan
last_name: Vojnović
citation:
ama: 'Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient
SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing
Systems Foundation; 2017:1710-1721.'
apa: 'Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., & Vojnović, M. (2017).
QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol.
2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System,
Long Beach, CA, United States: Neural Information Processing Systems Foundation.'
chicago: 'Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan
Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,”
2017:1710–21. Neural Information Processing Systems Foundation, 2017.'
ieee: 'D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient
SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information
Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.'
ista: 'Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. 2017. QSGD: Communication-efficient
SGD via gradient quantization and encoding. NIPS: Neural Information Processing
System, Advances in Neural Information Processing Systems, vol. 2017, 1710–1721.'
mla: 'Alistarh, Dan-Adrian, et al. QSGD: Communication-Efficient SGD via Gradient
Quantization and Encoding. Vol. 2017, Neural Information Processing Systems
Foundation, 2017, pp. 1710–21.'
short: D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information
Processing Systems Foundation, 2017, pp. 1710–1721.
conference:
end_date: 2017-12-09
location: Long Beach, CA, United States
name: 'NIPS: Neural Information Processing System'
start_date: 2017-12-04
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-10-17T11:48:03Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1610.02132'
intvolume: ' 2017'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1610.02132
month: '01'
oa: 1
oa_version: Submitted Version
page: 1710-1721
publication_identifier:
issn:
- '10495258'
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '7392'
quality_controlled: '1'
status: public
title: 'QSGD: Communication-efficient SGD via gradient quantization and encoding'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2017
year: '2017'
...
---
_id: '432'
abstract:
- lang: eng
text: 'Recently there has been significant interest in training machine-learning
models at low precision: by reducing precision, one can reduce computation and
communication by one order of magnitude. We examine training at reduced precision,
both from a theoretical and practical perspective, and ask: is it possible to
train models at end-to-end low precision with provable guarantees? Can this lead
to consistent order-of-magnitude speedups? We mainly focus on linear models, and
the answer is yes for linear models. We develop a simple framework called ZipML
based on one simple but novel strategy called double sampling. Our ZipML framework
is able to execute training at low precision with no bias, guaranteeing convergence,
whereas naive quanti- zation would introduce significant bias. We val- idate our
framework across a range of applica- tions, and show that it enables an FPGA proto-
type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision.
We further de- velop a variance-optimal stochastic quantization strategy and show
that it can make a significant difference in a variety of settings. When applied
to linear models together with double sampling, we save up to another 1.7 × in
data movement compared with uniform quantization. When training deep networks
with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. '
alternative_title:
- PMLR Press
article_processing_charge: No
author:
- first_name: Hantian
full_name: Zhang, Hantian
last_name: Zhang
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Kaan
full_name: Kara, Kaan
last_name: Kara
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Ji
full_name: Liu, Ji
last_name: Liu
- first_name: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear
models with end-to-end low precision, and a little bit of deep learning. In: Proceedings
of Machine Learning Research. Vol 70. ML Research Press; 2017:4035-4043.'
apa: 'Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., & Zhang, C. (2017).
ZipML: Training linear models with end-to-end low precision, and a little bit
of deep learning. In Proceedings of Machine Learning Research (Vol. 70,
pp. 4035–4043). Sydney, Australia: ML Research Press.'
chicago: 'Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and
Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a
Little Bit of Deep Learning.” In Proceedings of Machine Learning Research,
70:4035–43. ML Research Press, 2017.'
ieee: 'H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training
linear models with end-to-end low precision, and a little bit of deep learning,”
in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol.
70, pp. 4035–4043.'
ista: 'Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training
linear models with end-to-end low precision, and a little bit of deep learning.
Proceedings of Machine Learning Research. ICML: International Conference on
Machine Learning, PMLR Press, vol. 70, 4035–4043.'
mla: 'Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low
Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning
Research, vol. 70, ML Research Press, 2017, pp. 4035–43.'
short: H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings
of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-10-17T12:31:15Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
file:
- access_level: open_access
checksum: 86156ba7f4318e47cef3eb9092593c10
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:23:58Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5869'
file_name: 2017_ICML_Zhang.pdf
file_size: 849345
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 4035 - 4043
publication: Proceedings of Machine Learning Research
publication_identifier:
isbn:
- 978-151085514-4
publication_status: published
publisher: ML Research Press
publist_id: '7391'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ZipML: Training linear models with end-to-end low precision, and a little
bit of deep learning'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: ' 70'
year: '2017'
...
---
_id: '444'
abstract:
- lang: eng
text: Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular
energy generation, contributing to the proton motive force used to produce ATP.
It couples the transfer of two electrons between NADH and quinone to translocation
of four protons across the membrane. It is the largest protein assembly of bacterial
and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits
with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size,
providing the important “minimal” model of complex I. The l-shaped complex consists
of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where
proton translocation takes place. Previously, we have solved the crystal structures
of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane
domain from Escherichia coli, followed by the atomic structure of intact, entire
complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete
atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are
well conserved from the bacterial version, whilst supernumerary subunits form
an interlinked, stabilizing shell around the core. Subunits containing additional
cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory
roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative
diseases. The structure of mammalian enzyme provides many insights into complex
I mechanism, assembly, maturation and dysfunction, allowing detailed molecular
analysis of disease-causing mutations.
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de
luxe” mammalian versions. In: Wikström M, ed. Mechanisms of Primary Energy
Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology
. Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025'
apa: 'Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial
and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary
energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025'
chicago: 'Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial
and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction
in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy
Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025.'
ieee: 'L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and
‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction
in biology , M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.'
ista: 'Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial
and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction
in biology . , 25–59.'
mla: 'Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial
and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction
in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017,
pp. 25–59, doi:10.1039/9781788010405-00025.'
short: L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction
in Biology , Royal Society of Chemistry, 2017, pp. 25–59.
date_created: 2018-12-11T11:46:30Z
date_published: 2017-11-29T00:00:00Z
date_updated: 2021-01-12T07:56:59Z
day: '29'
department:
- _id: LeSa
doi: 10.1039/9781788010405-00025
editor:
- first_name: Mårten
full_name: Wikström, Mårten
last_name: Wikström
language:
- iso: eng
month: '11'
oa_version: None
page: 25 - 59
publication: 'Mechanisms of primary energy transduction in biology '
publication_identifier:
isbn:
- 978-1-78262-865-1
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7379'
quality_controlled: '1'
series_title: 'Mechanisms of Primary Energy Transduction in Biology '
status: public
title: 'Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian
versions'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '447'
abstract:
- lang: eng
text: We consider last passage percolation (LPP) models with exponentially distributed
random variables, which are linked to the totally asymmetric simple exclusion
process (TASEP). The competition interface for LPP was introduced and studied
in Ferrari and Pimentel (2005a) for cases where the corresponding exclusion process
had a rarefaction fan. Here we consider situations with a shock and determine
the law of the fluctuations of the competition interface around its deter- ministic
law of large number position. We also study the multipoint distribution of the
LPP around the shock, extending our one-point result of Ferrari and Nejjar (2015).
article_processing_charge: No
article_type: original
author:
- first_name: Patrik
full_name: Ferrari, Patrik
last_name: Ferrari
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
citation:
ama: Ferrari P, Nejjar P. Fluctuations of the competition interface in presence
of shocks. Revista Latino-Americana de Probabilidade e Estatística. 2017;9:299-325.
doi:10.30757/ALEA.v14-17
apa: Ferrari, P., & Nejjar, P. (2017). Fluctuations of the competition interface
in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística.
Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v14-17
chicago: Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface
in Presence of Shocks.” Revista Latino-Americana de Probabilidade e Estatística.
Instituto Nacional de Matematica Pura e Aplicada, 2017. https://doi.org/10.30757/ALEA.v14-17.
ieee: P. Ferrari and P. Nejjar, “Fluctuations of the competition interface in presence
of shocks,” Revista Latino-Americana de Probabilidade e Estatística, vol.
9. Instituto Nacional de Matematica Pura e Aplicada, pp. 299–325, 2017.
ista: Ferrari P, Nejjar P. 2017. Fluctuations of the competition interface in presence
of shocks. Revista Latino-Americana de Probabilidade e Estatística. 9, 299–325.
mla: Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface
in Presence of Shocks.” Revista Latino-Americana de Probabilidade e Estatística,
vol. 9, Instituto Nacional de Matematica Pura e Aplicada, 2017, pp. 299–325, doi:10.30757/ALEA.v14-17.
short: P. Ferrari, P. Nejjar, Revista Latino-Americana de Probabilidade e Estatística
9 (2017) 299–325.
date_created: 2018-12-11T11:46:31Z
date_published: 2017-03-23T00:00:00Z
date_updated: 2023-10-10T13:10:32Z
day: '23'
department:
- _id: LaEr
- _id: JaMa
doi: 10.30757/ALEA.v14-17
ec_funded: 1
intvolume: ' 9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://alea.impa.br/articles/v14/14-17.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 299 - 325
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Revista Latino-Americana de Probabilidade e Estatística
publication_status: published
publisher: Instituto Nacional de Matematica Pura e Aplicada
publist_id: '7376'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fluctuations of the competition interface in presence of shocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2017'
...
---
_id: '453'
abstract:
- lang: eng
text: Most kinesin motors move in only one direction along microtubules. Members
of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed
motors and shown to produce piconewton forces. However, some fungal kinesin-5
motors are bidirectional. The force production of a bidirectional kinesin-5 has
not yet been measured. Therefore, it remains unknown whether the mechanism of
the unconventional minus-end-directed motility differs fundamentally from that
of plus-end-directed stepping. Using force spectroscopy, we have measured here
the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in
microtubule gliding assays in both plus- and minus-end direction. Correlation
analysis of pause forces demonstrated that individual Cin8 molecules produce additive
forces in both directions of movement. In ensembles, Cin8 motors were able to
produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties
appear to be conserved within the kinesin-5 subfamily. Force production was largely
independent of the directionality of movement, indicating similarities between
the motility mechanisms for both directions. These results provide constraints
for the development of models for the bidirectional motility mechanism of fission
yeast kinesin-5 and provide insight into the function of this mitotic motor.
acknowledgement: 'The plasmid for full-length kinesin-1 was a gift from G. Holzwarth
and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade
for technical assistance. G.P. thanks the Francis Crick Institute, and in particular
the Surrey and Salbreux groups, for their hospitality during his sabbatical stay,
as well as Imperial College London for making it possible. This work was supported
by the Francis Crick Institute, which receives its core funding from Cancer Research
UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome
Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir
Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European
Research Council (Advanced Grant, project 323042). '
article_processing_charge: No
article_type: original
author:
- first_name: Todd
full_name: Fallesen, Todd
last_name: Fallesen
- first_name: Johanna
full_name: Roostalu, Johanna
last_name: Roostalu
- first_name: Christian F
full_name: Düllberg, Christian F
id: 459064DC-F248-11E8-B48F-1D18A9856A87
last_name: Düllberg
orcid: 0000-0001-6335-9748
- first_name: Gunnar
full_name: Pruessner, Gunnar
last_name: Pruessner
- first_name: Thomas
full_name: Surrey, Thomas
last_name: Surrey
citation:
ama: Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional
kinesin Cin8 produce additive forces in both directions of movement. Biophysical
Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006
apa: Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T.
(2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both
directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006
chicago: Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner,
and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces
in Both Directions of Movement.” Biophysical Journal. Biophysical Society,
2017. https://doi.org/10.1016/j.bpj.2017.09.006.
ieee: T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles
of bidirectional kinesin Cin8 produce additive forces in both directions of movement,”
Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067,
2017.
ista: Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles
of bidirectional kinesin Cin8 produce additive forces in both directions of movement.
Biophysical Journal. 113(9), 2055–2067.
mla: Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive
Forces in Both Directions of Movement.” Biophysical Journal, vol. 113,
no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.
short: T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical
Journal 113 (2017) 2055–2067.
date_created: 2018-12-11T11:46:33Z
date_published: 2017-11-07T00:00:00Z
date_updated: 2021-01-12T07:59:28Z
day: '07'
ddc:
- '570'
department:
- _id: MaLo
doi: 10.1016/j.bpj.2017.09.006
file:
- access_level: open_access
checksum: 99a2474088e20ac74b1882c4fbbb45b1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:03Z
date_updated: 2020-07-14T12:46:31Z
file_id: '5052'
file_name: IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf
file_size: 977192
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 113'
issue: '9'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 2055 - 2067
publication: Biophysical Journal
publication_status: published
publisher: Biophysical Society
publist_id: '7369'
pubrep_id: '965'
quality_controlled: '1'
status: public
title: Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions
of movement
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: 113
year: '2017'
...
---
_id: '1068'
abstract:
- lang: eng
text: 'Games on graphs provide the appropriate framework to study several central
problems in computer science, such as verification and synthesis of reactive systems.
One of the most basic objectives for games on graphs is the liveness (or Büchi)
objective that given a target set of vertices requires that some vertex in the
target set is visited infinitely often. We study generalized Büchi objectives
(i.e., conjunction of liveness objectives), and implications between two generalized
Büchi objectives (known as GR(1) objectives), that arise in numerous applications
in computer-aided verification. We present improved algorithms and conditional
super-linear lower bounds based on widely believed assumptions about the complexity
of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider
graph games with n vertices, m edges, and generalized Büchi objectives with k
conjunctions. First, we present an algorithm with running time O(k*n^2), improving
the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm
is optimal for dense graphs under (A1). Second, we show that the basic algorithm
for the problem is optimal for sparse graphs when the target sets have constant
size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions
in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1
k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time
algorithm for m > n^{1.5}. '
acknowledgement: K. C., M. H., and W. D. are partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC
Start grant (279307
alternative_title:
- LIPIcs
article_number: '25'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal
algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016).
Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented
at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika
Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”
Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally
optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical
Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally
optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations
of Computer Science (SG), LIPIcs, vol. 58, 25.'
mla: Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized
Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.25.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow, Poland
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:58Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-06-02T08:53:50Z
day: '01'
ddc:
- '000'
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2016.25
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:02Z
date_updated: 2018-12-12T10:16:02Z
file_id: '5187'
file_name: IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf
file_size: 632786
relation: main_file
file_date_updated: 2018-12-12T10:16:02Z
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided 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'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6317'
pubrep_id: '779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Conditionally optimal algorithms for generalized Büchi Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2016'
...
---
_id: '1069'
abstract:
- lang: eng
text: "The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differen-\r\ntial equation has a zero in a given interval of real numbers.
This is a fundamental reachability\r\nproblem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-\r\ntime Markov chains.
Decidability of the problem is currently open – indeed decidability is open\r\neven
for the sub-problem in which a zero is sought in a bounded interval. In this paper
we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture,
a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse
the unbounded problem in terms of the\r\nfrequencies of the differential equation,
that is, the imaginary parts of the characteristic roots.\r\nWe show that the
unbounded problem can be reduced to the bounded problem if there is at most\r\none
rationally linearly independent frequency, or if there are two rationally linearly
independent\r\nfrequencies and all characteristic roots are simple. We complete
the picture by showing that de-\r\ncidability of the unbounded problem in the
case of two (or more) rationally linearly independent\r\nfrequencies would entail
a major new effectiveness result in Diophantine approximation, namely\r\ncomputability
of the Diophantine-approximation types of all real algebraic numbers."
acknowledgement: 'Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN
Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC
Advanced Grant (267989: QUAREM).'
alternative_title:
- LIPIcs
article_number: '100'
author:
- first_name: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
- first_name: Joël
full_name: Ouaknine, Joël
last_name: Ouaknine
- first_name: James
full_name: Worrell, James
last_name: Worrell
citation:
ama: 'Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear
dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik;
2016. doi:10.4230/LIPIcs.ICALP.2016.100'
apa: 'Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem
for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata,
Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur
Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100'
chicago: Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem
Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.
ieee: 'V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous
linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming,
Rome, Italy, 2016, vol. 55.'
ista: 'Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous
linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs,
vol. 55, 100.'
mla: Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear
Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.100.
short: V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.100
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:26Z
date_updated: 2018-12-12T10:16:26Z
file_id: '5213'
file_name: IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf
file_size: 521415
relation: main_file
file_date_updated: 2018-12-12T10:16:26Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
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'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6314'
pubrep_id: '778'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the skolem problem for continuous linear dynamical systems
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1070'
abstract:
- lang: eng
text: 'We present a logic that extends CTL (Computation Tree Logic) with operators
that express synchronization properties. A property is synchronized in a system
if it holds in all paths of a certain length. The new logic is obtained by using
the same path quantifiers and temporal operators as in CTL, but allowing a different
order of the quantifiers. This small syntactic variation induces a logic that
can express non-regular properties for which known extensions of MSO with equality
of path length are undecidable. We show that our variant of CTL is decidable and
that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We
analogously consider quantifier exchange in extensions of CTL, and we present
operators defined using basic operators of CTL* that express the occurrence of
infinitely many synchronization points. We show that the model-checking problem
remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide
if the Next operator is allowed in the logics, thus the classical bisimulation
quotient can be used for state-space reduction before model checking. '
acknowledgement: "This research was partially supported by Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna
Science and Technology Fund (WWTF) through project ICT15-003, and European project
Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for
their insightful\r\ncomments and suggestions.\r\n"
alternative_title:
- LIPIcs
article_number: '98'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Computation tree logic for synchronization properties.
In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98'
apa: 'Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization
properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming,
Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for
Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
ieee: 'K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,”
presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016,
vol. 55.'
ista: 'Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties.
ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization
Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.98.
short: K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.98
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:52Z
date_updated: 2018-12-12T10:08:52Z
file_id: '4714'
file_name: IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf
file_size: 546133
relation: main_file
file_date_updated: 2018-12-12T10:08:52Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
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'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6313'
pubrep_id: '812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computation tree logic for synchronization properties
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1071'
abstract:
- lang: eng
text: 'We consider data-structures for answering reachability and distance queries
on constant-treewidth graphs with n nodes, on the standard RAM computational model
with wordsize W=Theta(log n). Our first contribution is a data-structure that
after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time;
and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries. The data-structure uses at all times O(n) space. Our
second contribution is a space-time tradeoff data-structure for distance queries.
For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing
time that allows pair queries in O(n^{1-\epsilon} alpha(n)) time, where alpha
is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space.
The input graph G is not considered in the space complexity. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant
(279307: Graph Games).'
alternative_title:
- LIPIcs
article_number: '28'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space
time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss
Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs (Vol.
57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark:
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant
Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs,”
presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016,
vol. 57.'
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs. ESA:
European Symposium on Algorithms, LIPIcs, vol. 57, 28.'
mla: Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff
for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl-
Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-09-07T12:01:58Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ESA.2016.28
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2018-12-12T10:14:31Z
file_id: '5084'
file_name: IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf
file_size: 579225
relation: main_file
file_date_updated: 2018-12-12T10:14:31Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
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'
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6312'
pubrep_id: '777'
quality_controlled: '1'
related_material:
record:
- id: '821'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Optimal reachability and a space time tradeoff for distance queries in constant
treewidth graphs
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: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '1081'
abstract:
- lang: eng
text: The asymmetric localization of proteins in the plasma membrane domains of
eukaryotic cells is a fundamental manifestation of cell polarity that is central
to multicellular organization and developmental patterning. In plants, the mechanisms
underlying the polar localization of cargo proteins are still largely unknown
and appear to be fundamentally distinct from those operating in mammals. Here,
we present a systematic, quantitative comparative analysis of the polar delivery
and subcellular localization of proteins that characterize distinct polar plasma
membrane domains in plant cells. The combination of microscopic analyses and computational
modeling revealed a mechanistic framework common to diverse polar cargos and underlying
the establishment and maintenance of apical, basal, and lateral polar domains
in plant cells. This mechanism depends on the polar secretion, constitutive endocytic
recycling, and restricted lateral diffusion of cargos within the plasma membrane.
Moreover, our observations suggest that polar cargo distribution involves the
individual protein potential to form clusters within the plasma membrane and interact
with the extracellular matrix. Our observations provide insights into the shared
cellular mechanisms of polar cargo delivery and polarity maintenance in plant
cells.
acknowledgement: "We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor
sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing
the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP);
Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute
of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research
Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety
for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the
Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN."
article_number: '16018'
author:
- first_name: Łukasz
full_name: Łangowski, Łukasz
last_name: Łangowski
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery
and polarity maintenance at different polar domains in plant cells. Cell Discovery.
2016;2. doi:10.1038/celldisc.2016.18
apa: Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H.,
& Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance
at different polar domains in plant cells. Cell Discovery. Nature Publishing
Group. https://doi.org/10.1038/celldisc.2016.18
chicago: Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste,
Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo
Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.”
Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.
ieee: Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity
maintenance at different polar domains in plant cells,” Cell Discovery,
vol. 2. Nature Publishing Group, 2016.
ista: Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016.
Cellular mechanisms for cargo delivery and polarity maintenance at different polar
domains in plant cells. Cell Discovery. 2, 16018.
mla: Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity
Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery,
vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.
short: Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J.
Friml, Cell Discovery 2 (2016).
date_created: 2018-12-11T11:50:02Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2021-01-12T06:48:08Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1038/celldisc.2016.18
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:33Z
date_updated: 2018-12-12T10:13:33Z
file_id: '5017'
file_name: IST-2017-757-v1+1_celldisc201618.pdf
file_size: 5261671
relation: main_file
file_date_updated: 2018-12-12T10:13:33Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Cell Discovery
publication_status: published
publisher: Nature Publishing Group
publist_id: '6299'
pubrep_id: '757'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cellular mechanisms for cargo delivery and polarity maintenance at different
polar domains in plant cells
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: 2
year: '2016'
...
---
_id: '10810'
abstract:
- lang: eng
text: "The main goal of the SCP-ECG standard is to address ECG data and related
metadata structuring, semantics and syntax, with the objective of facilitating
interoperability and thus supporting and promoting the exchange of the relevant
information for unary and serial ECG diagnosis. Starting with version V3.0, the
standard now also provides support for the storage of continuous, long-term ECG
recordings and affords a repository for selected ECG sequences and the related
metadata to accommodate stress tests, drug trials and protocol-based ECG recordings.
The global and per-lead measurements sections have been extended and three new
sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand
annotations. The used terminology and the provided measurements and annotations
have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis
has also been put on harmonizing the Universal Statement Codes with the CDISC
and the categorized AHA statement codes and similarly the drug and implanted devices
codes with the ATC and NASPE/BPEG codes. "
acknowledgement: The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul
Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen
Wagner for their in depth review and constructive comments.
article_processing_charge: No
author:
- first_name: Paul
full_name: Rubel, Paul
last_name: Rubel
- first_name: Danilo
full_name: Pani, Danilo
last_name: Pani
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Jocelyne
full_name: Fayn, Jocelyne
last_name: Fayn
- first_name: Fabio
full_name: Badilini, Fabio
last_name: Badilini
- first_name: Peter
full_name: Macfarlane, Peter
last_name: Macfarlane
- first_name: Alpo
full_name: Varri, Alpo
last_name: Varri
citation:
ama: 'Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography. In: 2016 Computing in Cardiology
Conference. Vol 43. Computing in Cardiology; 2016:309-312. doi:10.22489/cinc.2016.090-500'
apa: 'Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P.,
& Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol
for computer-assisted electrocardiography. In 2016 Computing in Cardiology
Conference (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology.
https://doi.org/10.22489/cinc.2016.090-500'
chicago: 'Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini,
Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication
Protocol for Computer-Assisted Electrocardiography.” In 2016 Computing in Cardiology
Conference, 43:309–12. Computing in Cardiology, 2016. https://doi.org/10.22489/cinc.2016.090-500.'
ieee: 'P. Rubel et al., “SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography,” in 2016 Computing in Cardiology
Conference, Vancouver, Canada, 2016, vol. 43, pp. 309–312.'
ista: 'Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016.
SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing
in Cardiology vol. 43, 309–312.'
mla: 'Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol
for Computer-Assisted Electrocardiography.” 2016 Computing in Cardiology Conference,
vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:10.22489/cinc.2016.090-500.'
short: P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri,
in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp.
309–312.
conference:
end_date: 2016-09-14
location: Vancouver, Canada
name: 'CinC: Computing in Cardiology'
start_date: 2016-09-11
date_created: 2022-03-03T10:43:10Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-03-04T07:34:45Z
day: '01'
department:
- _id: CampIT
doi: 10.22489/cinc.2016.090-500
intvolume: ' 43'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.22489/cinc.2016.090-500
month: '03'
oa: 1
oa_version: Published Version
page: 309-312
publication: 2016 Computing in Cardiology Conference
publication_identifier:
issn:
- 2325-887X
publication_status: published
publisher: Computing in Cardiology
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2016'
...
---
_id: '1082'
abstract:
- lang: eng
text: In many applications, it is desirable to extract only the relevant aspects
of data. A principled way to do this is the information bottleneck (IB) method,
where one seeks a code that maximises information about a relevance variable,
Y, while constraining the information encoded about the original data, X. Unfortunately
however, the IB method is computationally demanding when data are high-dimensional
and/or non-gaussian. Here we propose an approximate variational scheme for maximising
a lower bound on the IB objective, analogous to variational EM. Using this method,
we derive an IB algorithm to recover features that are both relevant and sparse.
Finally, we demonstrate how kernelised versions of the algorithm can be used to
address a broad range of problems with non-linear relation between X and Y.
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Matthew J
full_name: Chalk, Matthew J
id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
last_name: Chalk
orcid: 0000-0001-7782-4436
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: 'Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information
bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.'
apa: 'Chalk, M. J., Marre, O., & Tkačik, G. (2016). Relevant sparse codes with
variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the
NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information
Processing Systems.'
chicago: Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes
with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing
Systems, 2016.
ieee: 'M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational
information bottleneck,” presented at the NIPS: Neural Information Processing
Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.'
ista: 'Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational
information bottleneck. NIPS: Neural Information Processing Systems, Advances
in Neural Information Processing Systems, vol. 29, 1965–1973.'
mla: Chalk, Matthew J., et al. Relevant Sparse Codes with Variational Information
Bottleneck. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73.
short: M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems,
2016, pp. 1965–1973.
conference:
end_date: 2016-12-10
location: Barcelona, Spain
name: 'NIPS: Neural Information Processing Systems'
start_date: 2016-12-05
date_created: 2018-12-11T11:50:03Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2021-01-12T06:48:09Z
day: '01'
department:
- _id: GaTk
intvolume: ' 29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.07332
month: '12'
oa: 1
oa_version: Preprint
page: 1965-1973
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '6298'
quality_controlled: '1'
related_material:
link:
- relation: other
url: https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck
scopus_import: 1
status: public
title: Relevant sparse codes with variational information bottleneck
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...