---
_id: '10208'
abstract:
- lang: eng
text: It is practical to collect a huge amount of movement data and environmental
context information along with the health signals of individuals because there
is the emergence of new generations of positioning and tracking technologies and
rapid advancements of health sensors. The study of the relations between these
datasets and their sequence similarity analysis is of interest to many applications
such as health monitoring and recommender systems. However, entering all movement
parameters and health signals can lead to the complexity of the problem and an
increase in its computational load. In this situation, dimension reduction techniques
can be used to avoid consideration of simultaneous dependent parameters in the
process of similarity measurement of the trajectories. The present study provides
a framework, named CaDRAW, to use spatial–temporal data and movement parameters
along with independent context information in the process of measuring the similarity
of trajectories. In this regard, the omission of dependent movement characteristic
signals is conducted by using an unsupervised feature selection dimension reduction
technique. To evaluate the effectiveness of the proposed framework, it was applied
to a real contextualized movement and related health signal datasets of individuals.
The results indicated the capability of the proposed framework in measuring the
similarity and in decreasing the characteristic signals in such a way that the
similarity results -before and after reduction of dependent characteristic signals-
have small differences. The mean differences between the obtained results before
and after reducing the dimension were 0.029 and 0.023 for the round path, respectively.
acknowledgement: The third author acknowledges the funding received from the Wittgenstein
Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_processing_charge: No
article_type: original
author:
- first_name: Samira
full_name: Goudarzi, Samira
last_name: Goudarzi
- first_name: Mohammad
full_name: Sharif, Mohammad
last_name: Sharif
- first_name: Farid
full_name: Karimipour, Farid
id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425
last_name: Karimipour
orcid: 0000-0001-6746-4174
citation:
ama: Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework
for trajectory and health signal analyses. Journal of Ambient Intelligence
and Humanized Computing. 2022;13:2621–2635. doi:10.1007/s12652-021-03569-z
apa: Goudarzi, S., Sharif, M., & Karimipour, F. (2022). A context-aware dimension
reduction framework for trajectory and health signal analyses. Journal of Ambient
Intelligence and Humanized Computing. Springer Nature. https://doi.org/10.1007/s12652-021-03569-z
chicago: Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware
Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal
of Ambient Intelligence and Humanized Computing. Springer Nature, 2022. https://doi.org/10.1007/s12652-021-03569-z.
ieee: S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction
framework for trajectory and health signal analyses,” Journal of Ambient Intelligence
and Humanized Computing, vol. 13. Springer Nature, pp. 2621–2635, 2022.
ista: Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction
framework for trajectory and health signal analyses. Journal of Ambient Intelligence
and Humanized Computing. 13, 2621–2635.
mla: Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for
Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and
Humanized Computing, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:10.1007/s12652-021-03569-z.
short: S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and
Humanized Computing 13 (2022) 2621–2635.
date_created: 2021-11-02T09:28:55Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2025-04-15T07:16:55Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s12652-021-03569-z
external_id:
isi:
- '000712198000001'
file:
- access_level: open_access
checksum: 0a8961416a9bb2be5a1cebda65468bcf
content_type: application/pdf
creator: fkarimip
date_created: 2021-11-12T19:38:05Z
date_updated: 2022-12-20T23:30:08Z
embargo: 2022-11-12
file_id: '10279'
file_name: A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence
2021 (Preprint version).pdf
file_size: 1634958
relation: main_file
file_date_updated: 2022-12-20T23:30:08Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
keyword:
- general computer science
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 2621–2635
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: Journal of Ambient Intelligence and Humanized Computing
publication_identifier:
eissn:
- 1868-5145
issn:
- 1868-5137
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A context-aware dimension reduction framework for trajectory and health signal
analyses
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '7577'
abstract:
- lang: eng
text: Weak convergence of inertial iterative method for solving variational inequalities
is the focus of this paper. The cost function is assumed to be non-Lipschitz and
monotone. We propose a projection-type method with inertial terms and give weak
convergence analysis under appropriate conditions. Some test results are performed
and compared with relevant methods in the literature to show the efficiency and
advantages given by our proposed methods.
acknowledgement: The project of the first author has received funding from the European
Research Council (ERC) under the European Union's Seventh Framework Program (FP7
- 2007-2013) (Grant agreement No. 616160).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Olaniyi S.
full_name: Iyiola, Olaniyi S.
last_name: Iyiola
citation:
ama: Shehu Y, Iyiola OS. Weak convergence for variational inequalities with inertial-type
method. Applicable Analysis. 2022;101(1):192-216. doi:10.1080/00036811.2020.1736287
apa: Shehu, Y., & Iyiola, O. S. (2022). Weak convergence for variational inequalities
with inertial-type method. Applicable Analysis. Taylor & Francis. https://doi.org/10.1080/00036811.2020.1736287
chicago: Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational
Inequalities with Inertial-Type Method.” Applicable Analysis. Taylor &
Francis, 2022. https://doi.org/10.1080/00036811.2020.1736287.
ieee: Y. Shehu and O. S. Iyiola, “Weak convergence for variational inequalities
with inertial-type method,” Applicable Analysis, vol. 101, no. 1. Taylor
& Francis, pp. 192–216, 2022.
ista: Shehu Y, Iyiola OS. 2022. Weak convergence for variational inequalities with
inertial-type method. Applicable Analysis. 101(1), 192–216.
mla: Shehu, Yekini, and Olaniyi S. Iyiola. “Weak Convergence for Variational Inequalities
with Inertial-Type Method.” Applicable Analysis, vol. 101, no. 1, Taylor
& Francis, 2022, pp. 192–216, doi:10.1080/00036811.2020.1736287.
short: Y. Shehu, O.S. Iyiola, Applicable Analysis 101 (2022) 192–216.
corr_author: '1'
date_created: 2020-03-09T07:06:52Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2024-11-04T13:52:44Z
day: '01'
ddc:
- '510'
- '515'
- '518'
department:
- _id: VlKo
doi: 10.1080/00036811.2020.1736287
ec_funded: 1
external_id:
arxiv:
- '2101.08057'
isi:
- '000518364100001'
file:
- access_level: open_access
checksum: 869efe8cb09505dfa6012f67d20db63d
content_type: application/pdf
creator: dernst
date_created: 2020-10-12T10:42:54Z
date_updated: 2021-03-16T23:30:06Z
embargo: 2021-03-15
file_id: '8648'
file_name: 2020_ApplicAnalysis_Shehu.pdf
file_size: 4282586
relation: main_file
file_date_updated: 2021-03-16T23:30:06Z
has_accepted_license: '1'
intvolume: ' 101'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 192-216
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Applicable Analysis
publication_identifier:
eissn:
- 1563-504X
issn:
- 0003-6811
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Weak convergence for variational inequalities with inertial-type method
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 101
year: '2022'
...
---
OA_place: repository
_id: '11943'
abstract:
- lang: eng
text: Complex wiring between neurons underlies the information-processing network
enabling all brain functions, including cognition and memory. For understanding
how the network is structured, processes information, and changes over time, comprehensive
visualization of the architecture of living brain tissue with its cellular and
molecular components would open up major opportunities. However, electron microscopy
(EM) provides nanometre-scale resolution required for full in-silico
reconstruction1–5, yet is limited to fixed specimens and
static representations. Light microscopy allows live observation, with super-resolution
approaches6–12 facilitating nanoscale visualization, but
comprehensive 3D-reconstruction of living brain tissue has been hindered by tissue
photo-burden, photobleaching, insufficient 3D-resolution, and inadequate signal-to-noise
ratio (SNR). Here we demonstrate saturated reconstruction of living brain tissue.
We developed an integrated imaging and analysis technology, adapting stimulated
emission depletion (STED) microscopy6,13 in extracellularly
labelled tissue14 for high SNR and near-isotropic resolution.
Centrally, a two-stage deep-learning approach leveraged previously obtained information
on sample structure to drastically reduce photo-burden and enable automated volumetric
reconstruction down to single synapse level. Live reconstruction provides unbiased
analysis of tissue architecture across time in relation to functional activity
and targeted activation, and contextual understanding of molecular labelling.
This adoptable technology will facilitate novel insights into the dynamic functional
architecture of living brain tissue.
article_processing_charge: No
author:
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Eder
full_name: Miguel Villalba, Eder
id: 3FB91342-F248-11E8-B48F-1D18A9856A87
last_name: Miguel Villalba
orcid: 0000-0001-5665-0430
- first_name: Julia M
full_name: Michalska, Julia M
id: 443DB6DE-F248-11E8-B48F-1D18A9856A87
last_name: Michalska
orcid: 0000-0003-3862-1235
- first_name: Donglai
full_name: Wei, Donglai
last_name: Wei
- first_name: Zudi
full_name: Lin, Zudi
last_name: Lin
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Jakob
full_name: Troidl, Jakob
last_name: Troidl
- first_name: Johanna
full_name: Beyer, Johanna
last_name: Beyer
- first_name: Yoav
full_name: Ben Simon, Yoav
id: 43DF3136-F248-11E8-B48F-1D18A9856A87
last_name: Ben Simon
- first_name: Christoph M
full_name: Sommer, Christoph M
id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
last_name: Sommer
orcid: 0000-0003-1216-9105
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
orcid: 0000-0003-0201-2315
- first_name: Alban
full_name: Cenameri, Alban
id: 9ac8f577-2357-11eb-997a-e566c5550886
last_name: Cenameri
- first_name: Johannes
full_name: Broichhagen, Johannes
last_name: Broichhagen
- first_name: Seth G. N.
full_name: Grant, Seth G. N.
last_name: Grant
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Velicky P, Miguel Villalba E, Michalska JM, et al. Saturated reconstruction
of living brain tissue. bioRxiv. doi:10.1101/2022.03.16.484431
apa: Velicky, P., Miguel Villalba, E., Michalska, J. M., Wei, D., Lin, Z., Watson,
J., … Danzl, J. G. (n.d.). Saturated reconstruction of living brain tissue. bioRxiv.
https://doi.org/10.1101/2022.03.16.484431
chicago: Velicky, Philipp, Eder Miguel Villalba, Julia M Michalska, Donglai Wei,
Zudi Lin, Jake Watson, Jakob Troidl, et al. “Saturated Reconstruction of Living
Brain Tissue.” BioRxiv, n.d. https://doi.org/10.1101/2022.03.16.484431.
ieee: P. Velicky et al., “Saturated reconstruction of living brain tissue,”
bioRxiv. .
ista: Velicky P, Miguel Villalba E, Michalska JM, Wei D, Lin Z, Watson J, Troidl
J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen J, Grant SGN,
Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. Saturated reconstruction
of living brain tissue. bioRxiv, 10.1101/2022.03.16.484431.
mla: Velicky, Philipp, et al. “Saturated Reconstruction of Living Brain Tissue.”
BioRxiv, doi:10.1101/2022.03.16.484431.
short: P. Velicky, E. Miguel Villalba, J.M. Michalska, D. Wei, Z. Lin, J. Watson,
J. Troidl, J. Beyer, Y. Ben Simon, C.M. Sommer, W. Jahr, A. Cenameri, J. Broichhagen,
S.G.N. Grant, P.M. Jonas, G. Novarino, H. Pfister, B. Bickel, J.G. Danzl, BioRxiv
(n.d.).
corr_author: '1'
das_tickbox: '1'
date_created: 2022-08-23T11:07:59Z
date_published: 2022-05-09T00:00:00Z
date_updated: 2026-08-21T22:31:03Z
day: '09'
department:
- _id: PeJo
- _id: GaNo
- _id: BeBi
- _id: JoDa
doi: 10.1101/2022.03.16.484431
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2022.03.16.484431
month: '05'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: draft
related_material:
record:
- id: '13267'
relation: later_version
status: public
- id: '12470'
relation: dissertation_contains
status: public
status: public
title: Saturated reconstruction of living brain tissue
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11950'
abstract:
- lang: eng
text: Mapping the complex and dense arrangement of cells and their connectivity
in brain tissue demands nanoscale spatial resolution imaging. Super-resolution
optical microscopy excels at visualizing specific molecules and individual cells
but fails to provide tissue context. Here we developed Comprehensive Analysis
of Tissues across Scales (CATS), a technology to densely map brain tissue architecture
from millimeter regional to nanoscopic synaptic scales in diverse chemically fixed
brain preparations, including rodent and human. CATS leverages fixation-compatible
extracellular labeling and advanced optical readout, in particular stimulated-emission
depletion and expansion microscopy, to comprehensively delineate cellular structures.
It enables 3D-reconstructing single synapses and mapping synaptic connectivity
by identification and tailored analysis of putative synaptic cleft regions. Applying
CATS to the hippocampal mossy fiber circuitry, we demonstrate its power to reveal
the system’s molecularly informed ultrastructure across spatial scales and assess
local connectivity by reconstructing and quantifying the synaptic input and output
structure of identified neurons.
article_processing_charge: No
author:
- first_name: Julia M
full_name: Michalska, Julia M
id: 443DB6DE-F248-11E8-B48F-1D18A9856A87
last_name: Michalska
orcid: 0000-0003-3862-1235
- first_name: Julia
full_name: Lyudchik, Julia
id: 46E28B80-F248-11E8-B48F-1D18A9856A87
last_name: Lyudchik
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Hana
full_name: Korinkova, Hana
id: ee3cb6ca-ec98-11ea-ae11-ff703e2254ed
last_name: Korinkova
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Alban
full_name: Cenameri, Alban
id: 9ac8f577-2357-11eb-997a-e566c5550886
last_name: Cenameri
- first_name: Christoph M
full_name: Sommer, Christoph M
id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
last_name: Sommer
orcid: 0000-0003-1216-9105
- first_name: Alessandro
full_name: Venturino, Alessandro
id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
last_name: Venturino
orcid: 0000-0003-2356-9403
- first_name: Karl
full_name: Roessler, Karl
last_name: Roessler
- first_name: Thomas
full_name: Czech, Thomas
last_name: Czech
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Michalska JM, Lyudchik J, Velicky P, et al. Uncovering brain tissue architecture
across scales with super-resolution light microscopy. bioRxiv. doi:10.1101/2022.08.17.504272
apa: Michalska, J. M., Lyudchik, J., Velicky, P., Korinkova, H., Watson, J., Cenameri,
A., … Danzl, J. G. (n.d.). Uncovering brain tissue architecture across scales
with super-resolution light microscopy. bioRxiv. https://doi.org/10.1101/2022.08.17.504272
chicago: Michalska, Julia M, Julia Lyudchik, Philipp Velicky, Hana Korinkova, Jake
Watson, Alban Cenameri, Christoph M Sommer, et al. “Uncovering Brain Tissue Architecture
across Scales with Super-Resolution Light Microscopy.” BioRxiv, n.d. https://doi.org/10.1101/2022.08.17.504272.
ieee: J. M. Michalska et al., “Uncovering brain tissue architecture across
scales with super-resolution light microscopy,” bioRxiv. .
ista: Michalska JM, Lyudchik J, Velicky P, Korinkova H, Watson J, Cenameri A, Sommer
CM, Venturino A, Roessler K, Czech T, Siegert S, Novarino G, Jonas PM, Danzl JG.
Uncovering brain tissue architecture across scales with super-resolution light
microscopy. bioRxiv, 10.1101/2022.08.17.504272.
mla: Michalska, Julia M., et al. “Uncovering Brain Tissue Architecture across Scales
with Super-Resolution Light Microscopy.” BioRxiv, doi:10.1101/2022.08.17.504272.
short: J.M. Michalska, J. Lyudchik, P. Velicky, H. Korinkova, J. Watson, A. Cenameri,
C.M. Sommer, A. Venturino, K. Roessler, T. Czech, S. Siegert, G. Novarino, P.M.
Jonas, J.G. Danzl, BioRxiv (n.d.).
corr_author: '1'
das_tickbox: '1'
date_created: 2022-08-24T08:24:52Z
date_published: 2022-08-18T00:00:00Z
date_updated: 2026-08-21T22:31:03Z
day: '18'
department:
- _id: SaSi
- _id: GaNo
- _id: PeJo
- _id: JoDa
doi: 10.1101/2022.08.17.504272
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2022.08.17.504272
month: '08'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: draft
related_material:
record:
- id: '12470'
relation: dissertation_contains
status: public
status: public
title: Uncovering brain tissue architecture across scales with super-resolution light
microscopy
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11471'
abstract:
- lang: eng
text: 'Variational quantum algorithms are promising algorithms for achieving quantum
advantage on nearterm devices. The quantum hardware is used to implement a variational
wave function and measure observables, whereas the classical computer is used
to store and update the variational parameters. The optimization landscape of
expressive variational ansätze is however dominated by large regions in parameter
space, known as barren plateaus, with vanishing gradients, which prevents efficient
optimization. In this work we propose a general algorithm to avoid barren plateaus
in the initialization and throughout the optimization. To this end we define a
notion of weak barren plateaus (WBPs) based on the entropies of local reduced
density matrices. The presence of WBPs can be efficiently quantified using recently
introduced shadow tomography of the quantum state with a classical computer. We
demonstrate that avoidance of WBPs suffices to ensure sizable gradients in the
initialization. In addition, we demonstrate that decreasing the gradient step
size, guided by the entropies allows WBPs to be avoided during the optimization
process. This paves the way for efficient barren plateau-free optimization on
near-term devices. '
acknowledgement: "We thank Marco Cerezo, Zoe Holmes, and Nicholas Hunter-Jones for
fruitful discussion and valuable feedback. We also acknowledge Adam Smith, Johannes
Jakob Meyer, and Victor V. Albert for comments on the paper. The simulations were
performed in the Julia programming\r\nlanguage [65] using the Yao module [66]. S.H.S.,
R.A.M., A.A.M. and M.S. acknowledge support by the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation program (Grant Agreement
No. 850899)."
article_number: '020365'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stefan
full_name: Sack, Stefan
id: dd622248-f6e0-11ea-865d-ce382a1c81a5
last_name: Sack
orcid: 0000-0001-5400-8508
- first_name: Raimel A
full_name: Medina Ramos, Raimel A
id: CE680B90-D85A-11E9-B684-C920E6697425
last_name: Medina Ramos
orcid: 0000-0002-5383-2869
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: Richard
full_name: Kueng, Richard
last_name: Kueng
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Sack S, Medina Ramos RA, Michailidis A, Kueng R, Serbyn M. Avoiding barren
plateaus using classical shadows. PRX Quantum. 2022;3(2). doi:10.1103/prxquantum.3.020365
apa: Sack, S., Medina Ramos, R. A., Michailidis, A., Kueng, R., & Serbyn, M.
(2022). Avoiding barren plateaus using classical shadows. PRX Quantum.
American Physical Society. https://doi.org/10.1103/prxquantum.3.020365
chicago: Sack, Stefan, Raimel A Medina Ramos, Alexios Michailidis, Richard Kueng,
and Maksym Serbyn. “Avoiding Barren Plateaus Using Classical Shadows.” PRX
Quantum. American Physical Society, 2022. https://doi.org/10.1103/prxquantum.3.020365.
ieee: S. Sack, R. A. Medina Ramos, A. Michailidis, R. Kueng, and M. Serbyn, “Avoiding
barren plateaus using classical shadows,” PRX Quantum, vol. 3, no. 2. American
Physical Society, 2022.
ista: Sack S, Medina Ramos RA, Michailidis A, Kueng R, Serbyn M. 2022. Avoiding
barren plateaus using classical shadows. PRX Quantum. 3(2), 020365.
mla: Sack, Stefan, et al. “Avoiding Barren Plateaus Using Classical Shadows.” PRX
Quantum, vol. 3, no. 2, 020365, American Physical Society, 2022, doi:10.1103/prxquantum.3.020365.
short: S. Sack, R.A. Medina Ramos, A. Michailidis, R. Kueng, M. Serbyn, PRX Quantum
3 (2022).
corr_author: '1'
date_created: 2022-06-29T20:21:32Z
date_published: 2022-06-29T00:00:00Z
date_updated: 2026-08-21T22:31:08Z
day: '29'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1103/prxquantum.3.020365
ec_funded: 1
external_id:
arxiv:
- '2201.08194'
isi:
- '000822564300001'
file:
- access_level: open_access
checksum: a7706b28d24a0e32a55ea04b82a2df43
content_type: application/pdf
creator: dernst
date_created: 2022-06-30T07:14:48Z
date_updated: 2022-06-30T07:14:48Z
file_id: '11472'
file_name: 2022_PRXQuantum_Sack.pdf
file_size: 4231591
relation: main_file
success: 1
file_date_updated: 2022-06-30T07:14:48Z
has_accepted_license: '1'
intvolume: ' 3'
isi: 1
issue: '2'
keyword:
- General Medicine
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: PRX Quantum
publication_identifier:
issn:
- 2691-3399
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '17208'
relation: dissertation_contains
status: public
- id: '14622'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Avoiding barren plateaus using classical shadows
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 3
year: '2022'
...
---
_id: '10834'
abstract:
- lang: eng
text: Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE
regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation
and the protrusion of branched actin filament networks. Moreover, Hem1 loss of
function in immune cells causes autoimmune diseases in humans. Here, we show that
genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis
as well as phagocytic cup formation in addition to defects in lamellipodial protrusion
and migration. Moreover, Hem1-null macrophages displayed strong defects in cell
adhesion despite unaltered podosome formation and concomitant extracellular matrix
degradation. Specifically, dynamics of both adhesion and de-adhesion as well as
concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly
compromised. Accordingly, disruption of WRC function in non-hematopoietic cells
coincided with both defects in adhesion turnover and altered FAK and paxillin
phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished
integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes,
but not lamellipodia formation, were partially rescued by small molecule activation
of FAK. A full rescue of the phenotype, including lamellipodia formation, required
not only the presence of WRCs but also their binding to and activation by Rac.
Collectively, our results uncover that WRC impacts on integrin-dependent processes
in a FAK-dependent manner, controlling formation and dismantling of adhesions,
relevant for properly grabbing onto extracellular surfaces and particles during
cell edge expansion, like in migration or phagocytosis.
acknowledgement: We are grateful to Silvia Prettin, Ina Schleicher, and Petra Hagendorff
for expert technical assistance; David Dettbarn for animal keeping and breeding;
and Lothar Gröbe and Maria Höxter for cell sorting. We also thank Werner Tegge for
peptides and Giorgio Scita for antibodies. This work was supported, in part, by
the Deutsche Forschungsgemeinschaft (DFG), Priority Programm SPP1150 (to T.E.B.S.,
K.R., and M. Sixt), and by DFG grant GRK2223/1 (to K.R.). T.E.B.S. acknowledges
support by the Helmholtz Society through HGF impulse fund W2/W3-066 and M. Schnoor
by the Mexican Council for Science and Technology (CONACyT, 284292 ), Fund SEP-Cinvestav
( 108 ), and the Royal Society, UK (Newton Advanced Fellowship, NAF/R1/180017 ).
article_processing_charge: No
article_type: original
author:
- first_name: Stephanie
full_name: Stahnke, Stephanie
last_name: Stahnke
- first_name: Hermann
full_name: Döring, Hermann
last_name: Döring
- first_name: Charly
full_name: Kusch, Charly
last_name: Kusch
- first_name: David J.J.
full_name: de Gorter, David J.J.
last_name: de Gorter
- first_name: Sebastian
full_name: Dütting, Sebastian
last_name: Dütting
- first_name: Aleks
full_name: Guledani, Aleks
last_name: Guledani
- first_name: Irina
full_name: Pleines, Irina
last_name: Pleines
- first_name: Michael
full_name: Schnoor, Michael
last_name: Schnoor
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Robert
full_name: Geffers, Robert
last_name: Geffers
- first_name: Manfred
full_name: Rohde, Manfred
last_name: Rohde
- first_name: Mathias
full_name: Müsken, Mathias
last_name: Müsken
- first_name: Frieda
full_name: Kage, Frieda
last_name: Kage
- first_name: Anika
full_name: Steffen, Anika
last_name: Steffen
- first_name: Jan
full_name: Faix, Jan
last_name: Faix
- first_name: Bernhard
full_name: Nieswandt, Bernhard
last_name: Nieswandt
- first_name: Klemens
full_name: Rottner, Klemens
last_name: Rottner
- first_name: Theresia E.B.
full_name: Stradal, Theresia E.B.
last_name: Stradal
citation:
ama: Stahnke S, Döring H, Kusch C, et al. Loss of Hem1 disrupts macrophage function
and impacts migration, phagocytosis, and integrin-mediated adhesion. Current
Biology. 2021;31(10):2051-2064.e8. doi:10.1016/j.cub.2021.02.043
apa: Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani,
A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and
impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology.
Elsevier. https://doi.org/10.1016/j.cub.2021.02.043
chicago: Stahnke, Stephanie, Hermann Döring, Charly Kusch, David J.J. de Gorter,
Sebastian Dütting, Aleks Guledani, Irina Pleines, et al. “Loss of Hem1 Disrupts
Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated
Adhesion.” Current Biology. Elsevier, 2021. https://doi.org/10.1016/j.cub.2021.02.043.
ieee: S. Stahnke et al., “Loss of Hem1 disrupts macrophage function and impacts
migration, phagocytosis, and integrin-mediated adhesion,” Current Biology,
vol. 31, no. 10. Elsevier, p. 2051–2064.e8, 2021.
ista: Stahnke S, Döring H, Kusch C, de Gorter DJJ, Dütting S, Guledani A, Pleines
I, Schnoor M, Sixt MK, Geffers R, Rohde M, Müsken M, Kage F, Steffen A, Faix J,
Nieswandt B, Rottner K, Stradal TEB. 2021. Loss of Hem1 disrupts macrophage function
and impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology.
31(10), 2051–2064.e8.
mla: Stahnke, Stephanie, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts
Migration, Phagocytosis, and Integrin-Mediated Adhesion.” Current Biology,
vol. 31, no. 10, Elsevier, 2021, p. 2051–2064.e8, doi:10.1016/j.cub.2021.02.043.
short: S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani,
I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A.
Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31
(2021) 2051–2064.e8.
date_created: 2022-03-08T07:51:04Z
date_published: 2021-05-24T00:00:00Z
date_updated: 2023-08-17T07:01:14Z
day: '24'
department:
- _id: MiSi
doi: 10.1016/j.cub.2021.02.043
external_id:
isi:
- '000654652200002'
pmid:
- '33711252'
intvolume: ' 31'
isi: 1
issue: '10'
keyword:
- General Agricultural and Biological Sciences
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.03.24.005835
month: '05'
oa: 1
oa_version: Preprint
page: 2051-2064.e8
pmid: 1
publication: Current Biology
publication_identifier:
issn:
- 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis,
and integrin-mediated adhesion
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 31
year: '2021'
...
---
_id: '10838'
abstract:
- lang: eng
text: Combining hybrid zone analysis with genomic data is a promising approach to
understanding the genomic basis of adaptive divergence. It allows for the identification
of genomic regions underlying barriers to gene flow. It also provides insights
into spatial patterns of allele frequency change, informing about the interplay
between environmental factors, dispersal and selection. However, when only a single
hybrid zone is analysed, it is difficult to separate patterns generated by selection
from those resulting from chance. Therefore, it is beneficial to look for repeatable
patterns across replicate hybrid zones in the same system. We applied this approach
to the marine snail Littorina saxatilis, which contains two ecotypes, adapted
to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous
hybrid zones between ecotypes offered the opportunity to test for the repeatability
of genomic architectures and spatial patterns of divergence. We sampled and phenotyped
snails from seven replicate hybrid zones on the Swedish west coast and genotyped
them for thousands of single nucleotide polymorphisms. Shell shape and size showed
parallel clines across all zones. Many genomic regions showing steep clines and/or
high differentiation were shared among hybrid zones, consistent with a common
evolutionary history and extensive gene flow between zones, and supporting the
importance of these regions for divergence. In particular, we found that several
large putative inversions contribute to divergence in all locations. Additionally,
we found evidence for consistent displacement of clines from the boulder–rock
transition. Our results demonstrate patterns of spatial variation that would not
be accessible without continuous spatial sampling, a large genomic data set and
replicate hybrid zones.
acknowledgement: "We thank everyone who helped with fieldwork, snail processing and
DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise
Liabot, Mark Ravinet, Irena Senčić and Zuzanna Zagrodzka. We are also grateful to
Edinburgh Genomics for library preparation and sequencing, to Stuart Baird and Mark
Ravinet for helpful discussions, and to three anonymous reviewers for their constructive
comments. This work was supported by the Natural Environment Research Council (NE/K014021/1),
the European Research Council (AdG-693030-BARRIERS), Swedish Research Councils Formas
and Vetenskapsrådet through a Linnaeus grant to the Centre for Marine Evolutionary
Biology (217-2008-1719), the European Regional Development Fund (POCI-01-0145-FEDER-030628),
and the Fundação para a iência e a Tecnologia,\r\nPortugal (PTDC/BIA-EVL/\r\n30628/2017).
A.M.W. and R.F. were\r\nfunded by the European Union’s Horizon 2020 research and
innovation\r\nprogramme under Marie Skłodowska-Curie\r\ngrant agreements\r\nno.
754411/797747 and no. 706376, respectively."
article_processing_charge: No
article_type: original
author:
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger
full_name: Butlin, Roger
last_name: Butlin
citation:
ama: Westram AM, Faria R, Johannesson K, Butlin R. Using replicate hybrid zones
to understand the genomic basis of adaptive divergence. Molecular Ecology.
2021;30(15):3797-3814. doi:10.1111/mec.15861
apa: Westram, A. M., Faria, R., Johannesson, K., & Butlin, R. (2021). Using
replicate hybrid zones to understand the genomic basis of adaptive divergence.
Molecular Ecology. Wiley. https://doi.org/10.1111/mec.15861
chicago: Westram, Anja M, Rui Faria, Kerstin Johannesson, and Roger Butlin. “Using
Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.”
Molecular Ecology. Wiley, 2021. https://doi.org/10.1111/mec.15861.
ieee: A. M. Westram, R. Faria, K. Johannesson, and R. Butlin, “Using replicate hybrid
zones to understand the genomic basis of adaptive divergence,” Molecular Ecology,
vol. 30, no. 15. Wiley, pp. 3797–3814, 2021.
ista: Westram AM, Faria R, Johannesson K, Butlin R. 2021. Using replicate hybrid
zones to understand the genomic basis of adaptive divergence. Molecular Ecology.
30(15), 3797–3814.
mla: Westram, Anja M., et al. “Using Replicate Hybrid Zones to Understand the Genomic
Basis of Adaptive Divergence.” Molecular Ecology, vol. 30, no. 15, Wiley,
2021, pp. 3797–814, doi:10.1111/mec.15861.
short: A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021)
3797–3814.
corr_author: '1'
date_created: 2022-03-08T11:28:32Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2024-10-09T21:01:47Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1111/mec.15861
external_id:
isi:
- '000669439700001'
pmid:
- '33638231'
file:
- access_level: open_access
checksum: d5611f243ceb63a0e091d6662ebd9cda
content_type: application/pdf
creator: dernst
date_created: 2022-03-08T11:31:30Z
date_updated: 2022-03-08T11:31:30Z
file_id: '10839'
file_name: 2021_MolecularEcology_Westram.pdf
file_size: 1726548
relation: main_file
success: 1
file_date_updated: 2022-03-08T11:31:30Z
has_accepted_license: '1'
intvolume: ' 30'
isi: 1
issue: '15'
keyword:
- Genetics
- Ecology
- Evolution
- Behavior and Systematics
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 3797-3814
pmid: 1
publication: Molecular Ecology
publication_identifier:
eissn:
- 1365-294X
issn:
- 0962-1083
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Using replicate hybrid zones to understand the genomic basis of adaptive divergence
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: 30
year: '2021'
...
---
_id: '10847'
abstract:
- lang: eng
text: 'We study the two-player zero-sum extension of the partially observable stochastic
shortest-path problem where one agent has only partial information about the environment.
We formulate this problem as a partially observable stochastic game (POSG): given
a set of target states and negative rewards for each transition, the player with
imperfect information maximizes the expected undiscounted total reward until a
target state is reached. The second player with the perfect information aims for
the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs)
and give the following contributions: (1) we introduce a novel heuristic search
value iteration algorithm that iteratively solves depth-limited variants of the
game, (2) we derive the bound on the depth guaranteeing an arbitrary precision,
(3) we propose a novel upper-bound estimation that allows early terminations,
and (4) we experimentally evaluate the algorithm on a pursuit-evasion game.'
acknowledgement: "This research was supported by the Czech Science Foundation (no.
19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765
“Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the
Combat Capabilities Development Command Army Research Laboratory and was accomplished
under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA).
The views and conclusions contained in this document are those of the authors and
should not be interpreted as\r\nrepresenting the official policies, either expressed
or implied, of the Combat Capabilities Development Command Army Research Laboratory
or the U.S. Government. The U.S. Government is authorized to reproduce and distribute
reprints for Government purposes not withstanding any copyright notation here on. "
article_processing_charge: No
author:
- first_name: Petr
full_name: Tomášek, Petr
last_name: Tomášek
- first_name: Karel
full_name: Horák, Karel
last_name: Horák
- first_name: Aditya
full_name: Aradhye, Aditya
last_name: Aradhye
- first_name: Branislav
full_name: Bošanský, Branislav
last_name: Bošanský
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially
observable stochastic shortest-path games. In: 30th International Joint Conference
on Artificial Intelligence. International Joint Conferences on Artificial
Intelligence; 2021:4182-4189. doi:10.24963/ijcai.2021/575'
apa: 'Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021).
Solving partially observable stochastic shortest-path games. In 30th International
Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online:
International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/575'
chicago: Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu
Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In
30th International Joint Conference on Artificial Intelligence, 4182–89.
International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/575.
ieee: P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving
partially observable stochastic shortest-path games,” in 30th International
Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.
ista: 'Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially
observable stochastic shortest-path games. 30th International Joint Conference
on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial
Intelligence, 4182–4189.'
mla: Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path
Games.” 30th International Joint Conference on Artificial Intelligence,
International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89,
doi:10.24963/ijcai.2021/575.
short: P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International
Joint Conference on Artificial Intelligence, International Joint Conferences on
Artificial Intelligence, 2021, pp. 4182–4189.
conference:
end_date: 2021-08-27
location: Virtual, Online
name: 'IJCAI: International Joint Conferences on Artificial Intelligence'
start_date: 2021-08-19
date_created: 2022-03-13T23:01:47Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2026-06-18T10:41:02Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.24963/ijcai.2021/575
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.24963/ijcai.2021/575
month: '09'
oa: 1
oa_version: Published Version
page: 4182-4189
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 30th International Joint Conference on Artificial Intelligence
publication_identifier:
isbn:
- '9780999241196'
issn:
- 1045-0823
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solving partially observable stochastic shortest-path games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10852'
abstract:
- lang: eng
text: ' We review old and new results on the Fröhlich polaron model. The discussion
includes the validity of the (classical) Pekar approximation in the strong coupling
limit, quantum corrections to this limit, as well as the divergence of the effective
polaron mass.'
acknowledgement: This work was supported by the European Research Council (ERC) under
the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo.
694227).
article_number: '2060012'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Seiringer R. The polaron at strong coupling. Reviews in Mathematical Physics.
2021;33(01). doi:10.1142/s0129055x20600120
apa: Seiringer, R. (2021). The polaron at strong coupling. Reviews in Mathematical
Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x20600120
chicago: Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical
Physics. World Scientific Publishing, 2021. https://doi.org/10.1142/s0129055x20600120.
ieee: R. Seiringer, “The polaron at strong coupling,” Reviews in Mathematical
Physics, vol. 33, no. 01. World Scientific Publishing, 2021.
ista: Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical
Physics. 33(01), 2060012.
mla: Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical
Physics, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:10.1142/s0129055x20600120.
short: R. Seiringer, Reviews in Mathematical Physics 33 (2021).
corr_author: '1'
date_created: 2022-03-18T08:11:34Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2025-04-14T07:26:58Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/s0129055x20600120
ec_funded: 1
external_id:
arxiv:
- '1912.12509'
isi:
- '000613313200013'
intvolume: ' 33'
isi: 1
issue: '01'
keyword:
- Mathematical Physics
- Statistical and Nonlinear Physics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.12509
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Reviews in Mathematical Physics
publication_identifier:
eissn:
- 1793-6659
issn:
- 0129-055X
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: The polaron at strong coupling
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 33
year: '2021'
...
---
_id: '10853'
abstract:
- lang: eng
text: Dynamic Connectivity is a fundamental algorithmic graph problem, motivated
by a wide range of applications to social and communication networks and used
as a building block in various other algorithms, such as the bi-connectivity and
the dynamic minimal spanning tree problems. In brief, we wish to maintain the
connected components of the graph under dynamic edge insertions and deletions.
In the sequential case, the problem has been well-studied from both theoretical
and practical perspectives. However, much less is known about efficient concurrent
solutions to this problem. This is the gap we address in this paper. We start
from one of the classic data structures used to solve this problem, the Euler
Tour Tree. Our first contribution is a non-blocking single-writer implementation
of it. We leverage this data structure to obtain the first truly concurrent generalization
of dynamic connectivity, which preserves the time complexity of its sequential
counterpart, but is also scalable in practice. To achieve this, we rely on three
main techniques. The first is to ensure that connectivity queries, which usually
dominate real-world workloads, are non-blocking. The second non-trivial technique
expands the above idea by making all queries that do not change the connectivity
structure non-blocking. The third ingredient is applying fine-grained locking
for updating the connected components, which allows operations on disjoint components
to occur in parallel. We evaluate the resulting algorithm on various workloads,
executing on both real and synthetic graphs. The results show the efficiency of
each of the proposed optimizations; the most efficient variant improves the performance
of a coarse-grained based implementation on realistic scenarios up to 6x on average
and up to 30x when connectivity queries dominate.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Fedorov, Alexander
last_name: Fedorov
- first_name: Nikita
full_name: Koval, Nikita
last_name: Koval
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic
connectivity. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms
and Architectures. Association for Computing Machinery; 2021:208-220. doi:10.1145/3409964.3461810'
apa: 'Fedorov, A., Koval, N., & Alistarh, D.-A. (2021). A scalable concurrent
algorithm for dynamic connectivity. In Proceedings of the 33rd ACM Symposium
on Parallelism in Algorithms and Architectures (pp. 208–220). Virtual, Online:
Association for Computing Machinery. https://doi.org/10.1145/3409964.3461810'
chicago: Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable
Concurrent Algorithm for Dynamic Connectivity.” In Proceedings of the 33rd
ACM Symposium on Parallelism in Algorithms and Architectures, 208–20. Association
for Computing Machinery, 2021. https://doi.org/10.1145/3409964.3461810.
ieee: A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm
for dynamic connectivity,” in Proceedings of the 33rd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual, Online, 2021, pp. 208–220.
ista: 'Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for
dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in
Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and
Architectures, 208–220.'
mla: Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.”
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2021, pp. 208–20, doi:10.1145/3409964.3461810.
short: A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium
on Parallelism in Algorithms and Architectures, Association for Computing Machinery,
2021, pp. 208–220.
conference:
end_date: 2021-07-08
location: Virtual, Online
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2021-07-06
date_created: 2022-03-18T08:21:47Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2022-03-18T08:45:46Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3409964.3461810
external_id:
arxiv:
- '2105.08098'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.08098
month: '07'
oa: 1
oa_version: Preprint
page: 208-220
publication: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450380706'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A scalable concurrent algorithm for dynamic connectivity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10854'
abstract:
- lang: eng
text: "Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner?\r\nTo address this question, we define the batch dynamic CONGEST model
in which we are given a bandwidth-limited communication network and a dynamic
edge labelling defines the problem input. The task is to maintain a solution to
a graph problem on the labelled graph under batch changes. We investigate, when
a batch of alpha edge label changes arrive, - how much time as a function of alpha
we need to update an existing solution, and - how much information the nodes have
to keep in local memory between batches in order to update the solution quickly.\r\nOur
work lays the foundations for the theory of input-dynamic distributed network
algorithms. We give a general picture of the complexity landscape in this model,
design both universal algorithms and algorithms for concrete problems, and present
a general framework for lower bounds. The diverse time complexity of our model
spans from constant time, through time polynomial in alpha, and to alpha time,
which we show to be enough for any task."
acknowledgement: We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to
improve the paper. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research
and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605,
from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024,
and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.
article_processing_charge: No
arxiv: 1
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. In: Abstract Proceedings of the 2021
ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer
Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923'
apa: 'Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. In Abstract
Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement
and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association
for Computing Machinery. https://doi.org/10.1145/3410220.3453923'
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In
Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference
on Measurement and Modeling of Computer Systems, 71–72. Association for Computing
Machinery, 2021. https://doi.org/10.1145/3410220.3453923.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” in Abstract Proceedings
of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling
of Computer Systems, Virtual, Online, 2021, pp. 71–72.
ista: 'Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Abstract Proceedings of the
2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of
Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling
of Computer Systems, 71–72.'
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International
Conference on Measurement and Modeling of Computer Systems, Association for
Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract
Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement
and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp.
71–72.
conference:
end_date: 2021-06-18
location: Virtual, Online
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2021-06-14
date_created: 2022-03-18T08:48:41Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2025-04-14T13:52:09Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3410220.3453923
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '05'
oa: 1
oa_version: Preprint
page: 71-72
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
publication: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference
on Measurement and Modeling of Computer Systems
publication_identifier:
isbn:
- '9781450380720'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10855'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10855'
abstract:
- lang: eng
text: 'Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner? To address this question, we define the batch dynamic \congest model in
which we are given a bandwidth-limited communication network and a dynamic edge
labelling defines the problem input. The task is to maintain a solution to a graph
problem on the labeled graph under batch changes. We investigate, when a batch
of α edge label changes arrive, \beginitemize \item how much time as a function
of α we need to update an existing solution, and \item how much information the
nodes have to keep in local memory between batches in order to update the solution
quickly. \enditemize Our work lays the foundations for the theory of input-dynamic
distributed network algorithms. We give a general picture of the complexity landscape
in this model, design both universal algorithms and algorithms for concrete problems,
and present a general framework for lower bounds. In particular, we derive non-trivial
upper bounds for two selected, contrasting problems: maintaining a minimum spanning
tree and detecting cliques.'
acknowledgement: "We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how
to improve the paper. This project\r\nhas received funding from the European Research
Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation
programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon
2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant
agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project
WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE
SCIENCE project P 33775-N."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
apa: Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery. https://doi.org/10.1145/3447384
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery, 2021. https://doi.org/10.1145/3447384.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” Proceedings of the ACM
on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association
for Computing Machinery, pp. 1–33, 2021.
ista: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 5(1), 1–33.
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Proceedings of the ACM on Measurement and Analysis of Computing
Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33,
doi:10.1145/3447384.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of
the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
date_created: 2022-03-18T09:10:27Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2025-04-14T13:52:09Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3447384
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
intvolume: ' 5'
issue: '1'
keyword:
- Computer Networks and Communications
- Hardware and Architecture
- Safety
- Risk
- Reliability and Quality
- Computer Science (miscellaneous)
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '03'
oa: 1
oa_version: Preprint
page: 1-33
project:
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the ACM on Measurement and Analysis of Computing Systems
publication_identifier:
issn:
- 2476-1249
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10854'
relation: shorter_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '10856'
abstract:
- lang: eng
text: "We study the properties of the maximal volume k-dimensional sections of the
n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a
k-dimensional subspace to be a local maximizer of the volume of such sections,
which we formulate in a geometric way. We estimate the length of the projection
of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes
the volume of the intersection. We \x1Cnd the optimal upper bound on the volume
of a planar section of the cube [−1, 1]n , n ≥ 2."
acknowledgement: "The authors acknowledge the support of the grant of the Russian
Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science
Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer
for valuable remarks."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Grigory
full_name: Ivanov, Grigory
id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
last_name: Ivanov
- first_name: Igor
full_name: Tsiutsiurupa, Igor
last_name: Tsiutsiurupa
citation:
ama: Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. Analysis
and Geometry in Metric Spaces. 2021;9(1):1-18. doi:10.1515/agms-2020-0103
apa: Ivanov, G., & Tsiutsiurupa, I. (2021). On the volume of sections of the
cube. Analysis and Geometry in Metric Spaces. De Gruyter. https://doi.org/10.1515/agms-2020-0103
chicago: Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the
Cube.” Analysis and Geometry in Metric Spaces. De Gruyter, 2021. https://doi.org/10.1515/agms-2020-0103.
ieee: G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” Analysis
and Geometry in Metric Spaces, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.
ista: Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis
and Geometry in Metric Spaces. 9(1), 1–18.
mla: Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.”
Analysis and Geometry in Metric Spaces, vol. 9, no. 1, De Gruyter, 2021,
pp. 1–18, doi:10.1515/agms-2020-0103.
short: G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021)
1–18.
date_created: 2022-03-18T09:25:14Z
date_published: 2021-01-29T00:00:00Z
date_updated: 2023-08-17T07:07:58Z
day: '29'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1515/agms-2020-0103
external_id:
arxiv:
- '2004.02674'
isi:
- '000734286800001'
file:
- access_level: open_access
checksum: 7e615ac8489f5eae580b6517debfdc53
content_type: application/pdf
creator: dernst
date_created: 2022-03-18T09:31:59Z
date_updated: 2022-03-18T09:31:59Z
file_id: '10857'
file_name: 2021_AnalysisMetricSpaces_Ivanov.pdf
file_size: 789801
relation: main_file
success: 1
file_date_updated: 2022-03-18T09:31:59Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
keyword:
- Applied Mathematics
- Geometry and Topology
- Analysis
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1-18
publication: Analysis and Geometry in Metric Spaces
publication_identifier:
issn:
- 2299-3274
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the volume of sections of the cube
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 9
year: '2021'
...
---
_id: '10858'
abstract:
- lang: eng
text: The cost-effective conversion of low-grade heat into electricity using thermoelectric
devices requires developing alternative materials and material processing technologies
able to reduce the currently high device manufacturing costs. In this direction,
thermoelectric materials that do not rely on rare or toxic elements such as tellurium
or lead need to be produced using high-throughput technologies not involving high
temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative
to Bi2Te3 for ambient temperature thermoelectric applications, but its performance
is still low for practical applications, and additional efforts toward finding
proper dopants are required. Here, we report a scalable method to produce Bi2Se3
nanosheets at low synthesis temperatures. We studied the influence of different
dopants on the thermoelectric properties of this material. Among the elements
tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation
resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a
reduction in the thermal conductivity in the direction of the hot-press axis,
resulting in an overall 60% improvement in the thermoelectric figure of merit
of Bi2Se3.
acknowledgement: "M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for
their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s
Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie
grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects
MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding
from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3."
article_number: '1827'
article_processing_charge: No
article_type: original
author:
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Ting
full_name: Zhang, Ting
last_name: Zhang
- first_name: Yong
full_name: Zuo, Yong
last_name: Zuo
- first_name: Ke
full_name: Xiao, Ke
last_name: Xiao
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type
Bi2Se3 nanosheets through Sn doping. Nanomaterials. 2021;11(7). doi:10.3390/nano11071827
apa: Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021).
Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping.
Nanomaterials. MDPI. https://doi.org/10.3390/nano11071827
chicago: Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi
Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type
Bi2Se3 Nanosheets through Sn Doping.” Nanomaterials. MDPI, 2021. https://doi.org/10.3390/nano11071827.
ieee: M. Li et al., “Enhanced thermoelectric performance of n-type Bi2Se3
nanosheets through Sn doping,” Nanomaterials, vol. 11, no. 7. MDPI, 2021.
ista: Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A.
2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through
Sn doping. Nanomaterials. 11(7), 1827.
mla: Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets
through Sn Doping.” Nanomaterials, vol. 11, no. 7, 1827, MDPI, 2021, doi:10.3390/nano11071827.
short: M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu,
A. Cabot, Nanomaterials 11 (2021).
corr_author: '1'
date_created: 2022-03-18T09:45:02Z
date_published: 2021-07-14T00:00:00Z
date_updated: 2025-06-12T06:42:18Z
day: '14'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.3390/nano11071827
ec_funded: 1
external_id:
isi:
- '000676570000001'
pmid:
- '34361214'
file:
- access_level: open_access
checksum: f28a8b5cf80f5605828359bb398463b0
content_type: application/pdf
creator: dernst
date_created: 2022-03-18T09:53:15Z
date_updated: 2022-03-18T09:53:15Z
file_id: '10859'
file_name: 2021_Nanomaterials_Li.pdf
file_size: 4867547
relation: main_file
success: 1
file_date_updated: 2022-03-18T09:53:15Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '7'
keyword:
- General Materials Science
- General Chemical Engineering
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nanomaterials
publication_identifier:
issn:
- 2079-4991
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn
doping
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: 11
year: '2021'
...
---
_id: '10860'
abstract:
- lang: eng
text: A tight frame is the orthogonal projection of some orthonormal basis of Rn
onto Rk. We show that a set of vectors is a tight frame if and only if the set
of all cross products of these vectors is a tight frame. We reformulate a range
of problems on the volume of projections (or sections) of regular polytopes in
terms of tight frames and write a first-order necessary condition for local extrema
of these problems. As applications, we prove new results for the problem of maximization
of the volume of zonotopes.
acknowledgement: The author was supported by the Swiss National Science Foundation
grant 200021_179133. The author acknowledges the financial support from the Ministry
of Education and Science of the Russian Federation in the framework of MegaGrant
no. 075-15-2019-1926.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Grigory
full_name: Ivanov, Grigory
id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
last_name: Ivanov
citation:
ama: Ivanov G. Tight frames and related geometric problems. Canadian Mathematical
Bulletin. 2021;64(4):942-963. doi:10.4153/s000843952000096x
apa: Ivanov, G. (2021). Tight frames and related geometric problems. Canadian
Mathematical Bulletin. Canadian Mathematical Society. https://doi.org/10.4153/s000843952000096x
chicago: Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” Canadian
Mathematical Bulletin. Canadian Mathematical Society, 2021. https://doi.org/10.4153/s000843952000096x.
ieee: G. Ivanov, “Tight frames and related geometric problems,” Canadian Mathematical
Bulletin, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.
ista: Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical
Bulletin. 64(4), 942–963.
mla: Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” Canadian
Mathematical Bulletin, vol. 64, no. 4, Canadian Mathematical Society, 2021,
pp. 942–63, doi:10.4153/s000843952000096x.
short: G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.
corr_author: '1'
date_created: 2022-03-18T09:55:59Z
date_published: 2021-12-18T00:00:00Z
date_updated: 2024-10-09T21:01:50Z
day: '18'
department:
- _id: UlWa
doi: 10.4153/s000843952000096x
external_id:
arxiv:
- '1804.10055'
isi:
- '000730165300021'
intvolume: ' 64'
isi: 1
issue: '4'
keyword:
- General Mathematics
- Tight frame
- Grassmannian
- zonotope
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10055
month: '12'
oa: 1
oa_version: Preprint
page: 942-963
publication: Canadian Mathematical Bulletin
publication_identifier:
eissn:
- 1496-4287
issn:
- 0008-4395
publication_status: published
publisher: Canadian Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tight frames and related geometric problems
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 64
year: '2021'
...
---
_id: '11052'
abstract:
- lang: eng
text: In order to combat molecular damage, most cellular proteins undergo rapid
turnover. We have previously identified large nuclear protein assemblies that
can persist for years in post-mitotic tissues and are subject to age-related decline.
Here, we report that mitochondria can be long lived in the mouse brain and reveal
that specific mitochondrial proteins have half-lives longer than the average proteome.
These mitochondrial long-lived proteins (mitoLLPs) are core components of the
electron transport chain (ETC) and display increased longevity in respiratory
supercomplexes. We find that COX7C, a mitoLLP that forms a stable contact site
between complexes I and IV, is required for complex IV and supercomplex assembly.
Remarkably, even upon depletion of COX7C transcripts, ETC function is maintained
for days, effectively uncoupling mitochondrial function from ongoing transcription
of its mitoLLPs. Our results suggest that modulating protein longevity within
the ETC is critical for mitochondrial proteome maintenance and the robustness
of mitochondrial function.
article_processing_charge: No
article_type: original
author:
- first_name: Shefali
full_name: Krishna, Shefali
last_name: Krishna
- first_name: Rafael
full_name: Arrojo e Drigo, Rafael
last_name: Arrojo e Drigo
- first_name: Juliana S.
full_name: Capitanio, Juliana S.
last_name: Capitanio
- first_name: Ranjan
full_name: Ramachandra, Ranjan
last_name: Ramachandra
- first_name: Mark
full_name: Ellisman, Mark
last_name: Ellisman
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer
M. Identification of long-lived proteins in the mitochondria reveals increased
stability of the electron transport chain. Developmental Cell. 2021;56(21):P2952-2965.e9.
doi:10.1016/j.devcel.2021.10.008
apa: Krishna, S., Arrojo e Drigo, R., Capitanio, J. S., Ramachandra, R., Ellisman,
M., & Hetzer, M. (2021). Identification of long-lived proteins in the mitochondria
reveals increased stability of the electron transport chain. Developmental
Cell. Elsevier. https://doi.org/10.1016/j.devcel.2021.10.008
chicago: Krishna, Shefali, Rafael Arrojo e Drigo, Juliana S. Capitanio, Ranjan Ramachandra,
Mark Ellisman, and Martin Hetzer. “Identification of Long-Lived Proteins in the
Mitochondria Reveals Increased Stability of the Electron Transport Chain.” Developmental
Cell. Elsevier, 2021. https://doi.org/10.1016/j.devcel.2021.10.008.
ieee: S. Krishna, R. Arrojo e Drigo, J. S. Capitanio, R. Ramachandra, M. Ellisman,
and M. Hetzer, “Identification of long-lived proteins in the mitochondria reveals
increased stability of the electron transport chain,” Developmental Cell,
vol. 56, no. 21. Elsevier, p. P2952–2965.e9, 2021.
ista: Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer
M. 2021. Identification of long-lived proteins in the mitochondria reveals increased
stability of the electron transport chain. Developmental Cell. 56(21), P2952–2965.e9.
mla: Krishna, Shefali, et al. “Identification of Long-Lived Proteins in the Mitochondria
Reveals Increased Stability of the Electron Transport Chain.” Developmental
Cell, vol. 56, no. 21, Elsevier, 2021, p. P2952–2965.e9, doi:10.1016/j.devcel.2021.10.008.
short: S. Krishna, R. Arrojo e Drigo, J.S. Capitanio, R. Ramachandra, M. Ellisman,
M. Hetzer, Developmental Cell 56 (2021) P2952–2965.e9.
date_created: 2022-04-07T07:43:14Z
date_published: 2021-11-08T00:00:00Z
date_updated: 2025-12-15T10:01:56Z
day: '08'
department:
- _id: MaHe
doi: 10.1016/j.devcel.2021.10.008
extern: '1'
external_id:
pmid:
- '34715012'
intvolume: ' 56'
issue: '21'
keyword:
- Developmental Biology
- Cell Biology
- General Biochemistry
- Genetics and Molecular Biology
- Molecular Biology
language:
- iso: eng
month: '11'
oa_version: None
page: P2952-2965.e9
pmid: 1
publication: Developmental Cell
publication_identifier:
issn:
- 1534-5807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Identification of long-lived proteins in the mitochondria reveals increased
stability of the electron transport chain
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2021'
...
---
_id: '11458'
abstract:
- lang: eng
text: 'The increasing computational requirements of deep neural networks (DNNs)
have led to significant interest in obtaining DNN models that are sparse, yet
accurate. Recent work has investigated the even harder case of sparse training,
where the DNN weights are, for as much as possible, already sparse to reduce computational
costs during training. Existing sparse training methods are often empirical and
can have lower accuracy relative to the dense baseline. In this paper, we present
a general approach called Alternating Compressed/DeCompressed (AC/DC) training
of DNNs, demonstrate convergence for a variant of the algorithm, and show that
AC/DC outperforms existing sparse training methods in accuracy at similar computational
budgets; at high sparsity levels, AC/DC even outperforms existing methods that
rely on accurate pre-trained dense models. An important property of AC/DC is that
it allows co-training of dense and sparse models, yielding accurate sparse–dense
model pairs at the end of the training process. This is useful in practice, where
compressed variants may be desirable for deployment in resource-constrained settings
without re-doing the entire training flow, and also provides us with insights
into the accuracy gap between dense and compressed models. The code is available
at: https://github.com/IST-DASLab/ACDC.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported
by the Scientific Service Units (SSU) of IST Austria through resources provided
by Scientific Computing (SciComp). We would also like to thank Christoph Lampert
for his feedback on an earlier version of this work, as well as for providing hardware
for the Transformer-XL experiments.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Krumes A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed
training of deep neural networks. In: 35th Conference on Neural Information
Processing Systems. Vol 34. Neural Information Processing Systems Foundation;
2021:8557-8570.'
apa: 'Krumes, A., Iofinova, E. B., Vladu, A., & Alistarh, D.-A. (2021). AC/DC:
Alternating Compressed/DeCompressed training of deep neural networks. In 35th
Conference on Neural Information Processing Systems (Vol. 34, pp. 8557–8570).
Virtual, Online: Neural Information Processing Systems Foundation.'
chicago: 'Krumes, Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh.
“AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.”
In 35th Conference on Neural Information Processing Systems, 34:8557–70.
Neural Information Processing Systems Foundation, 2021.'
ieee: 'A. Krumes, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating
Compressed/DeCompressed training of deep neural networks,” in 35th Conference
on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34,
pp. 8557–8570.'
ista: 'Krumes A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed
training of deep neural networks. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 34, 8557–8570.'
mla: 'Krumes, Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training
of Deep Neural Networks.” 35th Conference on Neural Information Processing
Systems, vol. 34, Neural Information Processing Systems Foundation, 2021,
pp. 8557–70.'
short: A. Krumes, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2021, pp. 8557–8570.
conference:
end_date: 2021-12-14
location: Virtual, Online
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-06-20T12:11:53Z
date_published: 2021-12-06T00:00:00Z
date_updated: 2026-06-18T17:18:20Z
day: '06'
ddc:
- '000'
department:
- _id: GradSch
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2106.12379'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 8557-8570
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
record:
- id: '13074'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'AC/DC: Alternating Compressed/DeCompressed training of deep neural networks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '11463'
abstract:
- lang: eng
text: "Efficiently approximating local curvature information of the loss function
is a key tool for optimization and compression of deep neural networks. Yet, most
existing methods to approximate second-order information have high computational\r\nor
storage costs, which limits their practicality. In this work, we investigate matrix-free,
linear-time approaches for estimating Inverse-Hessian Vector Products (IHVPs)
for the case when the Hessian can be approximated as a sum of rank-one matrices,
as in the classic approximation of the Hessian by the empirical Fisher matrix.
We propose two new algorithms: the first is tailored towards network compression
and can compute the IHVP for dimension d, if the Hessian is given as a sum of
m rank-one matrices, using O(dm2) precomputation, O(dm) cost for computing the
IHVP, and query cost O(m) for any single element of the inverse Hessian. The second
algorithm targets an optimization setting, where we wish to compute the product
between the inverse Hessian, estimated over a sliding window of optimization steps,
and a given gradient direction, as required for preconditioned SGD. We give an
algorithm with cost O(dm + m2) for computing the IHVP and O(dm + m3) for adding
or removing any gradient from the sliding window. These\r\ntwo algorithms yield
state-of-the-art results for network pruning and optimization with lower computational
overhead relative to existing second-order methods. Implementations are available
at [9] and [17]."
acknowledgement: We gratefully acknowledge funding the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation programme (grant
agreement No 805223 ScaleML), as well as computational support from Amazon Web Services
(AWS) EC2.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Frantar E, Kurtic E, Alistarh D-A. M-FAC: Efficient matrix-free approximations
of second-order information. In: 35th Conference on Neural Information Processing
Systems. Vol 34. Neural Information Processing Systems Foundation; 2021:14873-14886.'
apa: 'Frantar, E., Kurtic, E., & Alistarh, D.-A. (2021). M-FAC: Efficient matrix-free
approximations of second-order information. In 35th Conference on Neural Information
Processing Systems (Vol. 34, pp. 14873–14886). Virtual, Online: Neural Information
Processing Systems Foundation.'
chicago: 'Frantar, Elias, Eldar Kurtic, and Dan-Adrian Alistarh. “M-FAC: Efficient
Matrix-Free Approximations of Second-Order Information.” In 35th Conference
on Neural Information Processing Systems, 34:14873–86. Neural Information
Processing Systems Foundation, 2021.'
ieee: 'E. Frantar, E. Kurtic, and D.-A. Alistarh, “M-FAC: Efficient matrix-free
approximations of second-order information,” in 35th Conference on Neural Information
Processing Systems, Virtual, Online, 2021, vol. 34, pp. 14873–14886.'
ista: 'Frantar E, Kurtic E, Alistarh D-A. 2021. M-FAC: Efficient matrix-free approximations
of second-order information. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 34, 14873–14886.'
mla: 'Frantar, Elias, et al. “M-FAC: Efficient Matrix-Free Approximations of Second-Order
Information.” 35th Conference on Neural Information Processing Systems,
vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 14873–86.'
short: E. Frantar, E. Kurtic, D.-A. Alistarh, in:, 35th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2021, pp.
14873–14886.
conference:
end_date: 2021-12-14
location: Virtual, Online
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-06-26T22:01:35Z
date_published: 2021-12-06T00:00:00Z
date_updated: 2026-06-18T17:18:44Z
day: '06'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2010.08222'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/file/7cfd5df443b4eb0d69886a583b33de4c-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 14873-14886
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'M-FAC: Efficient matrix-free approximations of second-order information'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '11464'
abstract:
- lang: eng
text: "We consider a standard distributed optimisation setting where N machines,
each holding a d-dimensional function\r\nfi, aim to jointly minimise the sum of
the functions ∑Ni=1fi(x). This problem arises naturally in large-scale distributed
optimisation, where a standard solution is to apply variants of (stochastic) gradient
descent. We focus on the communication complexity of this problem: our main result
provides the first fully unconditional bounds on total number of bits which need
to be sent and received by the N machines to solve this problem under point-to-point
communication, within a given error-tolerance. Specifically, we show that Ω(Ndlogd/Nε)
total bits need to be communicated between the machines to find an additive ϵ-approximation
to the minimum of ∑Ni=1fi(x). The result holds for both deterministic and randomised
algorithms, and, importantly, requires no assumptions on the algorithm structure.
The lower bound is tight under certain restrictions on parameter values, and is
matched within constant factors for quadratic objectives by a new variant of quantised
gradient descent, which we describe and analyse. Our results bring over tools
from communication complexity to distributed optimisation, which has potential
for further applications."
acknowledgement: We thank the NeurIPS reviewers for insightful comments that helped
us improve the positioning of our results, as well as for pointing out the subsampling
approach for complementing the randomised lower bound. We also thank Foivos Alimisis
and Peter Davies for useful discussions. This project has received funding from
the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant agreement No 805223 ScaleML).
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: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
citation:
ama: 'Alistarh D-A, Korhonen J. Towards tight communication lower bounds for distributed
optimisation. In: 35th Conference on Neural Information Processing Systems.
Vol 34. Neural Information Processing Systems Foundation; 2021:7254-7266.'
apa: 'Alistarh, D.-A., & Korhonen, J. (2021). Towards tight communication lower
bounds for distributed optimisation. In 35th Conference on Neural Information
Processing Systems (Vol. 34, pp. 7254–7266). Virtual, Online: Neural Information
Processing Systems Foundation.'
chicago: Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication
Lower Bounds for Distributed Optimisation.” In 35th Conference on Neural Information
Processing Systems, 34:7254–66. Neural Information Processing Systems Foundation,
2021.
ieee: D.-A. Alistarh and J. Korhonen, “Towards tight communication lower bounds
for distributed optimisation,” in 35th Conference on Neural Information Processing
Systems, Virtual, Online, 2021, vol. 34, pp. 7254–7266.
ista: 'Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds
for distributed optimisation. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 34, 7254–7266.'
mla: Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower
Bounds for Distributed Optimisation.” 35th Conference on Neural Information
Processing Systems, vol. 34, Neural Information Processing Systems Foundation,
2021, pp. 7254–66.
short: D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing
Systems, Neural Information Processing Systems Foundation, 2021, pp. 7254–7266.
conference:
end_date: 2021-12-14
location: Virtual, Online
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-06-26T22:01:35Z
date_published: 2021-12-06T00:00:00Z
date_updated: 2026-06-18T17:19:18Z
day: '06'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2010.08222'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/file/3b92d18aa7a6176dd37d372bc2f1eb71-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 7254-7266
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Towards tight communication lower bounds for distributed optimisation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '12186'
abstract:
- lang: eng
text: Activation of cell-surface and intracellular receptor-mediated immunity results
in rapid transcriptional reprogramming that underpins disease resistance. However,
the mechanisms by which co-activation of both immune systems lead to transcriptional
changes are not clear. Here, we combine RNA-seq and ATAC-seq to define changes
in gene expression and chromatin accessibility. Activation of cell-surface or
intracellular receptor-mediated immunity, or both, increases chromatin accessibility
at induced defence genes. Analysis of ATAC-seq and RNA-seq data combined with
publicly available information on transcription factor DNA-binding motifs enabled
comparison of individual gene regulatory networks activated by cell-surface or
intracellular receptor-mediated immunity, or by both. These results and analyses
reveal overlapping and conserved transcriptional regulatory mechanisms between
the two immune systems.
acknowledgement: "We thank the Gatsby Foundation (UK) for funding to the JDGJ laboratory.
PD acknowledges support from the European Union’s Horizon 2020 Research and Innovation
Program under Marie Skłodowska Curie Actions (grant agreement: 656243) and a Future
Leader Fellowship from the Biotechnology and Biological Sciences Research Council
(BBSRC) (grant agreement: BB/R012172/1). TS, RKS, DM, and JDGJ were supported by
the Gatsby Foundation funding to the\r\nSainsbury Laboratory. NMP and KV were supported
by a BOF grant from Ghent University (grant agreement: BOF24Y2019001901). WG and
RZ were supported by the Scottish Government Rural and Environment Science and Analytical
Services division (RESAS), and RZ also acknowledges the support from a BBSRC Bioinformatics
and Biological Resources Fund (grant agreement: BB/S020160/1).BPMN was supported
by the Norwich Research Park (NRP) Biosciences Doctoral Training Partnership (DTP)
funded by the BBSRC (grant agreement: BB/M011216/1). SH and XF were supported by
a BBSRC Responsive Mode grant (grant agreement: BB/S009620/1) and a European Research
Council Starting grant ‘SexMeth’ (grant agreement: 804981). CL was supported by
Deutsche Forschungsgemeinschaft (grant agreement: LI 2862/4). "
article_processing_charge: No
article_type: original
author:
- first_name: Pingtao
full_name: Ding, Pingtao
last_name: Ding
- first_name: Toshiyuki
full_name: Sakai, Toshiyuki
last_name: Sakai
- first_name: Ram
full_name: Krishna Shrestha, Ram
last_name: Krishna Shrestha
- first_name: Nicolas
full_name: Manosalva Perez, Nicolas
last_name: Manosalva Perez
- first_name: Wenbin
full_name: Guo, Wenbin
last_name: Guo
- first_name: Bruno Pok Man
full_name: Ngou, Bruno Pok Man
last_name: Ngou
- first_name: Shengbo
full_name: He, Shengbo
last_name: He
- first_name: Chang
full_name: Liu, Chang
last_name: Liu
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Runxuan
full_name: Zhang, Runxuan
last_name: Zhang
- first_name: Klaas
full_name: Vandepoele, Klaas
last_name: Vandepoele
- first_name: Dan
full_name: MacLean, Dan
last_name: MacLean
- first_name: Jonathan D G
full_name: Jones, Jonathan D G
last_name: Jones
citation:
ama: Ding P, Sakai T, Krishna Shrestha R, et al. Chromatin accessibility landscapes
activated by cell-surface and intracellular immune receptors. Journal of Experimental
Botany. 2021;72(22):7927-7941. doi:10.1093/jxb/erab373
apa: Ding, P., Sakai, T., Krishna Shrestha, R., Manosalva Perez, N., Guo, W., Ngou,
B. P. M., … Jones, J. D. G. (2021). Chromatin accessibility landscapes activated
by cell-surface and intracellular immune receptors. Journal of Experimental
Botany. Oxford University Press. https://doi.org/10.1093/jxb/erab373
chicago: Ding, Pingtao, Toshiyuki Sakai, Ram Krishna Shrestha, Nicolas Manosalva
Perez, Wenbin Guo, Bruno Pok Man Ngou, Shengbo He, et al. “Chromatin Accessibility
Landscapes Activated by Cell-Surface and Intracellular Immune Receptors.” Journal
of Experimental Botany. Oxford University Press, 2021. https://doi.org/10.1093/jxb/erab373.
ieee: P. Ding et al., “Chromatin accessibility landscapes activated by cell-surface
and intracellular immune receptors,” Journal of Experimental Botany, vol.
72, no. 22. Oxford University Press, pp. 7927–7941, 2021.
ista: Ding P, Sakai T, Krishna Shrestha R, Manosalva Perez N, Guo W, Ngou BPM, He
S, Liu C, Feng X, Zhang R, Vandepoele K, MacLean D, Jones JDG. 2021. Chromatin
accessibility landscapes activated by cell-surface and intracellular immune receptors.
Journal of Experimental Botany. 72(22), 7927–7941.
mla: Ding, Pingtao, et al. “Chromatin Accessibility Landscapes Activated by Cell-Surface
and Intracellular Immune Receptors.” Journal of Experimental Botany, vol.
72, no. 22, Oxford University Press, 2021, pp. 7927–41, doi:10.1093/jxb/erab373.
short: P. Ding, T. Sakai, R. Krishna Shrestha, N. Manosalva Perez, W. Guo, B.P.M.
Ngou, S. He, C. Liu, X. Feng, R. Zhang, K. Vandepoele, D. MacLean, J.D.G. Jones,
Journal of Experimental Botany 72 (2021) 7927–7941.
date_created: 2023-01-16T09:14:35Z
date_published: 2021-08-13T00:00:00Z
date_updated: 2023-05-08T11:01:18Z
day: '13'
department:
- _id: XiFe
doi: 10.1093/jxb/erab373
extern: '1'
external_id:
pmid:
- '34387350'
intvolume: ' 72'
issue: '22'
keyword:
- Plant Science
- Physiology
language:
- iso: eng
month: '08'
oa_version: None
page: 7927-7941
pmid: 1
publication: Journal of Experimental Botany
publication_identifier:
issn:
- 0022-0957
- 1460-2431
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chromatin accessibility landscapes activated by cell-surface and intracellular
immune receptors
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 72
year: '2021'
...