---
_id: '68'
abstract:
- lang: eng
text: The most common assumption made in statistical learning theory is the assumption
of the independent and identically distributed (i.i.d.) data. While being very
convenient mathematically, it is often very clearly violated in practice. This
disparity between the machine learning theory and applications underlies a growing
demand in the development of algorithms that learn from dependent data and theory
that can provide generalization guarantees similar to the independent situations.
This thesis is dedicated to two variants of dependencies that can arise in practice.
One is a dependence on the level of samples in a single learning task. Another
dependency type arises in the multi-task setting when the tasks are dependent
on each other even though the data for them can be i.i.d. In both cases we model
the data (samples or tasks) as stochastic processes and introduce new algorithms
for both settings that take into account and exploit the resulting dependencies.
We prove the theoretical guarantees on the performance of the introduced algorithms
under different evaluation criteria and, in addition, we compliment the theoretical
study by the empirical one, where we evaluate some of the algorithms on two real
world datasets to highlight their practical applicability.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Zimin, Alexander
id: 37099E9C-F248-11E8-B48F-1D18A9856A87
last_name: Zimin
citation:
ama: Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048
apa: Zimin, A. (2018). Learning from dependent data. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048
chicago: Zimin, Alexander. “Learning from Dependent Data.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.
ieee: A. Zimin, “Learning from dependent data,” Institute of Science and Technology
Austria, 2018.
ista: Zimin A. 2018. Learning from dependent data. Institute of Science and Technology
Austria.
mla: Zimin, Alexander. Learning from Dependent Data. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.
short: A. Zimin, Learning from Dependent Data, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-07T12:29:07Z
day: '01'
ddc:
- '004'
- '519'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:TH1048
ec_funded: 1
file:
- access_level: open_access
checksum: e849dd40a915e4d6c5572b51b517f098
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6253'
file_name: 2018_Thesis_Zimin.pdf
file_size: 1036137
relation: main_file
- access_level: closed
checksum: da092153cec55c97461bd53c45c5d139
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6254'
file_name: 2018_Thesis_Zimin_Source.zip
file_size: 637490
relation: source_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '92'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7986'
pubrep_id: '1048'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Learning from dependent data
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '69'
abstract:
- lang: eng
text: 'A qubit, a unit of quantum information, is essentially any quantum mechanical
two-level system which can be coherently controlled. Still, to be used for computation,
it has to fulfill criteria. Qubits, regardless of the system in which they are
realized, suffer from decoherence. This leads to loss of the information stored
in the qubit. The upper bound of the time scale on which decoherence happens is
set by the spin relaxation time. In this thesis I studied a two-level system consisting
of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire.
Such Ge hut wires have emerged as a promising material system for the realization
of spin qubits, due to the combination of two significant properties: long spin
coherence time as expected for group IV semiconductors due to the low hyperfine
interaction and a strong valence band spin-orbit coupling. Here, I present how
to fabricate quantum dot devices suitable for electrical transport measurements.
Coupled quantum dot devices allowed the realization of a charge sensor, which
is electrostatically and tunnel coupled to a quantum dot. By integrating the charge
sensor into a radio-frequency reflectometry setup, I performed for the first time
single-shot readout measurements of hole spins and extracted the hole spin relaxation
times in Ge hut wires.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
citation:
ama: Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires.
2018. doi:10.15479/AT:ISTA:TH_1047
apa: Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in
Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047
chicago: Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge
Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.
ieee: L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,”
Institute of Science and Technology Austria, 2018.
ista: Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut
wires. Institute of Science and Technology Austria.
mla: Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut
Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.
short: L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '01'
ddc:
- '530'
- '600'
degree_awarded: PhD
department:
- _id: GeKa
- _id: GradSch
doi: 10.15479/AT:ISTA:TH_1047
file:
- access_level: open_access
checksum: c570b656e30749cd65b1c7e13a9ce0a8
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6247'
file_name: 2018_Thesis_Vukusic.pdf
file_size: 28452385
relation: main_file
- access_level: closed
checksum: 7856771d9cd401fe0b311191076db6e1
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6248'
file_name: 2018_Thesis_Vukusic_source.zip
file_size: 53058704
relation: source_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: '103'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7985'
pubrep_id: '1047'
related_material:
record:
- id: '23'
relation: part_of_dissertation
status: public
- id: '840'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Charge sensing and spin relaxation times of holes in Ge hut wires
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
arxiv: 1
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2021-01-12T08:09:33Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
intvolume: ' 171'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
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
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: '107'
abstract:
- lang: eng
text: 'We introduce the notion of “non-malleable codes” which relaxes the notion
of error correction and error detection. Informally, a code is non-malleable if
the message contained in a modified codeword is either the original message, or
a completely unrelated value. In contrast to error correction and error detection,
non-malleability can be achieved for very rich classes of modifications. We construct
an efficient code that is non-malleable with respect to modifications that affect
each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set
it to either 0 or 1), but independently of the value of the other bits of the
codeword. Using the probabilistic method, we also show a very strong and general
statement: there exists a non-malleable code for every “small enough” family F
of functions via which codewords can be modified. Although this probabilistic
method argument does not directly yield efficient constructions, it gives us efficient
non-malleable codes in the random-oracle model for very general classes of tampering
functions—e.g., functions where every bit in the tampered codeword can depend
arbitrarily on any 99% of the bits in the original codeword. As an application
of non-malleable codes, we show that they provide an elegant algorithmic solution
to the task of protecting functionalities implemented in hardware (e.g., signature
cards) against “tampering attacks.” In such attacks, the secret state of a physical
system is tampered, in the hopes that future interaction with the modified system
will reveal some secret information. This problem was previously studied in the
work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security”
(ATP). We show that non-malleable codes can be used to achieve important improvements
over the prior work. In particular, we show that any functionality can be made
secure against a large class of tampering attacks, simply by encoding the secret
state with a non-malleable code while it is stored in memory.'
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the
ACM. 2018;65(4). doi:10.1145/3178432
apa: Dziembowski, S., Pietrzak, K. Z., & Wichs, D. (2018). Non-malleable codes.
Journal of the ACM. ACM. https://doi.org/10.1145/3178432
chicago: Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable
Codes.” Journal of the ACM. ACM, 2018. https://doi.org/10.1145/3178432.
ieee: S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal
of the ACM, vol. 65, no. 4. ACM, 2018.
ista: Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of
the ACM. 65(4), 20.
mla: Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM,
vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.
short: S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).
date_created: 2018-12-11T11:44:40Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-13T09:05:17Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/3178432
ec_funded: 1
external_id:
isi:
- '000442938200004'
intvolume: ' 65'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2009/608
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '7947'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non-malleable codes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 65
year: '2018'
...
---
_id: '108'
abstract:
- lang: eng
text: Universal hashing found a lot of applications in computer science. In cryptography
the most important fact about universal families is the so called Leftover Hash
Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography
it states that almost universal families are good extractors. In this work we
provide a somewhat surprising characterization in the opposite direction. Namely,
every extractor with sufficiently good parameters yields a universal family on
a noticeable fraction of its inputs. Our proof technique is based on tools from
extremal graph theory applied to the \'collision graph\' induced by the extractor,
and may be of independent interest. We discuss possible applications to the theory
of randomness extractors and non-malleable codes.
alternative_title:
- ISIT Proceedings
article_processing_charge: No
author:
- first_name: Marciej
full_name: Obremski, Marciej
last_name: Obremski
- first_name: Maciej
full_name: Skorski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skorski
citation:
ama: 'Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018.
doi:10.1109/ISIT.2018.8437654'
apa: 'Obremski, M., & Skórski, M. (2018). Inverted leftover hash lemma (Vol.
2018). Presented at the ISIT: International Symposium on Information Theory, Vail,
CO, USA: IEEE. https://doi.org/10.1109/ISIT.2018.8437654'
chicago: Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,”
Vol. 2018. IEEE, 2018. https://doi.org/10.1109/ISIT.2018.8437654.
ieee: 'M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at
the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018,
vol. 2018.'
ista: 'Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International
Symposium on Information Theory, ISIT Proceedings, vol. 2018.'
mla: Obremski, Marciej, and Maciej Skórski. Inverted Leftover Hash Lemma.
Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.
short: M. Obremski, M. Skórski, in:, IEEE, 2018.
conference:
end_date: 2018-06-22
location: Vail, CO, USA
name: 'ISIT: International Symposium on Information Theory'
start_date: '2018-06-17 '
date_created: 2018-12-11T11:44:40Z
date_published: 2018-08-16T00:00:00Z
date_updated: 2023-09-13T08:23:18Z
day: '16'
department:
- _id: KrPi
doi: 10.1109/ISIT.2018.8437654
external_id:
isi:
- '000448139300368'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/507
month: '08'
oa: 1
oa_version: Submitted Version
publication_status: published
publisher: IEEE
publist_id: '7946'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inverted leftover hash lemma
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '9471'
abstract:
- lang: eng
text: The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation
and is required for endosperm genomic imprinting and embryo viability. Targets
of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons
and at the boundaries of large transposons, but how DME interacts with these diverse
chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1)
subunit of the chromatin remodeler FACT (facilitates chromatin transactions),
was previously shown to be involved in the DME-dependent regulation of genomic
imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction
between DME and chromatin, we focused on the activity of the two FACT subunits,
SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found
that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of
target sites, the first being euchromatic and accessible to DME, but the second,
representing over half of DME targets, requiring the action of FACT for DME-mediated
DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets
are GC-rich heterochromatin domains with high nucleosome occupancy enriched with
H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated
linker histone H1 specifically mediates the requirement for FACT at a subset of
DME-target loci. Overall, our results demonstrate that FACT is required for DME
targeting by facilitating its access to heterochromatin.
article_processing_charge: No
article_type: original
author:
- first_name: Jennifer M.
full_name: Frost, Jennifer M.
last_name: Frost
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Guen Tae
full_name: Park, Guen Tae
last_name: Park
- first_name: Ping-Hung
full_name: Hsieh, Ping-Hung
last_name: Hsieh
- first_name: Miyuki
full_name: Nakamura, Miyuki
last_name: Nakamura
- first_name: Samuel J. H.
full_name: Lin, Samuel J. H.
last_name: Lin
- first_name: Hyunjin
full_name: Yoo, Hyunjin
last_name: Yoo
- first_name: Jaemyung
full_name: Choi, Jaemyung
last_name: Choi
- first_name: Yoko
full_name: Ikeda, Yoko
last_name: Ikeda
- first_name: Tetsu
full_name: Kinoshita, Tetsu
last_name: Kinoshita
- first_name: Yeonhee
full_name: Choi, Yeonhee
last_name: Choi
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
citation:
ama: Frost JM, Kim MY, Park GT, et al. FACT complex is required for DNA demethylation
at heterochromatin during reproduction in Arabidopsis. Proceedings of the National
Academy of Sciences. 2018;115(20):E4720-E4729. doi:10.1073/pnas.1713333115
apa: Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S.
J. H., … Fischer, R. L. (2018). FACT complex is required for DNA demethylation
at heterochromatin during reproduction in Arabidopsis. Proceedings of the National
Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1713333115
chicago: Frost, Jennifer M., M. Yvonne Kim, Guen Tae Park, Ping-Hung Hsieh, Miyuki
Nakamura, Samuel J. H. Lin, Hyunjin Yoo, et al. “FACT Complex Is Required for
DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” Proceedings
of the National Academy of Sciences. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1713333115.
ieee: J. M. Frost et al., “FACT complex is required for DNA demethylation
at heterochromatin during reproduction in Arabidopsis,” Proceedings of the
National Academy of Sciences, vol. 115, no. 20. National Academy of Sciences,
pp. E4720–E4729, 2018.
ista: Frost JM, Kim MY, Park GT, Hsieh P-H, Nakamura M, Lin SJH, Yoo H, Choi J,
Ikeda Y, Kinoshita T, Choi Y, Zilberman D, Fischer RL. 2018. FACT complex is required
for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings
of the National Academy of Sciences. 115(20), E4720–E4729.
mla: Frost, Jennifer M., et al. “FACT Complex Is Required for DNA Demethylation
at Heterochromatin during Reproduction in Arabidopsis.” Proceedings of the
National Academy of Sciences, vol. 115, no. 20, National Academy of Sciences,
2018, pp. E4720–29, doi:10.1073/pnas.1713333115.
short: J.M. Frost, M.Y. Kim, G.T. Park, P.-H. Hsieh, M. Nakamura, S.J.H. Lin, H.
Yoo, J. Choi, Y. Ikeda, T. Kinoshita, Y. Choi, D. Zilberman, R.L. Fischer, Proceedings
of the National Academy of Sciences 115 (2018) E4720–E4729.
date_created: 2021-06-07T06:11:28Z
date_published: 2018-05-15T00:00:00Z
date_updated: 2021-12-14T07:53:40Z
day: '15'
ddc:
- '580'
department:
- _id: DaZi
doi: 10.1073/pnas.1713333115
extern: '1'
external_id:
pmid:
- '29712855'
file:
- access_level: open_access
checksum: 810260dc0e3cc3033e15c19ad0dc123e
content_type: application/pdf
creator: asandaue
date_created: 2021-06-07T06:16:38Z
date_updated: 2021-06-07T06:16:38Z
file_id: '9472'
file_name: 2018_PNAS_Frost.pdf
file_size: 3045260
relation: main_file
success: 1
file_date_updated: 2021-06-07T06:16:38Z
has_accepted_license: '1'
intvolume: ' 115'
issue: '20'
keyword:
- Multidisciplinary
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: E4720-E4729
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: 'https://doi.org/10.1101/187674 '
scopus_import: '1'
status: public
title: FACT complex is required for DNA demethylation at heterochromatin during reproduction
in Arabidopsis
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 115
year: '2018'
...
---
_id: '95'
abstract:
- lang: eng
text: Electrostatic charging of insulating fine particles can be responsible for
numerous phenomena ranging from lightning in volcanic plumes to dust explosions.
However, even basic aspects of how fine particles become charged are still unclear.
Studying particle charging is challenging because it usually involves the complexities
associated with many-particle collisions. To address these issues, we introduce
a method based on acoustic levitation, which makes it possible to initiate sequences
of repeated collisions of a single submillimeter particle with a flat plate, and
to precisely measure the particle charge in situ after each collision. We show
that collisional charge transfer between insulators is dependent on the hydrophobicity
of the contacting surfaces. We use glass, which we modify by attaching nonpolar
molecules to the particle, the plate, or both. We find that hydrophilic surfaces
develop significant positive charges after contacting hydrophobic surfaces. Moreover,
we demonstrate that charging between a hydrophilic and a hydrophobic surface is
suppressed in an acidic environment and enhanced in a basic one. Application of
an electric field during each collision is found to modify the charge transfer,
again depending on surface hydrophobicity. We discuss these results within the
context of contact charging due to ion transfer, and we show that they lend strong
support to OH− ions as the charge carriers.
article_number: '035602'
arxiv: 1
author:
- first_name: Victor
full_name: Lee, Victor
last_name: Lee
- first_name: Nicole
full_name: James, Nicole
last_name: James
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Heinrich
full_name: Jaeger, Heinrich
last_name: Jaeger
citation:
ama: 'Lee V, James N, Waitukaitis SR, Jaeger H. Collisional charging of individual
submillimeter particles: Using ultrasonic levitation to initiate and track charge
transfer. Physical Review Materials. 2018;2(3). doi:10.1103/PhysRevMaterials.2.035602'
apa: 'Lee, V., James, N., Waitukaitis, S. R., & Jaeger, H. (2018). Collisional
charging of individual submillimeter particles: Using ultrasonic levitation to
initiate and track charge transfer. Physical Review Materials. American
Physical Society. https://doi.org/10.1103/PhysRevMaterials.2.035602'
chicago: 'Lee, Victor, Nicole James, Scott R Waitukaitis, and Heinrich Jaeger. “Collisional
Charging of Individual Submillimeter Particles: Using Ultrasonic Levitation to
Initiate and Track Charge Transfer.” Physical Review Materials. American
Physical Society, 2018. https://doi.org/10.1103/PhysRevMaterials.2.035602.'
ieee: 'V. Lee, N. James, S. R. Waitukaitis, and H. Jaeger, “Collisional charging
of individual submillimeter particles: Using ultrasonic levitation to initiate
and track charge transfer,” Physical Review Materials, vol. 2, no. 3. American
Physical Society, 2018.'
ista: 'Lee V, James N, Waitukaitis SR, Jaeger H. 2018. Collisional charging of individual
submillimeter particles: Using ultrasonic levitation to initiate and track charge
transfer. Physical Review Materials. 2(3), 035602.'
mla: 'Lee, Victor, et al. “Collisional Charging of Individual Submillimeter Particles:
Using Ultrasonic Levitation to Initiate and Track Charge Transfer.” Physical
Review Materials, vol. 2, no. 3, 035602, American Physical Society, 2018,
doi:10.1103/PhysRevMaterials.2.035602.'
short: V. Lee, N. James, S.R. Waitukaitis, H. Jaeger, Physical Review Materials
2 (2018).
date_created: 2018-12-11T11:44:36Z
date_published: 2018-03-29T00:00:00Z
date_updated: 2021-01-12T08:22:09Z
day: '29'
doi: 10.1103/PhysRevMaterials.2.035602
extern: '1'
external_id:
arxiv:
- '1801.09278'
intvolume: ' 2'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.09278
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review Materials
publication_status: published
publisher: American Physical Society
publist_id: '7959'
quality_controlled: '1'
status: public
title: 'Collisional charging of individual submillimeter particles: Using ultrasonic
levitation to initiate and track charge transfer'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_id: '9565'
abstract:
- lang: eng
text: Let D(n,p) be the random directed graph on n vertices where each of the n(n-1)
possible arcs is present independently with probability p. A celebrated result
of Frieze shows that if p≥(logn+ω(1))/n then D(n,p) typically has a directed Hamilton
cycle, and this is best possible. In this paper, we obtain a strengthening of
this result, showing that under the same condition, the number of directed Hamilton
cycles in D(n,p) is typically n!(p(1+o(1)))n. We also prove a hitting-time version
of this statement, showing that in the random directed graph process, as soon
as every vertex has in-/out-degrees at least 1, there are typically n!(logn/n(1+o(1)))n
directed Hamilton cycles.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Asaf
full_name: Ferber, Asaf
last_name: Ferber
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
citation:
ama: Ferber A, Kwan MA, Sudakov B. Counting Hamilton cycles in sparse random directed
graphs. Random Structures and Algorithms. 2018;53(4):592-603. doi:10.1002/rsa.20815
apa: Ferber, A., Kwan, M. A., & Sudakov, B. (2018). Counting Hamilton cycles
in sparse random directed graphs. Random Structures and Algorithms. Wiley.
https://doi.org/10.1002/rsa.20815
chicago: Ferber, Asaf, Matthew Alan Kwan, and Benny Sudakov. “Counting Hamilton
Cycles in Sparse Random Directed Graphs.” Random Structures and Algorithms.
Wiley, 2018. https://doi.org/10.1002/rsa.20815.
ieee: A. Ferber, M. A. Kwan, and B. Sudakov, “Counting Hamilton cycles in sparse
random directed graphs,” Random Structures and Algorithms, vol. 53, no.
4. Wiley, pp. 592–603, 2018.
ista: Ferber A, Kwan MA, Sudakov B. 2018. Counting Hamilton cycles in sparse random
directed graphs. Random Structures and Algorithms. 53(4), 592–603.
mla: Ferber, Asaf, et al. “Counting Hamilton Cycles in Sparse Random Directed Graphs.”
Random Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 592–603,
doi:10.1002/rsa.20815.
short: A. Ferber, M.A. Kwan, B. Sudakov, Random Structures and Algorithms 53 (2018)
592–603.
date_created: 2021-06-18T12:06:28Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-02-23T14:01:03Z
day: '01'
doi: 10.1002/rsa.20815
extern: '1'
external_id:
arxiv:
- '1708.07746'
intvolume: ' 53'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.07746
month: '12'
oa: 1
oa_version: Preprint
page: 592-603
publication: Random Structures and Algorithms
publication_identifier:
eissn:
- 1098-2418
issn:
- 1042-9832
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting Hamilton cycles in sparse random directed graphs
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 53
year: '2018'
...
---
_id: '9567'
abstract:
- lang: eng
text: Let P be a graph property which is preserved by removal of edges, and consider
the random graph process that starts with the empty n-vertex graph and then adds
edges one-by-one, each chosen uniformly at random subject to the constraint that
P is not violated. These types of random processes have been the subject of extensive
research over the last 20 years, having striking applications in extremal combinatorics,
and leading to the discovery of important probabilistic tools. In this paper we
consider the k-matching-free process, where P is the property of not containing
a matching of size k. We are able to analyse the behaviour of this process for
a wide range of values of k; in particular we prove that if k=o(n) or if n−2k=o(n−−√/logn)
then this process is likely to terminate in a k-matching-free graph with the maximum
possible number of edges, as characterised by Erdős and Gallai. We also show that
these bounds on k are essentially best possible, and we make a first step towards
understanding the behaviour of the process in the intermediate regime.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Michael
full_name: Krivelevich, Michael
last_name: Krivelevich
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Po‐Shen
full_name: Loh, Po‐Shen
last_name: Loh
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
citation:
ama: Krivelevich M, Kwan MA, Loh P, Sudakov B. The random k‐matching‐free process.
Random Structures and Algorithms. 2018;53(4):692-716. doi:10.1002/rsa.20814
apa: Krivelevich, M., Kwan, M. A., Loh, P., & Sudakov, B. (2018). The random
k‐matching‐free process. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20814
chicago: Krivelevich, Michael, Matthew Alan Kwan, Po‐Shen Loh, and Benny Sudakov.
“The Random K‐matching‐free Process.” Random Structures and Algorithms.
Wiley, 2018. https://doi.org/10.1002/rsa.20814.
ieee: M. Krivelevich, M. A. Kwan, P. Loh, and B. Sudakov, “The random k‐matching‐free
process,” Random Structures and Algorithms, vol. 53, no. 4. Wiley, pp.
692–716, 2018.
ista: Krivelevich M, Kwan MA, Loh P, Sudakov B. 2018. The random k‐matching‐free
process. Random Structures and Algorithms. 53(4), 692–716.
mla: Krivelevich, Michael, et al. “The Random K‐matching‐free Process.” Random
Structures and Algorithms, vol. 53, no. 4, Wiley, 2018, pp. 692–716, doi:10.1002/rsa.20814.
short: M. Krivelevich, M.A. Kwan, P. Loh, B. Sudakov, Random Structures and Algorithms
53 (2018) 692–716.
date_created: 2021-06-18T12:37:40Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-02-23T14:01:07Z
day: '01'
doi: 10.1002/rsa.20814
extern: '1'
external_id:
arxiv:
- '1708.01054'
intvolume: ' 53'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.01054
month: '12'
oa: 1
oa_version: Preprint
page: 692-716
publication: Random Structures and Algorithms
publication_identifier:
eissn:
- 1098-2418
issn:
- 1042-9832
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: The random k‐matching‐free process
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 53
year: '2018'
...
---
_id: '9568'
abstract:
- lang: eng
text: An intercalate in a Latin square is a 2×2 Latin subsquare. Let N be the number
of intercalates in a uniformly random n×n Latin square. We prove that asymptotically
almost surely N≥(1−o(1))n2/4, and that EN≤(1+o(1))n2/2 (therefore asymptotically
almost surely N≤fn2 for any f→∞). This significantly improves the previous best
lower and upper bounds. We also give an upper tail bound for the number of intercalates
in two fixed rows of a random Latin square. In addition, we discuss a problem
of Linial and Luria on low-discrepancy Latin squares.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
citation:
ama: Kwan MA, Sudakov B. Intercalates and discrepancy in random Latin squares. Random
Structures and Algorithms. 2018;52(2):181-196. doi:10.1002/rsa.20742
apa: Kwan, M. A., & Sudakov, B. (2018). Intercalates and discrepancy in random
Latin squares. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.20742
chicago: Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in
Random Latin Squares.” Random Structures and Algorithms. Wiley, 2018. https://doi.org/10.1002/rsa.20742.
ieee: M. A. Kwan and B. Sudakov, “Intercalates and discrepancy in random Latin squares,”
Random Structures and Algorithms, vol. 52, no. 2. Wiley, pp. 181–196, 2018.
ista: Kwan MA, Sudakov B. 2018. Intercalates and discrepancy in random Latin squares.
Random Structures and Algorithms. 52(2), 181–196.
mla: Kwan, Matthew Alan, and Benny Sudakov. “Intercalates and Discrepancy in Random
Latin Squares.” Random Structures and Algorithms, vol. 52, no. 2, Wiley,
2018, pp. 181–96, doi:10.1002/rsa.20742.
short: M.A. Kwan, B. Sudakov, Random Structures and Algorithms 52 (2018) 181–196.
date_created: 2021-06-18T12:47:25Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-02-23T14:01:09Z
day: '01'
doi: 10.1002/rsa.20742
extern: '1'
external_id:
arxiv:
- '1607.04981'
intvolume: ' 52'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1607.04981
month: '03'
oa: 1
oa_version: Preprint
page: 181-196
publication: Random Structures and Algorithms
publication_identifier:
eissn:
- 1098-2418
issn:
- 1042-9832
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intercalates and discrepancy in random Latin squares
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 52
year: '2018'
...