---
_id: '11850'
abstract:
- lang: eng
text: 'Modern networked systems are increasingly reconfigurable, enabling demand-aware
infrastructures whose resources can be adjusted according to the workload they
currently serve. Such dynamic adjustments can be exploited to improve network
utilization and hence performance, by moving frequently interacting communication
partners closer, e.g., collocating them in the same server or datacenter. However,
dynamically changing the embedding of workloads is algorithmically challenging:
communication patterns are often not known ahead of time, but must be learned.
During the learning process, overheads related to unnecessary moves (i.e., re-embeddings)
should be minimized. This paper studies a fundamental model which captures the
tradeoff between the benefits and costs of dynamically collocating communication
partners on l servers, in an online manner. Our main contribution is a distributed
online algorithm which is asymptotically almost optimal, i.e., almost matches
the lower bound (also derived in this paper) on the competitive ratio of any (distributed
or centralized) online algorithm.'
article_processing_charge: No
arxiv: 1
author:
- 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: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding.
In: SIGMETRICS’19: International Conference on Measurement and Modeling of
Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503'
apa: 'Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed
workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States:
Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503'
chicago: 'Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed
Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, 43–44. Association for Computing Machinery,
2019. https://doi.org/10.1145/3309697.3331503.'
ieee: 'M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload
(re-)embedding,” in SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.'
ista: 'Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding.
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems, 43–44.'
mla: 'Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.”
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.'
short: 'M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International
Conference on Measurement and Modeling of Computer Systems, Association for Computing
Machinery, 2019, pp. 43–44.'
conference:
end_date: 2019-06-28
location: Phoenix, AZ, United States
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2019-06-24
date_created: 2022-08-16T07:14:57Z
date_published: 2019-06-20T00:00:00Z
date_updated: 2023-02-17T09:41:45Z
day: '20'
doi: 10.1145/3309697.3331503
extern: '1'
external_id:
arxiv:
- '1904.05474'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.05474
month: '06'
oa: 1
oa_version: Preprint
page: 43–44
publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling
of Computer Systems'
publication_identifier:
isbn:
- 978-1-4503-6678-6
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient distributed workload (re-)embedding
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11853'
abstract:
- lang: eng
text: We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate
minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input
set system is undergoing element insertions and deletions. Here, n denotes the
number of elements, each element appears in at most f sets, and the cost of each
set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17],
implies that there is a deterministic algorithm for this problem with O(f log(Cn))
amortized update time and O(min(log n, f)) -approximation ratio, which nearly
matches the polynomial-time hardness of approximation for minimum set cover in
the static setting. Our update time is only O(log (Cn)) away from a trivial lower
bound. Prior to our work, the previous best approximation ratio guaranteed by
deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15].
In contrast, the only result that guaranteed O(f) -approximation was obtained
very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with
(1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the
extra O(f) factor in the update time compared to our and Gupta~et~al.'s results,
the Abboud~et~al.~algorithm is randomized, and works only when the adversary is
oblivious and the sets are unweighted (each set has the same cost). We achieve
our result via the primal-dual approach, by maintaining a fractional packing solution
as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and
Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual
algorithms that try to satisfy some local constraints for individual sets at all
time, our algorithm basically waits until the dual solution changes significantly
globally, and fixes the solution only where the fix is needed.
article_processing_charge: No
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for
dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science.
Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033'
apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic
algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of
Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of
Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New
Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on
Foundations of Computer Science, 406–23. Institute of Electrical and Electronics
Engineers, 2019. https://doi.org/10.1109/focs.2019.00033.
ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm
for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer
Science, Baltimore, MD, United States, 2019, pp. 406–423.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm
for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science.
FOCS: Annual Symposium on Foundations of Computer Science, 406–423.'
mla: Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set
Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute
of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium
on Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2019, pp. 406–423.
conference:
end_date: 2019-11-12
location: Baltimore, MD, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2019-11-09
date_created: 2022-08-16T08:00:00Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-02-17T09:50:37Z
day: '01'
doi: 10.1109/focs.2019.00033
extern: '1'
external_id:
arxiv:
- '1909.11600'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.11600
month: '11'
oa: 1
oa_version: Preprint
page: 406-423
publication: 60th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-7281-4952-3
isbn:
- 978-1-7281-4953-0
issn:
- 2575-8454
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new deterministic algorithm for dynamic set cover
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11865'
abstract:
- lang: eng
text: We present the first sublinear-time algorithm that can compute the edge connectivity
λ of a network exactly on distributed message-passing networks (the CONGEST model),
as long as the network contains no multi-edge. We present the first sublinear-time
algorithm for a distributed message-passing network sto compute its edge connectivity
λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm
takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ
with high probability, where n and D are the number of nodes and the diameter
of the network, respectively, and Õ hides polylogarithmic factors. This running
time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed
algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella
PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14]
or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve
this we develop and combine several new techniques. First, we design the first
distributed algorithm that can compute a k-edge connectivity certificate for any
k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only
when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the
first parallel algorithm with polylogarithmic depth and near-linear work. Previous
near-linear work algorithms are essentially sequential and previous polylogarithmic-depth
algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]).
Second, we show that by combining the recent distributed expander decomposition
technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential
deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15],
we can decompose the network into a sublinear number of clusters with small average
diameter and without any mincut separating a cluster (except the “trivial” ones).
This leads to a simplification of the Kawarabayashi-Thorup framework (except that
we are randomized while they are deterministic). This might make this framework
more useful in other models of computation. Finally, by extending the tree packing
technique from [Karger STOC’96], we can find the minimum cut in time proportional
to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time
algorithm for computing exact minimum cut for weighted graphs.
article_processing_charge: No
arxiv: 1
author:
- first_name: Mohit
full_name: Daga, Mohit
last_name: Daga
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
ama: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity
in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing. Association for Computing Machinery; 2019:343–354.
doi:10.1145/3313276.3316346'
apa: 'Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed
edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM
SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United
States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346'
chicago: Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak.
“Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st
Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for
Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346.
ieee: M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge
connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT
Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354.
ista: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity
in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing. STOC: Symposium on Theory of Computing, 343–354.'
mla: Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association
for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346.
short: M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of
the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing
Machinery, 2019, pp. 343–354.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2022-08-16T09:11:17Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-02-17T10:26:25Z
day: '01'
doi: 10.1145/3313276.3316346
extern: '1'
external_id:
arxiv:
- '1904.04341'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.04341
month: '06'
oa: 1
oa_version: Preprint
page: 343–354
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-1-4503-6705-9
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed edge connectivity in sublinear time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11871'
abstract:
- lang: eng
text: "Many dynamic graph algorithms have an amortized update time, rather than
a stronger worst-case guarantee. But amortized data structures are not suitable
for real-time systems, where each individual operation has to be executed quickly.
For this reason, there exist many recent randomized results that aim to provide
a guarantee stronger than amortized expected. The strongest possible guarantee
for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability
worst-case update time, which gives a bound on the time for each individual operation
that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic
high-probability worst-case time bounds for the dynamic spanner and the dynamic
maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n)
worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining
a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n)
high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which
yields the first worst-case polylog update time for all constant k. (All the results
above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor
dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm
with o(n) worst-case time bound was known and we present an algorithm with O(log5
(n)) high-probability worst-case time; similar worst-case bounds existed only
for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur
results are achieved using a new approach for converting amortized guarantees
to worst-case ones for randomized data structures by going through a third type
of guarantee, which is a middle ground between the two above: an algorithm is
said to have worst-case expected update time α if for every update σ, the expected
time to process σ is at most α. Although stronger than amortized expected, the
worst-case expected guarantee does not resolve the fundamental problem of amortization:
a worst-case expected update time of O(1) still allows for the possibility that
every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n).
In this paper we present a black-box reduction that converts any data structure
with worst-case expected update time into one with a high-probability worst-case
update time: the query time remains the same, while the update time increases
by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1)
First we show how to convert existing dynamic graph algorithms with amortized
expected polylogarithmic running times into algorithms with worst-case expected
polylogarithmic running times. (2) Then we use our black-box reduction to achieve
the polylogarithmic high-probability worst-case time bound. All our algorithms
are Las-Vegas-type algorithms."
article_processing_charge: No
arxiv: 1
author:
- first_name: Aaron
full_name: Bernstein, Aaron
last_name: Bernstein
- first_name: Sebastian
full_name: Forster, Sebastian
last_name: Forster
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic
spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on
Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918.
doi:10.1137/1.9781611975482.115'
apa: 'Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization
approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM
Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115'
chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization
Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual
ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial
and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115.
ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach
for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM
Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp.
1899–1918.
ista: 'Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for
dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.'
mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and
Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.
short: A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019,
pp. 1899–1918.
conference:
end_date: 2019-01-09
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2019-01-06
date_created: 2022-08-16T09:50:33Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-02-21T16:31:21Z
day: '01'
doi: 10.1137/1.9781611975482.115
extern: '1'
external_id:
arxiv:
- '1810.10932'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10932
month: '01'
oa: 1
oa_version: Preprint
page: 1899-1918
publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-548-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11871'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: A deamortization approach for dynamic spanner and dynamic maximal matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11898'
abstract:
- lang: eng
text: "We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12),
and Clifford et al. (FOCS'15) to present a general framework that gives amortized
lower bounds on the update and query times of dynamic data structures. Using our
framework, we present two concrete results.\r\n(1) For the dynamic polynomial
evaluation problem, where the polynomial is defined over a finite field of size
n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized
update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2)
For the dynamic online matrix vector multiplication problem, where we get an n×n
matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic
data structure must either have an amortized update time of Ω((lgn/lglgn)2) or
an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous
works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds,
but only for worst case update and query times. Our bounds match the highest unconditional
lower bounds known till date for any dynamic problem in the cell-probe model."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Stefan
full_name: Neumann, Stefan
last_name: Neumann
citation:
ama: Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds
for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043
apa: Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized
cell-probe lower bounds for dynamic problems. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized
Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science.
Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043.
ieee: S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe
lower bounds for dynamic problems,” Theoretical Computer Science, vol.
779. Elsevier, pp. 72–87, 2019.
ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower
bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.
mla: Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic
Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp.
72–87, doi:10.1016/j.tcs.2019.01.043.
short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science
779 (2019) 72–87.
date_created: 2022-08-17T09:02:15Z
date_published: 2019-08-02T00:00:00Z
date_updated: 2022-09-09T11:29:04Z
day: '02'
doi: 10.1016/j.tcs.2019.01.043
extern: '1'
external_id:
arxiv:
- '1902.02304'
intvolume: ' 779'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.02304
month: '08'
oa: 1
oa_version: Preprint
page: 72-87
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: New amortized cell-probe lower bounds for dynamic problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 779
year: '2019'
...
---
_id: '11982'
abstract:
- lang: eng
text: A carbon nitride material can be combined with homogeneous nickel catalysts
for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions.
The metal-free heterogeneous semiconductor is fully recyclable and couples a broad
range of electron-poor aryl bromides with primary and secondary alcohols as well
as water. The application for intramolecular reactions and the synthesis of active
pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable
for the coupling of aryl iodides with thiols as well.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Amiera
full_name: Madani, Amiera
last_name: Madani
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
ama: Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic
(thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334.
doi:10.1021/acs.orglett.9b01957
apa: Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous
dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic
Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957
chicago: Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus
Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using
Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957.
ieee: C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous
dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic
Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.
ista: Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual
nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters.
21(13), 5331–5334.
mla: Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification
Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical
Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957.
short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019)
5331–5334.
date_created: 2022-08-25T11:18:00Z
date_published: 2019-07-05T00:00:00Z
date_updated: 2023-02-21T10:10:19Z
day: '05'
doi: 10.1021/acs.orglett.9b01957
extern: '1'
external_id:
pmid:
- '31247752'
intvolume: ' 21'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.orglett.9b01957
month: '07'
oa: 1
oa_version: Published Version
page: 5331-5334
pmid: 1
publication: Organic Letters
publication_identifier:
eissn:
- 1523-7052
issn:
- 1523-7060
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon
nitrides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2019'
...
---
_id: '11984'
abstract:
- lang: eng
text: Differentially protected galactosamine building blocks are key components
for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation
of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding
2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead
to the formation of potentially explosive and toxic species limit the scalability
of this reaction and render it a bottleneck for carbohydrate synthesis. Here,
we present a method for the safe, efficient, and reliable azidophenylselenylation
of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry.
Careful analysis of the transformation resulted in reaction conditions that produce
minimal side products while the reaction time was reduced drastically when compared
to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal
in 3 h, producing 1.2 mmol/h of product.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Mónica
full_name: Guberman, Mónica
last_name: Guberman
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
ama: Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation
of galactal to prepare galactosamine building blocks. Organic Process Research
and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456
apa: Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable
continuous flow azidophenylselenylation of galactal to prepare galactosamine building
blocks. Organic Process Research and Development. American Chemical Society.
https://doi.org/10.1021/acs.oprd.9b00456
chicago: Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and
Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine
Building Blocks.” Organic Process Research and Development. American Chemical
Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456.
ieee: M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous
flow azidophenylselenylation of galactal to prepare galactosamine building blocks,”
Organic Process Research and Development, vol. 23, no. 12. American Chemical
Society, pp. 2764–2770, 2019.
ista: Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow
azidophenylselenylation of galactal to prepare galactosamine building blocks.
Organic Process Research and Development. 23(12), 2764–2770.
mla: Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation
of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research
and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70,
doi:10.1021/acs.oprd.9b00456.
short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development
23 (2019) 2764–2770.
date_created: 2022-08-25T11:30:33Z
date_published: 2019-12-20T00:00:00Z
date_updated: 2023-02-21T10:10:23Z
day: '20'
doi: 10.1021/acs.oprd.9b00456
extern: '1'
intvolume: ' 23'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.oprd.9b00456
month: '12'
oa: 1
oa_version: Published Version
page: 2764-2770
publication: Organic Process Research and Development
publication_identifier:
eissn:
- 1520-586X
issn:
- 1083-6160
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare
galactosamine building blocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2019'
...
---
_id: '1215'
abstract:
- lang: eng
text: "Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe
first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations
when they occur in examples and it is applied to the case of a group\r\ngenerator.
The second one, based on the previous one and a limit procedure, is an Itô\r\nformula
in a special class of Banach spaces having a product structure with the noise\r\nin
a Hilbert component; again the key point is the extension due to a cancellation.
This\r\nextension to Banach spaces and in particular the specific cancellation
are motivated\r\nby path-dependent Itô calculus."
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The second named author benefited partially from the support of the
“FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H).
He is also grateful for the invitation to the Department of Mathematics of the University
of Pisa. The third named author is grateful for the invitation to ENSTA.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Franco
full_name: Flandoli, Franco
last_name: Flandoli
- first_name: Francesco
full_name: Russo, Francesco
last_name: Russo
- first_name: Giovanni A
full_name: Zanco, Giovanni A
id: 47491882-F248-11E8-B48F-1D18A9856A87
last_name: Zanco
citation:
ama: Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial
regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826.
doi:10.1007/s10959-016-0724-2
apa: Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus
under weak spatial regularity of the processes. Journal of Theoretical Probability.
Springer. https://doi.org/10.1007/s10959-016-0724-2
chicago: Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional
Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical
Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2.
ieee: F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under
weak spatial regularity of the processes,” Journal of Theoretical Probability,
vol. 31, no. 2. Springer, pp. 789–826, 2018.
ista: Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak
spatial regularity of the processes. Journal of Theoretical Probability. 31(2),
789–826.
mla: Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial
Regularity of the Processes.” Journal of Theoretical Probability, vol.
31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.
short: F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31
(2018) 789–826.
date_created: 2018-12-11T11:50:45Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2021-01-12T06:49:09Z
day: '01'
ddc:
- '519'
department:
- _id: JaMa
doi: 10.1007/s10959-016-0724-2
file:
- access_level: open_access
checksum: 47686d58ec21c164540f1a980ff2163f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:13Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5266'
file_name: IST-2016-712-v1+1_s10959-016-0724-2.pdf
file_size: 671125
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 31'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 789-826
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Journal of Theoretical Probability
publication_status: published
publisher: Springer
publist_id: '6119'
pubrep_id: '712'
quality_controlled: '1'
scopus_import: 1
status: public
title: Infinite-dimensional calculus under weak spatial regularity of the processes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2018'
...
---
_id: '12603'
abstract:
- lang: eng
text: We present a field-data rich modelling analysis to reconstruct the climatic
forcing, glacier response, and runoff generation from a high-elevation catchment
in central Chile over the period 2000–2015 to provide insights into the differing
contributions of debris-covered and debris-free glaciers under current and future
changing climatic conditions. Model simulations with the physically based glacio-hydrological
model TOPKAPI-ETH reveal a period of neutral or slightly positive mass balance
between 2000 and 2010, followed by a transition to increasingly large annual mass
losses, associated with a recent mega drought. Mass losses commence earlier, and
are more severe, for a heavily debris-covered glacier, most likely due to its
strong dependence on snow avalanche accumulation, which has declined in recent
years. Catchment runoff shows a marked decreasing trend over the study period,
but with high interannual variability directly linked to winter snow accumulation,
and high contribution from ice melt in dry periods and drought conditions. The
study demonstrates the importance of incorporating local-scale processes such
as snow avalanche accumulation and spatially variable debris thickness, in understanding
the responses of different glacier types to climate change. We highlight the increased
dependency of runoff from high Andean catchments on the diminishing resource of
glacier ice during dry years.
article_processing_charge: No
article_type: original
author:
- first_name: Flavia
full_name: Burger, Flavia
last_name: Burger
- first_name: Alvaro
full_name: Ayala, Alvaro
last_name: Ayala
- first_name: David
full_name: Farias, David
last_name: Farias
- first_name: Thomas E.
full_name: Shaw, Thomas E.
last_name: Shaw
- first_name: Shelley
full_name: MacDonell, Shelley
last_name: MacDonell
- first_name: Ben
full_name: Brock, Ben
last_name: Brock
- first_name: James
full_name: McPhee, James
last_name: McPhee
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: 'Burger F, Ayala A, Farias D, et al. Interannual variability in glacier contribution
to runoff from a high‐elevation Andean catchment: Understanding the role of debris
cover in glacier hydrology. Hydrological Processes. 2018;33(2):214-229.
doi:10.1002/hyp.13354'
apa: 'Burger, F., Ayala, A., Farias, D., Shaw, T. E., MacDonell, S., Brock, B.,
… Pellicciotti, F. (2018). Interannual variability in glacier contribution to
runoff from a high‐elevation Andean catchment: Understanding the role of debris
cover in glacier hydrology. Hydrological Processes. Wiley. https://doi.org/10.1002/hyp.13354'
chicago: 'Burger, Flavia, Alvaro Ayala, David Farias, Thomas E. Shaw, Shelley MacDonell,
Ben Brock, James McPhee, and Francesca Pellicciotti. “Interannual Variability
in Glacier Contribution to Runoff from a High‐elevation Andean Catchment: Understanding
the Role of Debris Cover in Glacier Hydrology.” Hydrological Processes.
Wiley, 2018. https://doi.org/10.1002/hyp.13354.'
ieee: 'F. Burger et al., “Interannual variability in glacier contribution
to runoff from a high‐elevation Andean catchment: Understanding the role of debris
cover in glacier hydrology,” Hydrological Processes, vol. 33, no. 2. Wiley,
pp. 214–229, 2018.'
ista: 'Burger F, Ayala A, Farias D, Shaw TE, MacDonell S, Brock B, McPhee J, Pellicciotti
F. 2018. Interannual variability in glacier contribution to runoff from a high‐elevation
Andean catchment: Understanding the role of debris cover in glacier hydrology.
Hydrological Processes. 33(2), 214–229.'
mla: 'Burger, Flavia, et al. “Interannual Variability in Glacier Contribution to
Runoff from a High‐elevation Andean Catchment: Understanding the Role of Debris
Cover in Glacier Hydrology.” Hydrological Processes, vol. 33, no. 2, Wiley,
2018, pp. 214–29, doi:10.1002/hyp.13354.'
short: F. Burger, A. Ayala, D. Farias, T.E. Shaw, S. MacDonell, B. Brock, J. McPhee,
F. Pellicciotti, Hydrological Processes 33 (2018) 214–229.
date_created: 2023-02-20T08:13:14Z
date_published: 2018-11-26T00:00:00Z
date_updated: 2023-02-28T11:49:36Z
day: '26'
doi: 10.1002/hyp.13354
extern: '1'
intvolume: ' 33'
issue: '2'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/hyp.13354
month: '11'
oa: 1
oa_version: Published Version
page: 214-229
publication: Hydrological Processes
publication_identifier:
eissn:
- 1099-1085
issn:
- 0885-6087
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Interannual variability in glacier contribution to runoff from a high‐elevation
Andean catchment: Understanding the role of debris cover in glacier hydrology'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2018'
...
---
_id: '12604'
abstract:
- lang: eng
text: Glaciers in the high mountains of Asia provide an important water resource
for millions of people. Many of these glaciers are partially covered by rocky
debris, which protects the ice from solar radiation and warm air. However, studies
have found that the surface of these debris-covered glaciers is actually lowering
as fast as glaciers without debris. Water ponded on the surface of the glaciers
may be partially responsible, as water can absorb atmospheric energy very efficiently.
However, the overall effect of these ponds has not been thoroughly assessed yet.
We study a valley in Nepal for which we have extensive weather measurements, and
we use a numerical model to calculate the energy absorbed by ponds on the surface
of the glaciers over 6 months. As we have not observed each individual pond thoroughly,
we run the model 5,000 times with different setups. We find that ponds are extremely
important for glacier melt and absorb energy 14 times as quickly as the debris-covered
ice. Although the ponds account for 1% of the glacier area covered by rocks, and
only 0.3% of the total glacier area, they absorb enough energy to account for
one eighth of the whole valley's ice loss.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Ian
full_name: Willis, Ian
last_name: Willis
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Jakob F.
full_name: Steiner, Jakob F.
last_name: Steiner
- first_name: Neil S.
full_name: Arnold, Neil S.
last_name: Arnold
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Miles ES, Willis I, Buri P, Steiner JF, Arnold NS, Pellicciotti F. Surface
pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total
catchment ice loss. Geophysical Research Letters. 2018;45(19):10464-10473.
doi:10.1029/2018gl079678
apa: Miles, E. S., Willis, I., Buri, P., Steiner, J. F., Arnold, N. S., & Pellicciotti,
F. (2018). Surface pond energy absorption across four Himalayan Glaciers accounts
for 1/8 of total catchment ice loss. Geophysical Research Letters. American
Geophysical Union. https://doi.org/10.1029/2018gl079678
chicago: Miles, Evan S., Ian Willis, Pascal Buri, Jakob F. Steiner, Neil S. Arnold,
and Francesca Pellicciotti. “Surface Pond Energy Absorption across Four Himalayan
Glaciers Accounts for 1/8 of Total Catchment Ice Loss.” Geophysical Research
Letters. American Geophysical Union, 2018. https://doi.org/10.1029/2018gl079678.
ieee: E. S. Miles, I. Willis, P. Buri, J. F. Steiner, N. S. Arnold, and F. Pellicciotti,
“Surface pond energy absorption across four Himalayan Glaciers accounts for 1/8
of total catchment ice loss,” Geophysical Research Letters, vol. 45, no.
19. American Geophysical Union, pp. 10464–10473, 2018.
ista: Miles ES, Willis I, Buri P, Steiner JF, Arnold NS, Pellicciotti F. 2018. Surface
pond energy absorption across four Himalayan Glaciers accounts for 1/8 of total
catchment ice loss. Geophysical Research Letters. 45(19), 10464–10473.
mla: Miles, Evan S., et al. “Surface Pond Energy Absorption across Four Himalayan
Glaciers Accounts for 1/8 of Total Catchment Ice Loss.” Geophysical Research
Letters, vol. 45, no. 19, American Geophysical Union, 2018, pp. 10464–73,
doi:10.1029/2018gl079678.
short: E.S. Miles, I. Willis, P. Buri, J.F. Steiner, N.S. Arnold, F. Pellicciotti,
Geophysical Research Letters 45 (2018) 10464–10473.
date_created: 2023-02-20T08:13:18Z
date_published: 2018-10-18T00:00:00Z
date_updated: 2023-02-28T11:46:48Z
day: '18'
doi: 10.1029/2018gl079678
extern: '1'
intvolume: ' 45'
issue: '19'
keyword:
- General Earth and Planetary Sciences
- Geophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2018GL079678
month: '10'
oa: 1
oa_version: Published Version
page: 10464-10473
publication: Geophysical Research Letters
publication_identifier:
eissn:
- 1944-8007
issn:
- 0094-8276
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: Surface pond energy absorption across four Himalayan Glaciers accounts for
1/8 of total catchment ice loss
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 45
year: '2018'
...
---
_id: '12605'
abstract:
- lang: eng
text: Snow depth patterns over glaciers are controlled by precipitation, snow redistribution
due to wind and avalanches, and the exchange of energy with the atmosphere that
determines snow ablation. While many studies have advanced the understanding of
ablation processes, less is known about winter snow patterns and their variability
over glaciers. We analyze snow depth on Haut Glacier d'Arolla, Switzerland, in
the two winter seasons 2006–2007 and 2010–2011 to (1) understand whether snow
depth over an alpine glacier at the end of the accumulation season exhibits a
behavior similar to the one observed on single slopes and vegetated areas; and
(2) investigate the snow pattern consistency over the two accumulation seasons.
We perform this analysis on a data set of high-resolution lidar-derived snow depth
using variograms and fractal parameters. Our first main result is that snow depth
patterns on the glacier exhibit a multiscale behavior, with a scale break around
20 m after which the fractal dimension increases, indicating more autocorrelated
structure before the scale break than after. Second, this behavior is consistent
over the two years, with fractal parameters and their spatial variability almost
constant in the two seasons. We also show that snow depth patterns exhibit a distinct
behavior in the glacier tongue and the upper catchment, with longer correlation
distances on the tongue in the direction of the main winds, suggesting spatial
distinctions that are likely induced by different processes and that should be
taken into account when extrapolating snow depth from limited samples.
article_processing_charge: No
article_type: original
author:
- first_name: I.
full_name: Clemenzi, I.
last_name: Clemenzi
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: P.
full_name: Burlando, P.
last_name: Burlando
citation:
ama: Clemenzi I, Pellicciotti F, Burlando P. Snow depth structure, fractal behavior,
and interannual consistency over Haut Glacier d’Arolla, Switzerland. Water
Resources Research. 2018;54(10):7929-7945. doi:10.1029/2017wr021606
apa: Clemenzi, I., Pellicciotti, F., & Burlando, P. (2018). Snow depth structure,
fractal behavior, and interannual consistency over Haut Glacier d’Arolla, Switzerland.
Water Resources Research. American Geophysical Union. https://doi.org/10.1029/2017wr021606
chicago: Clemenzi, I., Francesca Pellicciotti, and P. Burlando. “Snow Depth Structure,
Fractal Behavior, and Interannual Consistency over Haut Glacier d’Arolla, Switzerland.”
Water Resources Research. American Geophysical Union, 2018. https://doi.org/10.1029/2017wr021606.
ieee: I. Clemenzi, F. Pellicciotti, and P. Burlando, “Snow depth structure, fractal
behavior, and interannual consistency over Haut Glacier d’Arolla, Switzerland,”
Water Resources Research, vol. 54, no. 10. American Geophysical Union,
pp. 7929–7945, 2018.
ista: Clemenzi I, Pellicciotti F, Burlando P. 2018. Snow depth structure, fractal
behavior, and interannual consistency over Haut Glacier d’Arolla, Switzerland.
Water Resources Research. 54(10), 7929–7945.
mla: Clemenzi, I., et al. “Snow Depth Structure, Fractal Behavior, and Interannual
Consistency over Haut Glacier d’Arolla, Switzerland.” Water Resources Research,
vol. 54, no. 10, American Geophysical Union, 2018, pp. 7929–45, doi:10.1029/2017wr021606.
short: I. Clemenzi, F. Pellicciotti, P. Burlando, Water Resources Research 54 (2018)
7929–7945.
date_created: 2023-02-20T08:13:31Z
date_published: 2018-06-07T00:00:00Z
date_updated: 2023-02-28T11:42:40Z
day: '07'
doi: 10.1029/2017wr021606
extern: '1'
intvolume: ' 54'
issue: '10'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2017WR021606
month: '06'
oa: 1
oa_version: Published Version
page: 7929-7945
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: Snow depth structure, fractal behavior, and interannual consistency over Haut
Glacier d'Arolla, Switzerland
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2018'
...
---
_id: '12606'
abstract:
- lang: eng
text: Ice cliffs within a supraglacial debris cover have been identified as a source
for high ablation relative to the surrounding debris-covered area. Due to their
small relative size and steep orientation, ice cliffs are difficult to detect
using nadir-looking space borne sensors. The method presented here uses surface
slopes calculated from digital elevation model (DEM) data to map ice cliff geometry
and produce an ice cliff probability map. Surface slope thresholds, which can
be sensitive to geographic location and/or data quality, are selected automatically.
The method also attempts to include area at the (often narrowing) ends of ice
cliffs which could otherwise be neglected due to signal saturation in surface
slope data. The method was calibrated in the eastern Alaska Range, Alaska, USA,
against a control ice cliff dataset derived from high-resolution visible and thermal
data. Using the same input parameter set that performed best in Alaska, the method
was tested against ice cliffs manually mapped in the Khumbu Himal, Nepal. Our
results suggest the method can accommodate different glaciological settings and
different DEM data sources without a data intensive (high-resolution, multi-data
source) recalibration.
article_processing_charge: No
article_type: original
author:
- first_name: Sam
full_name: Herreid, Sam
last_name: Herreid
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Herreid S, Pellicciotti F. Automated detection of ice cliffs within supraglacial
debris cover. The Cryosphere. 2018;12(5):1811-1829. doi:10.5194/tc-12-1811-2018
apa: Herreid, S., & Pellicciotti, F. (2018). Automated detection of ice cliffs
within supraglacial debris cover. The Cryosphere. Copernicus Publications.
https://doi.org/10.5194/tc-12-1811-2018
chicago: Herreid, Sam, and Francesca Pellicciotti. “Automated Detection of Ice Cliffs
within Supraglacial Debris Cover.” The Cryosphere. Copernicus Publications,
2018. https://doi.org/10.5194/tc-12-1811-2018.
ieee: S. Herreid and F. Pellicciotti, “Automated detection of ice cliffs within
supraglacial debris cover,” The Cryosphere, vol. 12, no. 5. Copernicus
Publications, pp. 1811–1829, 2018.
ista: Herreid S, Pellicciotti F. 2018. Automated detection of ice cliffs within
supraglacial debris cover. The Cryosphere. 12(5), 1811–1829.
mla: Herreid, Sam, and Francesca Pellicciotti. “Automated Detection of Ice Cliffs
within Supraglacial Debris Cover.” The Cryosphere, vol. 12, no. 5, Copernicus
Publications, 2018, pp. 1811–29, doi:10.5194/tc-12-1811-2018.
short: S. Herreid, F. Pellicciotti, The Cryosphere 12 (2018) 1811–1829.
date_created: 2023-02-20T08:13:36Z
date_published: 2018-05-31T00:00:00Z
date_updated: 2023-02-28T11:39:26Z
day: '31'
doi: 10.5194/tc-12-1811-2018
extern: '1'
intvolume: ' 12'
issue: '5'
keyword:
- Earth-Surface Processes
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.5194/tc-12-1811-2018
month: '05'
oa: 1
oa_version: Published Version
page: 1811-1829
publication: The Cryosphere
publication_identifier:
issn:
- 1994-0424
publication_status: published
publisher: Copernicus Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Automated detection of ice cliffs within supraglacial debris cover
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2018'
...
---
_id: '12607'
abstract:
- lang: eng
text: Supraglacial ice cliffs exist on debris-covered glaciers worldwide, but despite
their importance as melt hot spots, their life cycle is little understood. Early
field observations had advanced a hypothesis of survival of north-facing and disappearance
of south-facing cliffs, which is central for predicting the contribution of cliffs
to total glacier mass losses. Their role as windows of energy transfer suggests
they may explain the anomalously high mass losses of debris-covered glaciers in
High Mountain Asia (HMA) despite the insulating debris, currently at the center
of a debated controversy. We use a 3D model of cliff evolution coupled to very
high-resolution topographic data to demonstrate that ice cliffs facing south (in
the Northern Hemisphere) disappear within a few months due to enhanced solar radiation
receipts and that aspect is the key control on cliffs evolution. We reproduce
continuous flattening of south-facing cliffs, a result of their vertical gradient
of incoming solar radiation and sky view factor. Our results establish that only
north-facing cliffs are recurrent features and thus stable contributors to the
melting of debris-covered glaciers. Satellite observations and mass balance modeling
confirms that few south-facing cliffs of small size exist on the glaciers of Langtang,
and their contribution to the glacier volume losses is very small (∼1%). This
has major implications for the mass balance of HMA debris-covered glaciers as
it provides the basis for new parameterizations of cliff evolution and distribution
to constrain volume losses in a region where glaciers are highly relevant as water
sources for millions of people.
article_processing_charge: No
article_type: original
author:
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Buri P, Pellicciotti F. Aspect controls the survival of ice cliffs on debris-covered
glaciers. PNAS. 2018;115(17):4369-4374. doi:10.1073/pnas.1713892115
apa: Buri, P., & Pellicciotti, F. (2018). Aspect controls the survival of ice
cliffs on debris-covered glaciers. PNAS. Proceedings of the National Academy
of Sciences. https://doi.org/10.1073/pnas.1713892115
chicago: Buri, Pascal, and Francesca Pellicciotti. “Aspect Controls the Survival
of Ice Cliffs on Debris-Covered Glaciers.” PNAS. Proceedings of the National
Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1713892115.
ieee: P. Buri and F. Pellicciotti, “Aspect controls the survival of ice cliffs on
debris-covered glaciers,” PNAS, vol. 115, no. 17. Proceedings of the National
Academy of Sciences, pp. 4369–4374, 2018.
ista: Buri P, Pellicciotti F. 2018. Aspect controls the survival of ice cliffs on
debris-covered glaciers. PNAS. 115(17), 4369–4374.
mla: Buri, Pascal, and Francesca Pellicciotti. “Aspect Controls the Survival of
Ice Cliffs on Debris-Covered Glaciers.” PNAS, vol. 115, no. 17, Proceedings
of the National Academy of Sciences, 2018, pp. 4369–74, doi:10.1073/pnas.1713892115.
short: P. Buri, F. Pellicciotti, PNAS 115 (2018) 4369–4374.
date_created: 2023-02-20T08:13:41Z
date_published: 2018-04-09T00:00:00Z
date_updated: 2023-02-28T11:35:18Z
day: '09'
doi: 10.1073/pnas.1713892115
extern: '1'
intvolume: ' 115'
issue: '17'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1713892115
month: '04'
oa: 1
oa_version: Published Version
page: 4369-4374
publication: PNAS
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Aspect controls the survival of ice cliffs on debris-covered glaciers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 115
year: '2018'
...
---
_id: '13'
abstract:
- lang: eng
text: We propose a new method for fabricating digital objects through reusable silicone
molds. Molds are generated by casting liquid silicone into custom 3D printed containers
called metamolds. Metamolds automatically define the cuts that are needed to extract
the cast object from the silicone mold. The shape of metamolds is designed through
a novel segmentation technique, which takes into account both geometric and topological
constraints involved in the process of mold casting. Our technique is simple,
does not require changing the shape or topology of the input objects, and only
requires off-the- shelf materials and technologies. We successfully tested our
method on a set of challenging examples with complex shapes and rich geometric
detail. © 2018 Association for Computing Machinery.
article_number: '136'
article_processing_charge: No
author:
- first_name: Thomas
full_name: Alderighi, Thomas
last_name: Alderighi
- first_name: Luigi
full_name: Malomo, Luigi
last_name: Malomo
- first_name: Daniela
full_name: Giorgi, Daniela
last_name: Giorgi
- first_name: Nico
full_name: Pietroni, Nico
last_name: Pietroni
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Paolo
full_name: Cignoni, Paolo
last_name: Cignoni
citation:
ama: 'Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds:
Computational design of silicone molds. ACM Trans Graph. 2018;37(4). doi:10.1145/3197517.3201381'
apa: 'Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., & Cignoni,
P. (2018). Metamolds: Computational design of silicone molds. ACM Trans. Graph.
ACM. https://doi.org/10.1145/3197517.3201381'
chicago: 'Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd
Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.”
ACM Trans. Graph. ACM, 2018. https://doi.org/10.1145/3197517.3201381.'
ieee: 'T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni,
“Metamolds: Computational design of silicone molds,” ACM Trans. Graph.,
vol. 37, no. 4. ACM, 2018.'
ista: 'Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds:
Computational design of silicone molds. ACM Trans. Graph. 37(4), 136.'
mla: 'Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.”
ACM Trans. Graph., vol. 37, no. 4, 136, ACM, 2018, doi:10.1145/3197517.3201381.'
short: T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM
Trans. Graph. 37 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-08-04T00:00:00Z
date_updated: 2023-09-13T08:56:07Z
day: '04'
ddc:
- '004'
department:
- _id: BeBi
doi: 10.1145/3197517.3201381
ec_funded: 1
external_id:
isi:
- '000448185000097'
file:
- access_level: open_access
checksum: 61d46273dca4de626accef1d17a0aaad
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:52Z
date_updated: 2020-07-14T12:44:43Z
file_id: '5374'
file_name: IST-2018-1038-v1+1_metamolds_authorversion.pdf
file_size: 91939066
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Trans. Graph.
publication_status: published
publisher: ACM
publist_id: '8043'
pubrep_id: '1038'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/metamolds-molding-a-mold/
scopus_import: '1'
status: public
title: 'Metamolds: Computational design of silicone molds'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '13055'
abstract:
- lang: eng
text: "Dataset for manuscript 'Social network plasticity decreases disease transmission
in a eusocial insect'\r\nCompared to previous versions: - raw image files added\r\n
\ - correction of URLs within
README.txt file\r\n"
article_processing_charge: No
author:
- first_name: Nathalie
full_name: Stroeymeyt, Nathalie
last_name: Stroeymeyt
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Alessandro
full_name: Crespi, Alessandro
last_name: Crespi
- first_name: Danielle
full_name: Mersch, Danielle
last_name: Mersch
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Laurent
full_name: Keller, Laurent
last_name: Keller
citation:
ama: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network
plasticity decreases disease transmission in a eusocial insect. 2018. doi:10.5281/ZENODO.1322669
apa: Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller,
L. (2018). Social network plasticity decreases disease transmission in a eusocial
insect. Zenodo. https://doi.org/10.5281/ZENODO.1322669
chicago: Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch,
Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease
Transmission in a Eusocial Insect.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.1322669.
ieee: N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller,
“Social network plasticity decreases disease transmission in a eusocial insect.”
Zenodo, 2018.
ista: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social
network plasticity decreases disease transmission in a eusocial insect, Zenodo,
10.5281/ZENODO.1322669.
mla: Stroeymeyt, Nathalie, et al. Social Network Plasticity Decreases Disease
Transmission in a Eusocial Insect. Zenodo, 2018, doi:10.5281/ZENODO.1322669.
short: N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, (2018).
date_created: 2023-05-23T13:24:51Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2023-10-17T11:50:04Z
day: '23'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.5281/ZENODO.1322669
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.1480665
month: '10'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7'
relation: used_in_publication
status: public
status: public
title: Social network plasticity decreases disease transmission in a eusocial insect
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '13059'
abstract:
- lang: eng
text: "This dataset contains a GitHub repository containing all the data, analysis,
Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast
and accurate large multiple sequence alignments with a root-to-leaf regressive
method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated
and well as the main figures and tables from the manuscript.\r\nThe repository
is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor
details on how to use the regressive alignment algorithm, see the T-Coffee software
suite (https://github.com/cbcrg/tcoffee)."
article_processing_charge: No
author:
- first_name: Edgar
full_name: Garriga, Edgar
last_name: Garriga
- first_name: Paolo
full_name: di Tommaso, Paolo
last_name: di Tommaso
- first_name: Cedrik
full_name: Magis, Cedrik
last_name: Magis
- first_name: Ionas
full_name: Erb, Ionas
last_name: Erb
- first_name: Leila
full_name: Mansouri, Leila
last_name: Mansouri
- first_name: Athanasios
full_name: Baltzis, Athanasios
last_name: Baltzis
- first_name: Hafid
full_name: Laayouni, Hafid
last_name: Laayouni
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Evan
full_name: Floden, Evan
last_name: Floden
- first_name: Cedric
full_name: Notredame, Cedric
last_name: Notredame
citation:
ama: Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846
apa: Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A.,
… Notredame, C. (2018). Fast and accurate large multiple sequence alignments with
a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846
chicago: Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri,
Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric
Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf
Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846.
ieee: E. Garriga et al., “Fast and accurate large multiple sequence alignments
with a root-to-leaf regressive method.” Zenodo, 2018.
ista: Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H,
Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.
mla: Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments
with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.
short: E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H.
Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).
date_created: 2023-05-23T16:08:20Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2023-09-06T14:32:51Z
day: '07'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.5281/ZENODO.2025846
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.3271452
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7181'
relation: used_in_publication
status: public
status: public
title: Fast and accurate large multiple sequence alignments with a root-to-leaf regressive
method
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '131'
abstract:
- lang: eng
text: 'XY systems usually show chromosome-wide compensation of X-linked genes, while
in many ZW systems, compensation is restricted to a minority of dosage-sensitive
genes. Why such differences arose is still unclear. Here, we combine comparative
genomics, transcriptomics and proteomics to obtain a complete overview of the
evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare
the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium)
and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary
strata. We use these to assess gene expression evolution following sex-linkage.
The resulting patterns suggest a reduction in expression of Z-linked genes in
females, combined with upregulation of the Z in both sexes, in line with the first
step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics
suggest that post-transcriptional mechanisms do not play a major role in balancing
the expression of Z-linked genes. '
acknowledgement: We are grateful to Lu Dabing (Soochow University, Suzhou, China)
for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette
Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for
providing optimal environment to bioinformatic analyses, and to the Vicoso lab for
comments on the manuscript.
article_number: e35684
article_processing_charge: No
article_type: original
author:
- first_name: Marion A
full_name: Picard, Marion A
id: 2C921A7A-F248-11E8-B48F-1D18A9856A87
last_name: Picard
orcid: 0000-0002-8101-2518
- first_name: Celine
full_name: Cosseau, Celine
last_name: Cosseau
- first_name: Sabrina
full_name: Ferré, Sabrina
last_name: Ferré
- first_name: Thomas
full_name: Quack, Thomas
last_name: Quack
- first_name: Christoph
full_name: Grevelding, Christoph
last_name: Grevelding
- first_name: Yohann
full_name: Couté, Yohann
last_name: Couté
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome
of schistosome parasites. eLife. 2018;7. doi:10.7554/eLife.35684
apa: Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté,
Y., & Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome
parasites. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.35684
chicago: Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph
Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the
Z-Chromosome of Schistosome Parasites.” ELife. eLife Sciences Publications,
2018. https://doi.org/10.7554/eLife.35684.
ieee: M. A. L. Picard et al., “Evolution of gene dosage on the Z-chromosome
of schistosome parasites,” eLife, vol. 7. eLife Sciences Publications,
2018.
ista: Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B.
2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife.
7, e35684.
mla: Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome
of Schistosome Parasites.” ELife, vol. 7, e35684, eLife Sciences Publications,
2018, doi:10.7554/eLife.35684.
short: M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B.
Vicoso, ELife 7 (2018).
date_created: 2018-12-11T11:44:47Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2024-02-21T13:45:12Z
day: '13'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.7554/eLife.35684
external_id:
isi:
- '000441388200001'
file:
- access_level: open_access
checksum: d6331d4385b1fffd6b47b45d5949d841
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T11:55:05Z
date_updated: 2020-07-14T12:44:43Z
file_id: '5695'
file_name: 2018_eLife_Picard.pdf
file_size: 3158125
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 250ED89C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28842-B22
name: Sex chromosome evolution under male- and female- heterogamety
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7792'
quality_controlled: '1'
related_material:
record:
- id: '5586'
relation: popular_science
status: public
scopus_import: '1'
status: public
title: Evolution of gene dosage on the Z-chromosome of schistosome parasites
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7
year: '2018'
...
---
_id: '132'
abstract:
- lang: eng
text: Pancreas development involves a coordinated process in which an early phase
of cell segregation is followed by a longer phase of lineage restriction, expansion,
and tissue remodeling. By combining clonal tracing and whole-mount reconstruction
with proliferation kinetics and single-cell transcriptional profiling, we define
the functional basis of pancreas morphogenesis. We show that the large-scale organization
of mouse pancreas can be traced to the activity of self-renewing precursors positioned
at the termini of growing ducts, which act collectively to drive serial rounds
of stochastic ductal bifurcation balanced by termination. During this phase of
branching morphogenesis, multipotent precursors become progressively fate-restricted,
giving rise to self-renewing acinar-committed precursors that are conveyed with
growing ducts, as well as ductal progenitors that expand the trailing ducts and
give rise to delaminating endocrine cells. These findings define quantitatively
how the functional behavior and lineage progression of precursor pools determine
the large-scale patterning of pancreatic sub-compartments.
acknowledgement: E.H. is funded by a Junior Research Fellowship from Trinity College,
Cam-bridge, a Sir Henry Wellcome Fellowship from the Wellcome Trust, and theBettencourt-Schueller
Young Researcher Prize for support.
article_processing_charge: No
article_type: original
author:
- first_name: Magdalena
full_name: Sznurkowska, Magdalena
last_name: Sznurkowska
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Roberta
full_name: Azzarelli, Roberta
last_name: Azzarelli
- first_name: Steffen
full_name: Rulands, Steffen
last_name: Rulands
- first_name: Sonia
full_name: Nestorowa, Sonia
last_name: Nestorowa
- first_name: Christopher
full_name: Hindley, Christopher
last_name: Hindley
- first_name: Jennifer
full_name: Nichols, Jennifer
last_name: Nichols
- first_name: Berthold
full_name: Göttgens, Berthold
last_name: Göttgens
- first_name: Meritxell
full_name: Huch, Meritxell
last_name: Huch
- first_name: Anna
full_name: Philpott, Anna
last_name: Philpott
- first_name: Benjamin
full_name: Simons, Benjamin
last_name: Simons
citation:
ama: Sznurkowska M, Hannezo EB, Azzarelli R, et al. Defining lineage potential and
fate behavior of precursors during pancreas development. Developmental Cell.
2018;46(3):360-375. doi:10.1016/j.devcel.2018.06.028
apa: Sznurkowska, M., Hannezo, E. B., Azzarelli, R., Rulands, S., Nestorowa, S.,
Hindley, C., … Simons, B. (2018). Defining lineage potential and fate behavior
of precursors during pancreas development. Developmental Cell. Cell Press.
https://doi.org/10.1016/j.devcel.2018.06.028
chicago: Sznurkowska, Magdalena, Edouard B Hannezo, Roberta Azzarelli, Steffen Rulands,
Sonia Nestorowa, Christopher Hindley, Jennifer Nichols, et al. “Defining Lineage
Potential and Fate Behavior of Precursors during Pancreas Development.” Developmental
Cell. Cell Press, 2018. https://doi.org/10.1016/j.devcel.2018.06.028.
ieee: M. Sznurkowska et al., “Defining lineage potential and fate behavior
of precursors during pancreas development,” Developmental Cell, vol. 46,
no. 3. Cell Press, pp. 360–375, 2018.
ista: Sznurkowska M, Hannezo EB, Azzarelli R, Rulands S, Nestorowa S, Hindley C,
Nichols J, Göttgens B, Huch M, Philpott A, Simons B. 2018. Defining lineage potential
and fate behavior of precursors during pancreas development. Developmental Cell.
46(3), 360–375.
mla: Sznurkowska, Magdalena, et al. “Defining Lineage Potential and Fate Behavior
of Precursors during Pancreas Development.” Developmental Cell, vol. 46,
no. 3, Cell Press, 2018, pp. 360–75, doi:10.1016/j.devcel.2018.06.028.
short: M. Sznurkowska, E.B. Hannezo, R. Azzarelli, S. Rulands, S. Nestorowa, C.
Hindley, J. Nichols, B. Göttgens, M. Huch, A. Philpott, B. Simons, Developmental
Cell 46 (2018) 360–375.
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-06T00:00:00Z
date_updated: 2023-09-11T12:52:41Z
day: '06'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1016/j.devcel.2018.06.028
external_id:
isi:
- '000441327300012'
file:
- access_level: open_access
checksum: 78d2062b9e3c3b90fe71545aeb6d2f65
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:49:49Z
date_updated: 2020-07-14T12:44:43Z
file_id: '5694'
file_name: 2018_DevelopmentalCell_Sznurkowska.pdf
file_size: 8948384
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
has_accepted_license: '1'
intvolume: ' 46'
isi: 1
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 360 - 375
publication: Developmental Cell
publication_status: published
publisher: Cell Press
publist_id: '7791'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Defining lineage potential and fate behavior of precursors during pancreas
development
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 46
year: '2018'
...
---
_id: '133'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent computation threads. We present synchronization,
a new proof rule that simplifies the verification of asynchronous programs by
introducing the fiction, for proof purposes, that asynchronous operations complete
synchronously. Synchronization summarizes an asynchronous computation as immediate
atomic effect. Modular verification is enabled via pending asynchronous calls
in atomic summaries, and a complementary proof rule that eliminates pending asynchronous
calls when components and their specifications are composed. We evaluate synchronization
in the context of a multi-layer refinement verification methodology on a collection
of benchmark programs.
alternative_title:
- LIPIcs
article_number: '21'
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21'
apa: 'Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous
(Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory,
Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21'
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the
Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.
ieee: 'B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,”
presented at the CONCUR: International Conference on Concurrency Theory, Beijing,
China, 2018, vol. 118.'
ista: 'Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR:
International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.'
mla: Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '13'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2018.21
file:
- access_level: open_access
checksum: c90895f4c5fafc18ddc54d1c8848077e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:46Z
date_updated: 2020-07-14T12:44:44Z
file_id: '5368'
file_name: IST-2018-853-v2+2_concur2018.pdf
file_size: 745438
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7790'
pubrep_id: '1039'
quality_controlled: '1'
related_material:
record:
- id: '6426'
relation: earlier_version
status: public
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Synchronizing the asynchronous
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: 118
year: '2018'
...
---
_id: '82'
abstract:
- lang: eng
text: In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage,
bacterial cells resistant to the phage commonly emerge and become the dominant
population of bacteria. Following the ascent of resistant mutants, the densities
of bacteria in these simple communities become limited by resources rather than
the phage. Despite the evolution of resistant hosts, upon which the phage cannot
replicate, the lytic phage population is most commonly maintained in an apparently
stable state with the resistant bacteria. Several mechanisms have been put forward
to account for this result. Here we report the results of population dynamic/evolution
experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli
in serial transfer cultures. We show that, following the ascent of λVIR-resistant
bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal
media and in all cases in nutrient-rich broth. Using mathematical models and experiments,
we show that the dominant mechanism responsible for maintenance of λVIRin these
resource-limited populations dominated by resistant E. coli is a high rate of
either phenotypic or genetic transition from resistance to susceptibility—a hitherto
undemonstrated mechanism we term "leaky resistance." We discuss the
implications of leaky resistance to our understanding of the conditions for the
maintenance of phage in populations of bacteria—their “existence conditions.”.
article_number: '2005971'
article_processing_charge: Yes
author:
- first_name: Waqas
full_name: Chaudhry, Waqas
last_name: Chaudhry
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Nilang
full_name: Shah, Nilang
last_name: Shah
- first_name: Howard
full_name: Weiss, Howard
last_name: Weiss
- first_name: Ingrid
full_name: Mccall, Ingrid
last_name: Mccall
- first_name: Justin
full_name: Meyer, Justin
last_name: Meyer
- first_name: Animesh
full_name: Gupta, Animesh
last_name: Gupta
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Bruce
full_name: Levin, Bruce
last_name: Levin
citation:
ama: Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for
the existence of lytic bacteriophage. PLoS Biology. 2018;16(8). doi:10.1371/journal.pbio.2005971
apa: Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin,
B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage.
PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005971
chicago: Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall,
Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance
and the Conditions for the Existence of Lytic Bacteriophage.” PLoS Biology.
Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005971.
ieee: W. Chaudhry et al., “Leaky resistance and the conditions for the existence
of lytic bacteriophage,” PLoS Biology, vol. 16, no. 8. Public Library of
Science, 2018.
ista: Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC,
Levin B. 2018. Leaky resistance and the conditions for the existence of lytic
bacteriophage. PLoS Biology. 16(8), 2005971.
mla: Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence
of Lytic Bacteriophage.” PLoS Biology, vol. 16, no. 8, 2005971, Public
Library of Science, 2018, doi:10.1371/journal.pbio.2005971.
short: W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta,
C.C. Guet, B. Levin, PLoS Biology 16 (2018).
date_created: 2018-12-11T11:44:32Z
date_published: 2018-08-16T00:00:00Z
date_updated: 2023-09-13T08:45:41Z
day: '16'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.1371/journal.pbio.2005971
external_id:
isi:
- '000443383300024'
file:
- access_level: open_access
checksum: 527076f78265cd4ea192cd1569851587
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:55:31Z
date_updated: 2020-07-14T12:48:10Z
file_id: '5706'
file_name: 2018_Plos_Chaudhry.pdf
file_size: 4007095
relation: main_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_status: published
publisher: Public Library of Science
publist_id: '7972'
quality_controlled: '1'
related_material:
record:
- id: '9810'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Leaky resistance and the conditions for the existence of lytic bacteriophage
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 16
year: '2018'
...