---
_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: '10912'
abstract:
- lang: eng
text: Brain dynamics display collective phenomena as diverse as neuronal oscillations
and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic
scale, whereas avalanches are scale-free cascades of neural activity. Here we
show that such antithetic features can coexist in a very generic class of adaptive
neural networks. In the most simple yet fully microscopic model from this class
we make direct contact with human brain resting-state activity recordings via
tractable inference of the model's two essential parameters. The inferred model
quantitatively captures the dynamics over a broad range of scales, from single
sensor fluctuations, collective behaviors of nearly-synchronous extreme events
on multiple sensors, to neuronal avalanches unfolding over multiple sensors across
multiple time-bins. Importantly, the inferred parameters correlate with model-independent
signatures of "closeness to criticality", suggesting that the coexistence of scale-specific
(neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity
occurs close to a non-equilibrium critical point at the onset of self-sustained
oscillations.
acknowledgement: "FL acknowledges support from the European Union’s Horizon 2020 research
and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411.
GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone
Grant\r\nNo. P34015."
article_processing_charge: No
arxiv: 1
author:
- first_name: Fabrizio
full_name: Lombardi, Fabrizio
id: A057D288-3E88-11E9-986D-0CF4E5697425
last_name: Lombardi
orcid: 0000-0003-2623-5249
- first_name: Selver
full_name: Pepic, Selver
id: F93245C4-C3CA-11E9-B4F0-C6F4E5697425
last_name: Pepic
- first_name: Oren
full_name: Shriki, Oren
last_name: Shriki
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Daniele
full_name: De Martino, Daniele
last_name: De Martino
citation:
ama: Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence
of neuronal oscillations and avalanches. doi:10.48550/ARXIV.2108.06686
apa: Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., & De Martino, D. (n.d.).
Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. https://doi.org/10.48550/ARXIV.2108.06686
chicago: Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele
De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.”
arXiv, n.d. https://doi.org/10.48550/ARXIV.2108.06686.
ieee: F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying
the coexistence of neuronal oscillations and avalanches.” arXiv.
ista: Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence
of neuronal oscillations and avalanches. 10.48550/ARXIV.2108.06686.
mla: Lombardi, Fabrizio, et al. Quantifying the Coexistence of Neuronal Oscillations
and Avalanches. arXiv, doi:10.48550/ARXIV.2108.06686.
short: F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).
date_created: 2022-03-21T11:41:28Z
date_published: 2021-08-17T00:00:00Z
date_updated: 2024-10-22T11:24:26Z
day: '17'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.48550/ARXIV.2108.06686
ec_funded: 1
external_id:
arxiv:
- '2108.06686'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2108.06686
month: '08'
oa: 1
oa_version: Preprint
page: '37'
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 626c45b5-2b32-11ec-9570-e509828c1ba6
grant_number: P34015
name: Efficient coding with biophysical realism
publication_status: submitted
publisher: arXiv
status: public
title: Quantifying the coexistence of neuronal oscillations and avalanches
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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: '11053'
abstract:
- lang: eng
text: Understanding basic mechanisms of aging holds great promise for developing
interventions that prevent or delay many age-related declines and diseases simultaneously
to increase human healthspan. However, a major confounding factor in aging research
is the heterogeneity of the aging process itself. At the organismal level, it
is clear that chronological age does not always predict biological age or susceptibility
to frailty or pathology. While genetics and environment are major factors driving
variable rates of aging, additional complexity arises because different organs,
tissues, and cell types are intrinsically heterogeneous and exhibit different
aging trajectories normally or in response to the stresses of the aging process
(e.g., damage accumulation). Tackling the heterogeneity of aging requires new
and specialized tools (e.g., single-cell analyses, mass spectrometry-based approaches,
and advanced imaging) to identify novel signatures of aging across scales. Cutting-edge
computational approaches are then needed to integrate these disparate datasets
and elucidate network interactions between known aging hallmarks. There is also
a need for improved, human cell-based models of aging to ensure that basic research
findings are relevant to human aging and healthspan interventions. The San Diego
Nathan Shock Center (SD-NSC) provides access to cutting-edge scientific resources
to facilitate the study of the heterogeneity of aging in general and to promote
the use of novel human cell models of aging. The center also has a robust Research
Development Core that funds pilot projects on the heterogeneity of aging and organizes
innovative training activities, including workshops and a personalized mentoring
program, to help investigators new to the aging field succeed. Finally, the SD-NSC
participates in outreach activities to educate the general community about the
importance of aging research and promote the need for basic biology of aging research
in particular.
article_processing_charge: No
article_type: original
author:
- first_name: Gerald S.
full_name: Shadel, Gerald S.
last_name: Shadel
- first_name: Peter D.
full_name: Adams, Peter D.
last_name: Adams
- first_name: W. Travis
full_name: Berggren, W. Travis
last_name: Berggren
- first_name: Jolene K.
full_name: Diedrich, Jolene K.
last_name: Diedrich
- first_name: Kenneth E.
full_name: Diffenderfer, Kenneth E.
last_name: Diffenderfer
- first_name: Fred H.
full_name: Gage, Fred H.
last_name: Gage
- first_name: Nasun
full_name: Hah, Nasun
last_name: Hah
- first_name: Malene
full_name: Hansen, Malene
last_name: Hansen
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Anthony J. A.
full_name: Molina, Anthony J. A.
last_name: Molina
- first_name: Uri
full_name: Manor, Uri
last_name: Manor
- first_name: Kurt
full_name: Marek, Kurt
last_name: Marek
- first_name: David D.
full_name: O’Keefe, David D.
last_name: O’Keefe
- first_name: Antonio F. M.
full_name: Pinto, Antonio F. M.
last_name: Pinto
- first_name: Alessandra
full_name: Sacco, Alessandra
last_name: Sacco
- first_name: Tatyana O.
full_name: Sharpee, Tatyana O.
last_name: Sharpee
- first_name: Maxim N.
full_name: Shokriev, Maxim N.
last_name: Shokriev
- first_name: Stefania
full_name: Zambetti, Stefania
last_name: Zambetti
citation:
ama: 'Shadel GS, Adams PD, Berggren WT, et al. The San Diego Nathan Shock Center:
Tackling the heterogeneity of aging. GeroScience. 2021;43(5):2139-2148.
doi:10.1007/s11357-021-00426-x'
apa: 'Shadel, G. S., Adams, P. D., Berggren, W. T., Diedrich, J. K., Diffenderfer,
K. E., Gage, F. H., … Zambetti, S. (2021). The San Diego Nathan Shock Center:
Tackling the heterogeneity of aging. GeroScience. Springer Nature. https://doi.org/10.1007/s11357-021-00426-x'
chicago: 'Shadel, Gerald S., Peter D. Adams, W. Travis Berggren, Jolene K. Diedrich,
Kenneth E. Diffenderfer, Fred H. Gage, Nasun Hah, et al. “The San Diego Nathan
Shock Center: Tackling the Heterogeneity of Aging.” GeroScience. Springer
Nature, 2021. https://doi.org/10.1007/s11357-021-00426-x.'
ieee: 'G. S. Shadel et al., “The San Diego Nathan Shock Center: Tackling
the heterogeneity of aging,” GeroScience, vol. 43, no. 5. Springer Nature,
pp. 2139–2148, 2021.'
ista: 'Shadel GS, Adams PD, Berggren WT, Diedrich JK, Diffenderfer KE, Gage FH,
Hah N, Hansen M, Hetzer M, Molina AJA, Manor U, Marek K, O’Keefe DD, Pinto AFM,
Sacco A, Sharpee TO, Shokriev MN, Zambetti S. 2021. The San Diego Nathan Shock
Center: Tackling the heterogeneity of aging. GeroScience. 43(5), 2139–2148.'
mla: 'Shadel, Gerald S., et al. “The San Diego Nathan Shock Center: Tackling the
Heterogeneity of Aging.” GeroScience, vol. 43, no. 5, Springer Nature,
2021, pp. 2139–48, doi:10.1007/s11357-021-00426-x.'
short: G.S. Shadel, P.D. Adams, W.T. Berggren, J.K. Diedrich, K.E. Diffenderfer,
F.H. Gage, N. Hah, M. Hansen, M. Hetzer, A.J.A. Molina, U. Manor, K. Marek, D.D.
O’Keefe, A.F.M. Pinto, A. Sacco, T.O. Sharpee, M.N. Shokriev, S. Zambetti, GeroScience
43 (2021) 2139–2148.
date_created: 2022-04-07T07:43:25Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2022-07-18T08:27:24Z
day: '01'
doi: 10.1007/s11357-021-00426-x
extern: '1'
external_id:
pmid:
- '34370163'
intvolume: ' 43'
issue: '5'
keyword:
- Geriatrics and Gerontology
- Aging
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8599742/
month: '10'
oa: 1
oa_version: Published Version
page: 2139-2148
pmid: 1
publication: GeroScience
publication_identifier:
issn:
- 2509-2715
- 2509-2723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The San Diego Nathan Shock Center: Tackling the heterogeneity of aging'
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 43
year: '2021'
...
---
_id: '11436'
abstract:
- lang: eng
text: Asynchronous distributed algorithms are a popular way to reduce synchronization
costs in large-scale optimization, and in particular for neural network training.
However, for nonsmooth and nonconvex objectives, few convergence guarantees exist
beyond cases where closed-form proximal operator solutions are available. As training
most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex
objectives, there is a pressing need for such convergence guarantees. In this
paper, we analyze for the first time the convergence of stochastic asynchronous
optimization for this general class of objectives. In particular, we focus on
stochastic subgradient methods allowing for block variable partitioning, where
the shared model is asynchronously updated by concurrent processes. To this end,
we use a probabilistic model which captures key features of real asynchronous
scheduling between concurrent processes. Under this model, we establish convergence
with probability one to an invariant set for stochastic subgradient methods with
momentum. From a practical perspective, one issue with the family of algorithms
that we consider is that they are not efficiently supported by machine learning
frameworks, which mostly focus on distributed data-parallel strategies. To address
this, we propose a new implementation strategy for shared-memory based training
of deep neural networks for a partitioned but shared model in single- and multi-GPU
settings. Based on this implementation, we achieve on average1.2x speed-up in
comparison to state-of-the-art training methods for popular image classification
tasks, without compromising accuracy.
acknowledgement: Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16
019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the
European Union’s Horizon 2020 research and innovation programme under the Marie
Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh 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).
article_processing_charge: No
arxiv: 1
author:
- first_name: Vyacheslav
full_name: Kungurtsev, Vyacheslav
last_name: Kungurtsev
- first_name: Malcolm
full_name: Egan, Malcolm
last_name: Egan
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- 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: 'Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization
methods for efficient training of deep neural networks with guarantees. In: 35th
AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press;
2021:8209-8216.'
apa: 'Kungurtsev, V., Egan, M., Chatterjee, B., & Alistarh, D.-A. (2021). Asynchronous
optimization methods for efficient training of deep neural networks with guarantees.
In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 35,
pp. 8209–8216). Virtual, Online: AAAI Press.'
chicago: Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh.
“Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks
with Guarantees.” In 35th AAAI Conference on Artificial Intelligence, AAAI
2021, 35:8209–16. AAAI Press, 2021.
ieee: V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization
methods for efficient training of deep neural networks with guarantees,” in 35th
AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021,
vol. 35, no. 9B, pp. 8209–8216.
ista: 'Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization
methods for efficient training of deep neural networks with guarantees. 35th AAAI
Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial
Intelligence vol. 35, 8209–8216.'
mla: Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient
Training of Deep Neural Networks with Guarantees.” 35th AAAI Conference on
Artificial Intelligence, AAAI 2021, vol. 35, no. 9B, AAAI Press, 2021, pp.
8209–16.
short: V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference
on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.
conference:
end_date: 2021-02-09
location: Virtual, Online
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2021-02-02
date_created: 2022-06-05T22:01:52Z
date_published: 2021-05-18T00:00:00Z
date_updated: 2025-04-14T07:43:57Z
day: '18'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '1905.11845'
intvolume: ' 35'
issue: 9B
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1905.11845'
month: '05'
oa: 1
oa_version: Preprint
page: 8209-8216
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th AAAI Conference on Artificial Intelligence, AAAI 2021
publication_identifier:
eissn:
- 2374-3468
isbn:
- '9781713835974'
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous optimization methods for efficient training of deep neural networks
with guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10000'
abstract:
- lang: eng
text: Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective
in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs)
after acute optic nerve damage. Consistent with this, induced HDAC3 expression
in cultured cells shows selective toxicity to neurons. Despite an established
role for HDAC3 in neuronal pathology, little is known regarding the mechanism
of this pathology.
acknowledgement: 'The authors thank Joel Dietz for maintaining the mice used in this
study, Satoshi Kinoshita and the Translational Research Initiative in Pathology
Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed
in this study, and Mark Banghart for statistical review of the data analysis. Supported
by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809
(LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant
T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness,
Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick
A. Davis Research Chair (RWN). '
article_number: '14'
article_processing_charge: Yes
article_type: original
author:
- first_name: Heather M.
full_name: Schmitt, Heather M.
last_name: Schmitt
- first_name: Rachel L.
full_name: Fehrman, Rachel L.
last_name: Fehrman
- first_name: Margaret E
full_name: Maes, Margaret E
id: 3838F452-F248-11E8-B48F-1D18A9856A87
last_name: Maes
orcid: 0000-0001-9642-1085
- first_name: Huan
full_name: Yang, Huan
last_name: Yang
- first_name: Lian Wang
full_name: Guo, Lian Wang
last_name: Guo
- first_name: Cassandra L.
full_name: Schlamp, Cassandra L.
last_name: Schlamp
- first_name: Heather R.
full_name: Pelzel, Heather R.
last_name: Pelzel
- first_name: Robert W.
full_name: Nickells, Robert W.
last_name: Nickells
citation:
ama: Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic
apoptotic signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology
and Visual Science. 2021;62(10). doi:10.1167/IOVS.62.10.14
apa: Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp,
C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic
signaling in neurons by induced HDAC3 expression. Investigative Ophthalmology
and Visual Science. Association for Research in Vision and Ophthalmology.
https://doi.org/10.1167/IOVS.62.10.14
chicago: Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian
Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased
Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.”
Investigative Ophthalmology and Visual Science. Association for Research
in Vision and Ophthalmology, 2021. https://doi.org/10.1167/IOVS.62.10.14.
ieee: H. M. Schmitt et al., “Increased susceptibility and intrinsic apoptotic
signaling in neurons by induced HDAC3 expression,” Investigative Ophthalmology
and Visual Science, vol. 62, no. 10. Association for Research in Vision and
Ophthalmology, 2021.
ista: Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells
RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons
by induced HDAC3 expression. Investigative Ophthalmology and Visual Science. 62(10),
14.
mla: Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic
Signaling in Neurons by Induced HDAC3 Expression.” Investigative Ophthalmology
and Visual Science, vol. 62, no. 10, 14, Association for Research in Vision
and Ophthalmology, 2021, doi:10.1167/IOVS.62.10.14.
short: H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R.
Pelzel, R.W. Nickells, Investigative Ophthalmology and Visual Science 62 (2021).
date_created: 2021-09-12T22:01:23Z
date_published: 2021-08-16T00:00:00Z
date_updated: 2023-08-14T06:35:17Z
day: '16'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1167/IOVS.62.10.14
external_id:
isi:
- '000695230000014'
pmid:
- '34398198'
file:
- access_level: open_access
checksum: c430967746f653aa1ae84ee617f62b73
content_type: application/pdf
creator: dernst
date_created: 2022-05-13T07:40:15Z
date_updated: 2022-05-13T07:40:15Z
file_id: '11369'
file_name: 2021_IOVS_Schmitt.pdf
file_size: 19707796
relation: main_file
success: 1
file_date_updated: 2022-05-13T07:40:15Z
has_accepted_license: '1'
intvolume: ' 62'
isi: 1
issue: '10'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Investigative Ophthalmology and Visual Science
publication_identifier:
eissn:
- 1552-5783
issn:
- 0146-0404
publication_status: published
publisher: Association for Research in Vision and Ophthalmology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Increased susceptibility and intrinsic apoptotic signaling in neurons by induced
HDAC3 expression
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 62
year: '2021'
...
---
_id: '10002'
abstract:
- lang: eng
text: 'We present a faster symbolic algorithm for the following central problem
in probabilistic verification: Compute the maximal end-component (MEC) decomposition
of Markov decision processes (MDPs). This problem generalizes the SCC decomposition
problem of graphs and closed recurrent sets of Markov chains. The model of symbolic
algorithms is widely used in formal verification and model-checking, where access
to the input model is restricted to only symbolic operations (e.g., basic set
operations and computation of one-step neighborhood). For an input MDP with n vertices
and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition
requires O(n2) symbolic operations and O(1) symbolic space. The only other
symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations
and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound
for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic
operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our
algorithm provides a trade-off between symbolic operations and symbolic space:
for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations
and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques
we present faster algorithms for computing the almost-sure winning regions of ω
-regular objectives for MDPs. We consider the canonical parity objectives for ω
-regular objectives, and for parity objectives with d -priorities we present
an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic
operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .'
acknowledgement: The authors are grateful to the anonymous referees for their valuable
comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF)
through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For
M. H. the research leading to these results has received funding from the European
Research Council under the European Unions Seventh Framework Programme (FP/2007–2013)
/ ERC Grant Agreement no. 340506.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorak, Wolfgang
last_name: Dvorak
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs
for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. Institute of Electrical and Electronics
Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739'
apa: 'Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2021). Symbolic
time and space tradeoffs for probabilistic verification. In Proceedings of
the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13).
Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander
Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.
ieee: K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and
space tradeoffs for probabilistic verification,” in Proceedings of the 36th
Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021,
pp. 1–13.
ista: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space
tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic
Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
Computer Science, Institute of Electrical and Electronics Engineers, 2021,
pp. 1–13, doi:10.1109/LICS52264.2021.9470739.
short: K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the
36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical
and Electronics Engineers, 2021, pp. 1–13.
conference:
end_date: 2021-07-02
location: Rome, Italy
name: 'LICS: Logic in Computer Science'
start_date: 2021-06-29
date_created: 2021-09-12T22:01:24Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2025-07-10T11:15:45Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470739
ec_funded: 1
external_id:
arxiv:
- '2104.07466'
isi:
- '000947350400089'
isi: 1
keyword:
- Computer science
- Computational modeling
- Markov processes
- Probabilistic logic
- Formal verification
- Game Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.07466
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_identifier:
eisbn:
- 978-1-6654-4895-6
isbn:
- 978-1-6654-4896-3
issn:
- 1043-6871
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic time and space tradeoffs for probabilistic verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10004'
abstract:
- lang: eng
text: 'Markov chains are the de facto finite-state model for stochastic dynamical
systems, and Markov decision processes (MDPs) extend Markov chains by incorporating
non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization
criterion is the maximal expected total reward where the MDP stops after T steps,
which can be computed by a simple dynamic programming algorithm. We consider a
natural generalization of the problem where the stopping times can be chosen according
to a probability distribution, such that the expected stopping time is T, to optimize
the expected total reward. Quite surprisingly we establish inter-reducibility
of the expected stopping-time problem for Markov chains with the Positivity problem
(which is related to the well-known Skolem problem), for which establishing either
decidability or undecidability would be a major breakthrough. Given the hardness
of the exact problem, we consider the approximate version of the problem: we show
that it can be solved in exponential time for Markov chains and in exponential
space for MDPs.'
acknowledgement: We are grateful to the anonymous reviewers of LICS 2021 and of a
previous version of this paper for insightful comments that helped improving the
presentation. This research was partially supported by the grant ERC CoG 863818
(ForM-SMArt).
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In:
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595'
apa: 'Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected
stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/LICS52264.2021.9470595'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science, 1–13. Institute of Electrical and Electronics Engineers,
2021. https://doi.org/10.1109/LICS52264.2021.9470595.
ieee: K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,”
in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
Rome, Italy, 2021, pp. 1–13.
ista: 'Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping
time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
LICS: Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science, Institute of Electrical and Electronics Engineers, 2021,
pp. 1–13, doi:10.1109/LICS52264.2021.9470595.
short: K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium
on Logic in Computer Science, Institute of Electrical and Electronics Engineers,
2021, pp. 1–13.
conference:
end_date: 2021-07-02
location: Rome, Italy
name: 'LICS: Logic in Computer Science'
start_date: 2021-06-29
date_created: 2021-09-12T22:01:25Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2025-09-08T14:54:13Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470595
ec_funded: 1
external_id:
arxiv:
- '2104.07278'
isi:
- '000947350400036'
isi: 1
keyword:
- Computer science
- Heuristic algorithms
- Memory management
- Automata
- Markov processes
- Probability distribution
- Complexity theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.07278
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_identifier:
eisbn:
- 978-1-6654-4895-6
isbn:
- 978-1-6654-4896-3
issn:
- 1043-6871
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '18630'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Stochastic processes with expected stopping time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10005'
abstract:
- lang: eng
text: We study systems of nonlinear partial differential equations of parabolic
type, in which the elliptic operator is replaced by the first-order divergence
operator acting on a flux function, which is related to the spatial gradient of
the unknown through an additional implicit equation. This setting, broad enough
in terms of applications, significantly expands the paradigm of nonlinear parabolic
problems. Formulating four conditions concerning the form of the implicit equation,
we first show that these conditions describe a maximal monotone p-coercive graph.
We then establish the global-in-time and large-data existence of a (weak) solution
and its uniqueness. To this end, we adopt and significantly generalize Minty’s
method of monotone mappings. A unified theory, containing several novel tools,
is developed in a way to be tractable from the point of view of numerical approximations.
acknowledgement: "M. Bulíček and J. Málek acknowledge the support of the project No.
18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges
support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583
by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian
Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers
of the Nečas Center for Mathematical Modelling.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Miroslav
full_name: Bulíček, Miroslav
last_name: Bulíček
- first_name: Erika
full_name: Maringová, Erika
id: dbabca31-66eb-11eb-963a-fb9c22c880b4
last_name: Maringová
- first_name: Josef
full_name: Málek, Josef
last_name: Málek
citation:
ama: Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with
implicit constitutive equations involving flux. Mathematical Models and Methods
in Applied Sciences. 2021;31(09). doi:10.1142/S0218202521500457
apa: Bulíček, M., Maringová, E., & Málek, J. (2021). On nonlinear problems of
parabolic type with implicit constitutive equations involving flux. Mathematical
Models and Methods in Applied Sciences. World Scientific Publishing. https://doi.org/10.1142/S0218202521500457
chicago: Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems
of Parabolic Type with Implicit Constitutive Equations Involving Flux.” Mathematical
Models and Methods in Applied Sciences. World Scientific Publishing, 2021.
https://doi.org/10.1142/S0218202521500457.
ieee: M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic
type with implicit constitutive equations involving flux,” Mathematical Models
and Methods in Applied Sciences, vol. 31, no. 09. World Scientific Publishing,
2021.
ista: Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic
type with implicit constitutive equations involving flux. Mathematical Models
and Methods in Applied Sciences. 31(09).
mla: Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit
Constitutive Equations Involving Flux.” Mathematical Models and Methods in
Applied Sciences, vol. 31, no. 09, World Scientific Publishing, 2021, doi:10.1142/S0218202521500457.
short: M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied
Sciences 31 (2021).
date_created: 2021-09-12T22:01:25Z
date_published: 2021-08-25T00:00:00Z
date_updated: 2025-05-14T10:50:14Z
day: '25'
department:
- _id: JuFi
doi: 10.1142/S0218202521500457
external_id:
arxiv:
- '2009.06917'
isi:
- '000722222900004'
intvolume: ' 31'
isi: 1
issue: '09'
keyword:
- Nonlinear parabolic systems
- implicit constitutive theory
- weak solutions
- existence
- uniqueness
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2009.06917
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: Mathematical Models and Methods in Applied Sciences
publication_identifier:
eissn:
- 1793-6314
issn:
- 0218-2025
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: On nonlinear problems of parabolic type with implicit constitutive equations
involving flux
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2021'
...
---
_id: '10023'
abstract:
- lang: eng
text: We study the temporal dissipation of variance and relative entropy for ergodic
Markov Chains in continuous time, and compute explicitly the corresponding dissipation
rates. These are identified, as is well known, in the case of the variance in
terms of an appropriate Hilbertian norm; and in the case of the relative entropy,
in terms of a Dirichlet form which morphs into a version of the familiar Fisher
information under conditions of detailed balance. Here we obtain trajectorial
versions of these results, valid along almost every path of the random motion
and most transparent in the backwards direction of time. Martingale arguments
and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer
and Tschiderer for conservative diffusions. Extensions are developed to general
“convex divergences” and to countable state-spaces. The steepest descent and gradient
flow properties for the variance, the relative entropy, and appropriate generalizations,
are studied along with their respective geometries under conditions of detailed
balance, leading to a very direct proof for the HWI inequality of Otto and Villani
in the present context.
acknowledgement: I.K. acknowledges support from the U.S. National Science Foundation
under Grant NSF-DMS-20-04997. J.M. acknowledges support from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 716117) and from the Austrian Science Fund (FWF) through project
F65. W.S. acknowledges support from the Austrian Science Fund (FWF) under grant
P28861 and by the Vienna Science and Technology Fund (WWTF) through projects MA14-008
and MA16-021.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ioannis
full_name: Karatzas, Ioannis
last_name: Karatzas
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Walter
full_name: Schachermayer, Walter
last_name: Schachermayer
citation:
ama: Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient
flow for the relative entropy in Markov chains. Communications in Information
and Systems. 2021;21(4):481-536. doi:10.4310/CIS.2021.v21.n4.a1
apa: Karatzas, I., Maas, J., & Schachermayer, W. (2021). Trajectorial dissipation
and gradient flow for the relative entropy in Markov chains. Communications
in Information and Systems. International Press. https://doi.org/10.4310/CIS.2021.v21.n4.a1
chicago: Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation
and Gradient Flow for the Relative Entropy in Markov Chains.” Communications
in Information and Systems. International Press, 2021. https://doi.org/10.4310/CIS.2021.v21.n4.a1.
ieee: I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and
gradient flow for the relative entropy in Markov chains,” Communications in
Information and Systems, vol. 21, no. 4. International Press, pp. 481–536,
2021.
ista: Karatzas I, Maas J, Schachermayer W. 2021. Trajectorial dissipation and gradient
flow for the relative entropy in Markov chains. Communications in Information
and Systems. 21(4), 481–536.
mla: Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the
Relative Entropy in Markov Chains.” Communications in Information and Systems,
vol. 21, no. 4, International Press, 2021, pp. 481–536, doi:10.4310/CIS.2021.v21.n4.a1.
short: I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and
Systems 21 (2021) 481–536.
date_created: 2021-09-19T08:53:19Z
date_published: 2021-06-04T00:00:00Z
date_updated: 2025-04-14T07:27:45Z
day: '04'
department:
- _id: JaMa
doi: 10.4310/CIS.2021.v21.n4.a1
ec_funded: 1
external_id:
arxiv:
- '2005.14177'
intvolume: ' 21'
issue: '4'
keyword:
- Markov Chain
- relative entropy
- time reversal
- steepest descent
- gradient flow
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.14177
month: '06'
oa: 1
oa_version: Preprint
page: 481-536
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: Communications in Information and Systems
publication_identifier:
issn:
- 1526-7555
publication_status: published
publisher: International Press
quality_controlled: '1'
status: public
title: Trajectorial dissipation and gradient flow for the relative entropy in Markov
chains
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 21
year: '2021'
...
---
_id: '10024'
abstract:
- lang: eng
text: In this paper, we introduce a random environment for the exclusion process
in obtained by assigning a maximal occupancy to each site. This maximal occupancy
is allowed to randomly vary among sites, and partial exclusion occurs. Under the
assumption of ergodicity under translation and uniform ellipticity of the environment,
we derive a quenched hydrodynamic limit in path space by strengthening the mild
solution approach initiated in Nagy (2002) and Faggionato (2007). To this purpose,
we prove, employing the technology developed for the random conductance model,
a homogenization result in the form of an arbitrary starting point quenched invariance
principle for a single particle in the same environment, which is a result of
independent interest. The self-duality property of the partial exclusion process
allows us to transfer this homogenization result to the particle system and, then,
apply the tightness criterion in Redig et al. (2020).
acknowledgement: The authors would like to thank Marek Biskup and Alberto Chiarini
for useful suggestions and Cristian Giardina, Frank den Hollander and Shubhamoy Nandan for inspiring discussions. S.F. acknowledges Simona Villa for her help in creating the picture. Furthermore,
the authors thank two anonymous referees for the careful reading of the manuscript. S.F.
acknowledges financial support from NWO, The Netherlands via the grant TOP1.17.019.
F.S. acknowledges financial support from NWO via the TOP1 grant 613.001.552 as well as
funding from the European Union’s Horizon 2020 research and innovation programme
under the Marie-Skłodowska-Curie grant agreement No. 754411.
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Simone
full_name: Floreani, Simone
last_name: Floreani
- first_name: Frank
full_name: Redig, Frank
last_name: Redig
- first_name: Federico
full_name: Sau, Federico
id: E1836206-9F16-11E9-8814-AEFDE5697425
last_name: Sau
citation:
ama: Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process
in random environment. Stochastic Processes and their Applications. 2021;142:124-158.
doi:10.1016/j.spa.2021.08.006
apa: Floreani, S., Redig, F., & Sau, F. (2021). Hydrodynamics for the partial
exclusion process in random environment. Stochastic Processes and Their Applications.
Elsevier. https://doi.org/10.1016/j.spa.2021.08.006
chicago: Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the
Partial Exclusion Process in Random Environment.” Stochastic Processes and
Their Applications. Elsevier, 2021. https://doi.org/10.1016/j.spa.2021.08.006.
ieee: S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion
process in random environment,” Stochastic Processes and their Applications,
vol. 142. Elsevier, pp. 124–158, 2021.
ista: Floreani S, Redig F, Sau F. 2021. Hydrodynamics for the partial exclusion
process in random environment. Stochastic Processes and their Applications. 142,
124–158.
mla: Floreani, Simone, et al. “Hydrodynamics for the Partial Exclusion Process in
Random Environment.” Stochastic Processes and Their Applications, vol.
142, Elsevier, 2021, pp. 124–58, doi:10.1016/j.spa.2021.08.006.
short: S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications
142 (2021) 124–158.
date_created: 2021-09-19T22:01:25Z
date_published: 2021-08-27T00:00:00Z
date_updated: 2025-04-14T07:43:46Z
day: '27'
ddc:
- '519'
department:
- _id: JaMa
doi: 10.1016/j.spa.2021.08.006
ec_funded: 1
external_id:
arxiv:
- '1911.12564'
isi:
- '000697748500005'
file:
- access_level: open_access
checksum: 56768c553d7218ee5714902ffec90ec4
content_type: application/pdf
creator: dernst
date_created: 2022-05-13T07:55:50Z
date_updated: 2022-05-13T07:55:50Z
file_id: '11370'
file_name: 2021_StochasticProcessesAppl_Floreani.pdf
file_size: 2115791
relation: main_file
success: 1
file_date_updated: 2022-05-13T07:55:50Z
has_accepted_license: '1'
intvolume: ' 142'
isi: 1
keyword:
- hydrodynamic limit
- random environment
- random conductance model
- arbitrary starting point quenched invariance principle
- duality
- mild solution
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 124-158
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Stochastic Processes and their Applications
publication_identifier:
issn:
- 0304-4149
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hydrodynamics for the partial exclusion process in random environment
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: 142
year: '2021'
...
---
_id: '10025'
abstract:
- lang: eng
text: Ferromagnetism is most common in transition metal compounds but may also arise
in low-density two-dimensional electron systems, with signatures observed in silicon,
III-V semiconductor systems, and graphene moiré heterostructures. Here we show
that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive
the spontaneous ferromagnetic polarization of the electron system into one or
more spin- and valley flavors. Using capacitance measurements on graphite-gated
van der Waals heterostructures, we find a cascade of density- and electronic displacement
field tuned phase transitions marked by negative electronic compressibility. The
transitions define the boundaries between phases where quantum oscillations have
either four-fold, two-fold, or one-fold degeneracy, associated with a spin and
valley degenerate normal metal, spin-polarized `half-metal', and spin and valley
polarized `quarter metal', respectively. For electron doping, the salient features
are well captured by a phenomenological Stoner model with a valley-anisotropic
Hund's coupling, likely arising from interactions at the lattice scale. For hole
filling, we observe a richer phase diagram featuring a delicate interplay of broken
symmetries and transitions in the Fermi surface topology. Finally, by rotational
alignment of a hexagonal boron nitride substrate to induce a moiré superlattice,
we find that the superlattice perturbs the preexisting isospin order only weakly,
leaving the basic phase diagram intact while catalyzing the formation of topologically
nontrivial gapped states whenever itinerant half- or quarter metal states occur
at half- or quarter superlattice band filling. Our results show that rhombohedral
trilayer graphene is an ideal platform for well-controlled tests of many-body
theory and reveal magnetism in moiré materials to be fundamentally itinerant in
nature.
acknowledgement: "The authors acknowledge discussions with A. Macdonald, L. Fu, F.
Wang and M. Zaletel. AFY acknowledges support of the National Science Foundation
under DMR1654186, and the Gordon and Betty Moore Foundation under award GBMF9471.
The authors acknowledge the use of the research facilities within the California
NanoSystems Institute, supported by the University of California, Santa Barbara
and the University of California, Office of the President.\r\nK.W. and T.T. acknowledge
support from the Elemental Strategy Initiative conducted by the MEXT, Japan, Grant
Number JPMXP0112101001 and JSPS KAKENHI, Grant Number JP20H00354. EB and TH were
supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement
No. 817799). A.G. acknowledges support by the European Unions Horizon 2020 research
and innovation program under the Marie Sklodowska-Curie Grant Agreement\r\nNo. 754411.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Haoxin
full_name: Zhou, Haoxin
last_name: Zhou
- first_name: Tian
full_name: Xie, Tian
last_name: Xie
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Tobias
full_name: Holder, Tobias
last_name: Holder
- first_name: James R.
full_name: Ehrets, James R.
last_name: Ehrets
- first_name: Eric M.
full_name: Spanton, Eric M.
last_name: Spanton
- first_name: Takashi
full_name: Taniguchi, Takashi
last_name: Taniguchi
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Erez
full_name: Berg, Erez
last_name: Berg
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Andrea F.
full_name: Young, Andrea F.
last_name: Young
citation:
ama: Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral
trilayer graphene. Nature. 2021. doi:10.1038/s41586-021-03938-w
apa: Zhou, H., Xie, T., Ghazaryan, A., Holder, T., Ehrets, J. R., Spanton, E. M.,
… Young, A. F. (2021). Half and quarter metals in rhombohedral trilayer graphene.
Nature. Springer Nature. https://doi.org/10.1038/s41586-021-03938-w
chicago: Zhou, Haoxin, Tian Xie, Areg Ghazaryan, Tobias Holder, James R. Ehrets,
Eric M. Spanton, Takashi Taniguchi, et al. “Half and Quarter Metals in Rhombohedral
Trilayer Graphene.” Nature. Springer Nature, 2021. https://doi.org/10.1038/s41586-021-03938-w.
ieee: H. Zhou et al., “Half and quarter metals in rhombohedral trilayer graphene,”
Nature. Springer Nature, 2021.
ista: Zhou H, Xie T, Ghazaryan A, Holder T, Ehrets JR, Spanton EM, Taniguchi T,
Watanabe K, Berg E, Serbyn M, Young AF. 2021. Half and quarter metals in rhombohedral
trilayer graphene. Nature.
mla: Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.”
Nature, Springer Nature, 2021, doi:10.1038/s41586-021-03938-w.
short: H. Zhou, T. Xie, A. Ghazaryan, T. Holder, J.R. Ehrets, E.M. Spanton, T. Taniguchi,
K. Watanabe, E. Berg, M. Serbyn, A.F. Young, Nature (2021).
date_created: 2021-09-19T22:01:25Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2025-04-14T07:43:46Z
day: '01'
department:
- _id: MaSe
- _id: MiLe
doi: 10.1038/s41586-021-03938-w
ec_funded: 1
external_id:
arxiv:
- '2104.00653'
isi:
- '000706977400002'
isi: 1
keyword:
- condensed matter - mesoscale and nanoscale physics
- condensed matter - strongly correlated electrons
- multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.00653
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41586-021-04181-z
scopus_import: '1'
status: public
title: Half and quarter metals in rhombohedral trilayer graphene
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10029'
abstract:
- lang: eng
text: Superconductor-semiconductor hybrids are platforms for realizing effective
p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect,
causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and
application of magnetic field can then result in transitions to the normal state,
partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes.
Experimentally probing the hybrid superconductor-semiconductor interface is challenging
due to the shunting effect of the conventional superconductor. Consequently, the
nature of induced pairing remains an open question. Here, we use the circuit quantum
electrodynamics architecture to probe induced superconductivity in a two dimensional
Al-InAs hybrid system. We observe a strong suppression of superfluid density and
enhanced dissipation driven by magnetic field, which cannot be accounted for by
the depairing theory of an s-wave superconductor. These observations are explained
by a picture of independent intraband p±ip superconductors giving way to partial
Bogoliubov Fermi surfaces, and allow for the first characterization of key properties
of the hybrid superconducting system.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: This research was supported by the Scientific Service Units of IST
Austria through resources provided by the MIBA Machine Shop and the nanofabrication
facility. JS and AG were supported by funding from the European Union’s Horizon
2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement
No.754411.
article_number: '2107.03695'
article_processing_charge: No
arxiv: 1
author:
- first_name: Duc T
full_name: Phan, Duc T
id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87
last_name: Phan
- first_name: Jorden L
full_name: Senior, Jorden L
id: 5479D234-2D30-11EA-89CC-40953DDC885E
last_name: Senior
orcid: 0000-0002-0672-9295
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: M.
full_name: Hatefipour, M.
last_name: Hatefipour
- first_name: W. M.
full_name: Strickland, W. M.
last_name: Strickland
- first_name: J.
full_name: Shabani, J.
last_name: Shabani
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in
a superconductor-semiconductor hybrid. arXiv. doi:10.48550/arXiv.2107.03695
apa: Phan, D. T., Senior, J. L., Ghazaryan, A., Hatefipour, M., Strickland, W. M.,
Shabani, J., … Higginbotham, A. P. (n.d.). Breakdown of induced p±ip pairing in
a superconductor-semiconductor hybrid. arXiv. https://doi.org/10.48550/arXiv.2107.03695
chicago: Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland,
J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip
Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2107.03695.
ieee: D. T. Phan et al., “Breakdown of induced p±ip pairing in a superconductor-semiconductor
hybrid,” arXiv. .
ista: Phan DT, Senior JL, Ghazaryan A, Hatefipour M, Strickland WM, Shabani J, Serbyn
M, Higginbotham AP. Breakdown of induced p±ip pairing in a superconductor-semiconductor
hybrid. arXiv, 2107.03695.
mla: Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor
Hybrid.” ArXiv, 2107.03695, doi:10.48550/arXiv.2107.03695.
short: D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J.
Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.).
date_created: 2021-09-21T08:41:02Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2025-04-15T06:54:43Z
day: '08'
department:
- _id: MaSe
- _id: AnHi
- _id: MiLe
doi: 10.48550/arXiv.2107.03695
ec_funded: 1
external_id:
arxiv:
- '2107.03695'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.03695
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: arXiv
publication_status: draft
related_material:
record:
- id: '9636'
relation: research_data
status: public
- id: '10851'
relation: later_version
status: public
status: public
title: Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10033'
abstract:
- lang: eng
text: The ⊗*-monoidal structure on the category of sheaves on the Ran space is not
pro-nilpotent in the sense of [3]. However, under some connectivity assumptions,
we prove that Koszul duality induces an equivalence of categories and that this
equivalence behaves nicely with respect to Verdier duality on the Ran space and
integrating along the Ran space, i.e. taking factorization homology. Based on
ideas sketched in [4], we show that these results also offer a simpler alternative
to one of the two main steps in the proof of the Atiyah-Bott formula given in
[7] and [5].
acknowledgement: 'The author would like to express his gratitude to D. Gaitsgory,
without whose tireless guidance and encouragement in pursuing this problem, this
work would not have been possible. The author is grateful to his advisor B.C. Ngô
for many years of patient guidance and support. This paper is revised while the
author is a postdoc in Hausel group at IST Austria. We thank him and the group for
providing a wonderful research environment. The author also gratefully acknowledges
the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization
Homology,” Austrian Science Fund (FWF): M 2751.'
article_number: '107992'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Quoc P
full_name: Ho, Quoc P
id: 3DD82E3C-F248-11E8-B48F-1D18A9856A87
last_name: Ho
orcid: 0000-0001-6889-1418
citation:
ama: Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances
in Mathematics. 2021;392. doi:10.1016/j.aim.2021.107992
apa: Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul
duality. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2021.107992
chicago: Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul
Duality.” Advances in Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.aim.2021.107992.
ieee: Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,”
Advances in Mathematics, vol. 392. Elsevier, 2021.
ista: Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality.
Advances in Mathematics. 392, 107992.
mla: Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.”
Advances in Mathematics, vol. 392, 107992, Elsevier, 2021, doi:10.1016/j.aim.2021.107992.
short: Q.P. Ho, Advances in Mathematics 392 (2021).
corr_author: '1'
date_created: 2021-09-21T15:58:59Z
date_published: 2021-09-21T00:00:00Z
date_updated: 2025-04-14T09:09:35Z
day: '21'
ddc:
- '514'
department:
- _id: TaHa
doi: 10.1016/j.aim.2021.107992
external_id:
arxiv:
- '1610.00212'
isi:
- '000707040300031'
file:
- access_level: open_access
checksum: f3c0086d41af11db31c00014efb38072
content_type: application/pdf
creator: qho
date_created: 2021-09-21T15:58:52Z
date_updated: 2021-09-21T15:58:52Z
file_id: '10034'
file_name: 1-s2.0-S000187082100431X-main.pdf
file_size: 840635
relation: main_file
file_date_updated: 2021-09-21T15:58:52Z
has_accepted_license: '1'
intvolume: ' 392'
isi: 1
keyword:
- Chiral algebras
- Chiral homology
- Factorization algebras
- Koszul duality
- Ran space
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 26B96266-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02751
name: Algebro-Geometric Applications of Factorization Homology
publication: Advances in Mathematics
publication_identifier:
eissn:
- 1090-2082
issn:
- 0001-8708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Atiyah-Bott formula and connectivity in chiral Koszul duality
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: 392
year: '2021'
...
---
_id: '10051'
abstract:
- lang: eng
text: 'Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein
of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated
Ca2+ channels (CaV), it is considered to be a central organizer of the topography
of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2
knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate
the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs)
with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway
with high release probability. Disruption of RIM-BP2 lowered release probability
altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics
during high-frequency train stimulation indicated a reduction of SVs with high
release probability but an overall normal size of the readily releasable SV pool
(RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion
was slowed. Ultrastructural analysis by superresolution light and electron microscopy
revealed an impaired topography of presynaptic CaV and a reduction of docked and
membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography
of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for
establishing a high initial release probability as required to reliably signal
sound onset information that we found to be degraded in BCs of RIM-BP2-deficient
mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins
(BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach
to the calyceal endbulb of Held synapse that transmits auditory information at
rates of up to hundreds of Hertz with submillisecond precision we demonstrate
a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking
RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+
influx and abundance of the key priming protein Munc13-1, a reduced rate of SV
replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+
channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This
hampers transmission of sound onset information likely affecting downstream neural
computations such as of sound localization.'
acknowledgement: This work was supported by the Deutsche Forschungsgemeinschaft (DFG,
German Research Foundation) through the Collaborative Sensory Research Center 1286
[to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940.
We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance;
G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke
for technical support and discussion regarding in vivo experiments. We also thank
Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing
RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody,
and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the
STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments
on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang
and J. Neef for constant support and scientific discussion.
article_processing_charge: No
article_type: original
author:
- first_name: Tanvi
full_name: Butola, Tanvi
last_name: Butola
- first_name: Theocharis
full_name: Alvanos, Theocharis
last_name: Alvanos
- first_name: Anika
full_name: Hintze, Anika
last_name: Hintze
- first_name: Peter
full_name: Koppensteiner, Peter
id: 3B8B25A8-F248-11E8-B48F-1D18A9856A87
last_name: Koppensteiner
orcid: 0000-0002-3509-1948
- first_name: David
full_name: Kleindienst, David
id: 42E121A4-F248-11E8-B48F-1D18A9856A87
last_name: Kleindienst
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Carolin
full_name: Wichmann, Carolin
last_name: Wichmann
- first_name: Tobias
full_name: Moser, Tobias
last_name: Moser
citation:
ama: Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca21
channel topography and regulates release probability and vesicle replenishment
at a fast central synapse. Journal of Neuroscience. 2021;41(37):7742-7767.
doi:10.1523/JNEUROSCI.0586-21.2021
apa: Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto,
R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca21 channel
topography and regulates release probability and vesicle replenishment at a fast
central synapse. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0586-21.2021
chicago: Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David
Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding
Protein 2 Organizes Ca21 Channel Topography and Regulates Release Probability
and Vesicle Replenishment at a Fast Central Synapse.” Journal of Neuroscience.
Society for Neuroscience, 2021. https://doi.org/10.1523/JNEUROSCI.0586-21.2021.
ieee: T. Butola et al., “RIM-binding protein 2 organizes Ca21
channel topography and regulates release probability and vesicle replenishment
at a fast central synapse,” Journal of Neuroscience, vol. 41, no. 37. Society
for Neuroscience, pp. 7742–7767, 2021.
ista: Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R,
Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca21 channel
topography and regulates release probability and vesicle replenishment at a fast
central synapse. Journal of Neuroscience. 41(37), 7742–7767.
mla: Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca21 Channel
Topography and Regulates Release Probability and Vesicle Replenishment at a Fast
Central Synapse.” Journal of Neuroscience, vol. 41, no. 37, Society for
Neuroscience, 2021, pp. 7742–67, doi:10.1523/JNEUROSCI.0586-21.2021.
short: T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto,
C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.
date_created: 2021-09-27T14:33:13Z
date_published: 2021-09-15T00:00:00Z
date_updated: 2023-08-14T06:56:30Z
day: '15'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1523/JNEUROSCI.0586-21.2021
external_id:
isi:
- '000752287700005'
pmid:
- '34353898'
file:
- access_level: open_access
checksum: 769ab627c7355a50ccfd445e43a5f351
content_type: application/pdf
creator: dernst
date_created: 2022-05-31T09:10:15Z
date_updated: 2022-05-31T09:10:15Z
file_id: '11423'
file_name: 2021_JourNeuroscience_Butola.pdf
file_size: 11571961
relation: main_file
success: 1
file_date_updated: 2022-05-31T09:10:15Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '37'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 7742-7767
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
eissn:
- 1529-2401
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
quality_controlled: '1'
scopus_import: '1'
status: public
title: RIM-binding protein 2 organizes Ca21 channel topography and regulates
release probability and vesicle replenishment at a fast central synapse
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: 41
year: '2021'
...
---
_id: '10052'
abstract:
- lang: eng
text: "A deterministic finite automaton (DFA) \U0001D49C is composite if its language
L(\U0001D49C) can be decomposed into an intersection ⋂_{i = 1}^k L(\U0001D49C_i)
of languages of smaller DFAs. Otherwise, \U0001D49C is prime. This notion of primality
was introduced by Kupferman and Mosheiff in 2013, and while they proved that we
can decide whether a DFA is composite, the precise complexity of this problem
is still open, with a doubly-exponential gap between the upper and lower bounds.
In this work, we focus on permutation DFAs, i.e., those for which the transition
monoid is a group. We provide an NP algorithm to decide whether a permutation
DFA is composite, and show that the difficulty of this problem comes from the
number of non-accepting states of the instance: we give a fixed-parameter tractable
algorithm with the number of rejecting states as the parameter. Moreover, we investigate
the class of commutative permutation DFAs. Their structural properties allow us
to decide compositionality in NL, and even in LOGSPACE if the alphabet size is
fixed. Despite this low complexity, we show that complex behaviors still arise
in this class: we provide a family of composite DFAs each requiring polynomially
many factors with respect to its size. We also consider the variant of the problem
that asks whether a DFA is k-factor composite, that is, decomposable into k smaller
DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation
DFAs, restricting the number of factors makes the decision computationally harder,
and yields a problem with tight bounds: it is NP-complete. Finally, we show that
in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton
alphabet."
acknowledgement: "Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411.
Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM
project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project
FE 560/9-1.\r\n"
alternative_title:
- LIPIcs
article_number: '18'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
- first_name: Petra
full_name: Wolf, Petra
last_name: Wolf
citation:
ama: 'Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd
International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18'
apa: 'Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation
automata. In 32nd International Conference on Concurrency Theory (Vol.
203). Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18'
chicago: Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation
Automata.” In 32nd International Conference on Concurrency Theory, Vol.
203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18.
ieee: I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,”
in 32nd International Conference on Concurrency Theory, Paris, France,
2021, vol. 203.
ista: 'Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd
International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 203, 18.'
mla: Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International
Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
short: I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on
Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
end_date: 2021-08-27
location: Paris, France
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2021-08-23
date_created: 2021-09-27T14:33:14Z
date_published: 2021-08-13T00:00:00Z
date_updated: 2025-05-14T10:55:28Z
day: '13'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2021.18
ec_funded: 1
external_id:
arxiv:
- '2107.04683'
file:
- access_level: open_access
checksum: 4722c81be82265cf45e78adf9db91250
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T11:10:53Z
date_updated: 2021-10-01T11:10:53Z
file_id: '10064'
file_name: 2021_CONCUR_Jecker.pdf
file_size: 1003552
relation: main_file
success: 1
file_date_updated: 2021-10-01T11:10:53Z
has_accepted_license: '1'
intvolume: ' 203'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 32nd International Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-9597-7203-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decomposing permutation automata
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 203
year: '2021'
...
---
_id: '10053'
abstract:
- lang: eng
text: 'This paper characterizes the latency of the simplified successive-cancellation
(SSC) decoding scheme for polar codes under hardware resource constraints. In
particular, when the number of processing elements P that can perform SSC decoding
operations in parallel is limited, as is the case in practice, the latency of
SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code
and μ is the scaling exponent of polar codes for the channel. Three direct consequences
of this bound are presented. First, in a fully-parallel implementation where P=N2
, the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length.
This recovers a result from an earlier work. Second, in a fully-serial implementation
where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative
constant is also calculated: we show that the latency of SSC decoding when P=1
is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the
smallest P that gives the same latency as that of the fully-parallel implementation
is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability
of the foregoing results is validated through extensive simulations.'
acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the
Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei.
M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and
A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104."
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Arman
full_name: Fazeli, Arman
last_name: Fazeli
- first_name: Alexander
full_name: Vardy, Alexander
last_name: Vardy
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism
versus latency in simplified successive-cancellation decoding of polar codes.
In: 2021 IEEE International Symposium on Information Theory. Institute
of Electrical and Electronics Engineers; 2021:2369-2374. doi:10.1109/ISIT45174.2021.9518153'
apa: 'Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith,
A. (2021). Parallelism versus latency in simplified successive-cancellation decoding
of polar codes. In 2021 IEEE International Symposium on Information Theory
(pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/ISIT45174.2021.9518153'
chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John
Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation
Decoding of Polar Codes.” In 2021 IEEE International Symposium on Information
Theory, 2369–74. Institute of Electrical and Electronics Engineers, 2021.
https://doi.org/10.1109/ISIT45174.2021.9518153.
ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith,
“Parallelism versus latency in simplified successive-cancellation decoding of
polar codes,” in 2021 IEEE International Symposium on Information Theory,
Melbourne, Australia, 2021, pp. 2369–2374.
ista: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism
versus latency in simplified successive-cancellation decoding of polar codes.
2021 IEEE International Symposium on Information Theory. ISIT: International Symposium
on Information Theory, 2369–2374.'
mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation
Decoding of Polar Codes.” 2021 IEEE International Symposium on Information
Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–74,
doi:10.1109/ISIT45174.2021.9518153.
short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith,
in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical
and Electronics Engineers, 2021, pp. 2369–2374.
conference:
end_date: 2021-07-20
location: Melbourne, Australia
name: 'ISIT: International Symposium on Information Theory'
start_date: 2021-07-12
date_created: 2021-09-27T14:33:14Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2025-04-15T07:50:11Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT45174.2021.9518153
external_id:
arxiv:
- '2012.13378'
isi:
- '000701502202078'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.13378
month: '09'
oa: 1
oa_version: Preprint
page: 2369-2374
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
eisbn:
- 978-1-5386-8209-8
isbn:
- 978-1-5386-8210-4
issn:
- 2157-8095
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '10364'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Parallelism versus latency in simplified successive-cancellation decoding of
polar codes
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10054'
abstract:
- lang: eng
text: 'Graphs and games on graphs are fundamental models for the analysis of reactive
systems, in particular, for model-checking and the synthesis of reactive systems.
The class of ω-regular languages provides a robust specification formalism for
the desired properties of reactive systems. In the classical infinitary formulation
of the liveness part of an ω-regular specification, a "good" event must happen
eventually without any bound between the good events. A stronger notion of liveness
is bounded liveness, which requires that good events happen within d transitions.
Given a graph or a game graph with n vertices, m edges, and a bounded liveness
objective, the previous best-known algorithmic bounds are as follows: (i) O(dm)
for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs.
Our main contributions improve these long-standing algorithmic bounds. For graphs
we present: (i) a randomized algorithm with one-sided error with running time
O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic
linear-time algorithm for the complement of bounded liveness objectives. For games
on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.'
acknowledgement: 'Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt).
Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE
project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported
by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.'
alternative_title:
- LIPIcs
article_number: '124'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sagar Sudhir
full_name: Kale, Sagar Sudhir
last_name: Kale
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Henzinger M, Kale SS, Svozil A. Faster algorithms for bounded
liveness in graphs and game graphs. In: 48th International Colloquium on Automata,
Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124'
apa: 'Chatterjee, K., Henzinger, M., Kale, S. S., & Svozil, A. (2021). Faster
algorithms for bounded liveness in graphs and game graphs. In 48th International
Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124'
chicago: Chatterjee, Krishnendu, Monika Henzinger, Sagar Sudhir Kale, and Alexander
Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In
48th International Colloquium on Automata, Languages, and Programming,
Vol. 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.
ieee: K. Chatterjee, M. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms
for bounded liveness in graphs and game graphs,” in 48th International Colloquium
on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
ista: 'Chatterjee K, Henzinger M, Kale SS, Svozil A. 2021. Faster algorithms for
bounded liveness in graphs and game graphs. 48th International Colloquium on Automata,
Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs,
vol. 198, 124.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs
and Game Graphs.” 48th International Colloquium on Automata, Languages, and
Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2021, doi:10.4230/LIPIcs.ICALP.2021.124.
short: K. Chatterjee, M. Henzinger, S.S. Kale, A. Svozil, in:, 48th International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021.
conference:
end_date: 2021-07-16
location: Glasgow, Scotland
name: 'ICALP: Automata, Languages and Programming'
start_date: 2021-07-12
corr_author: '1'
date_created: 2021-09-27T14:33:15Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2025-05-14T10:55:19Z
day: '02'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2021.124
ec_funded: 1
file:
- access_level: open_access
checksum: 5a3fed8dbba8c088cbeac1e24cc10bc5
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T08:49:26Z
date_updated: 2021-10-01T08:49:26Z
file_id: '10062'
file_name: 2021_LIPIcs_Chatterjee.pdf
file_size: 854576
relation: main_file
success: 1
file_date_updated: 2021-10-01T08:49:26Z
has_accepted_license: '1'
intvolume: ' 198'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 48th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-195-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for bounded liveness in graphs and game graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 198
year: '2021'
...
---
_id: '10055'
abstract:
- lang: eng
text: "Repeated idempotent elements are commonly used to characterise iterable behaviours
in abstract models of computation. Therefore, given a monoid M, it is natural
to ask how long a sequence of elements of M needs to be to ensure the presence
of consecutive idempotent factors. This question is formalised through the notion
of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to
the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains
k consecutive non-empty factors that correspond to the same idempotent element
of M. In this work, we study the behaviour of the Ramsey function R_M by investigating
the regular \U0001D49F-length of M, defined as the largest size L(M) of a submonoid
of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the
max operation. We show that the regular \U0001D49F-length of M determines the
degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications
of this result, we provide the value of the regular \U0001D49F-length of diverse
monoids. In particular, we prove that the full monoid of n × n Boolean matrices,
which is used to express transition monoids of non-deterministic automata, has
a regular \U0001D49F-length of (n²+n+2)/2."
acknowledgement: This project has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman
for their valuable insights concerning Green’s relations.
alternative_title:
- LIPIcs
article_number: '44'
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
citation:
ama: 'Jecker IR. A Ramsey theorem for finite monoids. In: 38th International
Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44'
apa: 'Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International
Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44'
chicago: Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In 38th International
Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.44.
ieee: I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International
Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany,
2021, vol. 187.
ista: 'Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International
Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
Aspects of Computer Science, LIPIcs, vol. 187, 44.'
mla: Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International
Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
short: I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of
Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
end_date: 2021-03-19
location: Saarbrücken, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2021-03-16
date_created: 2021-09-27T14:33:15Z
date_published: 2021-03-10T00:00:00Z
date_updated: 2025-05-14T10:55:11Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.STACS.2021.44
ec_funded: 1
external_id:
isi:
- '000635691700044'
file:
- access_level: open_access
checksum: 17432a05733f408de300e17e390a90e4
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T09:55:00Z
date_updated: 2021-10-01T09:55:00Z
file_id: '10063'
file_name: 2021_LIPIcs_Jecker.pdf
file_size: 720250
relation: main_file
success: 1
file_date_updated: 2021-10-01T09:55:00Z
has_accepted_license: '1'
intvolume: ' 187'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 38th International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- 978-3-9597-7180-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Ramsey theorem for finite monoids
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 187
year: '2021'
...
---
_id: '10069'
abstract:
- lang: eng
text: 'The extent to which women differ in the course of blood cell counts throughout
pregnancy, and the importance of these changes to pregnancy outcomes has not been
well defined. Here, we develop a series of statistical analyses of repeated measures
data to reveal the degree to which women differ in the course of pregnancy, predict
the changes that occur, and determine the importance of these changes for post-partum
hemorrhage (PPH) which is one of the leading causes of maternal mortality. We
present a prospective cohort of 4082 births recorded at the University Hospital,
Lausanne, Switzerland between 2009 and 2014 where full labour records could be
obtained, along with complete blood count data taken at hospital admission. We
find significant differences, at a [Formula: see text] level, among women in how
blood count values change through pregnancy for mean corpuscular hemoglobin, mean
corpuscular volume, mean platelet volume, platelet count and red cell distribution
width. We find evidence that almost all complete blood count values show trimester-specific
associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53),
high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels
(OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester
3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences
among women in the course of blood cell counts throughout pregnancy have an important
role in shaping pregnancy outcome and tracking blood count value changes through
pregnancy improves identification of women at increased risk of postpartum hemorrhage.
This study provides greater understanding of the complex changes in blood count
values that occur through pregnancy and provides indicators to guide the stratification
of patients into risk groups.'
acknowledgement: This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181),
and by core funding from the Institute of Science and Technology Austria. We would
like to thank the participants of the study and all the midwives and doctors for
the computerized obstetrical data.
article_number: '19238'
article_processing_charge: Yes
article_type: original
author:
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Marion
full_name: Patxot, Marion
last_name: Patxot
- first_name: Miloš
full_name: Stojanov, Miloš
last_name: Stojanov
- first_name: Sabine
full_name: Blum, Sabine
last_name: Blum
- first_name: David
full_name: Baud, David
last_name: Baud
citation:
ama: Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. Postpartum hemorrhage risk
is driven by changes in blood composition through pregnancy. Scientific Reports.
2021;11. doi:10.1038/s41598-021-98411-z
apa: Robinson, M. R., Patxot, M., Stojanov, M., Blum, S., & Baud, D. (2021).
Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy.
Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-98411-z
chicago: Robinson, Matthew Richard, Marion Patxot, Miloš Stojanov, Sabine Blum,
and David Baud. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition
through Pregnancy.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-98411-z.
ieee: M. R. Robinson, M. Patxot, M. Stojanov, S. Blum, and D. Baud, “Postpartum
hemorrhage risk is driven by changes in blood composition through pregnancy,”
Scientific Reports, vol. 11. Springer Nature, 2021.
ista: Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. 2021. Postpartum hemorrhage
risk is driven by changes in blood composition through pregnancy. Scientific Reports.
11, 19238.
mla: Robinson, Matthew Richard, et al. “Postpartum Hemorrhage Risk Is Driven by
Changes in Blood Composition through Pregnancy.” Scientific Reports, vol.
11, 19238, Springer Nature, 2021, doi:10.1038/s41598-021-98411-z.
short: M.R. Robinson, M. Patxot, M. Stojanov, S. Blum, D. Baud, Scientific Reports
11 (2021).
corr_author: '1'
date_created: 2021-10-03T22:01:21Z
date_published: 2021-09-28T00:00:00Z
date_updated: 2024-10-09T21:00:57Z
day: '28'
ddc:
- '618'
department:
- _id: MaRo
doi: 10.1038/s41598-021-98411-z
external_id:
isi:
- '000701575500083'
pmid:
- '34584125'
file:
- access_level: open_access
checksum: f002ec22f609f58e1263b79e7f79601e
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-05T14:56:48Z
date_updated: 2021-10-05T14:56:48Z
file_id: '10091'
file_name: 2021_ScientificReports_Robinson.pdf
file_size: 6970368
relation: main_file
success: 1
file_date_updated: 2021-10-05T14:56:48Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Scientific Reports
publication_identifier:
eissn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Postpartum hemorrhage risk is driven by changes in blood composition through
pregnancy
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: 11
year: '2021'
...