---
_id: '18230'
abstract:
- lang: eng
text: 'A variety of complex systems, including social and communication networks,
financial markets, biology, and neuroscience are modeled using temporal graphs
that contain a set of nodes and directed timestamped edges. Temporal motifs in
temporal graphs are generalized from subgraph patterns in static graphs in that
they also account for edge ordering and time duration, in addition to the graph
structure. Mining temporal motifs is a fundamental problem used in several application
domains. However, existing software frameworks offer suboptimal performance due
to high algorithmic complexity and irregular memory accesses of temporal motif
mining.This paper presents Mint—a novel accelerator architecture and a programming
model for mining temporal motifs efficiently. We first divide this workload into
three fundamental tasks: search, book-keeping, and backtracking. Based on this,
we propose a task-centric programming model that enables decoupled, asynchronous
execution. This model unlocks massive opportunities for parallelism, and allows
storing task context information on-chip. To best utilize the proposed programming
model, we design a domain-specific hardware accelerator using its data path and
memory subsystem design to cater to the unique workload characteristics of temporal
motif mining. To further improve performance, we propose a novel optimization
called search index memoization that significantly reduces memory traffic. We
comprehensively compare the performance of Mint with state-of-the-art temporal
motif mining software frameworks (both approximate and exact) running on both
CPU and GPU, and show 9×−2576× benefit in performance.'
article_processing_charge: No
author:
- first_name: Nishil
full_name: Talati, Nishil
last_name: Talati
- first_name: Haojie
full_name: Ye, Haojie
last_name: Ye
- first_name: Sanketh
full_name: Vedula, Sanketh
last_name: Vedula
- first_name: Kuan-Yu
full_name: Chen, Kuan-Yu
last_name: Chen
- first_name: Yuhan
full_name: Chen, Yuhan
last_name: Chen
- first_name: Daniel
full_name: Liu, Daniel
last_name: Liu
- first_name: Yichao
full_name: Yuan, Yichao
last_name: Yuan
- first_name: David
full_name: Blaauw, David
last_name: Blaauw
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Trevor
full_name: Mudge, Trevor
last_name: Mudge
- first_name: Ronald
full_name: Dreslinski, Ronald
last_name: Dreslinski
citation:
ama: 'Talati N, Ye H, Vedula S, et al. Mint: An accelerator for mining temporal
motifs. In: 55th IEEE/ACM International Symposium on Microarchitecture.
Institute of Electrical and Electronics Engineers; 2022. doi:10.1109/micro56248.2022.00089'
apa: 'Talati, N., Ye, H., Vedula, S., Chen, K.-Y., Chen, Y., Liu, D., … Dreslinski,
R. (2022). Mint: An accelerator for mining temporal motifs. In 55th IEEE/ACM
International Symposium on Microarchitecture. Chicago, IL, United States:
Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/micro56248.2022.00089'
chicago: 'Talati, Nishil, Haojie Ye, Sanketh Vedula, Kuan-Yu Chen, Yuhan Chen, Daniel
Liu, Yichao Yuan, et al. “Mint: An Accelerator for Mining Temporal Motifs.” In
55th IEEE/ACM International Symposium on Microarchitecture. Institute of
Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/micro56248.2022.00089.'
ieee: 'N. Talati et al., “Mint: An accelerator for mining temporal motifs,”
in 55th IEEE/ACM International Symposium on Microarchitecture, Chicago,
IL, United States, 2022.'
ista: 'Talati N, Ye H, Vedula S, Chen K-Y, Chen Y, Liu D, Yuan Y, Blaauw D, Bronstein
AM, Mudge T, Dreslinski R. 2022. Mint: An accelerator for mining temporal motifs.
55th IEEE/ACM International Symposium on Microarchitecture. MICRO: Symposium on
Microarchitecture.'
mla: 'Talati, Nishil, et al. “Mint: An Accelerator for Mining Temporal Motifs.”
55th IEEE/ACM International Symposium on Microarchitecture, Institute of
Electrical and Electronics Engineers, 2022, doi:10.1109/micro56248.2022.00089.'
short: N. Talati, H. Ye, S. Vedula, K.-Y. Chen, Y. Chen, D. Liu, Y. Yuan, D. Blaauw,
A.M. Bronstein, T. Mudge, R. Dreslinski, in:, 55th IEEE/ACM International Symposium
on Microarchitecture, Institute of Electrical and Electronics Engineers, 2022.
conference:
end_date: 2022-10-05
location: Chicago, IL, United States
name: 'MICRO: Symposium on Microarchitecture'
start_date: 2022-10-01
date_created: 2024-10-08T12:56:03Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2024-10-15T07:14:02Z
day: '01'
doi: 10.1109/micro56248.2022.00089
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
publication: 55th IEEE/ACM International Symposium on Microarchitecture
publication_identifier:
eisbn:
- '9781665462723'
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mint: An accelerator for mining temporal motifs'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '18231'
abstract:
- lang: eng
text: 'The success of learning with noisy labels (LNL) methods relies heavily on
the success of a warm-up stage where standard supervised training is performed
using the full (noisy) training set. In this paper, we identify a "warm-up obstacle":
the inability of standard warm-up stages to train high quality feature extractors
and avert memorization of noisy labels. We propose "Contrast to Divide" (C2D),
a simple framework that solves this problem by pre-training the feature extractor
in a self-supervised fashion. Using self-supervised pre-training boosts the performance
of existing LNL approaches by drastically reducing the warm-up stage''s susceptibility
to noise level, shortening its duration, and improving extracted feature quality.
C2D works out of the box with existing methods and demonstrates markedly improved
performance, especially in the high noise regime, where we get a boost of more
than 27% for CIFAR-100 with 90% noise over the previous state of the art. In real-life
noise settings, C2D trained on mini-WebVision outperforms previous works both
in WebVision and ImageNet validation sets by 3% top-1 accuracy. We perform an
in-depth analysis of the framework, including investigating the performance of
different pre-training approaches and estimating the effective upper bound of
the LNL performance with semi-supervised learning. Code for reproducing our experiments
is available at https://github.com/ContrastToDivide/C2D.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Evgenii
full_name: Zheltonozhskii, Evgenii
last_name: Zheltonozhskii
- first_name: Chaim
full_name: Baskin, Chaim
last_name: Baskin
- first_name: Avi
full_name: Mendelson, Avi
last_name: Mendelson
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Or
full_name: Litany, Or
last_name: Litany
citation:
ama: 'Zheltonozhskii E, Baskin C, Mendelson A, Bronstein AM, Litany O. Contrast
to divide: Self-supervised pre-training for learning with noisy labels. In: IEEE/CVF
Winter Conference on Applications of Computer Vision. Institute of Electrical
and Electronics Engineers; 2022:387-397. doi:10.1109/wacv51458.2022.00046'
apa: 'Zheltonozhskii, E., Baskin, C., Mendelson, A., Bronstein, A. M., & Litany,
O. (2022). Contrast to divide: Self-supervised pre-training for learning with
noisy labels. In IEEE/CVF Winter Conference on Applications of Computer Vision
(pp. 387–397). Waikoloa, HI, United States: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/wacv51458.2022.00046'
chicago: 'Zheltonozhskii, Evgenii, Chaim Baskin, Avi Mendelson, Alex M. Bronstein,
and Or Litany. “Contrast to Divide: Self-Supervised Pre-Training for Learning
with Noisy Labels.” In IEEE/CVF Winter Conference on Applications of Computer
Vision, 387–97. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/wacv51458.2022.00046.'
ieee: 'E. Zheltonozhskii, C. Baskin, A. Mendelson, A. M. Bronstein, and O. Litany,
“Contrast to divide: Self-supervised pre-training for learning with noisy labels,”
in IEEE/CVF Winter Conference on Applications of Computer Vision, Waikoloa,
HI, United States, 2022, pp. 387–397.'
ista: 'Zheltonozhskii E, Baskin C, Mendelson A, Bronstein AM, Litany O. 2022. Contrast
to divide: Self-supervised pre-training for learning with noisy labels. IEEE/CVF
Winter Conference on Applications of Computer Vision. WACV: Winter Conference
on Applications of Computer Vision, 387–397.'
mla: 'Zheltonozhskii, Evgenii, et al. “Contrast to Divide: Self-Supervised Pre-Training
for Learning with Noisy Labels.” IEEE/CVF Winter Conference on Applications
of Computer Vision, Institute of Electrical and Electronics Engineers, 2022,
pp. 387–97, doi:10.1109/wacv51458.2022.00046.'
short: E. Zheltonozhskii, C. Baskin, A. Mendelson, A.M. Bronstein, O. Litany, in:,
IEEE/CVF Winter Conference on Applications of Computer Vision, Institute of Electrical
and Electronics Engineers, 2022, pp. 387–397.
conference:
end_date: 2022-01-08
location: Waikoloa, HI, United States
name: 'WACV: Winter Conference on Applications of Computer Vision'
start_date: 2022-01-03
date_created: 2024-10-08T12:56:20Z
date_published: 2022-02-15T00:00:00Z
date_updated: 2024-10-15T07:27:12Z
day: '15'
doi: 10.1109/wacv51458.2022.00046
extern: '1'
external_id:
arxiv:
- '2103.13646'
language:
- iso: eng
month: '02'
oa_version: Preprint
page: 387-397
publication: IEEE/CVF Winter Conference on Applications of Computer Vision
publication_identifier:
eisbn:
- '9781665409155'
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/ContrastToDivide/C2D
scopus_import: '1'
status: public
title: 'Contrast to divide: Self-supervised pre-training for learning with noisy labels'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '18232'
abstract:
- lang: eng
text: Cross-modal retrieval aims to retrieve related items across different modalities,
for example, using an image query to retrieve related text. The existing deep
methods ignore both the intra-modal and inter-modal intra-class low-rank structures
when fusing various modalities, which decreases the retrieval performance. In
this paper, two deep models (denoted as ILCMR and Semi-ILCMR) based on intra-class
low-rank regularization are proposed for supervised and semi-supervised cross-modal
retrieval, respectively. Specifically, ILCMR integrates the image network and
text network into a unified framework to learn a common feature space by imposing
three regularization terms to fuse the cross-modal data. First, to align them
in the label space, we utilize semantic consistency regularization to convert
the data representations to probability distributions over the classes. Second,
we introduce an intra-modal low-rank regularization, which encourages the intra-class
samples that originate from the same space to be more relevant in the common feature
space. Third, an inter-modal low-rank regularization is applied to reduce the
cross-modal discrepancy. To enable the low-rank regularization to be optimized
using automatic gradients during network back-propagation, we propose the rank-r
approximation and specify the explicit gradients for theoretical completeness.
In addition to the three regularization terms that rely on label information incorporated
by ILCMR, we propose Semi-ILCMR in the semi-supervised regime, which introduces
a low-rank constraint before projecting the general representations into the common
feature space. Extensive experiments on four public cross-modal datasets demonstrate
the superiority of ILCMR and Semi-ILCMR over other state-of-the-art methods.
article_processing_charge: No
article_type: original
author:
- first_name: Peipei
full_name: Kang, Peipei
last_name: Kang
- first_name: Zehang
full_name: Lin, Zehang
last_name: Lin
- first_name: Zhenguo
full_name: Yang, Zhenguo
last_name: Yang
- first_name: Xiaozhao
full_name: Fang, Xiaozhao
last_name: Fang
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Qing
full_name: Li, Qing
last_name: Li
- first_name: Wenyin
full_name: Liu, Wenyin
last_name: Liu
citation:
ama: Kang P, Lin Z, Yang Z, et al. Intra-class low-rank regularization for supervised
and semi-supervised cross-modal retrieval. Applied Intelligence. 2022;52:33-54.
doi:10.1007/s10489-021-02308-3
apa: Kang, P., Lin, Z., Yang, Z., Fang, X., Bronstein, A. M., Li, Q., & Liu,
W. (2022). Intra-class low-rank regularization for supervised and semi-supervised
cross-modal retrieval. Applied Intelligence. Springer Nature. https://doi.org/10.1007/s10489-021-02308-3
chicago: Kang, Peipei, Zehang Lin, Zhenguo Yang, Xiaozhao Fang, Alex M. Bronstein,
Qing Li, and Wenyin Liu. “Intra-Class Low-Rank Regularization for Supervised and
Semi-Supervised Cross-Modal Retrieval.” Applied Intelligence. Springer
Nature, 2022. https://doi.org/10.1007/s10489-021-02308-3.
ieee: P. Kang et al., “Intra-class low-rank regularization for supervised
and semi-supervised cross-modal retrieval,” Applied Intelligence, vol.
52. Springer Nature, pp. 33–54, 2022.
ista: Kang P, Lin Z, Yang Z, Fang X, Bronstein AM, Li Q, Liu W. 2022. Intra-class
low-rank regularization for supervised and semi-supervised cross-modal retrieval.
Applied Intelligence. 52, 33–54.
mla: Kang, Peipei, et al. “Intra-Class Low-Rank Regularization for Supervised and
Semi-Supervised Cross-Modal Retrieval.” Applied Intelligence, vol. 52,
Springer Nature, 2022, pp. 33–54, doi:10.1007/s10489-021-02308-3.
short: P. Kang, Z. Lin, Z. Yang, X. Fang, A.M. Bronstein, Q. Li, W. Liu, Applied
Intelligence 52 (2022) 33–54.
date_created: 2024-10-08T12:56:38Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2024-10-15T07:30:00Z
day: '01'
doi: 10.1007/s10489-021-02308-3
extern: '1'
intvolume: ' 52'
language:
- iso: eng
month: '01'
oa_version: None
page: 33-54
publication: Applied Intelligence
publication_identifier:
eissn:
- 1573-7497
issn:
- 0924-669X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intra-class low-rank regularization for supervised and semi-supervised cross-modal
retrieval
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2022'
...
---
_id: '18291'
article_processing_charge: No
author:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
citation:
ama: "Katsaros G, Jirovec D. Dynamics of Hole Singlet-Triplet Qubits with Large
\U0001D454-Factor Differences. 2022. doi:10.15479/AT:ISTA:18291"
apa: "Katsaros, G., & Jirovec, D. (2022). Dynamics of Hole Singlet-Triplet Qubits
with Large \U0001D454-Factor Differences. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:18291"
chicago: "Katsaros, Georgios, and Daniel Jirovec. “Dynamics of Hole Singlet-Triplet
Qubits with Large \U0001D454-Factor Differences.” Institute of Science and Technology
Austria, 2022. https://doi.org/10.15479/AT:ISTA:18291."
ieee: "G. Katsaros and D. Jirovec, “Dynamics of Hole Singlet-Triplet Qubits with
Large \U0001D454-Factor Differences.” Institute of Science and Technology Austria,
2022."
ista: "Katsaros G, Jirovec D. 2022. Dynamics of Hole Singlet-Triplet Qubits with
Large \U0001D454-Factor Differences, Institute of Science and Technology Austria,
10.15479/AT:ISTA:18291."
mla: "Katsaros, Georgios, and Daniel Jirovec. Dynamics of Hole Singlet-Triplet
Qubits with Large \U0001D454-Factor Differences. Institute of Science and
Technology Austria, 2022, doi:10.15479/AT:ISTA:18291."
short: G. Katsaros, D. Jirovec, (2022).
corr_author: '1'
date_created: 2024-10-09T19:35:03Z
date_published: 2022-03-01T00:00:00Z
date_updated: 2025-04-15T07:15:24Z
day: '01'
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:18291
file:
- access_level: open_access
checksum: 3128dffbd09267b93c2d0b1425fd3ba2
content_type: application/x-zip-compressed
creator: gkatsaro
date_created: 2024-10-09T19:31:35Z
date_updated: 2024-10-09T19:31:35Z
file_id: '18292'
file_name: SOIPaper.zip
file_size: 25566516
relation: main_file
success: 1
- access_level: open_access
checksum: df077d2f4652afeb3bf100068e88aa48
content_type: text/plain
creator: gkatsaro
date_created: 2024-10-14T18:11:45Z
date_updated: 2024-10-14T18:11:45Z
file_id: '18442'
file_name: Readme.txt
file_size: 6776
relation: main_file
success: 1
file_date_updated: 2024-10-14T18:11:45Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: None
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10920'
relation: research_paper
status: public
status: public
title: "Dynamics of Hole Singlet-Triplet Qubits with Large \U0001D454-Factor Differences"
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: research_data
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2022'
...
---
OA_place: repository
_id: '18293'
abstract:
- lang: eng
text: Given a non-singular diagonal cubic hypersurface X⊂Pn−1 over Fq(t) with char(Fq)≠3,
we show that the number of rational points of height at most |P| is O(|P|3+ε)
for n=6 and O(|P|2+ε) for n=4. In fact, if n=4 and char(Fq)>3 we prove that the
number of rational points away from any rational line contained in X is bounded
by O(|P|3/2+ε). From the result in 6 variables we deduce weak approximation for
diagonal cubic hypersurfaces for n≥7 over Fq(t) when char(Fq)>3 and handle Waring's
problem for cubes in 7 variables over Fq(t) when char(Fq)≠3. Our results answer
a question of Davenport regarding the number of solutions of bounded height to
x31+x32+x33=x34+x35+x36 with xi∈Fq[t].
article_number: '2208.05422'
article_processing_charge: No
arxiv: 1
author:
- first_name: Jakob
full_name: Glas, Jakob
id: d6423cba-dc74-11ea-a0a7-ee61689ff5fb
last_name: Glas
- first_name: Leonhard
full_name: Hochfilzer, Leonhard
last_name: Hochfilzer
citation:
ama: Glas J, Hochfilzer L. On a question of Davenport and diagonal cubic forms over
Fq(t). arXiv. doi:10.48550/arXiv.2208.05422
apa: Glas, J., & Hochfilzer, L. (n.d.). On a question of Davenport and diagonal
cubic forms over Fq(t). arXiv. https://doi.org/10.48550/arXiv.2208.05422
chicago: Glas, Jakob, and Leonhard Hochfilzer. “On a Question of Davenport and Diagonal
Cubic Forms over Fq(T).” ArXiv, n.d. https://doi.org/10.48550/arXiv.2208.05422.
ieee: J. Glas and L. Hochfilzer, “On a question of Davenport and diagonal cubic
forms over Fq(t),” arXiv. .
ista: Glas J, Hochfilzer L. On a question of Davenport and diagonal cubic forms
over Fq(t). arXiv, 2208.05422.
mla: Glas, Jakob, and Leonhard Hochfilzer. “On a Question of Davenport and Diagonal
Cubic Forms over Fq(T).” ArXiv, 2208.05422, doi:10.48550/arXiv.2208.05422.
short: J. Glas, L. Hochfilzer, ArXiv (n.d.).
corr_author: '1'
date_created: 2024-10-10T12:46:41Z
date_published: 2022-08-10T00:00:00Z
date_updated: 2026-04-07T12:53:53Z
day: '10'
department:
- _id: TiBr
doi: 10.48550/arXiv.2208.05422
external_id:
arxiv:
- '2208.05422'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2208.05422
month: '08'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '18705'
relation: later_version
status: public
- id: '18132'
relation: dissertation_contains
status: public
status: public
title: On a question of Davenport and diagonal cubic forms over Fq(t)
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '7791'
abstract:
- lang: eng
text: Extending a result of Milena Radnovic and Serge Tabachnikov, we establish
conditionsfor two different non-symmetric norms to define the same billiard reflection
law.
acknowledgement: AA was supported by European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818
Alpha). RK was supported by the Federal professorship program Grant 1.456.2016/1.4
and the Russian Foundation for Basic Research Grants 18-01-00036 and 19-01-00169.
Open access funding provided by Institute of Science and Technology (IST Austria).
The authors thank Alexey Balitskiy, Milena Radnović, and Serge Tabachnikov for useful
discussions.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Karasev R. When different norms lead to same billiard trajectories?
European Journal of Mathematics. 2022;8(4):1309-1312. doi:10.1007/s40879-020-00405-0
apa: Akopyan, A., & Karasev, R. (2022). When different norms lead to same billiard
trajectories? European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00405-0
chicago: Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same
Billiard Trajectories?” European Journal of Mathematics. Springer Nature,
2022. https://doi.org/10.1007/s40879-020-00405-0.
ieee: A. Akopyan and R. Karasev, “When different norms lead to same billiard trajectories?,”
European Journal of Mathematics, vol. 8, no. 4. Springer Nature, pp. 1309–1312,
2022.
ista: Akopyan A, Karasev R. 2022. When different norms lead to same billiard trajectories?
European Journal of Mathematics. 8(4), 1309–1312.
mla: Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard
Trajectories?” European Journal of Mathematics, vol. 8, no. 4, Springer
Nature, 2022, pp. 1309–12, doi:10.1007/s40879-020-00405-0.
short: A. Akopyan, R. Karasev, European Journal of Mathematics 8 (2022) 1309–1312.
corr_author: '1'
date_created: 2020-05-03T22:00:48Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T07:48:36Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s40879-020-00405-0
ec_funded: 1
external_id:
arxiv:
- '1912.12685'
file:
- access_level: open_access
checksum: f53e71fd03744075adcd0b8fc1b8423d
content_type: application/pdf
creator: dernst
date_created: 2020-05-04T10:33:42Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7796'
file_name: 2020_EuropMathematics_Akopyan.pdf
file_size: 263926
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1309 - 1312
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: When different norms lead to same billiard trajectories?
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2022'
...
---
_id: '8286'
abstract:
- lang: eng
text: "We consider the following dynamic load-balancing process: given an underlying
graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed
at a randomly chosen graph node. In the same step, the chosen node picks a random
neighbor, and the two nodes balance their loads by averaging them. We are interested
in the expected gap between the minimum and maximum loads at nodes as the process
progresses, and its dependence on n and on the graph structure. Variants of the
above graphical balanced allocation process have been studied previously by Peres,
Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and
Sun, 2015]. These authors left as open the question of characterizing the gap
in the case of cycle graphs in the dynamic case, where weights are created during
the algorithm’s execution. For this case, the only known upper bound is of \U0001D4AA(n
log n), following from a majorization argument due to [Peres et al., 2015], which
analyzes a related graphical allocation process. In this paper, we provide an
upper bound of \U0001D4AA (√n log n) on the expected gap of the above process
for cycles of length n. We introduce a new potential analysis technique, which
enables us to bound the difference in load between k-hop neighbors on the cycle,
for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds
the maximum value of the gap by bounding its value across all possible subsets
of a certain structure, and recursively bounding the gaps within each subset.
We provide analytical and experimental evidence that our upper bound on the gap
is tight up to a logarithmic factor. "
acknowledgement: The authors sincerely thank Thomas Sauerwald and George Giakkoupis
for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for
feedback on earlier versions of this draft. We also thank the ICALP anonymous reviewers
for their very useful comments. Open access funding provided by Institute of Science
and Technology (IST Austria). Funding was provided by European Research Council
(Grant No. PR1042ERC01).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Amirmojtaba
full_name: Sabour, Amirmojtaba
id: bcc145fd-e77f-11ea-ae8b-80d661dbff67
last_name: Sabour
citation:
ama: Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles.
Algorithmica. 2022;84(4):1007-1029. doi:10.1007/s00453-021-00905-9
apa: 'Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2022). Dynamic averaging
load balancing on cycles. Algorithmica. Virtual, Online; Germany: Springer
Nature. https://doi.org/10.1007/s00453-021-00905-9'
chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic
Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2022.
https://doi.org/10.1007/s00453-021-00905-9.
ieee: D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing
on cycles,” Algorithmica, vol. 84, no. 4. Springer Nature, pp. 1007–1029,
2022.
ista: Alistarh D-A, Nadiradze G, Sabour A. 2022. Dynamic averaging load balancing
on cycles. Algorithmica. 84(4), 1007–1029.
mla: Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”
Algorithmica, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:10.1007/s00453-021-00905-9.
short: D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica 84 (2022) 1007–1029.
conference:
end_date: 2020-07-11
location: Virtual, Online; Germany
name: 'ICALP: Automata, Languages and Programming'
start_date: 2020-07-08
date_created: 2020-08-24T06:24:04Z
date_published: 2022-04-01T00:00:00Z
date_updated: 2025-07-10T11:55:11Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00453-021-00905-9
ec_funded: 1
external_id:
arxiv:
- '2003.09297'
isi:
- '000734004600001'
file:
- access_level: open_access
checksum: 21169b25b0c8e17b21e12af22bff9870
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-27T10:36:40Z
date_updated: 2021-12-27T10:36:40Z
file_id: '10577'
file_name: 2021_Algorithmica_Alistarh.pdf
file_size: 525950
relation: main_file
success: 1
file_date_updated: 2021-12-27T10:36:40Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1007-1029
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://doi.org/10.4230/LIPIcs.ICALP.2020.7
record:
- id: '15077'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic averaging load balancing on cycles
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2022'
...
---
_id: '8538'
abstract:
- lang: eng
text: We prove some recent experimental observations of Dan Reznik concerning periodic
billiard orbits in ellipses. For example, the sum of cosines of the angles of
a periodic billiard polygon remains constant in the 1-parameter family of such
polygons (that exist due to the Poncelet porism). In our proofs, we use geometric
and complex analytic methods.
acknowledgement: " This paper would not be written if not for Dan Reznik’s curiosity
and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller
for interesting discussions. It is a pleasure to thank the Mathematical Institute
of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy
for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality.
AA was supported by European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported
by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR
191."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Richard
full_name: Schwartz, Richard
last_name: Schwartz
- first_name: Serge
full_name: Tabachnikov, Serge
last_name: Tabachnikov
citation:
ama: Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European
Journal of Mathematics. 2022;8(4):1313-1327. doi:10.1007/s40879-020-00426-9
apa: Akopyan, A., Schwartz, R., & Tabachnikov, S. (2022). Billiards in ellipses
revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9
chicago: Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in
Ellipses Revisited.” European Journal of Mathematics. Springer Nature,
2022. https://doi.org/10.1007/s40879-020-00426-9.
ieee: A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,”
European Journal of Mathematics, vol. 8, no. 4. Springer Nature, pp. 1313–1327,
2022.
ista: Akopyan A, Schwartz R, Tabachnikov S. 2022. Billiards in ellipses revisited.
European Journal of Mathematics. 8(4), 1313–1327.
mla: Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal
of Mathematics, vol. 8, no. 4, Springer Nature, 2022, pp. 1313–27, doi:10.1007/s40879-020-00426-9.
short: A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics
8 (2022) 1313–1327.
date_created: 2020-09-20T22:01:38Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T07:48:34Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s40879-020-00426-9
ec_funded: 1
external_id:
arxiv:
- '2001.02934'
intvolume: ' 8'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2001.02934
month: '12'
oa: 1
oa_version: Preprint
page: 1313-1327
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Billiards in ellipses revisited
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2022'
...
---
_id: '9199'
abstract:
- lang: eng
text: "We associate a certain tensor product lattice to any primitive integer lattice
and ask about its typical shape. These lattices are related to the tangent bundle
of Grassmannians and their study is motivated by Peyre's programme on \"freeness\"
for rational points of bounded height on Fano\r\nvarieties."
acknowledgement: The authors are very grateful to Will Sawin for useful remarks about
this topic. While working on this paper the first two authors were supported by
EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Tal
full_name: Horesh, Tal
id: C8B7BF48-8D81-11E9-BCA9-F536E6697425
last_name: Horesh
- first_name: Florian Alexander
full_name: Wilsch, Florian Alexander
id: 560601DA-8D36-11E9-A136-7AC1E5697425
last_name: Wilsch
orcid: 0000-0001-7302-8256
citation:
ama: Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians.
Algebra & Number Theory. 2022;16(10):2385-2407. doi:10.2140/ant.2022.16.2385
apa: Browning, T. D., Horesh, T., & Wilsch, F. A. (2022). Equidistribution and
freeness on Grassmannians. Algebra & Number Theory. Mathematical Sciences
Publishers. https://doi.org/10.2140/ant.2022.16.2385
chicago: Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution
and Freeness on Grassmannians.” Algebra & Number Theory. Mathematical
Sciences Publishers, 2022. https://doi.org/10.2140/ant.2022.16.2385.
ieee: T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness
on Grassmannians,” Algebra & Number Theory, vol. 16, no. 10. Mathematical
Sciences Publishers, pp. 2385–2407, 2022.
ista: Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians.
Algebra & Number Theory. 16(10), 2385–2407.
mla: Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.”
Algebra & Number Theory, vol. 16, no. 10, Mathematical Sciences Publishers,
2022, pp. 2385–407, doi:10.2140/ant.2022.16.2385.
short: T.D. Browning, T. Horesh, F.A. Wilsch, Algebra & Number Theory 16 (2022)
2385–2407.
corr_author: '1'
date_created: 2021-02-25T09:56:57Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T09:25:44Z
day: '01'
department:
- _id: TiBr
doi: 10.2140/ant.2022.16.2385
external_id:
arxiv:
- '2102.11552'
isi:
- '000961514100004'
intvolume: ' 16'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.11552
month: '12'
oa: 1
oa_version: Preprint
page: 2385-2407
project:
- _id: 26A8D266-B435-11E9-9278-68D0E5697425
grant_number: EP-P026710-2
name: Between rational and integral points
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P32428
name: New frontiers of the Manin conjecture
publication: Algebra & Number Theory
publication_identifier:
eissn:
- 1944-7833
issn:
- 1937-0652
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Equidistribution and freeness on Grassmannians
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 16
year: '2022'
...
---
_id: '9311'
abstract:
- lang: eng
text: 'Partially observable Markov decision processes (POMDPs) are standard models
for dynamic systems with probabilistic and nondeterministic behaviour in uncertain
environments. We prove that in POMDPs with long-run average objective, the decision
maker has approximately optimal strategies with finite memory. This implies notably
that approximating the long-run value is recursively enumerable, as well as a
weak continuity property of the value with respect to the transition function. '
acknowledgement: "Partially supported by Austrian Science Fund (FWF) NFN Grant No
RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT
through grant C15E03.\r\n"
article_processing_charge: No
article_type: original
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: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Bruno
full_name: Ziliotto, Bruno
last_name: Ziliotto
citation:
ama: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs
with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119.
doi:10.1287/moor.2020.1116
apa: Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory
strategies in POMDPs with long-run average objectives. Mathematics of Operations
Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116
chicago: Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto.
“Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics
of Operations Research. Institute for Operations Research and the Management
Sciences, 2022. https://doi.org/10.1287/moor.2020.1116.
ieee: K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies
in POMDPs with long-run average objectives,” Mathematics of Operations Research,
vol. 47, no. 1. Institute for Operations Research and the Management Sciences,
pp. 100–119, 2022.
ista: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies
in POMDPs with long-run average objectives. Mathematics of Operations Research.
47(1), 100–119.
mla: Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run
Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1,
Institute for Operations Research and the Management Sciences, 2022, pp. 100–19,
doi:10.1287/moor.2020.1116.
short: K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations
Research 47 (2022) 100–119.
date_created: 2021-04-08T09:33:31Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2026-04-07T12:31:21Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1287/moor.2020.1116
external_id:
arxiv:
- '1904.13360'
isi:
- '000731918100001'
intvolume: ' 47'
isi: 1
issue: '1'
keyword:
- Management Science and Operations Research
- General Mathematics
- Computer Science Applications
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.13360
month: '02'
oa: 1
oa_version: Preprint
page: 100-119
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Mathematics of Operations Research
publication_identifier:
eissn:
- 1526-5471
issn:
- 0364-765X
publication_status: published
publisher: Institute for Operations Research and the Management Sciences
quality_controlled: '1'
related_material:
record:
- id: '20234'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Finite-memory strategies in POMDPs with long-run average objectives
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2022'
...
---
_id: '9336'
abstract:
- lang: eng
text: Mentorship is experience and/or knowledge‐based guidance. Mentors support,
sponsor and advocate for mentees. Having one or more mentors when you seek advice
can significantly influence and improve your research endeavours, well‐being and
career development. Positive mentee–mentor relationships are vital for maintaining
work–life balance and success in careers. Early‐career researchers (ECRs), in
particular, can benefit from mentorship to navigate challenges in academic and
nonacademic life and careers. Yet, strategies for selecting mentors and maintaining
interactions with them are often underdiscussed within research environments.
In this Words of Advice, we provide recommendations for ECRs to seek and manage
mentorship interactions. Our article draws from our experiences as ECRs and published
work, to provide suggestions for mentees to proactively promote beneficial mentorship
interactions. The recommended practices highlight the importance of identifying
mentorship needs, planning and selecting multiple and diverse mentors, setting
goals, and maintaining constructive, and mutually beneficial working relationships
with mentors.
acknowledgement: The authors thank Nicholas Asby of the University of Chicago for
valuable comments on an earlier version of this work. A.P.S. was partially supported
by the NARSAD Young Investigator Grant 27705. S.J.H was supported by the National
Institutes of Health grant R35GM133732.
alternative_title:
- Words of Advice
article_processing_charge: No
article_type: original
author:
- first_name: Sarvenaz
full_name: Sarabipour, Sarvenaz
last_name: Sarabipour
- first_name: Sarah J.
full_name: Hainer, Sarah J.
last_name: Hainer
- first_name: Feyza N
full_name: Arslan, Feyza N
id: 49DA7910-F248-11E8-B48F-1D18A9856A87
last_name: Arslan
orcid: 0000-0001-5809-9566
- first_name: Charlotte M.
full_name: De Winde, Charlotte M.
last_name: De Winde
- first_name: Emily
full_name: Furlong, Emily
last_name: Furlong
- first_name: Natalia
full_name: Bielczyk, Natalia
last_name: Bielczyk
- first_name: Nafisa M.
full_name: Jadavji, Nafisa M.
last_name: Jadavji
- first_name: Aparna P.
full_name: Shah, Aparna P.
last_name: Shah
- first_name: Sejal
full_name: Davla, Sejal
last_name: Davla
citation:
ama: Sarabipour S, Hainer SJ, Arslan FN, et al. Building and sustaining mentor interactions
as a mentee. FEBS Journal. 2022;289(6):1374-1384. doi:10.1111/febs.15823
apa: Sarabipour, S., Hainer, S. J., Arslan, F. N., De Winde, C. M., Furlong, E.,
Bielczyk, N., … Davla, S. (2022). Building and sustaining mentor interactions
as a mentee. FEBS Journal. Wiley. https://doi.org/10.1111/febs.15823
chicago: Sarabipour, Sarvenaz, Sarah J. Hainer, Feyza N Arslan, Charlotte M. De
Winde, Emily Furlong, Natalia Bielczyk, Nafisa M. Jadavji, Aparna P. Shah, and
Sejal Davla. “Building and Sustaining Mentor Interactions as a Mentee.” FEBS
Journal. Wiley, 2022. https://doi.org/10.1111/febs.15823.
ieee: S. Sarabipour et al., “Building and sustaining mentor interactions
as a mentee,” FEBS Journal, vol. 289, no. 6. Wiley, pp. 1374–1384, 2022.
ista: Sarabipour S, Hainer SJ, Arslan FN, De Winde CM, Furlong E, Bielczyk N, Jadavji
NM, Shah AP, Davla S. 2022. Building and sustaining mentor interactions as a mentee.
FEBS Journal. 289(6), 1374–1384.
mla: Sarabipour, Sarvenaz, et al. “Building and Sustaining Mentor Interactions as
a Mentee.” FEBS Journal, vol. 289, no. 6, Wiley, 2022, pp. 1374–84, doi:10.1111/febs.15823.
short: S. Sarabipour, S.J. Hainer, F.N. Arslan, C.M. De Winde, E. Furlong, N. Bielczyk,
N.M. Jadavji, A.P. Shah, S. Davla, FEBS Journal 289 (2022) 1374–1384.
date_created: 2021-04-18T22:01:43Z
date_published: 2022-03-01T00:00:00Z
date_updated: 2026-06-18T19:47:28Z
day: '01'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1111/febs.15823
external_id:
isi:
- '000636678800001'
pmid:
- '33818917'
intvolume: ' 289'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/febs.15823
month: '03'
oa: 1
oa_version: Published Version
page: 1374-1384
pmid: 1
publication: FEBS Journal
publication_identifier:
eissn:
- 1742-4658
issn:
- 1742-464X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Building and sustaining mentor interactions as a mentee
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 289
year: '2022'
...
---
_id: '9364'
abstract:
- lang: eng
text: 'Let t : Fp → C be a complex valued function on Fp. A classical problem in
analytic number theory is bounding the maximum M(t) := max 0≤H 0 there exists a large subset of a ∈ F×p
such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1))
log log p, as p→∞. Finally, we prove a result on the growth of the moments of
{M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary);
14F20, 60F10 (Secondary).'
acknowledgement: I am most thankful to my advisor, Emmanuel Kowalski, for suggesting
this problem and for his guidance during these years. I also would like to thank
Youness Lamzouri for informing me about his work on sum of incomplete Birch sums
and Tal Horesh for her suggestions on a previous version of the paper. Finally,
I am very grateful to the anonymous referee for their careful reading of the manuscript
and their valuable comments.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Dante
full_name: Bonolis, Dante
id: 6A459894-5FDD-11E9-AF35-BB24E6697425
last_name: Bonolis
citation:
ama: Bonolis D. On the size of the maximum of incomplete Kloosterman sums. Mathematical
Proceedings of the Cambridge Philosophical Society. 2022;172(3):563-590. doi:10.1017/S030500412100030X
apa: Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums.
Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge
University Press. https://doi.org/10.1017/S030500412100030X
chicago: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.”
Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge
University Press, 2022. https://doi.org/10.1017/S030500412100030X.
ieee: D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” Mathematical
Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3. Cambridge
University Press, pp. 563–590, 2022.
ista: Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums.
Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590.
mla: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.”
Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172,
no. 3, Cambridge University Press, 2022, pp. 563–90, doi:10.1017/S030500412100030X.
short: D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society
172 (2022) 563–590.
date_created: 2021-05-02T22:01:29Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T06:47:48Z
day: '01'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1017/S030500412100030X
external_id:
arxiv:
- '1811.10563'
isi:
- '000784421500001'
file:
- access_level: open_access
checksum: 614d2e9b83a78100408e4ee7752a80a8
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-01T14:01:54Z
date_updated: 2021-12-01T14:01:54Z
file_id: '10395'
file_name: 2021_MathProcCamPhilSoc_Bonolis.pdf
file_size: 334064
relation: main_file
success: 1
file_date_updated: 2021-12-01T14:01:54Z
has_accepted_license: '1'
intvolume: ' 172'
isi: 1
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 563 - 590
publication: Mathematical Proceedings of the Cambridge Philosophical Society
publication_identifier:
eissn:
- 1469-8064
issn:
- 0305-0041
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the size of the maximum of incomplete Kloosterman sums
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: 172
year: '2022'
...
---
_id: '9365'
abstract:
- lang: eng
text: In this paper, we propose a new iterative method with alternated inertial
step for solving split common null point problem in real Hilbert spaces. We obtain
weak convergence of the proposed iterative algorithm. Furthermore, we introduce
the notion of bounded linear regularity property for the split common null point
problem and obtain the linear convergence property for the new algorithm under
some mild assumptions. Finally, we provide some numerical examples to demonstrate
the performance and efficiency of the proposed method.
acknowledgement: The second author has received funding from the European Research
Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013)
(Grant agreement No. 616160).
article_processing_charge: No
article_type: original
author:
- first_name: Ferdinard U.
full_name: Ogbuisi, Ferdinard U.
last_name: Ogbuisi
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Jen Chih
full_name: Yao, Jen Chih
last_name: Yao
citation:
ama: Ogbuisi FU, Shehu Y, Yao JC. Convergence analysis of new inertial method for
the split common null point problem. Optimization. 2022;71(13):3767-3795.
doi:10.1080/02331934.2021.1914035
apa: Ogbuisi, F. U., Shehu, Y., & Yao, J. C. (2022). Convergence analysis of
new inertial method for the split common null point problem. Optimization.
Taylor and Francis. https://doi.org/10.1080/02331934.2021.1914035
chicago: Ogbuisi, Ferdinard U., Yekini Shehu, and Jen Chih Yao. “Convergence Analysis
of New Inertial Method for the Split Common Null Point Problem.” Optimization.
Taylor and Francis, 2022. https://doi.org/10.1080/02331934.2021.1914035.
ieee: F. U. Ogbuisi, Y. Shehu, and J. C. Yao, “Convergence analysis of new inertial
method for the split common null point problem,” Optimization, vol. 71,
no. 13. Taylor and Francis, pp. 3767–3795, 2022.
ista: Ogbuisi FU, Shehu Y, Yao JC. 2022. Convergence analysis of new inertial method
for the split common null point problem. Optimization. 71(13), 3767–3795.
mla: Ogbuisi, Ferdinard U., et al. “Convergence Analysis of New Inertial Method
for the Split Common Null Point Problem.” Optimization, vol. 71, no. 13,
Taylor and Francis, 2022, pp. 3767–95, doi:10.1080/02331934.2021.1914035.
short: F.U. Ogbuisi, Y. Shehu, J.C. Yao, Optimization 71 (2022) 3767–3795.
date_created: 2021-05-02T22:01:29Z
date_published: 2022-11-01T00:00:00Z
date_updated: 2024-11-04T13:52:36Z
day: '01'
department:
- _id: VlKo
doi: 10.1080/02331934.2021.1914035
ec_funded: 1
external_id:
isi:
- '000640109300001'
intvolume: ' 71'
isi: 1
issue: '13'
language:
- iso: eng
month: '11'
oa_version: None
page: 3767-3795
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization
publication_identifier:
eissn:
- 1029-4945
issn:
- 0233-1934
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence analysis of new inertial method for the split common null point
problem
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 71
year: '2022'
...
---
_id: '9469'
abstract:
- lang: eng
text: In this paper, we consider reflected three-operator splitting methods for
monotone inclusion problems in real Hilbert spaces. To do this, we first obtain
weak convergence analysis and nonasymptotic O(1/n) convergence rate of the reflected
Krasnosel'skiĭ-Mann iteration for finding a fixed point of nonexpansive mapping
in real Hilbert spaces under some seemingly easy to implement conditions on the
iterative parameters. We then apply our results to three-operator splitting for
the monotone inclusion problem and consequently obtain the corresponding convergence
analysis. Furthermore, we derive reflected primal-dual algorithms for highly structured
monotone inclusion problems. Some numerical implementations are drawn from splitting
methods to support the theoretical analysis.
acknowledgement: The authors are grateful to the anonymous referees and the handling
Editor for their insightful comments which have improved the earlier version of
the manuscript greatly. The second author is grateful to the University of Hafr
Al Batin. The last author has received funding from the European Research Council
(ERC) under the European Union's Seventh Framework Program (FP7-2007-2013) (Grant
agreement No. 616160).
article_processing_charge: No
article_type: original
author:
- first_name: Olaniyi S.
full_name: Iyiola, Olaniyi S.
last_name: Iyiola
- first_name: Cyril D.
full_name: Enyi, Cyril D.
last_name: Enyi
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
citation:
ama: Iyiola OS, Enyi CD, Shehu Y. Reflected three-operator splitting method for
monotone inclusion problem. Optimization Methods and Software. 2022;37(4):1527-1565.
doi:10.1080/10556788.2021.1924715
apa: Iyiola, O. S., Enyi, C. D., & Shehu, Y. (2022). Reflected three-operator
splitting method for monotone inclusion problem. Optimization Methods and Software.
Taylor and Francis. https://doi.org/10.1080/10556788.2021.1924715
chicago: Iyiola, Olaniyi S., Cyril D. Enyi, and Yekini Shehu. “Reflected Three-Operator
Splitting Method for Monotone Inclusion Problem.” Optimization Methods and
Software. Taylor and Francis, 2022. https://doi.org/10.1080/10556788.2021.1924715.
ieee: O. S. Iyiola, C. D. Enyi, and Y. Shehu, “Reflected three-operator splitting
method for monotone inclusion problem,” Optimization Methods and Software,
vol. 37, no. 4. Taylor and Francis, pp. 1527–1565, 2022.
ista: Iyiola OS, Enyi CD, Shehu Y. 2022. Reflected three-operator splitting method
for monotone inclusion problem. Optimization Methods and Software. 37(4), 1527–1565.
mla: Iyiola, Olaniyi S., et al. “Reflected Three-Operator Splitting Method for Monotone
Inclusion Problem.” Optimization Methods and Software, vol. 37, no. 4,
Taylor and Francis, 2022, pp. 1527–65, doi:10.1080/10556788.2021.1924715.
short: O.S. Iyiola, C.D. Enyi, Y. Shehu, Optimization Methods and Software 37 (2022)
1527–1565.
corr_author: '1'
date_created: 2021-06-06T22:01:30Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2024-11-04T13:52:36Z
day: '01'
department:
- _id: VlKo
doi: 10.1080/10556788.2021.1924715
ec_funded: 1
external_id:
isi:
- '000650507600001'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
page: 1527-1565
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization Methods and Software
publication_identifier:
eissn:
- 1029-4937
issn:
- 1055-6788
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reflected three-operator splitting method for monotone inclusion problem
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2022'
...
---
_id: '9649'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued
smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an
isomanifold is to consider its Piecewise-Linear (PL) approximation based on a
triangulation T of the ambient space Rd. In this paper, we give conditions under
which the PL-approximation of an isomanifold is topologically equivalent to the
isomanifold. The conditions are easy to satisfy in the sense that they can always
be met by taking a sufficiently\r\nfine triangulation T . This contrasts with
previous results on the triangulation of manifolds where, in arbitrary dimensions,
delicate perturbations are needed to guarantee topological correctness, which
leads to strong limitations in practice. We further give a bound on the Fréchet
distance between the original isomanifold and its PL-approximation. Finally we
show analogous results for the PL-approximation of an isomanifold with boundary."
acknowledgement: "First and foremost, we acknowledge Siargey Kachanovich for discussions.
We thank Herbert Edelsbrunner and all members of his group, all former and current
members of the Datashape team (formerly known as Geometrica), and André Lieutier
for encouragement. We further thank the reviewers of Foundations of Computational
Mathematics and the reviewers and program committee of the Symposium on Computational
Geometry for their feedback, which improved the exposition.\r\nThis work was funded
by the European Research Council under the European Union’s ERC Grant Agreement
number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher
Dimensions). This work was also supported by the French government, through the
3IA Côte d’Azur Investments in the Future project managed by the National Research
Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also
received 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 (via OA deal)
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations
of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012.
doi:10.1007/s10208-021-09520-0
apa: Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness
of PL approximations of isomanifolds. Foundations of Computational Mathematics
. Springer Nature. https://doi.org/10.1007/s10208-021-09520-0
chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics
. Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0.
ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations
of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer
Nature, pp. 967–1012, 2022.
ista: Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations
of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.
mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics
, vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0.
short: J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22
(2022) 967–1012.
corr_author: '1'
date_created: 2021-07-14T06:44:53Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2025-04-22T13:45:18Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s10208-021-09520-0
ec_funded: 1
external_id:
isi:
- '000673039600001'
file:
- access_level: open_access
checksum: f1d372ec3c08ec22e84f8e93e1126b8c
content_type: application/pdf
creator: mwintrae
date_created: 2021-07-14T06:44:36Z
date_updated: 2021-07-14T06:44:36Z
file_id: '9650'
file_name: Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf
file_size: 1455699
relation: main_file
file_date_updated: 2021-07-14T06:44:36Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 967-1012
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 'Foundations of Computational Mathematics '
publication_identifier:
eissn:
- 1615-3383
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '7952'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: The topological correctness of PL approximations of isomanifolds
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2022'
...
---
_id: '9695'
abstract:
- lang: eng
text: Real-world data typically contain a large number of features that are often
heterogeneous in nature, relevance, and also units of measure. When assessing
the similarity between data points, one can build various distance measures using
subsets of these features. Using the fewest features but still retaining sufficient
information about the system is crucial in many statistical learning approaches,
particularly when data are sparse. We introduce a statistical test that can assess
the relative information retained when using two different distance measures,
and determine if they are equivalent, independent, or if one is more informative
than the other. This in turn allows finding the most informative distance measure
out of a pool of candidates. The approach is applied to find the most relevant
policy variables for controlling the Covid-19 epidemic and to find compact yet
informative representations of atomic structures, but its potential applications
are wide ranging in many branches of science.
acknowledgement: "A.G., C.Z., and A.L. gratefully acknowledge support from the European
Union’s Horizon 2020 research and innovation program (grant number 824143, MaX ’Materials
design at the eXascale’ Centre of Excellence). The authors would like to thank M.
Carli, D. Doimo, and I. Macocco (SISSA) for the discussions, M. Caro (Aalto University)
for the precious help in using the TurboGap code, and D. Frenkel (University of
Cambridge) and N. Bernstein (US Naval Research Laboratory) for useful feedback on
the manuscript.\r\nThis work is supported in part by funds from the European Union’s
Horizon 2020 research and innovation program (grant number 824143, MaX ’Materials
design at the eXascale’ Centre of Excellence)."
article_number: pgac039
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Aldo
full_name: Glielmo, Aldo
last_name: Glielmo
- first_name: Claudio
full_name: Zeni, Claudio
last_name: Zeni
- first_name: Bingqing
full_name: Cheng, Bingqing
id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9
last_name: Cheng
orcid: 0000-0002-3584-9632
- first_name: Gabor
full_name: Csanyi, Gabor
last_name: Csanyi
- first_name: Alessandro
full_name: Laio, Alessandro
last_name: Laio
citation:
ama: Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. Ranking the information content
of distance measures. PNAS Nexus. 2022;1(2). doi:10.1093/pnasnexus/pgac039
apa: Glielmo, A., Zeni, C., Cheng, B., Csanyi, G., & Laio, A. (2022). Ranking
the information content of distance measures. PNAS Nexus. Oxford University
Press. https://doi.org/10.1093/pnasnexus/pgac039
chicago: Glielmo, Aldo, Claudio Zeni, Bingqing Cheng, Gabor Csanyi, and Alessandro
Laio. “Ranking the Information Content of Distance Measures.” PNAS Nexus.
Oxford University Press, 2022. https://doi.org/10.1093/pnasnexus/pgac039.
ieee: A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, and A. Laio, “Ranking the information
content of distance measures,” PNAS Nexus, vol. 1, no. 2. Oxford University
Press, 2022.
ista: Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. 2022. Ranking the information
content of distance measures. PNAS Nexus. 1(2), pgac039.
mla: Glielmo, Aldo, et al. “Ranking the Information Content of Distance Measures.”
PNAS Nexus, vol. 1, no. 2, pgac039, Oxford University Press, 2022, doi:10.1093/pnasnexus/pgac039.
short: A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, A. Laio, PNAS Nexus 1 (2022).
date_created: 2021-07-20T06:31:53Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2025-06-12T06:23:20Z
day: '01'
ddc:
- '000'
department:
- _id: BiCh
doi: 10.1093/pnasnexus/pgac039
external_id:
arxiv:
- '2104.15079'
pmid:
- '36713323'
file:
- access_level: open_access
checksum: f6552854d760eb574ce97abce2c8ef89
content_type: application/pdf
creator: dernst
date_created: 2024-05-29T06:21:33Z
date_updated: 2024-05-29T06:21:33Z
file_id: '17080'
file_name: 2022_PNASNexus_Glielmo.pdf
file_size: 2005167
relation: main_file
success: 1
file_date_updated: 2024-05-29T06:21:33Z
has_accepted_license: '1'
intvolume: ' 1'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: PNAS Nexus
publication_identifier:
eissn:
- 2752-6542
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ranking the information content of distance measures
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2022'
...
---
_id: '9794'
abstract:
- lang: eng
text: 'Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular
cells that form dedicated niches for immune cell interaction and capsular fibroblasts
that build a shell around the organ. Immunological challenge causes LNs to increase
more than tenfold in size within a few days. Here, we characterized the biomechanics
of LN swelling on the cellular and organ scale. We identified lymphocyte trapping
by influx and proliferation as drivers of an outward pressure force, causing fibroblastic
reticular cells of the T-zone (TRCs) and their associated conduits to stretch.
After an initial phase of relaxation, TRCs sensed the resulting strain through
cell matrix adhesions, which coordinated local growth and remodeling of the stromal
network. While the expanded TRC network readopted its typical configuration, a
massive fibrotic reaction of the organ capsule set in and countered further organ
expansion. Thus, different fibroblast populations mechanically control LN swelling
in a multitier fashion.'
acknowledged_ssus:
- _id: Bio
- _id: EM-Fac
- _id: PreCl
- _id: LifeSc
acknowledgement: This research was supported by the Scientific Service Units of IST
Austria through resources provided by the Imaging and Optics, Electron Microscopy,
Preclinical and Life Science Facilities. We thank C. Moussion for providing anti-PNAd
antibody and D. Critchley for Talin1-floxed mice, and E. Papusheva for providing
a custom 3D channel alignment script. This work was supported by a European Research
Council grant ERC-CoG-72437 to M.S. M.H. was supported by Czech Sciencundation GACR
20-24603Y and Charles University PRIMUS/20/MED/013.
article_processing_charge: No
article_type: original
author:
- first_name: Frank P
full_name: Assen, Frank P
id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87
last_name: Assen
orcid: 0000-0003-3470-6119
- first_name: Jun
full_name: Abe, Jun
last_name: Abe
- first_name: Miroslav
full_name: Hons, Miroslav
id: 4167FE56-F248-11E8-B48F-1D18A9856A87
last_name: Hons
orcid: 0000-0002-6625-3348
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Tommaso
full_name: Costanzo, Tommaso
id: D93824F4-D9BA-11E9-BB12-F207E6697425
last_name: Costanzo
orcid: 0000-0001-9732-3815
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Burkhard
full_name: Ludewig, Burkhard
last_name: Ludewig
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Wolfgang
full_name: Weninger, Wolfgang
last_name: Weninger
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Sanjiv A.
full_name: Luther, Sanjiv A.
last_name: Luther
- first_name: Jens V.
full_name: Stein, Jens V.
last_name: Stein
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-4561-241X
citation:
ama: Assen FP, Abe J, Hons M, et al. Multitier mechanics control stromal adaptations
in swelling lymph nodes. Nature Immunology. 2022;23:1246-1255. doi:10.1038/s41590-022-01257-4
apa: Assen, F. P., Abe, J., Hons, M., Hauschild, R., Shamipour, S., Kaufmann, W.,
… Sixt, M. K. (2022). Multitier mechanics control stromal adaptations in swelling
lymph nodes. Nature Immunology. Springer Nature. https://doi.org/10.1038/s41590-022-01257-4
chicago: Assen, Frank P, Jun Abe, Miroslav Hons, Robert Hauschild, Shayan Shamipour,
Walter Kaufmann, Tommaso Costanzo, et al. “Multitier Mechanics Control Stromal
Adaptations in Swelling Lymph Nodes.” Nature Immunology. Springer Nature,
2022. https://doi.org/10.1038/s41590-022-01257-4.
ieee: F. P. Assen et al., “Multitier mechanics control stromal adaptations
in swelling lymph nodes,” Nature Immunology, vol. 23. Springer Nature,
pp. 1246–1255, 2022.
ista: Assen FP, Abe J, Hons M, Hauschild R, Shamipour S, Kaufmann W, Costanzo T,
Krens G, Brown M, Ludewig B, Hippenmeyer S, Heisenberg C-PJ, Weninger W, Hannezo
EB, Luther SA, Stein JV, Sixt MK. 2022. Multitier mechanics control stromal adaptations
in swelling lymph nodes. Nature Immunology. 23, 1246–1255.
mla: Assen, Frank P., et al. “Multitier Mechanics Control Stromal Adaptations in
Swelling Lymph Nodes.” Nature Immunology, vol. 23, Springer Nature, 2022,
pp. 1246–55, doi:10.1038/s41590-022-01257-4.
short: F.P. Assen, J. Abe, M. Hons, R. Hauschild, S. Shamipour, W. Kaufmann, T.
Costanzo, G. Krens, M. Brown, B. Ludewig, S. Hippenmeyer, C.-P.J. Heisenberg,
W. Weninger, E.B. Hannezo, S.A. Luther, J.V. Stein, M.K. Sixt, Nature Immunology
23 (2022) 1246–1255.
corr_author: '1'
date_created: 2021-08-06T09:09:11Z
date_published: 2022-07-11T00:00:00Z
date_updated: 2025-06-11T13:52:43Z
day: '11'
ddc:
- '570'
department:
- _id: SiHi
- _id: CaHe
- _id: EdHa
- _id: EM-Fac
- _id: Bio
- _id: MiSi
doi: 10.1038/s41590-022-01257-4
ec_funded: 1
external_id:
isi:
- '000822975900002'
pmid:
- '35817845'
file:
- access_level: open_access
checksum: 628e7b49809f22c75b428842efe70c68
content_type: application/pdf
creator: dernst
date_created: 2022-07-25T07:11:32Z
date_updated: 2022-07-25T07:11:32Z
file_id: '11642'
file_name: 2022_NatureImmunology_Assen.pdf
file_size: 11475325
relation: main_file
success: 1
file_date_updated: 2022-07-25T07:11:32Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1246-1255
pmid: 1
project:
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular Navigation Along Spatial Gradients
publication: Nature Immunology
publication_identifier:
eissn:
- 1529-2916
issn:
- 1529-2908
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multitier mechanics control stromal adaptations in swelling lymph nodes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2022'
...
---
_id: '9955'
abstract:
- lang: eng
text: Neurons can change their classical neurotransmitters during ontogeny, sometimes
going through stages of dual release. Here, we explored the development of the
neurotransmitter identity of neurons of the avian nucleus isthmi parvocellularis
(Ipc), whose axon terminals are retinotopically arranged in the optic tectum (TeO)
and exert a focal gating effect upon the ascending transmission of retinal inputs.
Although cholinergic and glutamatergic markers are both found in Ipc neurons and
terminals of adult pigeons and chicks, the mRNA expression of the vesicular acetylcholine
transporter, VAChT, is weak or absent. To explore how the Ipc neurotransmitter
identity is established during ontogeny, we analyzed the expression of mRNAs coding
for cholinergic (ChAT, VAChT, and CHT) and glutamatergic (VGluT2 and VGluT3) markers
in chick embryos at different developmental stages. We found that between E12
and E18, Ipc neurons expressed all cholinergic mRNAs and also VGluT2 mRNA; however,
from E16 through posthatch stages, VAChT mRNA expression was specifically diminished.
Our ex vivo deposits of tracer crystals and intracellular filling experiments
revealed that Ipc axons exhibit a mature paintbrush morphology late in development,
experiencing marked morphological transformations during the period of presumptive
dual vesicular transmitter release. Additionally, although ChAT protein immunoassays
increasingly label the growing Ipc axon, this labeling was consistently restricted
to sparse portions of the terminal branches. Combined, these results suggest that
the synthesis of glutamate and acetylcholine, and their vesicular release, is
complexly linked to the developmental processes of branching, growing and remodeling
of these unique axons.
acknowledgement: 'This work was supported by FONDECYT grants 1151432 and 1210169 to
Gonzalo J. Marín. FONDECYT grant 1210069 to Jorge Mpodozis. Spanish Ministry of
Science, Innovation and Universities (MCIU), State Research Agency (AEI) and European
Regional Development Fund (FEDER), PGC2018-098229-B-100 to José L Ferrán. Spanish
Ministry of Economy and Competitiveness Excellency Grant BFU2014-57516P (with European
Community FEDER support), and a Seneca Foundation (Autonomous Community of Murcia)
Excellency Research contract, ref: 19904/ GERM/15; project name: Genoarchitectonic
Brain Development and Applications to Neurodegenerative Diseases and Cancer (5672
Fundación Séneca) to Luis Puelles. The authors gratefully acknowledge the valuable
editorial help provided by Sara Fernández-Collemann. The authors also thank Elisa
Sentis and Solano Henríquez for expert technical help.'
article_processing_charge: No
article_type: original
author:
- first_name: Rosana
full_name: Reyes‐Pinto, Rosana
last_name: Reyes‐Pinto
- first_name: José L.
full_name: Ferrán, José L.
last_name: Ferrán
- first_name: Tomas A
full_name: Vega Zuniga, Tomas A
id: 2E7C4E78-F248-11E8-B48F-1D18A9856A87
last_name: Vega Zuniga
- first_name: Cristian
full_name: González‐Cabrera, Cristian
last_name: González‐Cabrera
- first_name: Harald
full_name: Luksch, Harald
last_name: Luksch
- first_name: Jorge
full_name: Mpodozis, Jorge
last_name: Mpodozis
- first_name: Luis
full_name: Puelles, Luis
last_name: Puelles
- first_name: Gonzalo J.
full_name: Marín, Gonzalo J.
last_name: Marín
citation:
ama: Reyes‐Pinto R, Ferrán JL, Vega Zuniga TA, et al. Change in the neurochemical
signature and morphological development of the parvocellular isthmic projection
to the avian tectum. Journal of Comparative Neurology. 2022;530(2):553-573.
doi:10.1002/cne.25229
apa: Reyes‐Pinto, R., Ferrán, J. L., Vega Zuniga, T. A., González‐Cabrera, C., Luksch,
H., Mpodozis, J., … Marín, G. J. (2022). Change in the neurochemical signature
and morphological development of the parvocellular isthmic projection to the avian
tectum. Journal of Comparative Neurology. Wiley. https://doi.org/10.1002/cne.25229
chicago: Reyes‐Pinto, Rosana, José L. Ferrán, Tomas A Vega Zuniga, Cristian González‐Cabrera,
Harald Luksch, Jorge Mpodozis, Luis Puelles, and Gonzalo J. Marín. “Change in
the Neurochemical Signature and Morphological Development of the Parvocellular
Isthmic Projection to the Avian Tectum.” Journal of Comparative Neurology.
Wiley, 2022. https://doi.org/10.1002/cne.25229.
ieee: R. Reyes‐Pinto et al., “Change in the neurochemical signature and morphological
development of the parvocellular isthmic projection to the avian tectum,” Journal
of Comparative Neurology, vol. 530, no. 2. Wiley, pp. 553–573, 2022.
ista: Reyes‐Pinto R, Ferrán JL, Vega Zuniga TA, González‐Cabrera C, Luksch H, Mpodozis
J, Puelles L, Marín GJ. 2022. Change in the neurochemical signature and morphological
development of the parvocellular isthmic projection to the avian tectum. Journal
of Comparative Neurology. 530(2), 553–573.
mla: Reyes‐Pinto, Rosana, et al. “Change in the Neurochemical Signature and Morphological
Development of the Parvocellular Isthmic Projection to the Avian Tectum.” Journal
of Comparative Neurology, vol. 530, no. 2, Wiley, 2022, pp. 553–73, doi:10.1002/cne.25229.
short: R. Reyes‐Pinto, J.L. Ferrán, T.A. Vega Zuniga, C. González‐Cabrera, H. Luksch,
J. Mpodozis, L. Puelles, G.J. Marín, Journal of Comparative Neurology 530 (2022)
553–573.
date_created: 2021-08-23T08:40:59Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2023-08-11T10:58:17Z
day: '01'
department:
- _id: MaJö
doi: 10.1002/cne.25229
external_id:
isi:
- '000686420000001'
pmid:
- '34363623'
intvolume: ' 530'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 553-573
pmid: 1
publication: Journal of Comparative Neurology
publication_identifier:
eissn:
- 1096-9861
issn:
- 0021-9967
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Change in the neurochemical signature and morphological development of the
parvocellular isthmic projection to the avian tectum
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 530
year: '2022'
...
---
_id: '9977'
abstract:
- lang: eng
text: "For a Seifert fibered homology sphere X we show that the q-series invariant
Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki
series Z0(X). We show that for every even k ∈ N there exists a full asymptotic
expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit
Zˆ0(X; e 2πi/k) exists and is equal to the\r\nWRT quantum invariant τk(X). We
show that the poles of the Borel transform of Z0(X) coincide with the classical
complex Chern-Simons values, which we further show classifies the corresponding
components of the moduli space of flat SL(2, C)-connections."
acknowledgement: "We warmly thank S. Gukov for valuable discussions on the GPPV invariant
̂Z\U0001D44E(\U0001D4403; \U0001D45E). The first\r\nauthor was supported in part
by the center of excellence grant ‘Center for Quantum Geometry\r\nof Moduli Spaces’
from the Danish National Research Foundation (DNRF95) and by the ERCSynergy\r\ngrant
‘ReNewQuantum’. The second author received funding from the European Union’s Horizon
2020 research and innovation program under the Marie Skłodowska-Curie grant agreement
no. 754411."
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: William
full_name: Mistegaard, William
id: 41B03CD0-62AE-11E9-84EF-0718E6697425
last_name: Mistegaard
- first_name: Jørgen Ellegaard
full_name: Andersen, Jørgen Ellegaard
last_name: Andersen
citation:
ama: Mistegaard W, Andersen JE. Resurgence analysis of quantum invariants of Seifert
fibered homology spheres. Journal of the London Mathematical Society. 2022;105(2):709-764.
doi:10.1112/jlms.12506
apa: Mistegaard, W., & Andersen, J. E. (2022). Resurgence analysis of quantum
invariants of Seifert fibered homology spheres. Journal of the London Mathematical
Society. Wiley. https://doi.org/10.1112/jlms.12506
chicago: Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis
of Quantum Invariants of Seifert Fibered Homology Spheres.” Journal of the
London Mathematical Society. Wiley, 2022. https://doi.org/10.1112/jlms.12506.
ieee: W. Mistegaard and J. E. Andersen, “Resurgence analysis of quantum invariants
of Seifert fibered homology spheres,” Journal of the London Mathematical Society,
vol. 105, no. 2. Wiley, pp. 709–764, 2022.
ista: Mistegaard W, Andersen JE. 2022. Resurgence analysis of quantum invariants
of Seifert fibered homology spheres. Journal of the London Mathematical Society.
105(2), 709–764.
mla: Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of
Quantum Invariants of Seifert Fibered Homology Spheres.” Journal of the London
Mathematical Society, vol. 105, no. 2, Wiley, 2022, pp. 709–64, doi:10.1112/jlms.12506.
short: W. Mistegaard, J.E. Andersen, Journal of the London Mathematical Society
105 (2022) 709–764.
corr_author: '1'
date_created: 2021-08-31T12:51:40Z
date_published: 2022-03-01T00:00:00Z
date_updated: 2025-04-14T07:43:49Z
day: '01'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.1112/jlms.12506
ec_funded: 1
external_id:
arxiv:
- '1811.05376'
isi:
- '000755205700001'
file:
- access_level: open_access
checksum: 9c72327d39f34f1a6eaa98fa4b8493f2
content_type: application/pdf
creator: dernst
date_created: 2022-03-24T11:42:25Z
date_updated: 2022-03-24T11:42:25Z
file_id: '10917'
file_name: 2022_JourLondonMathSoc_Andersen.pdf
file_size: 649130
relation: main_file
success: 1
file_date_updated: 2022-03-24T11:42:25Z
has_accepted_license: '1'
intvolume: ' 105'
isi: 1
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 709-764
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of the London Mathematical Society
publication_identifier:
eissn:
- 1469-7750
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resurgence analysis of quantum invariants of Seifert fibered homology spheres
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: 105
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '22043'
abstract:
- lang: eng
text: We prove that multisoliton solutions of the Korteweg–de Vries equation are
orbitally stable in H^-1(R). We introduce a variational characterization of multisolitons
that remains meaningful at such low regularity and show that all optimizing sequences
converge to the manifold of multisolitons. The proximity required at the initial
time is uniform across the entire manifold of multisolitons; this had not been
demonstrated previously, even in H^-1.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Vişan M. Orbital stability of KdV multisolitons in H-1. Communications
in Mathematical Physics. 2022;389(3):1445-1473. doi:10.1007/s00220-021-04280-y
apa: Killip, R., & Vişan, M. (2022). Orbital stability of KdV multisolitons
in H-1. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-021-04280-y
chicago: Killip, Rowan, and Monica Vişan. “Orbital Stability of KdV Multisolitons
in H-1.” Communications in Mathematical Physics. Springer Nature, 2022.
https://doi.org/10.1007/s00220-021-04280-y.
ieee: R. Killip and M. Vişan, “Orbital stability of KdV multisolitons in H-1,” Communications
in Mathematical Physics, vol. 389, no. 3. Springer Nature, pp. 1445–1473,
2022.
ista: Killip R, Vişan M. 2022. Orbital stability of KdV multisolitons in H-1. Communications
in Mathematical Physics. 389(3), 1445–1473.
mla: Killip, Rowan, and Monica Vişan. “Orbital Stability of KdV Multisolitons in
H-1.” Communications in Mathematical Physics, vol. 389, no. 3, Springer
Nature, 2022, pp. 1445–73, doi:10.1007/s00220-021-04280-y.
short: R. Killip, M. Vişan, Communications in Mathematical Physics 389 (2022) 1445–1473.
das_tickbox: '1'
date_created: 2026-06-19T07:46:39Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2026-06-25T07:41:51Z
day: '01'
doi: 10.1007/s00220-021-04280-y
extern: '1'
external_id:
arxiv:
- '2009.06746'
intvolume: ' 389'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2009.06746
month: '02'
oa: 1
oa_version: Preprint
page: 1445-1473
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Orbital stability of KdV multisolitons in H-1
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 389
year: '2022'
...