---
_id: '6665'
abstract:
- lang: eng
text: We prove that, at least for the binary erasure channel, the polar-coding paradigm
gives rise to codes that not only approach the Shannon limit but, in fact, do
so under the best possible scaling of their block length as a function of the
gap to capacity. This result exhibits the first known family of binary codes that
attain both optimal scaling and quasi-linear complexity of encoding and decoding.
Specifically, for any fixed δ > 0, we exhibit binary linear codes that ensure
reliable communication at rates within ε > 0 of capacity with block length n =
O(1/ε 2+δ ), construction complexity Θ(n), and encoding/decoding complexity Θ(n
log n).
arxiv: 1
author:
- first_name: Arman
full_name: Fazeli, Arman
last_name: Fazeli
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Alexander
full_name: Vardy, Alexander
last_name: Vardy
citation:
ama: 'Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal
scaling: Polar codes with large kernels. In: 2018 IEEE Information Theory Workshop.
IEEE; 2018:1-5. doi:10.1109/itw.2018.8613428'
apa: 'Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear
codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information
Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428'
chicago: 'Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary
Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In 2018
IEEE Information Theory Workshop, 1–5. IEEE, 2018. https://doi.org/10.1109/itw.2018.8613428.'
ieee: 'A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with
optimal scaling: Polar codes with large kernels,” in 2018 IEEE Information
Theory Workshop, Guangzhou, China, 2018, pp. 1–5.'
ista: 'Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with
optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory
Workshop. ITW: Information Theory Workshop, 1–5.'
mla: 'Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes
with Large Kernels.” 2018 IEEE Information Theory Workshop, IEEE, 2018,
pp. 1–5, doi:10.1109/itw.2018.8613428.'
short: A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information
Theory Workshop, IEEE, 2018, pp. 1–5.
conference:
end_date: 2018-11-29
location: Guangzhou, China
name: 'ITW: Information Theory Workshop'
start_date: 2018-11-25
date_created: 2019-07-23T11:01:42Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2024-03-07T12:18:50Z
day: '01'
doi: 10.1109/itw.2018.8613428
extern: '1'
external_id:
arxiv:
- '1711.01339'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.01339
month: '11'
oa: 1
oa_version: Preprint
page: 1-5
publication: 2018 IEEE Information Theory Workshop
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9002'
relation: later_version
status: public
status: public
title: 'Binary linear codes with optimal scaling: Polar codes with large kernels'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6674'
abstract:
- lang: eng
text: Polar codes represent one of the major recent breakthroughs in coding theory
and, because of their attractive features, they have been selected for the incoming
5G standard. As such, a lot of attention has been devoted to the development of
decoding algorithms with good error performance and efficient hardware implementation.
One of the leading candidates in this regard is represented by successive-cancellation
list (SCL) decoding. However, its hardware implementation requires a large amount
of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly
reduce the memory consumption. In this paper, we consider the paradigm of PSCL
decoding from a practical standpoint, and we provide several improvements. First,
by changing the target signal-to-noise ratio and consequently modifying the construction
of the code, we are able to improve the performance at no additional computational,
latency, or memory cost. Second, we bridge the performance gap between SCL and
PSCL decoding by introducing a generalized PSCL decoder and a layered PSCL decoder.
In this way, we obtain almost the same performance of the SCL decoder with a significantly
lower memory requirement, as testified by hardware implementation results. Third,
we present an optimal scheme to allocate cyclic redundancy checks. Finally, we
provide a lower bound on the list size that guarantees optimal maximum a posteriori
performance for the binary erasure channel.
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: S. Hamed
full_name: Hassani, S. Hamed
last_name: Hassani
- first_name: Carlo
full_name: Condo, Carlo
last_name: Condo
- first_name: Rudiger L.
full_name: Urbanke, Rudiger L.
last_name: Urbanke
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. Decoder
partitioning: Towards practical list decoding of polar codes. IEEE Transactions
on Communications. 2018;66(9):3749-3759. doi:10.1109/tcomm.2018.2832207'
apa: 'Hashemi, S. A., Mondelli, M., Hassani, S. H., Condo, C., Urbanke, R. L., &
Gross, W. J. (2018). Decoder partitioning: Towards practical list decoding of
polar codes. IEEE Transactions on Communications. IEEE. https://doi.org/10.1109/tcomm.2018.2832207'
chicago: 'Hashemi, Seyyed Ali, Marco Mondelli, S. Hamed Hassani, Carlo Condo, Rudiger
L. Urbanke, and Warren J. Gross. “Decoder Partitioning: Towards Practical List
Decoding of Polar Codes.” IEEE Transactions on Communications. IEEE, 2018.
https://doi.org/10.1109/tcomm.2018.2832207.'
ieee: 'S. A. Hashemi, M. Mondelli, S. H. Hassani, C. Condo, R. L. Urbanke, and W.
J. Gross, “Decoder partitioning: Towards practical list decoding of polar codes,”
IEEE Transactions on Communications, vol. 66, no. 9. IEEE, pp. 3749–3759,
2018.'
ista: 'Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. 2018.
Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions
on Communications. 66(9), 3749–3759.'
mla: 'Hashemi, Seyyed Ali, et al. “Decoder Partitioning: Towards Practical List
Decoding of Polar Codes.” IEEE Transactions on Communications, vol. 66,
no. 9, IEEE, 2018, pp. 3749–59, doi:10.1109/tcomm.2018.2832207.'
short: S.A. Hashemi, M. Mondelli, S.H. Hassani, C. Condo, R.L. Urbanke, W.J. Gross,
IEEE Transactions on Communications 66 (2018) 3749–3759.
date_created: 2019-07-24T08:59:41Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2021-01-12T08:08:31Z
day: '01'
doi: 10.1109/tcomm.2018.2832207
extern: '1'
intvolume: ' 66'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 3749-3759
publication: IEEE Transactions on Communications
publication_identifier:
eissn:
- 1558-0857
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Decoder partitioning: Towards practical list decoding of polar codes'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2018'
...
---
_id: '6675'
abstract:
- lang: eng
text: 'We present a coding paradigm that provides a new achievable rate for the
primitive relay channel by combining compress-and-forward and decode-and-forward
with a chaining construction. In the primitive relay channel model, the source
broadcasts a message to the relay and to the destination; and the relay facilitates
this communication by sending an additional message to the destination through
a separate channel. Two well-known coding approaches for this setting are decode-and-forward
and compress-and-forward: in the former, the relay decodes the message and sends
some of the information to the destination; in the latter, the relay does not
attempt to decode, but it sends a compressed description of the received sequence
to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs
of blocks and we use compress-and-forward for the first block and decode-and-forward
for the second. In particular, in the first block, the relay does not attempt
to decode and it sends only a part of the compressed description of the received
sequence; in the second block, the relay decodes the message and sends this information
plus the remaining part of the compressed sequence relative to the first block.
As a result, we strictly outperform both compress-and- forward and decode-and-forward.
Furthermore, this paradigm can be implemented with a low-complexity polar coding
scheme that has the typical attractive features of polar codes, i.e., quasi-linear
encoding/decoding complexity and super-polynomial decay of the error probability.
Throughout the paper we consider as a running example the special case of the
erasure relay channel and we compare the rates achievable by our proposed scheme
with the existing upper and lower bounds.'
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
ama: 'Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive
relay channel. In: 2018 IEEE International Symposium on Information Theory.
IEEE; 2018:351-355. doi:10.1109/isit.2018.8437479'
apa: 'Mondelli, M., Hassani, H., & Urbanke, R. (2018). A new coding paradigm
for the primitive relay channel. In 2018 IEEE International Symposium on Information
Theory (pp. 351–355). Vail, CO, United States: IEEE. https://doi.org/10.1109/isit.2018.8437479'
chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm
for the Primitive Relay Channel.” In 2018 IEEE International Symposium on Information
Theory, 351–55. IEEE, 2018. https://doi.org/10.1109/isit.2018.8437479.
ieee: M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive
relay channel,” in 2018 IEEE International Symposium on Information Theory,
Vail, CO, United States, 2018, pp. 351–355.
ista: 'Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive
relay channel. 2018 IEEE International Symposium on Information Theory. ISIT:
International Symposium on Information Theory , 351–355.'
mla: Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.”
2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp.
351–55, doi:10.1109/isit.2018.8437479.
short: M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium
on Information Theory, IEEE, 2018, pp. 351–355.
conference:
end_date: 2018-06-22
location: Vail, CO, United States
name: 'ISIT: International Symposium on Information Theory '
start_date: 2018-06-17
date_created: 2019-07-24T09:10:38Z
date_published: 2018-06-16T00:00:00Z
date_updated: 2023-02-23T12:56:49Z
day: '16'
doi: 10.1109/isit.2018.8437479
extern: '1'
external_id:
arxiv:
- '1801.03153'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.03153
month: '06'
oa: 1
oa_version: Preprint
page: 351-355
publication: 2018 IEEE International Symposium on Information Theory
publication_identifier:
eissn:
- 2157-8117
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '7007'
relation: later_version
status: public
status: public
title: A new coding paradigm for the primitive relay channel
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6678'
abstract:
- lang: eng
text: We survey coding techniques that enable reliable transmission at rates that
approach the capacity of an arbitrary discrete memoryless channel. In particular,
we take the point of view of modern coding theory and discuss how recent advances
in coding for symmetric channels help provide more efficient solutions for the
asymmetric case. We consider, in more detail, three basic coding paradigms. The
first one is Gallager's scheme that consists of concatenating a linear code with
a non-linear mapping so that the input distribution can be appropriately shaped.
We explicitly show that both polar codes and spatially coupled codes can be employed
in this scenario. Furthermore, we derive a scaling law between the gap to capacity,
the cardinality of the input and output alphabets, and the required size of the
mapper. The second one is an integrated scheme in which the code is used both
for source coding, in order to create codewords distributed according to the capacity-achieving
input distribution, and for channel coding, in order to provide error protection.
Such a technique has been recently introduced by Honda and Yamamoto in the context
of polar codes, and we show how to apply it also to the design of sparse graph
codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates
the two tasks of source coding and channel coding by a chaining construction that
binds together several codewords. We present conditions for the source code and
the channel code, and we describe how to combine any source code with any channel
code that fulfill those conditions, in order to provide capacity-achieving schemes
for asymmetric channels. In particular, we show that polar codes, spatially coupled
codes, and homophonic codes are suitable as basic building blocks of the proposed
coding strategy. Rather than focusing on the exact details of the schemes, the
purpose of this tutorial is to present different coding techniques that can then
be implemented with many variants. There is no absolute winner and, in order to
understand the most suitable technique for a specific application scenario, we
provide a detailed comparison that takes into account several performance metrics.
article_type: original
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: 'Rudiger '
full_name: 'Urbanke, Rudiger '
last_name: Urbanke
citation:
ama: Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric
channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393.
doi:10.1109/tit.2018.2789885
apa: Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity
of asymmetric channels. IEEE Transactions on Information Theory. IEEE.
https://doi.org/10.1109/tit.2018.2789885
chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the
Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory.
IEEE, 2018. https://doi.org/10.1109/tit.2018.2789885.
ieee: M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric
channels,” IEEE Transactions on Information Theory, vol. 64, no. 5. IEEE,
pp. 3371–3393, 2018.
ista: Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric
channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.
mla: Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.”
IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp.
3371–93, doi:10.1109/tit.2018.2789885.
short: M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory
64 (2018) 3371–3393.
date_created: 2019-07-24T12:38:49Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T12:50:46Z
day: '01'
doi: 10.1109/tit.2018.2789885
extern: '1'
external_id:
arxiv:
- '1406.7373'
intvolume: ' 64'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.7373
month: '05'
oa: 1
oa_version: Preprint
page: 3371-3393
publication: IEEE Transactions on Information Theory
publication_identifier:
issn:
- 0018-9448
- 1557-9654
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6740'
relation: earlier_version
status: public
status: public
title: How to achieve the capacity of asymmetric channels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2018'
...
---
_id: '67'
abstract:
- lang: eng
text: 'Gene regulatory networks evolve through rewiring of individual components—that
is, through changes in regulatory connections. However, the mechanistic basis
of regulatory rewiring is poorly understood. Using a canonical gene regulatory
system, we quantify the properties of transcription factors that determine the
evolutionary potential for rewiring of regulatory connections: robustness, tunability
and evolvability. In vivo repression measurements of two repressors at mutated
operator sites reveal their contrasting evolutionary potential: while robustness
and evolvability were positively correlated, both were in trade-off with tunability.
Epistatic interactions between adjacent operators alleviated this trade-off. A
thermodynamic model explains how the differences in robustness, tunability and
evolvability arise from biophysical characteristics of repressor–DNA binding.
The model also uncovers that the energy matrix, which describes how mutations
affect repressor–DNA binding, encodes crucial information about the evolutionary
potential of a repressor. The biophysical determinants of evolutionary potential
for regulatory rewiring constitute a mechanistic framework for understanding network
evolution.'
article_processing_charge: No
article_type: original
author:
- first_name: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential
of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution.
2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y
apa: Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018).
Evolutionary potential of transcription factors for gene regulatory rewiring.
Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y
chicago: Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin
C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.”
Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y.
ieee: C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary
potential of transcription factors for gene regulatory rewiring,” Nature Ecology
and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.
ista: Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential
of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution.
2(10), 1633–1643.
mla: Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for
Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10,
Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.
short: C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology
and Evolution 2 (2018) 1633–1643.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-10T00:00:00Z
date_updated: 2024-03-25T23:30:27Z
day: '10'
ddc:
- '570'
department:
- _id: CaGu
- _id: GaTk
- _id: JoBo
doi: 10.1038/s41559-018-0651-y
ec_funded: 1
external_id:
isi:
- '000447947600021'
file:
- access_level: open_access
checksum: 383a2e2c944a856e2e821ec8e7bf71b6
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T11:28:52Z
date_updated: 2020-07-14T12:47:37Z
file_id: '7830'
file_name: 2018_NatureEcology_Igler.pdf
file_size: 1135973
relation: main_file
file_date_updated: 2020-07-14T12:47:37Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '10'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 1633 - 1643
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture (DOC Fellowship)
publication: Nature Ecology and Evolution
publication_status: published
publisher: Nature Publishing Group
publist_id: '7987'
quality_controlled: '1'
related_material:
record:
- id: '5585'
relation: popular_science
status: public
- id: '6371'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Evolutionary potential of transcription factors for gene regulatory rewiring
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '6728'
abstract:
- lang: eng
text: Polar codes are a channel coding scheme for the next generation of wireless
communications standard (5G). The belief propagation (BP) decoder allows for parallel
decoding of polar codes, making it suitable for high throughput applications.
However, the error-correction performance of polar codes under BP decoding is
far from the requirements of 5G. It has been shown that the error-correction performance
of BP can be improved if the decoding is performed on multiple permuted factor
graphs of polar codes. However, a different BP decoding scheduling is required
for each factor graph permutation which results in the design of a different decoder
for each permutation. Moreover, the selection of the different factor graph permutations
is at random, which prevents the decoder to achieve a desirable error correction
performance with a small number of permutations. In this paper, we first show
that the permutations on the factor graph can be mapped into suitable permutations
on the codeword positions. As a result, we can make use of a single decoder for
all the permutations. In addition, we introduce a method to construct a set of
predetermined permutations which can provide the correct codeword if the decoding
fails on the original permutation. We show that for the 5G polar code of length
1024, the error-correction performance of the proposed decoder is more than 0.25
dB better than that of the BP decoder with the same number of random permutations
at the frame error rate of 10 -4 .
arxiv: 1
author:
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on
permuted factor graphs. In: 2018 IEEE Global Communications Conference .
IEEE; 2018. doi:10.1109/glocom.2018.8647308'
apa: 'Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the
decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications
Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308'
chicago: Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On
the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global
Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308.
ieee: N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of
polar codes on permuted factor graphs,” in 2018 IEEE Global Communications
Conference , Abu Dhabi, United Arab Emirates, 2018.
ista: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar
codes on permuted factor graphs. 2018 IEEE Global Communications Conference .
GLOBECOM: Global Communications Conference.'
mla: Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.”
2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308.
short: N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications
Conference , IEEE, 2018.
conference:
end_date: 2018-12-13
location: Abu Dhabi, United Arab Emirates
name: 'GLOBECOM: Global Communications Conference'
start_date: 2018-12-09
date_created: 2019-07-30T06:43:15Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:42Z
day: '01'
doi: 10.1109/glocom.2018.8647308
extern: '1'
external_id:
arxiv:
- '1806.11195'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.11195
month: '12'
oa: 1
oa_version: Preprint
publication: '2018 IEEE Global Communications Conference '
publication_identifier:
isbn:
- '9781538647271'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: On the decoding of polar codes on permuted factor graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6774'
abstract:
- lang: eng
text: "A central problem of algebraic topology is to understand the homotopy groups
\ \U0001D70B\U0001D451(\U0001D44B) of a topological space X. For the computational
version of the problem, it is well known that there is no algorithm to decide
whether the fundamental group \U0001D70B1(\U0001D44B) of a given finite simplicial
complex X is trivial. On the other hand, there are several algorithms that, given
a finite simplicial complex X that is simply connected (i.e., with \U0001D70B1(\U0001D44B)
\ trivial), compute the higher homotopy group \U0001D70B\U0001D451(\U0001D44B)
\ for any given \U0001D451≥2 . However, these algorithms come with a caveat:
They compute the isomorphism type of \U0001D70B\U0001D451(\U0001D44B) , \U0001D451≥2
\ as an abstract finitely generated abelian group given by generators and relations,
but they work with very implicit representations of the elements of \U0001D70B\U0001D451(\U0001D44B)
. Converting elements of this abstract group into explicit geometric maps from
the d-dimensional sphere \U0001D446\U0001D451 to X has been one of the main
unsolved problems in the emerging field of computational homotopy theory. Here
we present an algorithm that, given a simply connected space X, computes \U0001D70B\U0001D451(\U0001D44B)
\ and represents its elements as simplicial maps from a suitable triangulation
of the d-sphere \U0001D446\U0001D451 to X. For fixed d, the algorithm runs
in time exponential in size(\U0001D44B) , the number of simplices of X. Moreover,
we prove that this is optimal: For every fixed \U0001D451≥2 , we construct a
family of simply connected spaces X such that for any simplicial map representing
a generator of \U0001D70B\U0001D451(\U0001D44B) , the size of the triangulation
of \U0001D446\U0001D451 on which the map is defined, is exponential in size(\U0001D44B)
."
article_type: original
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology.
2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
apa: Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing
simplicial representatives of homotopy group elements. Journal of Applied and
Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
chicago: Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing
Simplicial Representatives of Homotopy Group Elements.” Journal of Applied
and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.
ieee: M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial
representatives of homotopy group elements,” Journal of Applied and Computational
Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.
ista: Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4),
177–231.
mla: Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy
Group Elements.” Journal of Applied and Computational Topology, vol. 2,
no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
short: M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and
Computational Topology 2 (2018) 177–231.
date_created: 2019-08-08T06:47:40Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-07T13:10:36Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.1007/s41468-018-0021-5
file:
- access_level: open_access
checksum: cf9e7fcd2a113dd4828774fc75cdb7e8
content_type: application/pdf
creator: dernst
date_created: 2019-08-08T06:55:21Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6775'
file_name: 2018_JourAppliedComputTopology_Filakovsky.pdf
file_size: 1056278
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: 3-4
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 177-231
project:
- _id: 25F8B9BC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M01980
name: Robust invariants of Nonlinear Systems
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6681'
relation: dissertation_contains
status: public
status: public
title: Computing simplicial representatives of homotopy group elements
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_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
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: '10357'
abstract:
- lang: eng
text: The misfolding and aggregation of proteins into linear fibrils is widespread
in human biology, for example, in connection with amyloid formation and the pathology
of neurodegenerative disorders such as Alzheimer’s and Parkinson’s diseases. The
oligomeric species that are formed in the early stages of protein aggregation
are of great interest, having been linked with the cellular toxicity associated
with these conditions. However, these species are not characterized in any detail
experimentally, and their properties are not well understood. Many of these species
have been found to have approximately spherical morphology and to be held together
by hydrophobic interactions. We present here an analytical statistical mechanical
model of globular oligomer formation from simple idealized amphiphilic protein
monomers and show that this correlates well with Monte Carlo simulations of oligomer
formation. We identify the controlling parameters of the model, which are closely
related to simple quantities that may be fitted directly from experiment. We predict
that globular oligomers are unlikely to form at equilibrium in many polypeptide
systems but instead form transiently in the early stages of amyloid formation.
We contrast the globular model of oligomer formation to a well-established model
of linear oligomer formation, highlighting how the differing ensemble properties
of linear and globular oligomers offer a potential strategy for characterizing
oligomers from experimental measurements.
acknowledgement: We acknowledge support from the Schiff Foundation (A.J.D.), the Royal
Society (A.Š.), the Academy of Medical Sciences and Wellcome Trust (A.Š.), Peterhouse,
Cambridge (T.C.T.M.), the Swiss National Science foundation (T.C.T.M.), the Wellcome
Trust (T.P.J.K.), the Cambridge Centre for Misfolding Diseases (T.P.J.K.), the BBSRC
(T.P.J.K.), the Frances and Augustus Newman foundation (T.P.J.K.). The research
leading to these results has received funding from the European Research Council
under the European Union’s Seventh Framework Programme (Grant FP7/2007-2013) through
the ERC Grant PhysProt (Agreement No. 337969). We thank Daan Frenkel for several
useful discussions.
article_processing_charge: No
article_type: original
author:
- first_name: Alexander J.
full_name: Dear, Alexander J.
last_name: Dear
- 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: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
citation:
ama: Dear AJ, Šarić A, Michaels TCT, Dobson CM, Knowles TPJ. Statistical mechanics
of globular oligomer formation by protein molecules. The Journal of Physical
Chemistry B. 2018;122(49):11721-11730. doi:10.1021/acs.jpcb.8b07805
apa: Dear, A. J., Šarić, A., Michaels, T. C. T., Dobson, C. M., & Knowles, T.
P. J. (2018). Statistical mechanics of globular oligomer formation by protein
molecules. The Journal of Physical Chemistry B. American Chemical Society.
https://doi.org/10.1021/acs.jpcb.8b07805
chicago: Dear, Alexander J., Anđela Šarić, Thomas C. T. Michaels, Christopher M.
Dobson, and Tuomas P. J. Knowles. “Statistical Mechanics of Globular Oligomer
Formation by Protein Molecules.” The Journal of Physical Chemistry B. American
Chemical Society, 2018. https://doi.org/10.1021/acs.jpcb.8b07805.
ieee: A. J. Dear, A. Šarić, T. C. T. Michaels, C. M. Dobson, and T. P. J. Knowles,
“Statistical mechanics of globular oligomer formation by protein molecules,” The
Journal of Physical Chemistry B, vol. 122, no. 49. American Chemical Society,
pp. 11721–11730, 2018.
ista: Dear AJ, Šarić A, Michaels TCT, Dobson CM, Knowles TPJ. 2018. Statistical
mechanics of globular oligomer formation by protein molecules. The Journal of
Physical Chemistry B. 122(49), 11721–11730.
mla: Dear, Alexander J., et al. “Statistical Mechanics of Globular Oligomer Formation
by Protein Molecules.” The Journal of Physical Chemistry B, vol. 122, no.
49, American Chemical Society, 2018, pp. 11721–30, doi:10.1021/acs.jpcb.8b07805.
short: A.J. Dear, A. Šarić, T.C.T. Michaels, C.M. Dobson, T.P.J. Knowles, The Journal
of Physical Chemistry B 122 (2018) 11721–11730.
date_created: 2021-11-26T11:55:12Z
date_published: 2018-10-18T00:00:00Z
date_updated: 2021-11-26T12:40:02Z
day: '18'
doi: 10.1021/acs.jpcb.8b07805
extern: '1'
external_id:
pmid:
- '30336667'
intvolume: ' 122'
issue: '49'
keyword:
- materials chemistry
language:
- iso: eng
month: '10'
oa_version: None
page: 11721-11730
pmid: 1
publication: The Journal of Physical Chemistry B
publication_identifier:
eissn:
- 1520-5207
issn:
- 1520-6106
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Statistical mechanics of globular oligomer formation by protein molecules
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 122
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: '10360'
abstract:
- lang: eng
text: Mapping free-energy landscapes has proved to be a powerful tool for studying
reaction mechanisms. Many complex biomolecular assembly processes, however, have
remained challenging to access using this approach, including the aggregation
of peptides and proteins into amyloid fibrils implicated in a range of disorders.
Here, we generalize the strategy used to probe free-energy landscapes in protein
folding to determine the activation energies and entropies that characterize each
of the molecular steps in the aggregation of the amyloid-β peptide (Aβ42), which
is associated with Alzheimer’s disease. Our results reveal that interactions between
monomeric Aβ42 and amyloid fibrils during fibril-dependent secondary nucleation
fundamentally reverse the thermodynamic signature of this process relative to
primary nucleation, even though both processes generate aggregates from soluble
peptides. By mapping the energetic and entropic contributions along the reaction
trajectories, we show that the catalytic efficiency of Aβ42 fibril surfaces results
from the enthalpic stabilization of adsorbing peptides in conformations amenable
to nucleation, resulting in a dramatic lowering of the activation energy for nucleation.
acknowledgement: We thank B. Jönsson and I. André for helpful discussions. We acknowledge
financial support from the Schiff Foundation (S.I.A.C.), St John’s College, Cambridge
(S.I.A.C.), the Royal Physiographic Society (R.C.), the Research School FLÄK of
Lund University (S.L., R.C.), the Swedish Research Council (S.L.) and its Linneaus
Centre Organizing Molecular Matter (S.L.), the Crafoord Foundation (S.L.), Alzheimerfonden
(S.L.), the European Research Council (S.L.), NanoLund (S.L.), Knut and Alice Wallenberg
Foundation (S.L.), Peterhouse, Cambridge (T.C.T.M.), the Swiss National Science
Foundation (T.C.T.M.), Magdalene College, Cambridge (A.K.B.), the Leverhulme Trust
(A.K.B.), the Royal Society (A.Š.), the Academy of Medical Sciences (A.Š.), the
Wellcome Trust (C.M.D., T.P.J.K., A.Š.), and the Centre for Misfolding Diseases
(C.M.D., T.P.J.K, M.V.). A.K.B. thanks the Alzheimer Forschung Initiative (AFI).
article_processing_charge: No
article_type: original
author:
- first_name: Samuel I. A.
full_name: Cohen, Samuel I. A.
last_name: Cohen
- first_name: Risto
full_name: Cukalevski, Risto
last_name: Cukalevski
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- 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: Mattias
full_name: Törnquist, Mattias
last_name: Törnquist
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Alexander K.
full_name: Buell, Alexander K.
last_name: Buell
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
- first_name: Sara
full_name: Linse, Sara
last_name: Linse
citation:
ama: Cohen SIA, Cukalevski R, Michaels TCT, et al. Distinct thermodynamic signatures
of oligomer generation in the aggregation of the amyloid-β peptide. Nature
Chemistry. 2018;10(5):523-531. doi:10.1038/s41557-018-0023-x
apa: Cohen, S. I. A., Cukalevski, R., Michaels, T. C. T., Šarić, A., Törnquist,
M., Vendruscolo, M., … Linse, S. (2018). Distinct thermodynamic signatures of
oligomer generation in the aggregation of the amyloid-β peptide. Nature Chemistry.
Springer Nature. https://doi.org/10.1038/s41557-018-0023-x
chicago: Cohen, Samuel I. A., Risto Cukalevski, Thomas C. T. Michaels, Anđela Šarić,
Mattias Törnquist, Michele Vendruscolo, Christopher M. Dobson, Alexander K. Buell,
Tuomas P. J. Knowles, and Sara Linse. “Distinct Thermodynamic Signatures of Oligomer
Generation in the Aggregation of the Amyloid-β Peptide.” Nature Chemistry.
Springer Nature, 2018. https://doi.org/10.1038/s41557-018-0023-x.
ieee: S. I. A. Cohen et al., “Distinct thermodynamic signatures of oligomer
generation in the aggregation of the amyloid-β peptide,” Nature Chemistry,
vol. 10, no. 5. Springer Nature, pp. 523–531, 2018.
ista: Cohen SIA, Cukalevski R, Michaels TCT, Šarić A, Törnquist M, Vendruscolo M,
Dobson CM, Buell AK, Knowles TPJ, Linse S. 2018. Distinct thermodynamic signatures
of oligomer generation in the aggregation of the amyloid-β peptide. Nature Chemistry.
10(5), 523–531.
mla: Cohen, Samuel I. A., et al. “Distinct Thermodynamic Signatures of Oligomer
Generation in the Aggregation of the Amyloid-β Peptide.” Nature Chemistry,
vol. 10, no. 5, Springer Nature, 2018, pp. 523–31, doi:10.1038/s41557-018-0023-x.
short: S.I.A. Cohen, R. Cukalevski, T.C.T. Michaels, A. Šarić, M. Törnquist, M.
Vendruscolo, C.M. Dobson, A.K. Buell, T.P.J. Knowles, S. Linse, Nature Chemistry
10 (2018) 523–531.
date_created: 2021-11-26T12:41:38Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2021-11-26T15:14:00Z
day: '26'
doi: 10.1038/s41557-018-0023-x
extern: '1'
external_id:
pmid:
- '29581486'
intvolume: ' 10'
issue: '5'
keyword:
- general chemical engineering
- general chemistry
language:
- iso: eng
month: '03'
oa_version: None
page: 523-531
pmid: 1
publication: Nature Chemistry
publication_identifier:
eissn:
- 1755-4349
issn:
- 1755-4330
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distinct thermodynamic signatures of oligomer generation in the aggregation
of the amyloid-β peptide
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 10
year: '2018'
...
---
_id: '10361'
abstract:
- lang: eng
text: Understanding how normally soluble peptides and proteins aggregate to form
amyloid fibrils is central to many areas of modern biomolecular science, ranging
from the development of functional biomaterials to the design of rational therapeutic
strategies against increasingly prevalent medical conditions such as Alzheimer's
and Parkinson's diseases. As such, there is a great need to develop models to
mechanistically describe how amyloid fibrils are formed from precursor peptides
and proteins. Here we review and discuss how ideas and concepts from chemical
reaction kinetics can help to achieve this objective. In particular, we show how
a combination of theory, experiments, and computer simulations, based on chemical
kinetics, provides a general formalism for uncovering, at the molecular level,
the mechanistic steps that underlie the phenomenon of amyloid fibril formation.
acknowledgement: "We acknowledge support from the Swiss National Science Foundation
(T.C.T.M.); Peterhouse,\r\nCambridge (T.C.T.M.); the Royal Society (A.S.); the Academy
of Medical Sciences (A.S.); the\r\nWellcome Trust (A.S., M.V., C.M.D., T.P.J.K.);
the Cambridge Centre for Misfolding Diseases\r\n(M.V., C.M.D., T.P.J.K.); the Biotechnology
and Biological Sciences Research Council (C.M.D.,\r\nT.P.J.K.); and the Frances
and Augustus Newman Foundation (T.P.J.K.). The research leading\r\nto these results
has received funding from the European Research Council (ERC) under the\r\nEuropean
Union’s Seventh Framework Programme (FP7/2007-2013) through the ERC grant\r\nPhysProt
(337969)."
article_processing_charge: No
article_type: original
author:
- first_name: Thomas C.T.
full_name: Michaels, Thomas C.T.
last_name: Michaels
- 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: Johnny
full_name: Habchi, Johnny
last_name: Habchi
- first_name: Sean
full_name: Chia, Sean
last_name: Chia
- first_name: Georg
full_name: Meisl, Georg
last_name: Meisl
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Tuomas P.J.
full_name: Knowles, Tuomas P.J.
last_name: Knowles
citation:
ama: Michaels TCT, Šarić A, Habchi J, et al. Chemical kinetics for bridging molecular
mechanisms and macroscopic measurements of amyloid fibril formation. Annual
Review of Physical Chemistry. 2018;69(1):273-298. doi:10.1146/annurev-physchem-050317-021322
apa: Michaels, T. C. T., Šarić, A., Habchi, J., Chia, S., Meisl, G., Vendruscolo,
M., … Knowles, T. P. J. (2018). Chemical kinetics for bridging molecular mechanisms
and macroscopic measurements of amyloid fibril formation. Annual Review of
Physical Chemistry. Annual Reviews. https://doi.org/10.1146/annurev-physchem-050317-021322
chicago: Michaels, Thomas C.T., Anđela Šarić, Johnny Habchi, Sean Chia, Georg Meisl,
Michele Vendruscolo, Christopher M. Dobson, and Tuomas P.J. Knowles. “Chemical
Kinetics for Bridging Molecular Mechanisms and Macroscopic Measurements of Amyloid
Fibril Formation.” Annual Review of Physical Chemistry. Annual Reviews,
2018. https://doi.org/10.1146/annurev-physchem-050317-021322.
ieee: T. C. T. Michaels et al., “Chemical kinetics for bridging molecular
mechanisms and macroscopic measurements of amyloid fibril formation,” Annual
Review of Physical Chemistry, vol. 69, no. 1. Annual Reviews, pp. 273–298,
2018.
ista: Michaels TCT, Šarić A, Habchi J, Chia S, Meisl G, Vendruscolo M, Dobson CM,
Knowles TPJ. 2018. Chemical kinetics for bridging molecular mechanisms and macroscopic
measurements of amyloid fibril formation. Annual Review of Physical Chemistry.
69(1), 273–298.
mla: Michaels, Thomas C. T., et al. “Chemical Kinetics for Bridging Molecular Mechanisms
and Macroscopic Measurements of Amyloid Fibril Formation.” Annual Review of
Physical Chemistry, vol. 69, no. 1, Annual Reviews, 2018, pp. 273–98, doi:10.1146/annurev-physchem-050317-021322.
short: T.C.T. Michaels, A. Šarić, J. Habchi, S. Chia, G. Meisl, M. Vendruscolo,
C.M. Dobson, T.P.J. Knowles, Annual Review of Physical Chemistry 69 (2018) 273–298.
date_created: 2021-11-26T12:52:12Z
date_published: 2018-02-28T00:00:00Z
date_updated: 2021-11-26T15:58:19Z
day: '28'
doi: 10.1146/annurev-physchem-050317-021322
extern: '1'
external_id:
pmid:
- '29490200'
intvolume: ' 69'
issue: '1'
keyword:
- physical and theoretical chemistry
language:
- iso: eng
month: '02'
oa_version: None
page: 273-298
pmid: 1
publication: Annual Review of Physical Chemistry
publication_identifier:
eissn:
- 1545-1593
issn:
- 0066-426X
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chemical kinetics for bridging molecular mechanisms and macroscopic measurements
of amyloid fibril formation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 69
year: '2018'
...
---
_id: '10362'
abstract:
- lang: eng
text: Nuclear pore complexes (NPCs) form gateways that control molecular exchange
between the nucleus and the cytoplasm. They impose a diffusion barrier to macromolecules
and enable the selective transport of nuclear transport receptors with bound cargo.
The underlying mechanisms that establish these permeability properties remain
to be fully elucidated but require unstructured nuclear pore proteins rich in
Phe-Gly (FG)-repeat domains of different types, such as FxFG and GLFG. While physical
modeling and in vitro approaches have provided a framework for explaining how
the FG network contributes to the barrier and transport properties of the NPC,
it remains unknown whether the number and/or the spatial positioning of different
FG-domains along a cylindrical, ∼40 nm diameter transport channel contributes
to their collective properties and function. To begin to answer these questions,
we have used DNA origami to build a cylinder that mimics the dimensions of the
central transport channel and can house a specified number of FG-domains at specific
positions with easily tunable design parameters, such as grafting density and
topology. We find the overall morphology of the FG-domain assemblies to be dependent
on their chemical composition, determined by the type and density of FG-repeat,
and on their architectural confinement provided by the DNA cylinder, largely consistent
with here presented molecular dynamics simulations based on a coarse-grained polymer
model. In addition, high-speed atomic force microscopy reveals local and reversible
FG-domain condensation that transiently occludes the lumen of the DNA central
channel mimics, suggestive of how the NPC might establish its permeability properties.
acknowledgement: We thank J. Edel and members of the Lusk, Lin and Hoogenboom lab
for discussion and acknowledge A. Pyne and R. Thorogate for support carrying out
the AFM experiments. This work was funded by the NIH (R21GM109466 to CPL, CL and
TJM, DP2GM114830 to CL, RO1GM105672 to CPL, and T32GM007223 to PDEF) and the UK
Engineering and Physical Sciences Research Council (EP/L015277/1, EP/L504889/1,
and EP/M028100/1).
article_processing_charge: No
article_type: original
author:
- first_name: Patrick D. Ellis
full_name: Fisher, Patrick D. Ellis
last_name: Fisher
- first_name: Qi
full_name: Shen, Qi
last_name: Shen
- first_name: Bernice
full_name: Akpinar, Bernice
last_name: Akpinar
- first_name: Luke K.
full_name: Davis, Luke K.
last_name: Davis
- first_name: Kenny Kwok Hin
full_name: Chung, Kenny Kwok Hin
last_name: Chung
- first_name: David
full_name: Baddeley, David
last_name: Baddeley
- 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: Thomas J.
full_name: Melia, Thomas J.
last_name: Melia
- first_name: Bart W.
full_name: Hoogenboom, Bart W.
last_name: Hoogenboom
- first_name: Chenxiang
full_name: Lin, Chenxiang
last_name: Lin
- first_name: C. Patrick
full_name: Lusk, C. Patrick
last_name: Lusk
citation:
ama: Fisher PDE, Shen Q, Akpinar B, et al. A Programmable DNA origami platform for
organizing intrinsically disordered nucleoporins within nanopore confinement.
ACS Nano. 2018;12(2):1508-1518. doi:10.1021/acsnano.7b08044
apa: Fisher, P. D. E., Shen, Q., Akpinar, B., Davis, L. K., Chung, K. K. H., Baddeley,
D., … Lusk, C. P. (2018). A Programmable DNA origami platform for organizing intrinsically
disordered nucleoporins within nanopore confinement. ACS Nano. American
Chemical Society. https://doi.org/10.1021/acsnano.7b08044
chicago: Fisher, Patrick D. Ellis, Qi Shen, Bernice Akpinar, Luke K. Davis, Kenny
Kwok Hin Chung, David Baddeley, Anđela Šarić, et al. “A Programmable DNA Origami
Platform for Organizing Intrinsically Disordered Nucleoporins within Nanopore
Confinement.” ACS Nano. American Chemical Society, 2018. https://doi.org/10.1021/acsnano.7b08044.
ieee: P. D. E. Fisher et al., “A Programmable DNA origami platform for organizing
intrinsically disordered nucleoporins within nanopore confinement,” ACS Nano,
vol. 12, no. 2. American Chemical Society, pp. 1508–1518, 2018.
ista: Fisher PDE, Shen Q, Akpinar B, Davis LK, Chung KKH, Baddeley D, Šarić A, Melia
TJ, Hoogenboom BW, Lin C, Lusk CP. 2018. A Programmable DNA origami platform for
organizing intrinsically disordered nucleoporins within nanopore confinement.
ACS Nano. 12(2), 1508–1518.
mla: Fisher, Patrick D. Ellis, et al. “A Programmable DNA Origami Platform for Organizing
Intrinsically Disordered Nucleoporins within Nanopore Confinement.” ACS Nano,
vol. 12, no. 2, American Chemical Society, 2018, pp. 1508–18, doi:10.1021/acsnano.7b08044.
short: P.D.E. Fisher, Q. Shen, B. Akpinar, L.K. Davis, K.K.H. Chung, D. Baddeley,
A. Šarić, T.J. Melia, B.W. Hoogenboom, C. Lin, C.P. Lusk, ACS Nano 12 (2018) 1508–1518.
date_created: 2021-11-26T15:15:00Z
date_published: 2018-01-19T00:00:00Z
date_updated: 2021-11-26T15:57:02Z
day: '19'
doi: 10.1021/acsnano.7b08044
extern: '1'
external_id:
pmid:
- '29350911'
intvolume: ' 12'
issue: '2'
keyword:
- general physics and astronomy
language:
- iso: eng
month: '01'
oa_version: None
page: 1508-1518
pmid: 1
publication: ACS Nano
publication_identifier:
eissn:
- 1936-086X
issn:
- 1936-0851
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Programmable DNA origami platform for organizing intrinsically disordered
nucleoporins within nanopore confinement
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 12
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'
...