---
_id: '9687'
abstract:
- lang: eng
text: The Gibbs free energy is the fundamental thermodynamic potential underlying
the relative stability of different states of matter under constant-pressure conditions.
However, computing this quantity from atomic-scale simulations is far from trivial,
so the potential energy of a system is often used as a proxy. In this paper, we
use a combination of thermodynamic integration methods to accurately evaluate
the Gibbs free energies associated with defects in crystals, including the vacancy
formation energy in bcc iron, and the stacking fault energy in fcc nickel, iron,
and cobalt. We quantify the importance of entropic and anharmonic effects in determining
the free energies of defects at high temperatures, and show that the potential
energy approximation as well as the harmonic approximation may produce inaccurate
or even qualitatively wrong results. Our calculations manifest the necessity to
employ accurate free energy methods such as thermodynamic integration to estimate
the stability of crystallographic defects at high temperatures.
article_number: '054102'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Bingqing
full_name: Cheng, Bingqing
id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9
last_name: Cheng
orcid: 0000-0002-3584-9632
- first_name: Michele
full_name: Ceriotti, Michele
last_name: Ceriotti
citation:
ama: 'Cheng B, Ceriotti M. Computing the absolute Gibbs free energy in atomistic
simulations: Applications to defects in solids. Physical Review B. 2018;97(5).
doi:10.1103/physrevb.97.054102'
apa: 'Cheng, B., & Ceriotti, M. (2018). Computing the absolute Gibbs free energy
in atomistic simulations: Applications to defects in solids. Physical Review
B. American Physical Society. https://doi.org/10.1103/physrevb.97.054102'
chicago: 'Cheng, Bingqing, and Michele Ceriotti. “Computing the Absolute Gibbs Free
Energy in Atomistic Simulations: Applications to Defects in Solids.” Physical
Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.97.054102.'
ieee: 'B. Cheng and M. Ceriotti, “Computing the absolute Gibbs free energy in atomistic
simulations: Applications to defects in solids,” Physical Review B, vol.
97, no. 5. American Physical Society, 2018.'
ista: 'Cheng B, Ceriotti M. 2018. Computing the absolute Gibbs free energy in atomistic
simulations: Applications to defects in solids. Physical Review B. 97(5), 054102.'
mla: 'Cheng, Bingqing, and Michele Ceriotti. “Computing the Absolute Gibbs Free
Energy in Atomistic Simulations: Applications to Defects in Solids.” Physical
Review B, vol. 97, no. 5, 054102, American Physical Society, 2018, doi:10.1103/physrevb.97.054102.'
short: B. Cheng, M. Ceriotti, Physical Review B 97 (2018).
date_created: 2021-07-19T09:39:48Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2021-08-09T12:38:26Z
day: '01'
doi: 10.1103/physrevb.97.054102
extern: '1'
external_id:
arxiv:
- '1710.02815'
intvolume: ' 97'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1710.02815
month: '02'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Computing the absolute Gibbs free energy in atomistic simulations: Applications
to defects in solids'
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 97
year: '2018'
...
---
_id: '10'
abstract:
- lang: eng
text: Genomic imprinting is an epigenetic process that leads to parent of origin-specific
gene expression in a subset of genes. Imprinted genes are essential for brain
development, and deregulation of imprinting is associated with neurodevelopmental
diseases and the pathogenesis of psychiatric disorders. However, the cell-type
specificity of imprinting at single cell resolution, and how imprinting and thus
gene dosage regulates neuronal circuit assembly is still largely unknown. Here,
MADM (Mosaic Analysis with Double Markers) technology was employed to assess genomic
imprinting at single cell level. By visualizing MADM-induced uniparental disomies
(UPDs) in distinct colors at single cell level in genetic mosaic animals, this
experimental paradigm provides a unique quantitative platform to systematically
assay the UPD-mediated imbalances in imprinted gene expression at unprecedented
resolution. An experimental pipeline based on FACS, RNA-seq and bioinformatics
analysis was established and applied to systematically map cell-type-specific
‘imprintomes’ in the mouse brain. The results revealed that parental-specific
expression of imprinted genes per se is rarely cell-type-specific even at the
individual cell level. Conversely, when we extended the comparison to downstream
responses resulting from imbalanced imprinted gene expression, we discovered an
unexpectedly high degree of cell-type specificity. Furthermore, we determined
a novel function of genomic imprinting in cortical astrocyte production and in
olfactory bulb (OB) granule cell generation. These results suggest important functional
implication of genomic imprinting for generating cell-type diversity in the brain.
In addition, MADM provides a powerful tool to study candidate genes by concomitant
genetic manipulation and fluorescent labelling of single cells. MADM-based candidate
gene approach was utilized to identify potential imprinted genes involved in the
generation of cortical astrocytes and OB granule cells. We investigated p57Kip2,
a maternally expressed gene and known cell cycle regulator. Although we found
that p57Kip2 does not play a role in these processes, we detected an unexpected
function of the paternal allele previously thought to be silent. Finally, we took
advantage of a key property of MADM which is to allow unambiguous investigation
of environmental impact on single cells. The experimental pipeline based on FACS
and RNA-seq analysis of MADM-labeled cells was established to probe the functional
differences of single cell loss of gene function compared to global loss of function
on a transcriptional level. With this method, both common and distinct responses
were isolated due to cell-autonomous and non-autonomous effects acting on genotypically
identical cells. As a result, transcriptional changes were identified which result
solely from the surrounding environment. Using the MADM technology to study genomic
imprinting at single cell resolution, we have identified cell-type-specific gene
expression, novel gene function and the impact of environment on single cell transcriptomes.
Together, these provide important insights to the understanding of mechanisms
regulating cell-type specificity and thus diversity in the brain.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Susanne
full_name: Laukoter, Susanne
id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87
last_name: Laukoter
orcid: 0000-0002-7903-3010
citation:
ama: Laukoter S. Role of genomic imprinting in cerebral cortex development. 2018:1-139.
doi:10.15479/AT:ISTA:th1057
apa: Laukoter, S. (2018). Role of genomic imprinting in cerebral cortex development.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th1057
chicago: Laukoter, Susanne. “Role of Genomic Imprinting in Cerebral Cortex Development.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th1057.
ieee: S. Laukoter, “Role of genomic imprinting in cerebral cortex development,”
Institute of Science and Technology Austria, 2018.
ista: Laukoter S. 2018. Role of genomic imprinting in cerebral cortex development.
Institute of Science and Technology Austria.
mla: Laukoter, Susanne. Role of Genomic Imprinting in Cerebral Cortex Development.
Institute of Science and Technology Austria, 2018, pp. 1–139, doi:10.15479/AT:ISTA:th1057.
short: S. Laukoter, Role of Genomic Imprinting in Cerebral Cortex Development, Institute
of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:08Z
date_published: 2018-11-21T00:00:00Z
date_updated: 2023-09-07T12:40:44Z
day: '21'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: SiHi
doi: 10.15479/AT:ISTA:th1057
file:
- access_level: closed
checksum: 41fdbf5fdce312802935d88a8ad9932c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-05-10T07:47:04Z
date_updated: 2019-11-23T23:30:03Z
embargo_to: open_access
file_id: '6396'
file_name: Thesis_LaukoterSusanne_FINAL.docx
file_size: 17949175
relation: source_file
- access_level: open_access
checksum: 53001a9a0c9e570e598d861bb0af28aa
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T07:47:04Z
date_updated: 2021-02-11T11:17:16Z
embargo: 2019-11-21
file_id: '6397'
file_name: Thesis_LaukoterSusanne_FINAL.pdf
file_size: 21187245
relation: main_file
file_date_updated: 2021-02-11T11:17:16Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1 - 139
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8046'
pubrep_id: '1057'
status: public
supervisor:
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
title: Role of genomic imprinting in cerebral cortex development
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '1012'
abstract:
- lang: eng
text: We prove a new central limit theorem (CLT) for the difference of linear eigenvalue
statistics of a Wigner random matrix H and its minor H and find that the fluctuation
is much smaller than the fluctuations of the individual linear statistics, as
a consequence of the strong correlation between the eigenvalues of H and H. In
particular, our theorem identifies the fluctuation of Kerov's rectangular Young
diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic
shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel
measure follow the same limiting shape. For this, algebraically motivated, ensemble
a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar
to our result but the variance is different, indicating that the analogy between
the two models has its limitations. Moreover, our theorem shows that Borodin's
result [7] on the convergence of the spectral distribution of Wigner matrices
to a Gaussian free field also holds in derivative sense.
article_processing_charge: No
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing
wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298.
doi:10.1093/imrn/rnw330
apa: Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young
diagrams of interlacing wigner eigenvalues. International Mathematics Research
Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330
chicago: Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young
Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research
Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330.
ieee: L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of
interlacing wigner eigenvalues,” International Mathematics Research Notices,
vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.
ista: Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of
interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10),
3255–3298.
mla: Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young
Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research
Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330.
short: L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018
(2018) 3255–3298.
date_created: 2018-12-11T11:49:41Z
date_published: 2018-05-18T00:00:00Z
date_updated: 2023-09-22T09:44:21Z
day: '18'
department:
- _id: LaEr
doi: 10.1093/imrn/rnw330
ec_funded: 1
external_id:
arxiv:
- '1608.05163'
isi:
- '000441668300009'
intvolume: ' 2018'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.05163
month: '05'
oa: 1
oa_version: Preprint
page: 3255-3298
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: International Mathematics Research Notices
publication_identifier:
issn:
- '10737928'
publication_status: published
publisher: Oxford University Press
publist_id: '6383'
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '10286'
abstract:
- lang: eng
text: 'In this paper, we evaluate clock signals generated in ring oscillators and
self-timed rings and the way their jitter can be transformed into random numbers.
We show that counting the periods of the jittery clock signal produces random
numbers of significantly better quality than the methods in which the jittery
signal is simply sampled (the case in almost all current methods). Moreover, we
use the counter values to characterize and continuously monitor the source of
randomness. However, instead of using the widely used statistical variance, we
propose to use Allan variance to do so. There are two main advantages: Allan variance
is insensitive to low frequency noises such as flicker noise that are known to
be autocorrelated and significantly less circuitry is required for its computation
than that used to compute commonly used variance. We also show that it is essential
to use a differential principle of randomness extraction from the jitter based
on the use of two identical oscillators to avoid autocorrelations originating
from external and internal global jitter sources and that this fact is valid for
both kinds of rings. Last but not least, we propose a method of statistical testing
based on high order Markov model to show the reduced dependencies when the proposed
randomness extraction is applied.'
article_processing_charge: No
article_type: original
author:
- first_name: Elie Noumon
full_name: Allini, Elie Noumon
last_name: Allini
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
- first_name: Oto
full_name: Petura, Oto
last_name: Petura
- first_name: Florent
full_name: Bernard, Florent
last_name: Bernard
- first_name: Marek
full_name: Laban, Marek
last_name: Laban
- first_name: Viktor
full_name: Fischer, Viktor
last_name: Fischer
citation:
ama: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and
monitoring of free running oscillators serving as source of randomness. IACR
Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242.
doi:10.13154/tches.v2018.i3.214-242
apa: Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer,
V. (2018). Evaluation and monitoring of free running oscillators serving as source
of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems.
International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242
chicago: Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek
Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators
Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware
and Embedded Systems. International Association for Cryptologic Research,
2018. https://doi.org/10.13154/tches.v2018.i3.214-242.
ieee: E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer,
“Evaluation and monitoring of free running oscillators serving as source of randomness,”
IACR Transactions on Cryptographic Hardware and Embedded Systems, vol.
2018, no. 3. International Association for Cryptologic Research, pp. 214–242,
2018.
ista: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation
and monitoring of free running oscillators serving as source of randomness. IACR
Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.
mla: Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators
Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware
and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic
Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.
short: E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR
Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.
date_created: 2021-11-14T23:01:25Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-11-15T10:48:49Z
day: '01'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.13154/tches.v2018.i3.214-242
file:
- access_level: open_access
checksum: b816b848f046c48a8357700d9305dce5
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-15T10:27:29Z
date_updated: 2021-11-15T10:27:29Z
file_id: '10289'
file_name: 2018_IACR_Allini.pdf
file_size: 955755
relation: main_file
success: 1
file_date_updated: 2021-11-15T10:27:29Z
has_accepted_license: '1'
intvolume: ' 2018'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 214-242
publication: IACR Transactions on Cryptographic Hardware and Embedded Systems
publication_identifier:
eissn:
- 2569-2925
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evaluation and monitoring of free running oscillators serving as source of
randomness
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2018
year: '2018'
...
---
_id: '10358'
abstract:
- lang: eng
text: Probing reaction mechanisms of supramolecular processes in soft and biological
matter, such as protein aggregation, is inherently challenging. This is because
these processes involve multiple molecular mechanisms that are associated with
the rearrangement of large numbers of weak bonds, resulting in complex free energy
landscapes with many kinetic barriers. Reaction rate measurements at different
temperatures can offer unprecedented insights into the underlying molecular mechanisms.
However, to be able to interpret such measurements, a key challenge is to establish
which properties of the complex free energy landscapes are probed by the reaction
rate. Here, we present a reaction rate theory for supramolecular kinetics based
on Kramers theory of diffusive reactions over multiple kinetic barriers. We find
that reaction rates for protein aggregation are of the Arrhenius–Eyring type and
that the associated activation energies probe only one relevant barrier along
the respective free energy landscapes. We apply this advancement to interpret,
in experiments and in coarse-grained computer simulations, reaction rates of amyloid
aggregation in terms of molecular mechanisms and associated thermodynamic signatures.
These results suggest a practical extension of the concept of rate-determining
steps for complex supramolecular processes and establish a general platform for
probing the underlying energy landscape using kinetic measurements.
acknowledgement: We thank Claudia Flandoli for the help with illustrations.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Lucie X.
full_name: Liu, Lucie X.
last_name: Liu
- first_name: Samo
full_name: Curk, Samo
last_name: Curk
- first_name: Peter G.
full_name: Bolhuis, Peter G.
last_name: Bolhuis
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
citation:
ama: 'Michaels TCT, Liu LX, Curk S, Bolhuis PG, Šarić A, Knowles TPJ. Reaction rate
theory for supramolecular kinetics: application to protein aggregation. Molecular
Physics. 2018;116(21-22):3055-3065. doi:10.1080/00268976.2018.1474280'
apa: 'Michaels, T. C. T., Liu, L. X., Curk, S., Bolhuis, P. G., Šarić, A., &
Knowles, T. P. J. (2018). Reaction rate theory for supramolecular kinetics: application
to protein aggregation. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2018.1474280'
chicago: 'Michaels, Thomas C. T., Lucie X. Liu, Samo Curk, Peter G. Bolhuis, Anđela
Šarić, and Tuomas P. J. Knowles. “Reaction Rate Theory for Supramolecular Kinetics:
Application to Protein Aggregation.” Molecular Physics. Taylor & Francis,
2018. https://doi.org/10.1080/00268976.2018.1474280.'
ieee: 'T. C. T. Michaels, L. X. Liu, S. Curk, P. G. Bolhuis, A. Šarić, and T. P.
J. Knowles, “Reaction rate theory for supramolecular kinetics: application to
protein aggregation,” Molecular Physics, vol. 116, no. 21–22. Taylor &
Francis, pp. 3055–3065, 2018.'
ista: 'Michaels TCT, Liu LX, Curk S, Bolhuis PG, Šarić A, Knowles TPJ. 2018. Reaction
rate theory for supramolecular kinetics: application to protein aggregation. Molecular
Physics. 116(21–22), 3055–3065.'
mla: 'Michaels, Thomas C. T., et al. “Reaction Rate Theory for Supramolecular Kinetics:
Application to Protein Aggregation.” Molecular Physics, vol. 116, no. 21–22,
Taylor & Francis, 2018, pp. 3055–65, doi:10.1080/00268976.2018.1474280.'
short: T.C.T. Michaels, L.X. Liu, S. Curk, P.G. Bolhuis, A. Šarić, T.P.J. Knowles,
Molecular Physics 116 (2018) 3055–3065.
date_created: 2021-11-26T12:08:02Z
date_published: 2018-05-24T00:00:00Z
date_updated: 2021-11-26T12:39:58Z
day: '24'
doi: 10.1080/00268976.2018.1474280
extern: '1'
external_id:
arxiv:
- '1803.04851'
intvolume: ' 116'
issue: 21-22
keyword:
- physical chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.04851
month: '05'
oa: 1
oa_version: Preprint
page: 3055-3065
publication: Molecular Physics
publication_identifier:
eissn:
- 1362-3028
issn:
- 0026-8976
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Reaction rate theory for supramolecular kinetics: application to protein aggregation'
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 116
year: '2018'
...
---
_id: '10359'
abstract:
- lang: eng
text: Biological membranes typically contain a large number of different components
dispersed in small concentrations in the main membrane phase, including proteins,
sugars, and lipids of varying geometrical properties. Most of these components
do not bind the cargo. Here, we show that such “inert” components can be crucial
for the precise control of cross-membrane trafficking. Using a statistical mechanics
model and molecular dynamics simulations, we demonstrate that the presence of
inert membrane components of small isotropic curvatures dramatically influences
cargo endocytosis, even if the total spontaneous curvature of such a membrane
remains unchanged. Curved lipids, such as cholesterol, as well as asymmetrically
included proteins and tethered sugars can, therefore, actively participate in
the control of the membrane trafficking of nanoscopic cargo. We find that even
a low-level expression of curved inert membrane components can determine the membrane
selectivity toward the cargo size and can be used to selectively target membranes
of certain compositions. Our results suggest a robust and general method of controlling
cargo trafficking by adjusting the membrane composition without needing to alter
the concentration of receptors or the average membrane curvature. This study indicates
that cells can prepare for any trafficking event by incorporating curved inert
components in either of the membrane leaflets.
acknowledgement: We acknowledge discussions with Giuseppe Battaglia as well as support
from the Herchel Smith scholarship (T.C.), the CAS PIFI fellowship (T.C.), the UCL
Institute for the Physics of Living Systems (T.C. and A.Š.), the Austrian Academy
of Sciences through a DOC fellowship (P.W.), the European Union Horizon 2020 programme
under ETN grant no. 674979-NANOTRANS and FET grant no. 766972-NANOPHLOW (J.D. and
D.F.), the Engineering and Physical Sciences Research Council (D.F. and A.Š.), the
Academy of Medical Sciences and Wellcome Trust (A.Š.), and the Royal Society (A.Š.).
We thank Claudia Flandoli for help with Figure 1.
article_processing_charge: No
article_type: original
author:
- first_name: Tine
full_name: Curk, Tine
last_name: Curk
- first_name: Peter
full_name: Wirnsberger, Peter
last_name: Wirnsberger
- first_name: Jure
full_name: Dobnikar, Jure
last_name: Dobnikar
- first_name: Daan
full_name: Frenkel, Daan
last_name: Frenkel
- 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: Curk T, Wirnsberger P, Dobnikar J, Frenkel D, Šarić A. Controlling cargo trafficking
in multicomponent membranes. Nano Letters. 2018;18(9):5350-5356. doi:10.1021/acs.nanolett.8b00786
apa: Curk, T., Wirnsberger, P., Dobnikar, J., Frenkel, D., & Šarić, A. (2018).
Controlling cargo trafficking in multicomponent membranes. Nano Letters.
American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b00786
chicago: Curk, Tine, Peter Wirnsberger, Jure Dobnikar, Daan Frenkel, and Anđela
Šarić. “Controlling Cargo Trafficking in Multicomponent Membranes.” Nano Letters.
American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b00786.
ieee: T. Curk, P. Wirnsberger, J. Dobnikar, D. Frenkel, and A. Šarić, “Controlling
cargo trafficking in multicomponent membranes,” Nano Letters, vol. 18,
no. 9. American Chemical Society, pp. 5350–5356, 2018.
ista: Curk T, Wirnsberger P, Dobnikar J, Frenkel D, Šarić A. 2018. Controlling cargo
trafficking in multicomponent membranes. Nano Letters. 18(9), 5350–5356.
mla: Curk, Tine, et al. “Controlling Cargo Trafficking in Multicomponent Membranes.”
Nano Letters, vol. 18, no. 9, American Chemical Society, 2018, pp. 5350–56,
doi:10.1021/acs.nanolett.8b00786.
short: T. Curk, P. Wirnsberger, J. Dobnikar, D. Frenkel, A. Šarić, Nano Letters
18 (2018) 5350–5356.
date_created: 2021-11-26T12:15:47Z
date_published: 2018-04-18T00:00:00Z
date_updated: 2021-11-26T15:14:08Z
day: '18'
doi: 10.1021/acs.nanolett.8b00786
extern: '1'
external_id:
pmid:
- '29667410'
intvolume: ' 18'
issue: '9'
keyword:
- mechanical engineering
- condensed matter physics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.10147
month: '04'
oa: 1
oa_version: Preprint
page: 5350-5356
pmid: 1
publication: Nano Letters
publication_identifier:
eissn:
- 1530-6992
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Controlling cargo trafficking in multicomponent membranes
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 18
year: '2018'
...
---
_id: '104'
abstract:
- lang: eng
text: The biotrophic pathogen Ustilago maydis, the causative agent of corn smut
disease, infects one of the most important crops worldwide – Zea mays. To successfully
colonize its host, U. maydis secretes proteins, known as effectors, that suppress
plant defense responses and facilitate the establishment of biotrophy. In this
work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence
and is upregulated during infection. Through microscopic analysis and in vitro
assays, we show that Cce1 is secreted from hyphae during filamentous growth of
the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection
and induce callose deposition as a plant defense response. Cce1 is highly conserved
among smut fungi and the Ustilago bromivora ortholog complemented the virulence
defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core
effector with apoplastic localization that is essential for U. maydis to infect
its host.
acknowledgement: 'the Austrian Science Fund (FWF): [P27429‐B22, P27818‐B22, I 3033‐B22],
and the Austrian Academy of Science (OEAW).'
article_processing_charge: No
author:
- first_name: Denise
full_name: Seitner, Denise
last_name: Seitner
- first_name: Simon
full_name: Uhse, Simon
last_name: Uhse
- first_name: Michelle C
full_name: Gallei, Michelle C
id: 35A03822-F248-11E8-B48F-1D18A9856A87
last_name: Gallei
orcid: 0000-0003-1286-7368
- first_name: Armin
full_name: Djamei, Armin
last_name: Djamei
citation:
ama: Seitner D, Uhse S, Gallei MC, Djamei A. The core effector Cce1 is required
for early infection of maize by Ustilago maydis. Molecular Plant Pathology.
2018;19(10):2277-2287. doi:10.1111/mpp.12698
apa: Seitner, D., Uhse, S., Gallei, M. C., & Djamei, A. (2018). The core effector
Cce1 is required for early infection of maize by Ustilago maydis. Molecular
Plant Pathology. Wiley. https://doi.org/10.1111/mpp.12698
chicago: Seitner, Denise, Simon Uhse, Michelle C Gallei, and Armin Djamei. “The
Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.”
Molecular Plant Pathology. Wiley, 2018. https://doi.org/10.1111/mpp.12698.
ieee: D. Seitner, S. Uhse, M. C. Gallei, and A. Djamei, “The core effector Cce1
is required for early infection of maize by Ustilago maydis,” Molecular Plant
Pathology, vol. 19, no. 10. Wiley, pp. 2277–2287, 2018.
ista: Seitner D, Uhse S, Gallei MC, Djamei A. 2018. The core effector Cce1 is required
for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 19(10),
2277–2287.
mla: Seitner, Denise, et al. “The Core Effector Cce1 Is Required for Early Infection
of Maize by Ustilago Maydis.” Molecular Plant Pathology, vol. 19, no. 10,
Wiley, 2018, pp. 2277–87, doi:10.1111/mpp.12698.
short: D. Seitner, S. Uhse, M.C. Gallei, A. Djamei, Molecular Plant Pathology 19
(2018) 2277–2287.
date_created: 2018-12-11T11:44:39Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-09-19T10:06:42Z
day: '01'
ddc:
- '580'
department:
- _id: GradSch
doi: 10.1111/mpp.12698
external_id:
isi:
- '000445624100006'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:46:00Z
date_updated: 2018-12-18T09:46:00Z
file_id: '5740'
file_name: 2018_MolecPlantPath_Seitner.pdf
file_size: 682335
relation: main_file
success: 1
file_date_updated: 2018-12-18T09:46:00Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 2277 - 2287
publication: Molecular Plant Pathology
publication_status: published
publisher: Wiley
publist_id: '7950'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The core effector Cce1 is required for early infection of maize by Ustilago
maydis
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: 19
year: '2018'
...
---
_id: '106'
abstract:
- lang: eng
text: The goal of this article is to introduce the reader to the theory of intrinsic
geometry of convex surfaces. We illustrate the power of the tools by proving a
theorem on convex surfaces containing an arbitrarily long closed simple geodesic.
Let us remind ourselves that a curve in a surface is called geodesic if every
sufficiently short arc of the curve is length minimizing; if, in addition, it
has no self-intersections, we call it simple geodesic. A tetrahedron with equal
opposite edges is called isosceles. The axiomatic method of Alexandrov geometry
allows us to work with the metrics of convex surfaces directly, without approximating
it first by a smooth or polyhedral metric. Such approximations destroy the closed
geodesics on the surface; therefore it is difficult (if at all possible) to apply
approximations in the proof of our theorem. On the other hand, a proof in the
smooth or polyhedral case usually admits a translation into Alexandrov’s language;
such translation makes the result more general. In fact, our proof resembles a
translation of the proof given by Protasov. Note that the main theorem implies
in particular that a smooth convex surface does not have arbitrarily long simple
closed geodesics. However we do not know a proof of this corollary that is essentially
simpler than the one presented below.
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Anton
full_name: Petrunin, Anton
last_name: Petrunin
citation:
ama: Akopyan A, Petrunin A. Long geodesics on convex surfaces. Mathematical Intelligencer.
2018;40(3):26-31. doi:10.1007/s00283-018-9795-5
apa: Akopyan, A., & Petrunin, A. (2018). Long geodesics on convex surfaces.
Mathematical Intelligencer. Springer. https://doi.org/10.1007/s00283-018-9795-5
chicago: Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.”
Mathematical Intelligencer. Springer, 2018. https://doi.org/10.1007/s00283-018-9795-5.
ieee: A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” Mathematical
Intelligencer, vol. 40, no. 3. Springer, pp. 26–31, 2018.
ista: Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical
Intelligencer. 40(3), 26–31.
mla: Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.”
Mathematical Intelligencer, vol. 40, no. 3, Springer, 2018, pp. 26–31,
doi:10.1007/s00283-018-9795-5.
short: A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31.
date_created: 2018-12-11T11:44:40Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-13T08:49:16Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00283-018-9795-5
external_id:
arxiv:
- '1702.05172'
isi:
- '000444141200005'
intvolume: ' 40'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.05172
month: '09'
oa: 1
oa_version: Preprint
page: 26 - 31
publication: Mathematical Intelligencer
publication_status: published
publisher: Springer
publist_id: '7948'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long geodesics on convex surfaces
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 40
year: '2018'
...
---
_id: '10626'
abstract:
- lang: eng
text: "Owing to their wide tunability, multiple internal degrees of freedom, and
low disorder, graphene heterostructures are emerging as a promising experimental
platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal
activation gap measurements in dual graphite-gated monolayer graphene devices
fabricated in an edgeless Corbino geometry. In devices with substrate-induced
sublattice splitting, we find a tunable crossover between single- and multicomponent
FQH states in the zero energy Landau level. Activation gaps in the single-component
regime show excellent agreement with numerical calculations using a single broadening
parameter \r\nΓ≈7.2K. In the first excited Landau level, in contrast, FQH gaps
are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered
state at integer filling ν=−4."
acknowledgement: We thank Cory Dean, S. Chen, Y. Zeng, M. Yankowitz, and J. Li for
discussing their unpublished data and for sharing the stack inversion technique.
The authors acknowledge further discussions of the results with I. Sodemann, M.
Zaletel, C. Nayak, and J. Jain. A. F. Y., H. P., H. Z., and E. M. S. were supported
by the ARO under awards 69188PHH and MURI W911NF-17-1-0323. A portion of this work
was performed at the National High Magnetic Field Laboratory, which is supported
by National Science Foundation Cooperative Agreement No. DMR-1644779 and the State
of Florida. K. W. and T. T. acknowledge support from the Elemental Strategy Initiative
conducted by the MEXT, Japan, and JSPS KAKENHI Grant No. JP15K21722. E. M. S. acknowledges
the support of the Elings Prize Fellowship in Science of the California Nanosystems
Institute at the University of California, Santa Barbara. A. F. Y. acknowledges
the support of the David and Lucile Packard Foundation.
article_number: '226801'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: H.
full_name: Zhou, H.
last_name: Zhou
- first_name: E. M.
full_name: Spanton, E. M.
last_name: Spanton
- first_name: T.
full_name: Taniguchi, T.
last_name: Taniguchi
- first_name: K.
full_name: Watanabe, K.
last_name: Watanabe
- first_name: A. F.
full_name: Young, A. F.
last_name: Young
citation:
ama: Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. Quantitative
transport measurements of fractional quantum Hall energy gaps in edgeless graphene
devices. Physical Review Letters. 2018;121(22). doi:10.1103/physrevlett.121.226801
apa: Polshyn, H., Zhou, H., Spanton, E. M., Taniguchi, T., Watanabe, K., & Young,
A. F. (2018). Quantitative transport measurements of fractional quantum Hall energy
gaps in edgeless graphene devices. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/physrevlett.121.226801
chicago: Polshyn, Hryhoriy, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and
A. F. Young. “Quantitative Transport Measurements of Fractional Quantum Hall Energy
Gaps in Edgeless Graphene Devices.” Physical Review Letters. American Physical
Society, 2018. https://doi.org/10.1103/physrevlett.121.226801.
ieee: H. Polshyn, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young,
“Quantitative transport measurements of fractional quantum Hall energy gaps in
edgeless graphene devices,” Physical Review Letters, vol. 121, no. 22.
American Physical Society, 2018.
ista: Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. 2018. Quantitative
transport measurements of fractional quantum Hall energy gaps in edgeless graphene
devices. Physical Review Letters. 121(22), 226801.
mla: Polshyn, Hryhoriy, et al. “Quantitative Transport Measurements of Fractional
Quantum Hall Energy Gaps in Edgeless Graphene Devices.” Physical Review Letters,
vol. 121, no. 22, 226801, American Physical Society, 2018, doi:10.1103/physrevlett.121.226801.
short: H. Polshyn, H. Zhou, E.M. Spanton, T. Taniguchi, K. Watanabe, A.F. Young,
Physical Review Letters 121 (2018).
date_created: 2022-01-14T12:15:47Z
date_published: 2018-11-28T00:00:00Z
date_updated: 2022-01-14T13:48:35Z
day: '28'
doi: 10.1103/physrevlett.121.226801
extern: '1'
external_id:
arxiv:
- '1805.04199'
intvolume: ' 121'
issue: '22'
keyword:
- general physics and astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.04199
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative transport measurements of fractional quantum Hall energy gaps
in edgeless graphene devices
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 121
year: '2018'
...
---
_id: '10627'
abstract:
- lang: eng
text: We present a scanning probe technique for measuring the dynamics of individual
fluxoid transitions in multiply connected superconducting structures. In these
measurements, a small magnetic particle attached to the tip of a silicon cantilever
is scanned over a micron-size superconducting ring fabricated from a thin aluminum
film. We find that near the superconducting transition temperature of the aluminum,
the dissipation and frequency of the cantilever changes significantly at particular
locations where the tip-induced magnetic flux penetrating the ring causes the
two lowest-energy fluxoid states to become nearly degenerate. In this regime,
we show that changes in the cantilever frequency and dissipation are well-described
by a stochastic resonance (SR) process, wherein small oscillations of the cantilever
in the presence of thermally activated phase slips (TAPS) in the ring give rise
to a dynamical force that modifies the mechanical properties of the cantilever.
Using the SR model, we calculate the average fluctuation rate of the TAPS as a
function of temperature over a 32-dB range in frequency, and we compare it to
the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting
structures.
acknowledgement: "We are grateful to Nadya Mason for useful discussions. This work
was supported by the DOE Basic Energy Sciences under Contract No. DE-SC0012649,
the Department of Physics and the Frederick Seitz Materials Research Laboratory
Central Facilities at the University of Illinois.\r\n"
article_number: '184501'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Tyler R.
full_name: Naibert, Tyler R.
last_name: Naibert
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: Polshyn H, Naibert TR, Budakian R. Imaging phase slip dynamics in micron-size
superconducting rings. Physical Review B. 2018;97(18). doi:10.1103/physrevb.97.184501
apa: Polshyn, H., Naibert, T. R., & Budakian, R. (2018). Imaging phase slip
dynamics in micron-size superconducting rings. Physical Review B. American
Physical Society. https://doi.org/10.1103/physrevb.97.184501
chicago: Polshyn, Hryhoriy, Tyler R. Naibert, and Raffi Budakian. “Imaging Phase
Slip Dynamics in Micron-Size Superconducting Rings.” Physical Review B.
American Physical Society, 2018. https://doi.org/10.1103/physrevb.97.184501.
ieee: H. Polshyn, T. R. Naibert, and R. Budakian, “Imaging phase slip dynamics in
micron-size superconducting rings,” Physical Review B, vol. 97, no. 18.
American Physical Society, 2018.
ista: Polshyn H, Naibert TR, Budakian R. 2018. Imaging phase slip dynamics in micron-size
superconducting rings. Physical Review B. 97(18), 184501.
mla: Polshyn, Hryhoriy, et al. “Imaging Phase Slip Dynamics in Micron-Size Superconducting
Rings.” Physical Review B, vol. 97, no. 18, 184501, American Physical Society,
2018, doi:10.1103/physrevb.97.184501.
short: H. Polshyn, T.R. Naibert, R. Budakian, Physical Review B 97 (2018).
date_created: 2022-01-14T13:48:47Z
date_published: 2018-05-08T00:00:00Z
date_updated: 2022-01-14T13:58:24Z
day: '08'
doi: 10.1103/physrevb.97.184501
extern: '1'
external_id:
arxiv:
- '1703.08184'
intvolume: ' 97'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.08184
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Imaging phase slip dynamics in micron-size superconducting rings
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 97
year: '2018'
...
---
_id: '1064'
abstract:
- lang: eng
text: 'In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by
P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it
is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot
be separated into two subfamilies by a straight line disjoint from the disks.
In this note we show that essentially the same idea may work for different analogues
and generalizations of their result. In particular, we prove the following: Given
a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety
coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate
of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane
disjoint from the homothets.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexey
full_name: Balitskiy, Alexey
last_name: Balitskiy
- first_name: Mikhail
full_name: Grigorev, Mikhail
last_name: Grigorev
citation:
ama: Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W.
Goodman and R.E. Goodman. Discrete & Computational Geometry. 2018;59(4):1001-1009.
doi:10.1007/s00454-017-9883-x
apa: Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering
theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/s00454-017-9883-x
chicago: Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle
Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational
Geometry. Springer, 2018. https://doi.org/10.1007/s00454-017-9883-x.
ieee: A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem
by A.W. Goodman and R.E. Goodman,” Discrete & Computational Geometry,
vol. 59, no. 4. Springer, pp. 1001–1009, 2018.
ista: Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by
A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 59(4), 1001–1009.
mla: Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and
R.E. Goodman.” Discrete & Computational Geometry, vol. 59, no. 4, Springer,
2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x.
short: A. Akopyan, A. Balitskiy, M. Grigorev, Discrete & Computational Geometry
59 (2018) 1001–1009.
date_created: 2018-12-11T11:49:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-20T12:08:51Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: HeEd
doi: 10.1007/s00454-017-9883-x
ec_funded: 1
external_id:
isi:
- '000432205500011'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T09:27:36Z
date_updated: 2019-01-18T09:27:36Z
file_id: '5844'
file_name: 2018_DiscreteComp_Akopyan.pdf
file_size: 482518
relation: main_file
success: 1
file_date_updated: 2019-01-18T09:27:36Z
has_accepted_license: '1'
intvolume: ' 59'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1001-1009
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer
publist_id: '6324'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the circle covering theorem by A.W. Goodman and R.E. Goodman
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: 59
year: '2018'
...
---
_id: '11827'
abstract:
- lang: eng
text: We study the metric facility location problem with client insertions and deletions.
This setting differs from the classic dynamic facility location problem, where
the set of clients remains the same, but the metric space can change over time.
We show a deterministic algorithm that maintains a constant factor approximation
to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion
or deletion in metric spaces while answering queries about the cost in O(1) time,
where kappa denotes the doubling dimension of the metric. For metric spaces with
bounded doubling dimension, the update time is polylogarithmic in the parameters
of the problem.
alternative_title:
- LIPIcs
article_number: '39'
article_processing_charge: No
arxiv: 1
author:
- first_name: 'Gramoz '
full_name: 'Goranci, Gramoz '
last_name: Goranci
- 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: Dariusz
full_name: Leniowski, Dariusz
last_name: Leniowski
citation:
ama: 'Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility
location. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.39'
apa: 'Goranci, G., Henzinger, M. H., & Leniowski, D. (2018). A tree structure
for dynamic facility location. In 26th Annual European Symposium on Algorithms
(Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ESA.2018.39'
chicago: Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure
for Dynamic Facility Location.” In 26th Annual European Symposium on Algorithms,
Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.39.
ieee: G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic
facility location,” in 26th Annual European Symposium on Algorithms, Helsinki,
Finland, 2018, vol. 112.
ista: 'Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic
facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 112, 39.'
mla: Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” 26th
Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39.
short: G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
conference:
end_date: 2018-08-22
location: Helsinki, Finland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2018-08-20
date_created: 2022-08-12T08:20:57Z
date_published: 2018-08-14T00:00:00Z
date_updated: 2023-02-16T10:50:51Z
day: '14'
doi: 10.4230/LIPICS.ESA.2018.39
extern: '1'
external_id:
arxiv:
- '1909.06653'
intvolume: ' 112'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2018.39
month: '08'
oa: 1
oa_version: Published Version
publication: 26th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959770811'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A tree structure for dynamic facility location
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2018'
...
---
_id: '11828'
abstract:
- lang: eng
text: "We consider the problem of dynamically maintaining (approximate) all-pairs
effective resistances in separable graphs, which are those that admit an n^{c}-separator
theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations
of the all-pairs effective resistances of an n-vertex graph G undergoing edge
insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and
O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable
(i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its
separator can be computed in O~(n) time. Our algorithm is built upon a dynamic
algorithm for maintaining approximate Schur complement that approximately preserves
pairwise effective resistances among a set of terminals for separable graphs,
which might be of independent interest.\r\nWe complement our result by proving
that for any two fixed vertices s and t, no incremental or decremental algorithm
can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case
update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless
the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further
show that for general graphs, no incremental or decremental algorithm can maintain
the s-t effective resistance problem with worst-case update time O(n^{1-delta})
and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false."
alternative_title:
- LIPIcs
article_number: '40'
article_processing_charge: No
arxiv: 1
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- 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: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: 'Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate
schur complement on separable graphs. In: 26th Annual European Symposium on
Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018.
doi:10.4230/LIPICS.ESA.2018.40'
apa: 'Goranci, G., Henzinger, M. H., & Peng, P. (2018). Dynamic effective resistances
and approximate schur complement on separable graphs. In 26th Annual European
Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl -
Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.40'
chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances
and Approximate Schur Complement on Separable Graphs.” In 26th Annual European
Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.40.
ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and
approximate schur complement on separable graphs,” in 26th Annual European
Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
ista: 'Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and
approximate schur complement on separable graphs. 26th Annual European Symposium
on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112,
40.'
mla: Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur
Complement on Separable Graphs.” 26th Annual European Symposium on Algorithms,
vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40.
short: G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
conference:
end_date: 2018-08-22
location: Helsinki, Finland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2018-08-20
date_created: 2022-08-12T08:26:42Z
date_published: 2018-08-14T00:00:00Z
date_updated: 2023-02-16T11:08:08Z
day: '14'
doi: 10.4230/LIPICS.ESA.2018.40
extern: '1'
external_id:
arxiv:
- '1802.09111'
intvolume: ' 112'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2018.40
month: '08'
oa: 1
oa_version: Published Version
publication: 26th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959770811'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic effective resistances and approximate schur complement on separable
graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2018'
...
---
_id: '11872'
abstract:
- lang: eng
text: We design fast dynamic algorithms for proper vertex and edge colorings in
a graph undergoing edge insertions and deletions. In the static setting, there
are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge
coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently
maintain such colorings in the dynamic setting as well. We get the following three
results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex
coloring with O(log Δ) expected amortized update time. (2) We present a deterministic
algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized
update time. (3) We present a simple, deterministic algorithm which maintains
a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the
recent O(Δ)-edge coloring algorithm with worst-case update time [4].
article_processing_charge: No
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Deeparnab
full_name: Chakrabarty, Deeparnab
last_name: Chakrabarty
- 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, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms
for graph coloring. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2018:1-20. doi:10.1137/1.9781611975031.1'
apa: 'Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., & Nanongkai, D. (2018).
Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on
Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for
Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.1'
chicago: Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon
Nanongkai. “Dynamic Algorithms for Graph Coloring.” In 29th Annual ACM-SIAM
Symposium on Discrete Algorithms, 1–20. Society for Industrial and Applied
Mathematics, 2018. https://doi.org/10.1137/1.9781611975031.1.
ieee: S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic
algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete
Algorithms, New Orleans, LA, United States, 2018, pp. 1–20.
ista: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms
for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA:
Symposium on Discrete Algorithms, 1–20.'
mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” 29th
Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and
Applied Mathematics, 2018, pp. 1–20, doi:10.1137/1.9781611975031.1.
short: S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th
Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied
Mathematics, 2018, pp. 1–20.
conference:
end_date: 2018-01-10
location: New Orleans, LA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2022-08-16T12:07:14Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-02-17T11:39:01Z
day: '01'
doi: 10.1137/1.9781611975031.1
extern: '1'
external_id:
arxiv:
- '1711.04355'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.04355
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 20
publication: 29th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-161197503-1
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic algorithms for graph coloring
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11882'
abstract:
- lang: eng
text: The minimum cut problem for an undirected edge-weighted graph asks us to divide
its set of nodes into two blocks while minimizing the weight sum of the cut edges.
Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm
is based on cluster contraction using label propagation and Padberg and Rinaldi's
contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory
parallel implementations of our algorithm. Extensive experiments on both real-world
and generated instances show that our algorithm finds the optimal cut on nearly
all instances significantly faster than other state-of-the-art exact algorithms,
and our error rate is lower than that of other heuristic algorithms. In addition,
our parallel algorithm shows good scalability.
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: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Darren
full_name: Strash, Darren
last_name: Strash
citation:
ama: 'Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms.
In: 20th Workshop on Algorithm Engineering and Experiments. Society for
Industrial and Applied Mathematics; 2018:48-61. doi:10.1137/1.9781611975055.5'
apa: 'Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical
minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments
(pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611975055.5'
chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash.
“Practical Minimum Cut Algorithms.” In 20th Workshop on Algorithm Engineering
and Experiments, 48–61. Society for Industrial and Applied Mathematics, 2018.
https://doi.org/10.1137/1.9781611975055.5.
ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut
algorithms,” in 20th Workshop on Algorithm Engineering and Experiments,
New Orleans, LA, United States, 2018, pp. 48–61.
ista: 'Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms.
20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm
Engineering and Experiments, 48–61.'
mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” 20th Workshop
on Algorithm Engineering and Experiments, Society for Industrial and Applied
Mathematics, 2018, pp. 48–61, doi:10.1137/1.9781611975055.5.
short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm
Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018,
pp. 48–61.
conference:
end_date: 2018-01-08
location: New Orleans, LA, United States
name: 'ALENEX: Symposium on Algorithm Engineering and Experiments'
start_date: 2018-01-07
date_created: 2022-08-17T07:04:57Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-02-17T14:03:39Z
day: '01'
doi: 10.1137/1.9781611975055.5
extern: '1'
external_id:
arxiv:
- '1708.06127'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.06127
month: '01'
oa: 1
oa_version: Preprint
page: 48-61
publication: 20th Workshop on Algorithm Engineering and Experiments
publication_identifier:
eisbn:
- 978-1-61197-505-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical minimum cut algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11890'
abstract:
- lang: eng
text: "We present the first deterministic data structures for maintaining approximate
minimum vertex cover and maximum matching in a fully dynamic graph \U0001D43A=(\U0001D449,\U0001D438),
with |\U0001D449|=\U0001D45B and |\U0001D438|=\U0001D45A, in \U0001D45C(\U0001D45A‾‾√)
time per update. In particular, for minimum vertex cover, we provide deterministic
data structures for maintaining a (2+\U0001D716) approximation in \U0001D442(log\U0001D45B/\U0001D7162)
amortized time per update. For maximum matching, we show how to maintain a (3+\U0001D716)
approximation in \U0001D442(min(\U0001D45B√/\U0001D716,\U0001D45A1/3/\U0001D7162)
amortized time per update and a (4+\U0001D716) approximation in \U0001D442(\U0001D45A1/3/\U0001D7162)
worst-case time per update. Our data structure for fully dynamic minimum vertex
cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld
[in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]."
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: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
citation:
ama: Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data
structures for vertex cover and matching. SIAM Journal on Computing. 2018;47(3):859-887.
doi:10.1137/140998925
apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2018). Deterministic
fully dynamic data structures for vertex cover and matching. SIAM Journal on
Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140998925
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic
Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal
on Computing. Society for Industrial & Applied Mathematics, 2018. https://doi.org/10.1137/140998925.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully
dynamic data structures for vertex cover and matching,” SIAM Journal on Computing,
vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887,
2018.
ista: Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic
data structures for vertex cover and matching. SIAM Journal on Computing. 47(3),
859–887.
mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for
Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3,
Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing
47 (2018) 859–887.
date_created: 2022-08-17T08:21:23Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-21T16:31:30Z
day: '01'
doi: 10.1137/140998925
extern: '1'
external_id:
arxiv:
- '1412.1318'
intvolume: ' 47'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.1318
month: '05'
oa: 1
oa_version: Preprint
page: 859-887
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11875'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Deterministic fully dynamic data structures for vertex cover and matching
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2018'
...
---
_id: '11911'
abstract:
- lang: eng
text: It is common knowledge that there is no single best strategy for graph clustering,
which justifies a plethora of existing approaches. In this paper, we present a
general memetic algorithm, VieClus, to tackle the graph clustering problem. This
algorithm can be adapted to optimize different objective functions. A key component
of our contribution are natural recombine operators that employ ensemble clusterings
as well as multi-level techniques. Lastly, we combine these techniques with a
scalable communication protocol, producing a system that is able to compute high-quality
solutions in a short amount of time. We instantiate our scheme with local search
for modularity and show that our algorithm successfully improves or reproduces
all entries of the 10th DIMACS implementation challenge under consideration using
a small amount of time.
alternative_title:
- LIPIcs
article_number: '3'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sonja
full_name: Biedermann, Sonja
last_name: Biedermann
- 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: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Bernhard
full_name: Schuster, Bernhard
last_name: Schuster
citation:
ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering.
In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3'
apa: 'Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic
graph clustering. In 17th International Symposium on Experimental Algorithms
(Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.SEA.2018.3'
chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster.
“Memetic Graph Clustering.” In 17th International Symposium on Experimental
Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPICS.SEA.2018.3.
ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph
clustering,” in 17th International Symposium on Experimental Algorithms,
L’Aquila, Italy, 2018, vol. 103.
ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering.
17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental
Algorithms, LIPIcs, vol. 103, 3.'
mla: Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International
Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3.
short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International
Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018.
conference:
end_date: 2018-07-29
location: L'Aquila, Italy
name: 'SEA: Symposium on Experimental Algorithms'
start_date: 2018-07-27
date_created: 2022-08-18T06:49:40Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-02-16T11:45:14Z
day: '01'
doi: 10.4230/LIPICS.SEA.2018.3
extern: '1'
external_id:
arxiv:
- '1802.07034'
intvolume: ' 103'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPICS.SEA.2018.3
month: '07'
oa: 1
oa_version: Published Version
publication: 17th International Symposium on Experimental Algorithms
publication_identifier:
isbn:
- '9783959770705'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Memetic graph clustering
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2018'
...
---
_id: '12'
abstract:
- lang: eng
text: Molding is a popular mass production method, in which the initial expenses
for the mold are offset by the low per-unit production cost. However, the physical
fabrication constraints of the molding technique commonly restrict the shape of
moldable objects. For a complex shape, a decomposition of the object into moldable
parts is a common strategy to address these constraints, with plastic model kits
being a popular and illustrative example. However, conducting such a decomposition
requires considerable expertise, and it depends on the technical aspects of the
fabrication technique, as well as aesthetic considerations. We present an interactive
technique to create such decompositions for two-piece molding, in which each part
of the object is cast between two rigid mold pieces. Given the surface description
of an object, we decompose its thin-shell equivalent into moldable parts by first
performing a coarse decomposition and then utilizing an active contour model for
the boundaries between individual parts. Formulated as an optimization problem,
the movement of the contours is guided by an energy reflecting fabrication constraints
to ensure the moldability of each part. Simultaneously, the user is provided with
editing capabilities to enforce aesthetic guidelines. Our interactive interface
provides control of the contour positions by allowing, for example, the alignment
of part boundaries with object features. Our technique enables a novel workflow,
as it empowers novice users to explore the design space, and it generates fabrication-ready
two-piece molds that can be used either for casting or industrial injection molding
of free-form objects.
article_number: '135'
article_processing_charge: No
author:
- first_name: Kazutaka
full_name: Nakashima, Kazutaka
last_name: Nakashima
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Emmanuel
full_name: Iarussi, Emmanuel
id: 33F19F16-F248-11E8-B48F-1D18A9856A87
last_name: Iarussi
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
- first_name: Takeo
full_name: Igarashi, Takeo
last_name: Igarashi
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity:
Interactive shell decomposition for fabrication with two-piece rigid molds. ACM
Transaction on Graphics. 2018;37(4). doi:10.1145/3197517.3201341'
apa: 'Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., & Bickel,
B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece
rigid molds. ACM Transaction on Graphics. ACM. https://doi.org/10.1145/3197517.3201341'
chicago: 'Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo
Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication
with Two-Piece Rigid Molds.” ACM Transaction on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201341.'
ieee: 'K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel,
“CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid
molds,” ACM Transaction on Graphics, vol. 37, no. 4. ACM, 2018.'
ista: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018.
CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid
molds. ACM Transaction on Graphics. 37(4), 135.'
mla: 'Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for
Fabrication with Two-Piece Rigid Molds.” ACM Transaction on Graphics, vol.
37, no. 4, 135, ACM, 2018, doi:10.1145/3197517.3201341.'
short: K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel,
ACM Transaction on Graphics 37 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-08-04T00:00:00Z
date_updated: 2023-09-11T12:48:09Z
day: '04'
ddc:
- '004'
- '516'
- '670'
department:
- _id: BeBi
doi: 10.1145/3197517.3201341
ec_funded: 1
external_id:
isi:
- '000448185000096'
file:
- access_level: open_access
checksum: 6a5368bc86c4e1a9fcfe588fd1f14ee8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:38Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5360'
file_name: IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf
file_size: 104225664
relation: main_file
- access_level: open_access
checksum: 3861e693ba47c51f3ec7b7867d573a61
content_type: application/zip
creator: system
date_created: 2018-12-12T10:18:39Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5361'
file_name: IST-2018-1037-v1+2_CoreCavity-Supplemental.zip
file_size: 377743553
relation: main_file
- access_level: open_access
checksum: 490040c685ed869536e2a18f5a906b94
content_type: video/vnd.objectvideo
creator: system
date_created: 2018-12-12T10:18:41Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5362'
file_name: IST-2018-1037-v1+3_CoreCavity-Video.mp4
file_size: 162634396
relation: main_file
- access_level: open_access
checksum: be7fc8b229adda727419b6504b3b9352
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:42Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5363'
file_name: IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg
file_size: 527972
relation: main_file
file_date_updated: 2020-07-14T12:44:38Z
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'
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
publication: ACM Transaction on Graphics
publication_status: published
publisher: ACM
publist_id: '8044'
pubrep_id: '1037'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/
scopus_import: '1'
status: public
title: 'CoreCavity: Interactive shell decomposition for fabrication with two-piece
rigid molds'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_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'
...