---
_id: '14456'
abstract:
- lang: eng
text: In this paper, we present novel algorithms that efficiently compute a shortest
reconfiguration sequence between two given dominating sets in trees and interval
graphs under the TOKEN SLIDING model. In this problem, a graph is provided along
with its two dominating sets, which can be imagined as tokens placed on vertices.
The objective is to find a shortest sequence of dominating sets that transforms
one set into the other, with each set in the sequence resulting from sliding a
single token in the previous set. While identifying any sequence has been well
studied, our work presents the first polynomial algorithms for this optimization
variant in the context of dominating sets.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Jan Matyáš
full_name: Křišťan, Jan Matyáš
last_name: Křišťan
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token
sliding. In: 24th International Symposium on Fundamentals of Computation Theory.
Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24'
apa: 'Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration
under token sliding. In 24th International Symposium on Fundamentals of Computation
Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24'
chicago: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” In 24th International Symposium on Fundamentals of Computation
Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.
ieee: J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under
token sliding,” in 24th International Symposium on Fundamentals of Computation
Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.
ista: 'Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under
token sliding. 24th International Symposium on Fundamentals of Computation Theory.
FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.'
mla: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” 24th International Symposium on Fundamentals of Computation
Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.
short: J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals
of Computation Theory, Springer Nature, 2023, pp. 333–347.
conference:
end_date: 2023-09-21
location: Trier, Germany
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2023-09-18
date_created: 2023-10-29T23:01:16Z
date_published: 2023-09-21T00:00:00Z
date_updated: 2024-01-22T08:10:49Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-031-43587-4_24
external_id:
arxiv:
- '2307.10847'
intvolume: ' 14292'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2307.10847
month: '09'
oa: 1
oa_version: Preprint
page: 333-347
publication: 24th International Symposium on Fundamentals of Computation Theory
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031435867'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/978-3-031-43587-4_31
scopus_import: '1'
status: public
title: Shortest dominating set reconfiguration under token sliding
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14292
year: '2023'
...
---
_id: '14457'
abstract:
- lang: eng
text: "Threshold secret sharing allows a dealer to split a secret s into n shares,
such that any t shares allow for reconstructing s, but no t-1 shares reveal any
information about s. Leakage-resilient secret sharing requires that the secret
remains hidden, even when an adversary additionally obtains a limited amount of
leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret
sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n
and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen
and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving
that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn
this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy
leakage-resilience, where a random subset of leakages is replaced by uniformly
random noise. We prove a lower bound for Shamir’s secret sharing, similar to that
of Nielsen and Simkin, which holds even when a constant fraction of leakages is
replaced by random noise. To this end, we first prove a lower bound on the share
size of any noisy-leakage-resilient sharing scheme. We then use this lower bound
to show that there exist universal constants c1, c2, such that for sufficiently
large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient
for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random
noise.\r\n\r\n\r\n\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
orcid: 0000-0003-2027-5549
- first_name: Mark
full_name: Simkin, Mark
last_name: Simkin
citation:
ama: 'Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing.
In: 8th International Conference on Cryptology and Information Security in
Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11'
apa: 'Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient
secret sharing. In 8th International Conference on Cryptology and Information
Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer
Nature. https://doi.org/10.1007/978-3-031-44469-2_11'
chicago: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” In 8th International Conference on Cryptology and Information
Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11.
ieee: C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret
sharing,” in 8th International Conference on Cryptology and Information Security
in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.
ista: 'Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret
sharing. 8th International Conference on Cryptology and Information Security in
Latin America. LATINCRYPT: Conference on Cryptology and Information Security in
Latin America, LNCS, vol. 14168, 215–228.'
mla: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” 8th International Conference on Cryptology and Information
Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28,
doi:10.1007/978-3-031-44469-2_11.
short: C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and
Information Security in Latin America, Springer Nature, 2023, pp. 215–228.
conference:
end_date: 2023-10-06
location: Quito, Ecuador
name: 'LATINCRYPT: Conference on Cryptology and Information Security in Latin America'
start_date: 2023-10-03
date_created: 2023-10-29T23:01:16Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2023-10-31T11:43:12Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-031-44469-2_11
intvolume: ' 14168'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/1017
month: '10'
oa: 1
oa_version: Preprint
page: 215-228
publication: 8th International Conference on Cryptology and Information Security in
Latin America
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031444685'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stronger lower bounds for leakage-resilient secret sharing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14168
year: '2023'
...
---
_id: '14458'
abstract:
- lang: eng
text: 'We show for the first time that large-scale generative pretrained transformer
(GPT) family models can be pruned to at least 50% sparsity in one-shot, without
any retraining, at minimal loss of accuracy. This is achieved via a new pruning
method called SparseGPT, specifically designed to work efficiently and accurately
on massive GPT-family models. We can execute SparseGPT on the largest available
open-source models, OPT-175B and BLOOM-176B, in under 4.5 hours, and can reach
60% unstructured sparsity with negligible increase in perplexity: remarkably,
more than 100 billion weights from these models can be ignored at inference time.
SparseGPT generalizes to semi-structured (2:4 and 4:8) patterns, and is compatible
with weight quantization approaches. The code is available at: https://github.com/IST-DASLab/sparsegpt.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: The authors gratefully acknowledge funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement
No. 805223 ScaleML), as well as experimental support from Eldar Kurtic, and from
the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and
Alois Schloegl.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Frantar E, Alistarh D-A. SparseGPT: Massive language models can be accurately
pruned in one-shot. In: Proceedings of the 40th International Conference on
Machine Learning. Vol 202. ML Research Press; 2023:10323-10337.'
apa: 'Frantar, E., & Alistarh, D.-A. (2023). SparseGPT: Massive language models
can be accurately pruned in one-shot. In Proceedings of the 40th International
Conference on Machine Learning (Vol. 202, pp. 10323–10337). Honolulu, Hawaii,
HI, United States: ML Research Press.'
chicago: 'Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language
Models Can Be Accurately Pruned in One-Shot.” In Proceedings of the 40th International
Conference on Machine Learning, 202:10323–37. ML Research Press, 2023.'
ieee: 'E. Frantar and D.-A. Alistarh, “SparseGPT: Massive language models can be
accurately pruned in one-shot,” in Proceedings of the 40th International Conference
on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202,
pp. 10323–10337.'
ista: 'Frantar E, Alistarh D-A. 2023. SparseGPT: Massive language models can be
accurately pruned in one-shot. Proceedings of the 40th International Conference
on Machine Learning. ICML: International Conference on Machine Learning, PMLR,
vol. 202, 10323–10337.'
mla: 'Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models
Can Be Accurately Pruned in One-Shot.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10323–37.'
short: E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference
on Machine Learning, ML Research Press, 2023, pp. 10323–10337.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
date_created: 2023-10-29T23:01:16Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2023-10-31T09:59:42Z
day: '30'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2301.00774'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2301.00774
month: '07'
oa: 1
oa_version: Preprint
page: 10323-10337
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SparseGPT: Massive language models can be accurately pruned in one-shot'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14459'
abstract:
- lang: eng
text: Autoencoders are a popular model in many branches of machine learning and
lossy data compression. However, their fundamental limits, the performance of
gradient methods and the features learnt during optimization remain poorly understood,
even in the two-layer setting. In fact, earlier work has considered either linear
autoencoders or specific training regimes (leading to vanishing or diverging compression
rates). Our paper addresses this gap by focusing on non-linear two-layer autoencoders
trained in the challenging proportional regime in which the input dimension scales
linearly with the size of the representation. Our results characterize the minimizers
of the population risk, and show that such minimizers are achieved by gradient
methods; their structure is also unveiled, thus leading to a concise description
of the features obtained via training. For the special case of a sign activation
function, our analysis establishes the fundamental limits for the lossy compression
of Gaussian sources via (shallow) autoencoders. Finally, while the results are
proved for Gaussian data, numerical simulations on standard datasets display the
universality of the theoretical predictions.
acknowledgement: Aleksandr Shevchenko, Kevin Kogler and Marco Mondelli are supported
by the 2019 Lopez-Loreta Prize. Hamed Hassani acknowledges the support by the NSF
CIF award (1910056) and the NSF Institute for CORE Emerging Methods in Data Science
(EnCORE).
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Aleksandr
full_name: Shevchenko, Aleksandr
id: F2B06EC2-C99E-11E9-89F0-752EE6697425
last_name: Shevchenko
- first_name: Kevin
full_name: Kögler, Kevin
id: 94ec913c-dc85-11ea-9058-e5051ab2428b
last_name: Kögler
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Shevchenko A, Kögler K, Hassani H, Mondelli M. Fundamental limits of two-layer
autoencoders, and achieving them with gradient methods. In: Proceedings of
the 40th International Conference on Machine Learning. Vol 202. ML Research
Press; 2023:31151-31209.'
apa: 'Shevchenko, A., Kögler, K., Hassani, H., & Mondelli, M. (2023). Fundamental
limits of two-layer autoencoders, and achieving them with gradient methods. In
Proceedings of the 40th International Conference on Machine Learning (Vol.
202, pp. 31151–31209). Honolulu, Hawaii, HI, United States: ML Research Press.'
chicago: Shevchenko, Aleksandr, Kevin Kögler, Hamed Hassani, and Marco Mondelli.
“Fundamental Limits of Two-Layer Autoencoders, and Achieving Them with Gradient
Methods.” In Proceedings of the 40th International Conference on Machine Learning,
202:31151–209. ML Research Press, 2023.
ieee: A. Shevchenko, K. Kögler, H. Hassani, and M. Mondelli, “Fundamental limits
of two-layer autoencoders, and achieving them with gradient methods,” in Proceedings
of the 40th International Conference on Machine Learning, Honolulu, Hawaii,
HI, United States, 2023, vol. 202, pp. 31151–31209.
ista: 'Shevchenko A, Kögler K, Hassani H, Mondelli M. 2023. Fundamental limits of
two-layer autoencoders, and achieving them with gradient methods. Proceedings
of the 40th International Conference on Machine Learning. ICML: International
Conference on Machine Learning, PMLR, vol. 202, 31151–31209.'
mla: Shevchenko, Aleksandr, et al. “Fundamental Limits of Two-Layer Autoencoders,
and Achieving Them with Gradient Methods.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 31151–209.
short: A. Shevchenko, K. Kögler, H. Hassani, M. Mondelli, in:, Proceedings of the
40th International Conference on Machine Learning, ML Research Press, 2023, pp.
31151–31209.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2024-09-10T13:03:19Z
day: '30'
department:
- _id: MaMo
- _id: DaAl
external_id:
arxiv:
- '2212.13468'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2212.13468
month: '07'
oa: 1
oa_version: Preprint
page: 31151-31209
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fundamental limits of two-layer autoencoders, and achieving them with gradient
methods
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14460'
abstract:
- lang: eng
text: We provide an efficient implementation of the backpropagation algorithm, specialized
to the case where the weights of the neural network being trained are sparse.
Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and
common layer types (e.g., convolutional or linear). We provide a fast vectorized
implementation on commodity CPUs, and show that it can yield speedups in end-to-end
runtime experiments, both in transfer learning using already-sparsified networks,
and in training sparse networks from scratch. Thus, our results provide the first
support for sparse training on commodity hardware.
acknowledgement: 'We would like to thank Elias Frantar for his valuable assistance
and support at the outset of this project, and the anonymous ICML and SNN reviewers
for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant
agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant
805223 ScaleML. '
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Mahdi
full_name: Nikdan, Mahdi
id: 66374281-f394-11eb-9cf6-869147deecc0
last_name: Nikdan
- first_name: Tommaso
full_name: Pegolotti, Tommaso
last_name: Pegolotti
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient
sparse backpropagation for faster training of neural networks at the edge. In:
Proceedings of the 40th International Conference on Machine Learning. Vol
202. ML Research Press; 2023:26215-26227.'
apa: 'Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A.
(2023). SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge. In Proceedings of the 40th International Conference on
Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United
States: ML Research Press.'
chicago: 'Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and
Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” In Proceedings of the 40th International
Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.'
ieee: 'M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge,” in Proceedings of the 40th International Conference on Machine Learning,
Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.'
ista: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge. Proceedings of the 40th International Conference on Machine Learning. ICML:
International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.'
mla: 'Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.'
short: M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings
of the 40th International Conference on Machine Learning, ML Research Press, 2023,
pp. 26215–26227.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2023-10-31T09:33:51Z
day: '30'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2302.04852'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.04852
month: '07'
oa: 1
oa_version: Preprint
page: 26215-26227
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14461'
abstract:
- lang: eng
text: 'Communication-reduction techniques are a popular way to improve scalability
in data-parallel training of deep neural networks (DNNs). The recent emergence
of large language models such as GPT has created the need for new approaches to
exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training
is highly popular, yet it still encounters scalability bottlenecks. One reason
is that applying compression techniques to FSDP is challenging: as the vast majority
of the communication involves the model’s weights, direct compression alters convergence
and leads to accuracy loss. We present QSDP, a variant of FSDP which supports
both gradient and weight quantization with theoretical guarantees, is simple to
implement and has essentially no overheads. To derive QSDP we prove that a natural
modification of SGD achieves convergence even when we only maintain quantized
weights, and thus the domain over which we train consists of quantized points
and is, therefore, highly non-convex. We validate this approach by training GPT-family
models with up to 1.3 billion parameters on a multi-node cluster. Experiments
show that QSDP preserves model accuracy, while completely removing the communication
bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: The authors gratefully acknowledge funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML), as well as experimental support from the IST
Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois
Schloegl. AV acknowledges the support of the French Agence Nationale de la Recherche
(ANR), under grant ANR-21-CE48-0016 (project COMCOPT), the support of Fondation
Hadamard with a PRMO grant, and the support of CNRS with a CoopIntEER IEA grant
(project ALFRED).
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Qi
full_name: Guo, Qi
last_name: Guo
- 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: 'Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of
large models with convergence guarantees. In: Proceedings of the 40th International
Conference on Machine Learning. Vol 202. ML Research Press; 2023:24020-24044.'
apa: 'Markov, I., Vladu, A., Guo, Q., & Alistarh, D.-A. (2023). Quantized distributed
training of large models with convergence guarantees. In Proceedings of the
40th International Conference on Machine Learning (Vol. 202, pp. 24020–24044).
Honolulu, Hawaii, HI, United States: ML Research Press.'
chicago: Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized
Distributed Training of Large Models with Convergence Guarantees.” In Proceedings
of the 40th International Conference on Machine Learning, 202:24020–44. ML
Research Press, 2023.
ieee: I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training
of large models with convergence guarantees,” in Proceedings of the 40th International
Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023,
vol. 202, pp. 24020–24044.
ista: 'Markov I, Vladu A, Guo Q, Alistarh D-A. 2023. Quantized distributed training
of large models with convergence guarantees. Proceedings of the 40th International
Conference on Machine Learning. ICML: International Conference on Machine Learning,
PMLR, vol. 202, 24020–24044.'
mla: Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence
Guarantees.” Proceedings of the 40th International Conference on Machine Learning,
vol. 202, ML Research Press, 2023, pp. 24020–44.
short: I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th
International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2023-10-31T09:40:45Z
day: '30'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2302.02390'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.02390
month: '07'
oa: 1
oa_version: Preprint
page: 24020-24044
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantized distributed training of large models with convergence guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14462'
abstract:
- lang: eng
text: "We study fine-grained error bounds for differentially private algorithms
for counting under continual observation. Our main insight is that the matrix
mechanism when using lower-triangular matrices can be used in the continual observation
model. More specifically, we give an explicit factorization for the counting matrix
Mcount and upper bound the error explicitly. We also give a fine-grained analysis,
specifying the exact constant in the upper bound. Our analysis is based on upper
and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along
the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal
on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large
range of the dimension of Mcount. Furthermore, we are the first to give concrete
error bounds for various problems under continual observation such as binary counting,
maintaining a histogram, releasing an approximately cut-preserving synthetic graph,
many graph-based statistics, and substring and episode counting. Finally, we note
that our result can be used to get a fine-grained error bound for non-interactive
local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private
counting under continual observation. Subsequent to this work, Henzinger et al.
(SODA, 2023) showed that our factorization also achieves fine-grained mean-squared
error."
acknowledgement: "This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures
(MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project
“Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional
funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was
funded by Decanal Research Grant. A part of this work was done when JU was visiting
Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia,
Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta,
and Sarvagya Upadhyay for useful discussions."
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Hendrik
full_name: Fichtenberger, Hendrik
last_name: Fichtenberger
- 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: Jalaj
full_name: Upadhyay, Jalaj
last_name: Upadhyay
citation:
ama: 'Fichtenberger H, Henzinger MH, Upadhyay J. Constant matters: Fine-grained
error bound on differentially private continual observation. In: Proceedings
of the 40th International Conference on Machine Learning. Vol 202. ML Research
Press; 2023:10072-10092.'
apa: 'Fichtenberger, H., Henzinger, M. H., & Upadhyay, J. (2023). Constant matters:
Fine-grained error bound on differentially private continual observation. In Proceedings
of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092).
Honolulu, Hawaii, HI, United States: ML Research Press.'
chicago: 'Fichtenberger, Hendrik, Monika H Henzinger, and Jalaj Upadhyay. “Constant
Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.”
In Proceedings of the 40th International Conference on Machine Learning,
202:10072–92. ML Research Press, 2023.'
ieee: 'H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained
error bound on differentially private continual observation,” in Proceedings
of the 40th International Conference on Machine Learning, Honolulu, Hawaii,
HI, United States, 2023, vol. 202, pp. 10072–10092.'
ista: 'Fichtenberger H, Henzinger MH, Upadhyay J. 2023. Constant matters: Fine-grained
error bound on differentially private continual observation. Proceedings of the
40th International Conference on Machine Learning. ICML: International Conference
on Machine Learning, PMLR, vol. 202, 10072–10092.'
mla: 'Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound
on Differentially Private Continual Observation.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.'
short: H. Fichtenberger, M.H. Henzinger, J. Upadhyay, in:, Proceedings of the 40th
International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-07-15T12:51:52Z
day: '30'
department:
- _id: MoHe
ec_funded: 1
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf
month: '07'
oa: 1
oa_version: Published Version
page: 10072-10092
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Wittgenstein Award - Monika Henzinger
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: 'P33775 '
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Constant matters: Fine-grained error bound on differentially private continual
observation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14463'
abstract:
- lang: eng
text: Inversions are thought to play a key role in adaptation and speciation, suppressing
recombination between diverging populations. Genes influencing adaptive traits
cluster in inversions, and changes in inversion frequencies are associated with
environmental differences. However, in many organisms, it is unclear if inversions
are geographically and taxonomically widespread. The intertidal snail, Littorina
saxatilis, is one such example. Strong associations between putative polymorphic
inversions and phenotypic differences have been demonstrated between two ecotypes
of L. saxatilis in Sweden and inferred elsewhere, but no direct evidence for inversion
polymorphism currently exists across the species range. Using whole genome data
from 107 snails, most inversion polymorphisms were found to be widespread across
the species range. The frequencies of some inversion arrangements were significantly
different among ecotypes, suggesting a parallel adaptive role. Many inversions
were also polymorphic in the sister species, L. arcana, hinting at an ancient
origin.
acknowledgement: We would like to thank members of the Littorina team for their advice
and feedback during this project. In particular, we thank Alan Le Moan, who inspired
us to look at heterozygosity differences to identify inversions, and Katherine Hearn
for helping with the PCA scripts. We thank Edinburgh Genomics for library preparation
and sequencing. Sample collections, sequencing and data preparation were supported
by the European Research Council (ERC-2015-AdG-693030- BARRIERS) and the Natural
Environment Research Council (NE/P001610/1). The analysis was supported by the Swedish
Research Council (vetenskaprådet; 2018-03695_VR) and the Portuguese Foundation for
Science and Technology (Fundación para a Ciência e Tecnologia) through a research
project (PTDC/BIA-EVL/1614/2021) and CEEC contract (2020.00275.CEECIND).
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: James
full_name: Reeve, James
last_name: Reeve
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
- first_name: Eva L.
full_name: Koch, Eva L.
last_name: Koch
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
citation:
ama: Reeve J, Butlin RK, Koch EL, Stankowski S, Faria R. Chromosomal inversion polymorphisms
are widespread across the species ranges of rough periwinkles (Littorina saxatilis
and L. arcana). Molecular Ecology. 2023. doi:10.1111/mec.17160
apa: Reeve, J., Butlin, R. K., Koch, E. L., Stankowski, S., & Faria, R. (2023).
Chromosomal inversion polymorphisms are widespread across the species ranges of
rough periwinkles (Littorina saxatilis and L. arcana). Molecular Ecology.
Wiley. https://doi.org/10.1111/mec.17160
chicago: Reeve, James, Roger K. Butlin, Eva L. Koch, Sean Stankowski, and Rui Faria.
“Chromosomal Inversion Polymorphisms Are Widespread across the Species Ranges
of Rough Periwinkles (Littorina Saxatilis and L. Arcana).” Molecular Ecology.
Wiley, 2023. https://doi.org/10.1111/mec.17160.
ieee: J. Reeve, R. K. Butlin, E. L. Koch, S. Stankowski, and R. Faria, “Chromosomal
inversion polymorphisms are widespread across the species ranges of rough periwinkles
(Littorina saxatilis and L. arcana),” Molecular Ecology. Wiley, 2023.
ista: Reeve J, Butlin RK, Koch EL, Stankowski S, Faria R. 2023. Chromosomal inversion
polymorphisms are widespread across the species ranges of rough periwinkles (Littorina
saxatilis and L. arcana). Molecular Ecology.
mla: Reeve, James, et al. “Chromosomal Inversion Polymorphisms Are Widespread across
the Species Ranges of Rough Periwinkles (Littorina Saxatilis and L. Arcana).”
Molecular Ecology, Wiley, 2023, doi:10.1111/mec.17160.
short: J. Reeve, R.K. Butlin, E.L. Koch, S. Stankowski, R. Faria, Molecular Ecology
(2023).
date_created: 2023-10-29T23:01:17Z
date_published: 2023-10-16T00:00:00Z
date_updated: 2023-12-13T13:05:27Z
day: '16'
department:
- _id: NiBa
doi: 10.1111/mec.17160
external_id:
isi:
- '001085119000001'
pmid:
- '37843465'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/mec.17160
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: Molecular Ecology
publication_identifier:
eissn:
- 1365-294X
issn:
- 0962-1083
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chromosomal inversion polymorphisms are widespread across the species ranges
of rough periwinkles (Littorina saxatilis and L. arcana)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14464'
abstract:
- lang: eng
text: 'Given a triangle Δ, we study the problem of determining the smallest enclosing
and largest embedded isosceles triangles of Δ with respect to area and perimeter.
This problem was initially posed by Nandakumar [17, 22] and was first studied
by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles
triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present
paper, we prove that for any triangle Δ, every maximum area isosceles triangle
embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares
a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter
enclosing triangles is different: there are infinite families of triangles Δ whose
minimum perimeter isosceles containers do not share a side and an angle with Δ.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Áron
full_name: Ambrus, Áron
last_name: Ambrus
- first_name: Mónika
full_name: Csikós, Mónika
last_name: Csikós
- first_name: Gergely
full_name: Kiss, Gergely
last_name: Kiss
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Gábor
full_name: Somlai, Gábor
last_name: Somlai
citation:
ama: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
2023;34(7):737-760. doi:10.1142/S012905412342008X
apa: Ambrus, Á., Csikós, M., Kiss, G., Pach, J., & Somlai, G. (2023). Optimal
embedded and enclosing isosceles triangles. International Journal of Foundations
of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S012905412342008X
chicago: Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai.
“Optimal Embedded and Enclosing Isosceles Triangles.” International Journal
of Foundations of Computer Science. World Scientific Publishing, 2023. https://doi.org/10.1142/S012905412342008X.
ieee: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and
enclosing isosceles triangles,” International Journal of Foundations of Computer
Science, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.
ista: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
34(7), 737–760.
mla: Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.”
International Journal of Foundations of Computer Science, vol. 34, no.
7, World Scientific Publishing, 2023, pp. 737–60, doi:10.1142/S012905412342008X.
short: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal
of Foundations of Computer Science 34 (2023) 737–760.
date_created: 2023-10-29T23:01:18Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2023-12-13T13:04:55Z
day: '05'
department:
- _id: HeEd
doi: 10.1142/S012905412342008X
external_id:
arxiv:
- '2205.11637'
isi:
- '001080874400001'
intvolume: ' 34'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2205.11637
month: '10'
oa: 1
oa_version: Preprint
page: 737-760
publication: International Journal of Foundations of Computer Science
publication_identifier:
eissn:
- 1793-6373
issn:
- 0129-0541
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal embedded and enclosing isosceles triangles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2023'
...
---
_id: '14466'
abstract:
- lang: eng
text: The first long-lived turbulent structures observable in planar shear flows
take the form of localized stripes, inclined with respect to the mean flow direction.
The dynamics of these stripes is central to transition, and recent studies proposed
an analogy to directed percolation where the stripes’ proliferation is ultimately
responsible for the turbulence becoming sustained. In the present study we focus
on the internal stripe dynamics as well as on the eventual stripe expansion, and
we compare the underlying mechanisms in pressure- and shear-driven planar flows,
respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities
of the overall laminar–turbulence patterns, the stripe proliferation processes
in the two cases are fundamentally different. Starting from the growth and sustenance
of individual stripes, we find that in plane-Couette flow new streaks are created
stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation
is deterministic and occurs locally at the downstream tip. Because of the up/downstream
symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and
two strong laminar turbulent interfaces. These differences in symmetry as well
as in internal growth give rise to two fundamentally different stripe splitting
mechanisms. In plane-Poiseuille flow splitting is connected to the elongational
growth of the original stripe, and it results from a break-off/shedding of the
stripe's tail. In plane-Couette flow splitting follows from a broadening of the
original stripe and a division along the stripe into two slimmer stripes.
acknowledgement: E.M. acknowledges funding from the ISTplus fellowship programme.
G.Y. and B.H. acknowledge a grant from the Simons Foundation (662960, BH).
article_number: A21
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Elena
full_name: Marensi, Elena
id: 0BE7553A-1004-11EA-B805-18983DDC885E
last_name: Marensi
orcid: 0000-0001-7173-4923
- first_name: Gökhan
full_name: Yalniz, Gökhan
id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
last_name: Yalniz
orcid: 0000-0002-8490-9312
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Marensi E, Yalniz G, Hof B. Dynamics and proliferation of turbulent stripes
in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics.
2023;974. doi:10.1017/jfm.2023.780
apa: Marensi, E., Yalniz, G., & Hof, B. (2023). Dynamics and proliferation of
turbulent stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid
Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2023.780
chicago: Marensi, Elena, Gökhan Yalniz, and Björn Hof. “Dynamics and Proliferation
of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” Journal
of Fluid Mechanics. Cambridge University Press, 2023. https://doi.org/10.1017/jfm.2023.780.
ieee: E. Marensi, G. Yalniz, and B. Hof, “Dynamics and proliferation of turbulent
stripes in plane-Poiseuille and plane-Couette flows,” Journal of Fluid Mechanics,
vol. 974. Cambridge University Press, 2023.
ista: Marensi E, Yalniz G, Hof B. 2023. Dynamics and proliferation of turbulent
stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics.
974, A21.
mla: Marensi, Elena, et al. “Dynamics and Proliferation of Turbulent Stripes in
Plane-Poiseuille and Plane-Couette Flows.” Journal of Fluid Mechanics,
vol. 974, A21, Cambridge University Press, 2023, doi:10.1017/jfm.2023.780.
short: E. Marensi, G. Yalniz, B. Hof, Journal of Fluid Mechanics 974 (2023).
date_created: 2023-10-30T09:32:28Z
date_published: 2023-11-10T00:00:00Z
date_updated: 2024-02-15T09:06:23Z
day: '10'
ddc:
- '530'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1017/jfm.2023.780
external_id:
arxiv:
- '2212.12406'
isi:
- '001088363700001'
file:
- access_level: open_access
checksum: 17c64c1fb0d5f73252364bf98b0b9e1a
content_type: application/pdf
creator: dernst
date_created: 2024-02-15T09:05:21Z
date_updated: 2024-02-15T09:05:21Z
file_id: '14996'
file_name: 2023_JourFluidMechanics_Marensi.pdf
file_size: 2804641
relation: main_file
success: 1
file_date_updated: 2024-02-15T09:05:21Z
has_accepted_license: '1'
intvolume: ' 974'
isi: 1
keyword:
- turbulence
- transition to turbulence
- patterns
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
grant_number: '662960'
name: 'Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental
Studies on Transitional and Turbulent Flows'
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- 1469-7645
issn:
- 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
status: public
title: Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette
flows
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: 974
year: '2023'
...
---
_id: '14472'
abstract:
- lang: eng
text: "Data related to the following paper:\r\n\"Stress granules plug and stabilize
damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract:
\r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic
cells. To cope with this threat, cells possess mechanisms that repair the damage
and restore cellular homeostasis. Endomembrane damage also results in organelle
instability and the mechanisms by which cells stabilize damaged endomembranes
to enable membrane repair remains unknown. In this work we use a minimal coarse-grained
molecular dynamics system to explore how lipid vesicles undergoing poration in
a protein-rich medium can be plugged and stabilised by condensate formation. The
solution of proteins in and out of the vesicle is described by beads dispersed
in implicit solvent. The membrane is described as a one-bead-thick fluid elastic
layer of mechanical properties that mimic biological membranes. We tune the interactions
between solution beads in the different compartments to capture the differences
between the cytoplasmic and endosomal protein solutions and explore how the system
responds to different degrees of membrane poration. We find that, in the right
interaction regime, condensates form rapidly at the damage site upon solution
mixing and act as a plug that prevents futher mixing and destabilisation of the
vesicle. Further, when the condensate can interact with the membrane (wetting
interactions) we find that it mediates pore sealing and membrane repair. This
research is part of the work published in \"Stress granules plug and stabilize
damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w."
article_processing_charge: No
author:
- first_name: Christian Eduardo
full_name: Vanhille-Campos, Christian Eduardo
id: 3adeca52-9313-11ed-b1ac-c170b2505714
last_name: Vanhille-Campos
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal
membranes. 2023. doi:10.15479/AT:ISTA:14472
apa: Vanhille-Campos, C. E., & Šarić, A. (2023). Stress granules plug and stabilize
damaged endolysosomal membranes. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:14472
chicago: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules
Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and
Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:14472.
ieee: C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged
endolysosomal membranes.” Institute of Science and Technology Austria, 2023.
ista: Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged
endolysosomal membranes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14472.
mla: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. Stress Granules Plug
and Stabilize Damaged Endolysosomal Membranes. Institute of Science and Technology
Austria, 2023, doi:10.15479/AT:ISTA:14472.
short: C.E. Vanhille-Campos, A. Šarić, (2023).
date_created: 2023-10-30T16:38:32Z
date_published: 2023-10-31T00:00:00Z
date_updated: 2023-11-27T09:05:07Z
day: '31'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.15479/AT:ISTA:14472
file:
- access_level: open_access
checksum: a18706e952e8660c51ede52a167270b7
content_type: application/zip
creator: ipalaia
date_created: 2023-10-30T16:31:08Z
date_updated: 2023-10-30T16:31:08Z
file_id: '14473'
file_name: SGporecondensation-main.zip
file_size: 62821432
relation: main_file
success: 1
- access_level: open_access
checksum: 389eab31c6509dbc05795017fb618758
content_type: text/plain
creator: dernst
date_created: 2023-10-31T08:57:50Z
date_updated: 2023-10-31T08:57:50Z
file_id: '14474'
file_name: README.txt
file_size: 1697
relation: main_file
success: 1
file_date_updated: 2023-10-31T08:57:50Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '10'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '14610'
relation: used_in_publication
status: public
status: public
title: Stress granules plug and stabilize damaged endolysosomal membranes
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14478'
abstract:
- lang: eng
text: Entire chromosomes are typically only transmitted vertically from one generation
to the next. The horizontal transfer of such chromosomes has long been considered
improbable, yet gained recent support in several pathogenic fungi where it may
affect the fitness or host specificity. To date, it is unknown how these transfers
occur, how common they are and whether they can occur between different species.
In this study, we show multiple independent instances of horizontal transfers
of the same accessory chromosome between two distinct strains of the asexual entomopathogenic
fungusMetarhizium robertsiiduring experimental co-infection
of its insect host, the Argentine ant. Notably, only the one chromosome – but
no other – was transferred from the donor to the recipient strain. The recipient
strain, now harboring the accessory chromosome, exhibited a competitive advantage
under certain host conditions. By phylogenetic analysis we further demonstrate
that the same accessory chromosome was horizontally transferred in a natural environment
betweenM. robertsiiand another congeneric insect pathogen,M.
guizhouense. Hence horizontal chromosome transfer is not limited
to the observed frequent events within species during experimental infections
but also occurs naturally across species. The transferred accessory chromosome
contains genes that might be involved in its preferential horizontal transfer,
encoding putative histones and histone-modifying enzymes, but also putative virulence
factors that may support its establishment. Our study reveals that both intra-
and interspecies horizontal transfer of entire chromosomes is more frequent than
previously assumed, likely representing a not uncommon mechanism for gene exchange.Significance
StatementThe enormous success of bacterial pathogens has
been attributed to their ability to exchange genetic material between one another.
Similarly, in eukaryotes, horizontal transfer of genetic material allowed the
spread of virulence factors across species. The horizontal transfer of whole chromosomes
could be an important pathway for such exchange of genetic material, but little
is known about the origin of transferable chromosomes and how frequently they
are exchanged. Here, we show that the transfer of accessory chromosomes - chromosomes
that are non-essential but may provide fitness benefits - is common during fungal
co-infections and is even possible between distant pathogenic species, highlighting
the importance of horizontal gene transfer via chromosome transfer also for the
evolution and function of eukaryotic pathogens.
acknowledgement: We thank Bernhardt Steinwender, Jorgen Eilenberg and Nicolai V. Meyling
for the fungal strains. We further thank Chengshu Wang for providing the short sequencing
reads for M. guizhouense ARESF977 he used for his published genome assembly, and
Kristian Ullrich for help in the bioinformatics analysis for methylation pattern
in Nanopore reads, and the Vienna BioCenter and the Max Planck Society for the use
of their sequencing centers. We thank Barbara Milutinović and Hinrich Schulenburg
for discussion, and Tal Dagan and Jens Rolff for comments on a previous version
of the manuscript. Fig1 A was created with BioRender.com. This study received funding
by the European Research Council (ERC) under the European Union’s Horizon 2020 Research
and Innovation Programme (No. 771402; EPIDEMICSonCHIP) to S.C. and by the German
Research Foundation (DFG grant HA9263/1-1) to M.H.
article_processing_charge: No
author:
- first_name: Michael
full_name: Habig, Michael
last_name: Habig
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Judith
full_name: Müller, Judith
last_name: Müller
- first_name: Eva H.
full_name: Stukenbrock, Eva H.
last_name: Stukenbrock
- first_name: Hanna
full_name: Leitner, Hanna
id: 8fc5c6f6-5903-11ec-abad-c83f046253e7
last_name: Leitner
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Habig M, Grasse AV, Müller J, Stukenbrock EH, Leitner H, Cremer S. Frequent
horizontal chromosome transfer between asexual fungal insect pathogens. bioRxiv.
doi:10.1101/2023.09.18.558174
apa: Habig, M., Grasse, A. V., Müller, J., Stukenbrock, E. H., Leitner, H., &
Cremer, S. (n.d.). Frequent horizontal chromosome transfer between asexual fungal
insect pathogens. bioRxiv. https://doi.org/10.1101/2023.09.18.558174
chicago: Habig, Michael, Anna V Grasse, Judith Müller, Eva H. Stukenbrock, Hanna
Leitner, and Sylvia Cremer. “Frequent Horizontal Chromosome Transfer between Asexual
Fungal Insect Pathogens.” BioRxiv, n.d. https://doi.org/10.1101/2023.09.18.558174.
ieee: M. Habig, A. V. Grasse, J. Müller, E. H. Stukenbrock, H. Leitner, and S. Cremer,
“Frequent horizontal chromosome transfer between asexual fungal insect pathogens,”
bioRxiv. .
ista: Habig M, Grasse AV, Müller J, Stukenbrock EH, Leitner H, Cremer S. Frequent
horizontal chromosome transfer between asexual fungal insect pathogens. bioRxiv,
10.1101/2023.09.18.558174.
mla: Habig, Michael, et al. “Frequent Horizontal Chromosome Transfer between Asexual
Fungal Insect Pathogens.” BioRxiv, doi:10.1101/2023.09.18.558174.
short: M. Habig, A.V. Grasse, J. Müller, E.H. Stukenbrock, H. Leitner, S. Cremer,
BioRxiv (n.d.).
date_created: 2023-10-31T13:30:00Z
date_published: 2023-09-19T00:00:00Z
date_updated: 2023-11-07T11:20:54Z
day: '19'
department:
- _id: SyCr
doi: 10.1101/2023.09.18.558174
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2023.09.18.558174
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 2649B4DE-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '771402'
name: Epidemics in ant societies on a chip
publication: bioRxiv
publication_status: submitted
status: public
title: Frequent horizontal chromosome transfer between asexual fungal insect pathogens
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14484'
abstract:
- lang: eng
text: Intercellular signaling molecules, known as morphogens, act at a long range
in developing tissues to provide spatial information and control properties such
as cell fate and tissue growth. The production, transport, and removal of morphogens
shape their concentration profiles in time and space. Downstream signaling cascades
and gene regulatory networks within cells then convert the spatiotemporal morphogen
profiles into distinct cellular responses. Current challenges are to understand
the diverse molecular and cellular mechanisms underlying morphogen gradient formation,
as well as the logic of downstream regulatory circuits involved in morphogen interpretation.
This knowledge, combining experimental and theoretical results, is essential to
understand emerging properties of morphogen-controlled systems, such as robustness
and scaling.
acknowledgement: We are grateful to Zena Hadjivasiliou for comments on this article.
A.K. is supported by grants from the European Research Council under the European
Union (EU) Horizon 2020 research and innovation program (680037) and Horizon Europe
(101044579), and the Austrian Science Fund (F78) (Stem Cell Modulation). J.B. is
supported by the Francis Crick Institute, which receives its core funding from Cancer
Research UK (CC001051), the UK Medical Research Council (CC001051), and the Wellcome
Trust (CC001051), and by a grant from the European Research Council under the EU
Horizon 2020 research and innovation program (742138).
article_processing_charge: Yes (in subscription journal)
article_type: review
author:
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
citation:
ama: Kicheva A, Briscoe J. Control of tissue development by morphogens. Annual
Review of Cell and Developmental Biology. 2023;39:91-121. doi:10.1146/annurev-cellbio-020823-011522
apa: Kicheva, A., & Briscoe, J. (2023). Control of tissue development by morphogens.
Annual Review of Cell and Developmental Biology. Annual Reviews. https://doi.org/10.1146/annurev-cellbio-020823-011522
chicago: Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.”
Annual Review of Cell and Developmental Biology. Annual Reviews, 2023.
https://doi.org/10.1146/annurev-cellbio-020823-011522.
ieee: A. Kicheva and J. Briscoe, “Control of tissue development by morphogens,”
Annual Review of Cell and Developmental Biology, vol. 39. Annual Reviews,
pp. 91–121, 2023.
ista: Kicheva A, Briscoe J. 2023. Control of tissue development by morphogens. Annual
Review of Cell and Developmental Biology. 39, 91–121.
mla: Kicheva, Anna, and James Briscoe. “Control of Tissue Development by Morphogens.”
Annual Review of Cell and Developmental Biology, vol. 39, Annual Reviews,
2023, pp. 91–121, doi:10.1146/annurev-cellbio-020823-011522.
short: A. Kicheva, J. Briscoe, Annual Review of Cell and Developmental Biology 39
(2023) 91–121.
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-16T00:00:00Z
date_updated: 2023-11-06T09:56:24Z
day: '16'
ddc:
- '570'
department:
- _id: AnKi
doi: 10.1146/annurev-cellbio-020823-011522
ec_funded: 1
external_id:
pmid:
- '37418774'
file:
- access_level: open_access
checksum: 461726014cf5907010afbd418d3c13ec
content_type: application/pdf
creator: dernst
date_created: 2023-11-06T09:47:50Z
date_updated: 2023-11-06T09:47:50Z
file_id: '14491'
file_name: 2023_AnnualReviews_Kicheva.pdf
file_size: 434819
relation: main_file
success: 1
file_date_updated: 2023-11-06T09:47:50Z
has_accepted_license: '1'
intvolume: ' 39'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 91-121
pmid: 1
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
- _id: bd7e737f-d553-11ed-ba76-d69ffb5ee3aa
grant_number: '101044579'
name: Mechanisms of tissue size regulation in spinal cord development
- _id: 059DF620-7A3F-11EA-A408-12923DDC885E
grant_number: F07802
name: Morphogen control of growth and pattern in the spinal cord
publication: Annual Review of Cell and Developmental Biology
publication_identifier:
eissn:
- 1530-8995
issn:
- 1081-0706
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Control of tissue development by morphogens
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: 39
year: '2023'
...
---
_id: '14485'
abstract:
- lang: eng
text: "Batching is a technique that stores multiple keys/values in each node of
a data structure. In sequential search data structures, batching reduces latency
by reducing the number of cache misses and shortening the chain of pointers to
dereference. Applying batching to concurrent data structures is challenging, because
it is difficult to maintain the search property and keep contention low in the
presence of batching.\r\nIn this paper, we present a general methodology for leveraging
batching in concurrent search data structures, called BatchBoost. BatchBoost builds
a search data structure from distinct \"data\" and \"index\" layers. The data
layer’s purpose is to store a batch of key/value pairs in each of its nodes. The
index layer uses an unmodified concurrent search data structure to route operations
to a position in the data layer that is \"close\" to where the corresponding key
should exist. The requirements on the index and data layers are low: with minimal
effort, we were able to compose three highly scalable concurrent search data structures
based on three original data structures as the index layers with a batched version
of the Lazy List as the data layer. The resulting BatchBoost data structures provide
significant performance improvements over their original counterparts."
alternative_title:
- LIPIcs
article_number: '35'
article_processing_charge: Yes
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Michael
full_name: Anoprenko, Michael
last_name: Anoprenko
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Michael
full_name: Spear, Michael
last_name: Spear
citation:
ama: 'Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost:
Universal batching for concurrent data structures. In: 37th International Symposium
on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35'
apa: 'Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement:
BatchBoost: Universal batching for concurrent data structures. In 37th International
Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35'
chicago: 'Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear.
“Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.”
In 37th International Symposium on Distributed Computing, Vol. 281. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35.'
ieee: 'V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement:
BatchBoost: Universal batching for concurrent data structures,” in 37th International
Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.'
ista: 'Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost:
Universal batching for concurrent data structures. 37th International Symposium
on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol.
281, 35.'
mla: 'Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching
for Concurrent Data Structures.” 37th International Symposium on Distributed
Computing, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023, doi:10.4230/LIPIcs.DISC.2023.35.'
short: V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium
on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
conference:
end_date: 2023-10-13
location: L'Aquila, Italy
name: 'DISC: Symposium on Distributed Computing'
start_date: 2023-10-09
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2023-11-07T07:48:01Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
doi: 10.4230/LIPIcs.DISC.2023.35
file:
- access_level: open_access
checksum: d9f8d2915cccdf2df5905b7cd1b4a560
content_type: application/pdf
creator: dernst
date_created: 2023-11-06T11:45:21Z
date_updated: 2023-11-06T11:45:21Z
file_id: '14492'
file_name: 2023_LIPIcs_Aksenov.pdf
file_size: 646665
relation: main_file
success: 1
file_date_updated: 2023-11-06T11:45:21Z
has_accepted_license: '1'
intvolume: ' 281'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: 37th International Symposium on Distributed Computing
publication_identifier:
isbn:
- '9783959773010'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief announcement: BatchBoost: Universal batching for concurrent data structures'
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: 281
year: '2023'
...
---
_id: '14486'
abstract:
- lang: eng
text: We present a minimal model of ferroelectric large polarons, which are suggested
as one of the mechanisms responsible for the unique charge transport properties
of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions
lead to long-range ferroelectric ordering of rotors, which strongly affects the
carrier mobility. In the nonperturbative regime, where our theory cannot be reduced
to any of the earlier models, we reveal that the polaron is characterized by large
coherence length and a roughly tenfold increase of the effective mass as compared
to the bare mass. These results are in good agreement with other theoretical predictions
for ferroelectric polarons. Our model establishes a general phenomenological framework
for ferroelectric polarons providing the starting point for future studies of
their role in the transport properties of hybrid organic-inorganic perovskites.
acknowledgement: We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful
discussions and comments. This project received funding from the European Union’s
Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 101034413. M.L. acknowledges support by the European Research
Council (ERC) Starting Grant No. 801770 (ANGULON).
article_number: '043016'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Georgios
full_name: Koutentakis, Georgios
id: d7b23d3a-9e21-11ec-b482-f76739596b95
last_name: Koutentakis
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric
large polarons. Physical Review Research. 2023;5(4). doi:10.1103/PhysRevResearch.5.043016
apa: Koutentakis, G., Ghazaryan, A., & Lemeshko, M. (2023). Rotor lattice model
of ferroelectric large polarons. Physical Review Research. American Physical
Society. https://doi.org/10.1103/PhysRevResearch.5.043016
chicago: Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice
Model of Ferroelectric Large Polarons.” Physical Review Research. American
Physical Society, 2023. https://doi.org/10.1103/PhysRevResearch.5.043016.
ieee: G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric
large polarons,” Physical Review Research, vol. 5, no. 4. American Physical
Society, 2023.
ista: Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric
large polarons. Physical Review Research. 5(4), 043016.
mla: Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.”
Physical Review Research, vol. 5, no. 4, 043016, American Physical Society,
2023, doi:10.1103/PhysRevResearch.5.043016.
short: G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2023-11-07T07:53:39Z
day: '05'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/PhysRevResearch.5.043016
ec_funded: 1
external_id:
arxiv:
- '2301.09875'
file:
- access_level: open_access
checksum: cb8de8fed6e09df1a18bd5a5aec5c55c
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T07:52:46Z
date_updated: 2023-11-07T07:52:46Z
file_id: '14493'
file_name: 2023_PhysReviewResearch_Koutentakis.pdf
file_size: 1127522
relation: main_file
success: 1
file_date_updated: 2023-11-07T07:52:46Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rotor lattice model of ferroelectric large polarons
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: 5
year: '2023'
...
---
_id: '14487'
abstract:
- lang: eng
text: High Mountain Asia (HMA) is among the most vulnerable water towers globally
and yet future projections of water availability in and from its high-mountain
catchments remain uncertain, as their hydrologic response to ongoing environmental
changes is complex. Mechanistic modeling approaches incorporating cryospheric,
hydrological, and vegetation processes in high spatial, temporal, and physical
detail have never been applied for high-elevation catchments of HMA. We use a
land surface model at high spatial and temporal resolution (100 m and hourly)
to simulate the coupled dynamics of energy, water, and vegetation for the 350
km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological
year against a large set of observations to gain insight into the partitioning
of the water balance at the subseasonal scale and across elevation bands. During
the simulated hydrological year, we find that evapotranspiration is a key component
of the total water balance, as it causes about the equivalent of 20% of all the
available precipitation or 154% of the water production from glacier melt in the
basin to return directly to the atmosphere. The depletion of the cryospheric water
budget is dominated by snow melt, but at high elevations is primarily dictated
by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%)
at the catchment scale, accounting for the equivalent of 11% of snowfall, 17%
of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should
consider sublimation and other evaporative fluxes explicitly, as otherwise water
balance estimates can be ill-quantified.
acknowledgement: This project has received funding from the JSPS-SNSF (Japan Society
for the Promotion of Science and Swiss National Science Foundation) Bilateral Programmes
project (HOPE, High-ele-vation precipitation in High Mountain Asia; Grant 183633),
and the European Research Council (ERC) under the European Union's Horizon 2020
research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers
in High Mountain Asia; Grant 772751). We want to thank in particular T. Gurung,
S. Joshi, J. Shea, W. Immerzeel, and others involved, as well as ICIMOD, for their
efforts over the past years in observing the meteorology of the Langtang catchment,
collecting and organizing the data and making them publicly available. We also thank
the National Geographic Society (Grant NGS-61784R-19) and the Mount Everest Foundation
(reference 19-24) for providing fieldwork funding for C. L. Fyffe. We thank T. Kramer
for help with the WSL Hyperion cluster. We are grate-ful for comments by three anonymous
reviewers and the Associate Editor, who greatly helped to improve the manuscript
further. Open access funding provided by ETH-Bereich Forschungsanstalten.
article_number: e2022WR033841
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Simone
full_name: Fatichi, Simone
last_name: Fatichi
- first_name: Thomas
full_name: Shaw, Thomas
id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
last_name: Shaw
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Michael
full_name: Mccarthy, Michael
id: 22a2674a-61ce-11ee-94b5-d18813baf16f
last_name: Mccarthy
- first_name: Catriona Louise
full_name: Fyffe, Catriona Louise
id: 001b0422-8d15-11ed-bc51-cab6c037a228
last_name: Fyffe
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Shaoting
full_name: Ren, Shaoting
last_name: Ren
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Achille
full_name: Jouberton, Achille
last_name: Jouberton
- first_name: Jakob
full_name: Steiner, Jakob
last_name: Steiner
- first_name: Koji
full_name: Fujita, Koji
last_name: Fujita
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: 'Buri P, Fatichi S, Shaw T, et al. Land surface modeling in the Himalayas:
On the importance of evaporative fluxes for the water balance of a high-elevation
catchment. Water Resources Research. 2023;59(10). doi:10.1029/2022WR033841'
apa: 'Buri, P., Fatichi, S., Shaw, T., Miles, E. S., McCarthy, M., Fyffe, C. L.,
… Pellicciotti, F. (2023). Land surface modeling in the Himalayas: On the importance
of evaporative fluxes for the water balance of a high-elevation catchment. Water
Resources Research. Wiley. https://doi.org/10.1029/2022WR033841'
chicago: 'Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan S. Miles, Michael McCarthy,
Catriona Louise Fyffe, Stefan Fugger, et al. “Land Surface Modeling in the Himalayas:
On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation
Catchment.” Water Resources Research. Wiley, 2023. https://doi.org/10.1029/2022WR033841.'
ieee: 'P. Buri et al., “Land surface modeling in the Himalayas: On the importance
of evaporative fluxes for the water balance of a high-elevation catchment,” Water
Resources Research, vol. 59, no. 10. Wiley, 2023.'
ista: 'Buri P, Fatichi S, Shaw T, Miles ES, McCarthy M, Fyffe CL, Fugger S, Ren
S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Land surface
modeling in the Himalayas: On the importance of evaporative fluxes for the water
balance of a high-elevation catchment. Water Resources Research. 59(10), e2022WR033841.'
mla: 'Buri, Pascal, et al. “Land Surface Modeling in the Himalayas: On the Importance
of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water
Resources Research, vol. 59, no. 10, e2022WR033841, Wiley, 2023, doi:10.1029/2022WR033841.'
short: P. Buri, S. Fatichi, T. Shaw, E.S. Miles, M. McCarthy, C.L. Fyffe, S. Fugger,
S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, Water
Resources Research 59 (2023).
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-25T00:00:00Z
date_updated: 2023-11-07T08:12:34Z
day: '25'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.1029/2022WR033841
file:
- access_level: open_access
checksum: 7ba9c87228dc09029b16bc800a0ef1a1
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T08:10:44Z
date_updated: 2023-11-07T08:10:44Z
file_id: '14495'
file_name: 2023_WaterResourcesResearch_Buri.pdf
file_size: 5554901
relation: main_file
success: 1
file_date_updated: 2023-11-07T08:10:44Z
has_accepted_license: '1'
intvolume: ' 59'
issue: '10'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '14494'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Land surface modeling in the Himalayas: On the importance of evaporative fluxes
for the water balance of a high-elevation catchment'
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: 59
year: '2023'
...
---
_id: '14488'
abstract:
- lang: eng
text: 'Portrait viewpoint and illumination editing is an important problem with
several applications in VR/AR, movies, and photography. Comprehensive knowledge
of geometry and illumination is critical for obtaining photorealistic results.
Current methods are unable to explicitly model in 3D while handling both viewpoint
and illumination editing from a single image. In this paper, we propose VoRF,
a novel approach that can take even a single portrait image as input and relight
human heads under novel illuminations that can be viewed from arbitrary viewpoints.
VoRF represents a human head as a continuous volumetric field and learns a prior
model of human heads using a coordinate-based MLP with individual latent spaces
for identity and illumination. The prior model is learned in an auto-decoder manner
over a diverse class of head shapes and appearances, allowing VoRF to generalize
to novel test identities from a single input image. Additionally, VoRF has a reflectance
MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time
(OLAT) images under novel views. We synthesize novel illuminations by combining
these OLAT images with target environment maps. Qualitative and quantitative evaluations
demonstrate the effectiveness of VoRF for relighting and novel view synthesis,
even when applied to unseen subjects under uncontrolled illumination. This work
is an extension of Rao et al. (VoRF: Volumetric Relightable Faces 2022). We provide
extensive evaluation and ablative studies of our model and also provide an application,
where any face can be relighted using textual input.'
acknowledgement: Open Access funding enabled and organized by Projekt DEAL.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Pramod
full_name: Rao, Pramod
last_name: Rao
- first_name: B. R.
full_name: Mallikarjun, B. R.
last_name: Mallikarjun
- first_name: Gereon
full_name: Fox, Gereon
last_name: Fox
- first_name: Tim
full_name: Weyrich, Tim
last_name: Weyrich
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Wojciech
full_name: Matusik, Wojciech
last_name: Matusik
- first_name: Fangneng
full_name: Zhan, Fangneng
last_name: Zhan
- first_name: Ayush
full_name: Tewari, Ayush
last_name: Tewari
- first_name: Christian
full_name: Theobalt, Christian
last_name: Theobalt
- first_name: Mohamed
full_name: Elgharib, Mohamed
last_name: Elgharib
citation:
ama: Rao P, Mallikarjun BR, Fox G, et al. A deeper analysis of volumetric relightiable
faces. International Journal of Computer Vision. 2023. doi:10.1007/s11263-023-01899-3
apa: Rao, P., Mallikarjun, B. R., Fox, G., Weyrich, T., Bickel, B., Pfister, H.,
… Elgharib, M. (2023). A deeper analysis of volumetric relightiable faces. International
Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-023-01899-3
chicago: Rao, Pramod, B. R. Mallikarjun, Gereon Fox, Tim Weyrich, Bernd Bickel,
Hanspeter Pfister, Wojciech Matusik, et al. “A Deeper Analysis of Volumetric Relightiable
Faces.” International Journal of Computer Vision. Springer Nature, 2023.
https://doi.org/10.1007/s11263-023-01899-3.
ieee: P. Rao et al., “A deeper analysis of volumetric relightiable faces,”
International Journal of Computer Vision. Springer Nature, 2023.
ista: Rao P, Mallikarjun BR, Fox G, Weyrich T, Bickel B, Pfister H, Matusik W, Zhan
F, Tewari A, Theobalt C, Elgharib M. 2023. A deeper analysis of volumetric relightiable
faces. International Journal of Computer Vision.
mla: Rao, Pramod, et al. “A Deeper Analysis of Volumetric Relightiable Faces.” International
Journal of Computer Vision, Springer Nature, 2023, doi:10.1007/s11263-023-01899-3.
short: P. Rao, B.R. Mallikarjun, G. Fox, T. Weyrich, B. Bickel, H. Pfister, W. Matusik,
F. Zhan, A. Tewari, C. Theobalt, M. Elgharib, International Journal of Computer
Vision (2023).
date_created: 2023-11-05T23:00:54Z
date_published: 2023-10-31T00:00:00Z
date_updated: 2023-11-06T08:52:30Z
day: '31'
department:
- _id: BeBi
doi: 10.1007/s11263-023-01899-3
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s11263-023-01899-3
month: '10'
oa: 1
oa_version: Published Version
publication: International Journal of Computer Vision
publication_identifier:
eissn:
- 1573-1405
issn:
- 0920-5691
publication_status: epub_ahead
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A deeper analysis of volumetric relightiable faces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14489'
abstract:
- lang: eng
text: Microwave-optics entanglement is a vital component for building hybrid quantum
networks. Here, a new mechanism for preparing stationary entanglement between
microwave and optical cavity fields in a cavity optomagnomechanical system is
proposed. It consists of a magnon mode in a ferrimagnetic crystal that couples
directly to a microwave cavity mode via the magnetic dipole interaction and indirectly
to an optical cavity through the deformation displacement of the crystal. The
mechanical displacement is induced by the magnetostrictive force and coupled to
the optical cavity via radiation pressure. Both the opto- and magnomechanical
couplings are dispersive. Magnon–phonon entanglement is created via magnomechanical
parametric down-conversion, which is further distributed to optical and microwave
photons via simultaneous optomechanical beamsplitter interaction and electromagnonic
state-swap interaction, yielding stationary microwave-optics entanglement. The
microwave-optics entanglement is robust against thermal noise, which will find
broad potential applications in quantum networks and quantum information processing
with hybrid quantum systems.
acknowledgement: This work was supported by the National Key Research and Development
Program of China (Grant no. 2022YFA1405200), the National Natural Science Foundation
of China (Nos. 92265202), and the European Research Council (ERC CoG Q-ECHOS, 101001005).
article_number: '2200866'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zhi Yuan
full_name: Fan, Zhi Yuan
last_name: Fan
- first_name: Liu
full_name: Qiu, Liu
id: 45e99c0d-1eb1-11eb-9b96-ed8ab2983cac
last_name: Qiu
orcid: 0000-0003-4345-4267
- first_name: Simon
full_name: Gröblacher, Simon
last_name: Gröblacher
- first_name: Jie
full_name: Li, Jie
last_name: Li
citation:
ama: Fan ZY, Qiu L, Gröblacher S, Li J. Microwave-optics entanglement via cavity
optomagnomechanics. Laser and Photonics Reviews. 2023;17(12). doi:10.1002/lpor.202200866
apa: Fan, Z. Y., Qiu, L., Gröblacher, S., & Li, J. (2023). Microwave-optics
entanglement via cavity optomagnomechanics. Laser and Photonics Reviews.
Wiley. https://doi.org/10.1002/lpor.202200866
chicago: Fan, Zhi Yuan, Liu Qiu, Simon Gröblacher, and Jie Li. “Microwave-Optics
Entanglement via Cavity Optomagnomechanics.” Laser and Photonics Reviews.
Wiley, 2023. https://doi.org/10.1002/lpor.202200866.
ieee: Z. Y. Fan, L. Qiu, S. Gröblacher, and J. Li, “Microwave-optics entanglement
via cavity optomagnomechanics,” Laser and Photonics Reviews, vol. 17, no.
12. Wiley, 2023.
ista: Fan ZY, Qiu L, Gröblacher S, Li J. 2023. Microwave-optics entanglement via
cavity optomagnomechanics. Laser and Photonics Reviews. 17(12), 2200866.
mla: Fan, Zhi Yuan, et al. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.”
Laser and Photonics Reviews, vol. 17, no. 12, 2200866, Wiley, 2023, doi:10.1002/lpor.202200866.
short: Z.Y. Fan, L. Qiu, S. Gröblacher, J. Li, Laser and Photonics Reviews 17 (2023).
date_created: 2023-11-05T23:00:54Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2024-01-30T14:36:42Z
day: '01'
department:
- _id: JoFi
doi: 10.1002/lpor.202200866
external_id:
arxiv:
- '2208.10703'
intvolume: ' 17'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2208.10703
month: '12'
oa: 1
oa_version: Preprint
publication: Laser and Photonics Reviews
publication_identifier:
eissn:
- 1863-8899
issn:
- 1863-8880
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Microwave-optics entanglement via cavity optomagnomechanics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2023'
...
---
_id: '14490'
abstract:
- lang: eng
text: Payment channel networks (PCNs) are a promising solution to the scalability
problem of cryptocurrencies. Any two users connected by a payment channel in the
network can theoretically send an unbounded number of instant, costless transactions
between them. Users who are not directly connected can also transact with each
other in a multi-hop fashion. In this work, we study the incentive structure behind
the creation of payment channel networks, particularly from the point of view
of a single user that wants to join the network. We define a utility function
for a new user in terms of expected revenue, expected fees, and the cost of creating
channels, and then provide constant factor approximation algorithms that optimise
the utility function given a certain budget. Additionally, we take a step back
from a single user to the whole network and examine the parameter spaces under
which simple graph topologies form a Nash equilibrium.
acknowledgement: The work was partially supported by the Austrian Science Fund (FWF)
through the project CoRaF (grant 2020388). It was also partially supported by NCN
Grant 2019/35/B/ST6/04138 and ERC Grant 885666.
article_processing_charge: No
arxiv: 1
author:
- first_name: Zeta
full_name: Avarikioti, Zeta
last_name: Avarikioti
- first_name: Tomasz
full_name: Lizurej, Tomasz
last_name: Lizurej
- first_name: Tomasz
full_name: Michalak, Tomasz
last_name: Michalak
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
citation:
ama: 'Avarikioti Z, Lizurej T, Michalak T, Yeo MX. Lightning creation games. In:
43rd International Conference on Distributed Computing Systems. Vol 2023.
IEEE; 2023:603-613. doi:10.1109/ICDCS57875.2023.00037'
apa: 'Avarikioti, Z., Lizurej, T., Michalak, T., & Yeo, M. X. (2023). Lightning
creation games. In 43rd International Conference on Distributed Computing Systems
(Vol. 2023, pp. 603–613). Hong Kong, China: IEEE. https://doi.org/10.1109/ICDCS57875.2023.00037'
chicago: Avarikioti, Zeta, Tomasz Lizurej, Tomasz Michalak, and Michelle X Yeo.
“Lightning Creation Games.” In 43rd International Conference on Distributed
Computing Systems, 2023:603–13. IEEE, 2023. https://doi.org/10.1109/ICDCS57875.2023.00037.
ieee: Z. Avarikioti, T. Lizurej, T. Michalak, and M. X. Yeo, “Lightning creation
games,” in 43rd International Conference on Distributed Computing Systems,
Hong Kong, China, 2023, vol. 2023, pp. 603–613.
ista: 'Avarikioti Z, Lizurej T, Michalak T, Yeo MX. 2023. Lightning creation games.
43rd International Conference on Distributed Computing Systems. ICDCS: International
Conference on Distributed Computing Systems vol. 2023, 603–613.'
mla: Avarikioti, Zeta, et al. “Lightning Creation Games.” 43rd International
Conference on Distributed Computing Systems, vol. 2023, IEEE, 2023, pp. 603–13,
doi:10.1109/ICDCS57875.2023.00037.
short: Z. Avarikioti, T. Lizurej, T. Michalak, M.X. Yeo, in:, 43rd International
Conference on Distributed Computing Systems, IEEE, 2023, pp. 603–613.
conference:
end_date: 2023-07-21
location: Hong Kong, China
name: 'ICDCS: International Conference on Distributed Computing Systems'
start_date: 2023-07-18
date_created: 2023-11-05T23:00:54Z
date_published: 2023-10-11T00:00:00Z
date_updated: 2023-11-30T10:54:51Z
day: '11'
department:
- _id: KrPi
doi: 10.1109/ICDCS57875.2023.00037
external_id:
arxiv:
- '2306.16006'
intvolume: ' 2023'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2306.16006
month: '10'
oa: 1
oa_version: Preprint
page: 603-613
publication: 43rd International Conference on Distributed Computing Systems
publication_identifier:
eissn:
- 2575-8411
isbn:
- '9798350339864'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '14506'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Lightning creation games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2023
year: '2023'
...
---
_id: '14494'
abstract:
- lang: eng
text: "We provide i) gridded initial conditions (.tif), ii) modeled gridded monthly
outputs (.tif), and iii) modeled hourly outputs at the station locations (.txt)
for the hydrological year 2019. Information about the variables and units can
be found in the figures (.png) associated to each dataset. Details about the datasets
can be found in the original publication by Buri and others (2023).\r\n\r\nBuri,
P., Fatichi, S., Shaw, T. E., Miles, E. S., McCarthy, M. J., Fyffe, C. L., ...
& Pellicciotti, F. (2023). Land Surface Modeling in the Himalayas: On the Importance
of Evaporative Fluxes for the Water Balance of a High‐Elevation Catchment. Water
Resources Research, 59(10), e2022WR033841. DOI: 10.1029/2022WR033841"
article_processing_charge: No
author:
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Simone
full_name: Fatichi, Simone
last_name: Fatichi
- first_name: Thomas
full_name: Shaw, Thomas
id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
last_name: Shaw
- first_name: 'Evan '
full_name: 'Miles, Evan '
last_name: Miles
- first_name: Michael
full_name: McCarthy, Michael
id: 22a2674a-61ce-11ee-94b5-d18813baf16f
last_name: McCarthy
- first_name: Catriona Louise
full_name: Fyffe, Catriona Louise
id: 001b0422-8d15-11ed-bc51-cab6c037a228
last_name: Fyffe
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Shaoting
full_name: Ren, Shaoting
last_name: Ren
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Achille
full_name: Jouberton, Achille
last_name: Jouberton
- first_name: Jakob
full_name: Steiner, Jakob
last_name: Steiner
- first_name: Koji
full_name: Fujita, Koji
last_name: Fujita
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: 'Buri P, Fatichi S, Shaw T, et al. Model output data to “Land surface modeling
in the Himalayas: on the importance of evaporative fluxes for the water balance
of a high elevation catchment.” 2023. doi:10.5281/ZENODO.8402426'
apa: 'Buri, P., Fatichi, S., Shaw, T., Miles, E., McCarthy, M., Fyffe, C. L., …
Pellicciotti, F. (2023). Model output data to “Land surface modeling in the Himalayas:
on the importance of evaporative fluxes for the water balance of a high elevation
catchment.” Zenodo. https://doi.org/10.5281/ZENODO.8402426'
chicago: 'Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan Miles, Michael McCarthy,
Catriona Louise Fyffe, Stefan Fugger, et al. “Model Output Data to ‘Land Surface
Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water
Balance of a High Elevation Catchment.’” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8402426.'
ieee: 'P. Buri et al., “Model output data to ‘Land surface modeling in the
Himalayas: on the importance of evaporative fluxes for the water balance of a
high elevation catchment.’” Zenodo, 2023.'
ista: 'Buri P, Fatichi S, Shaw T, Miles E, McCarthy M, Fyffe CL, Fugger S, Ren S,
Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Model output
data to ‘Land surface modeling in the Himalayas: on the importance of evaporative
fluxes for the water balance of a high elevation catchment’, Zenodo, 10.5281/ZENODO.8402426.'
mla: 'Buri, Pascal, et al. Model Output Data to “Land Surface Modeling in the
Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a
High Elevation Catchment.” Zenodo, 2023, doi:10.5281/ZENODO.8402426.'
short: P. Buri, S. Fatichi, T. Shaw, E. Miles, M. McCarthy, C.L. Fyffe, S. Fugger,
S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, (2023).
date_created: 2023-11-07T08:01:39Z
date_published: 2023-10-03T00:00:00Z
date_updated: 2023-11-07T08:12:35Z
day: '03'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.5281/ZENODO.8402426
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://10.5281/ZENODO.8402426
month: '10'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14487'
relation: used_in_publication
status: public
status: public
title: 'Model output data to "Land surface modeling in the Himalayas: on the importance
of evaporative fluxes for the water balance of a high elevation catchment"'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...