---
_id: '194'
abstract:
- lang: eng
text: Ants are emerging model systems to study cellular signaling because distinct
castes possess different physiologic phenotypes within the same colony. Here we
studied the functionality of inotocin signaling, an insect ortholog of mammalian
oxytocin (OT), which was recently discovered in ants. In Lasius ants, we determined
that specialization within the colony, seasonal factors, and physiologic conditions
down-regulated the expression of the OT-like signaling system. Given this natural
variation, we interrogated its function using RNAi knockdowns. Next-generation
RNA sequencing of OT-like precursor knock-down ants highlighted its role in the
regulation of genes involved in metabolism. Knock-down ants exhibited higher walking
activity and increased self-grooming in the brood chamber. We propose that OT-like
signaling in ants is important for regulating metabolic processes and locomotion.
article_processing_charge: No
article_type: original
author:
- first_name: Zita
full_name: Liutkeviciute, Zita
last_name: Liutkeviciute
- first_name: Esther
full_name: Gil Mansilla, Esther
last_name: Gil Mansilla
- first_name: Thomas
full_name: Eder, Thomas
last_name: Eder
- first_name: Barbara E
full_name: Casillas Perez, Barbara E
id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
last_name: Casillas Perez
- first_name: Maria
full_name: Giulia Di Giglio, Maria
last_name: Giulia Di Giglio
- first_name: Edin
full_name: Muratspahić, Edin
last_name: Muratspahić
- first_name: Florian
full_name: Grebien, Florian
last_name: Grebien
- first_name: Thomas
full_name: Rattei, Thomas
last_name: Rattei
- first_name: Markus
full_name: Muttenthaler, Markus
last_name: Muttenthaler
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Christian
full_name: Gruber, Christian
last_name: Gruber
citation:
ama: Liutkeviciute Z, Gil Mansilla E, Eder T, et al. Oxytocin-like signaling in
ants influences metabolic gene expression and locomotor activity. The FASEB
Journal. 2018;32(12):6808-6821. doi:10.1096/fj.201800443
apa: Liutkeviciute, Z., Gil Mansilla, E., Eder, T., Casillas Perez, B. E., Giulia
Di Giglio, M., Muratspahić, E., … Gruber, C. (2018). Oxytocin-like signaling in
ants influences metabolic gene expression and locomotor activity. The FASEB
Journal. FASEB. https://doi.org/10.1096/fj.201800443
chicago: Liutkeviciute, Zita, Esther Gil Mansilla, Thomas Eder, Barbara E Casillas
Perez, Maria Giulia Di Giglio, Edin Muratspahić, Florian Grebien, et al. “Oxytocin-like
Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.”
The FASEB Journal. FASEB, 2018. https://doi.org/10.1096/fj.201800443.
ieee: Z. Liutkeviciute et al., “Oxytocin-like signaling in ants influences
metabolic gene expression and locomotor activity,” The FASEB Journal, vol.
32, no. 12. FASEB, pp. 6808–6821, 2018.
ista: Liutkeviciute Z, Gil Mansilla E, Eder T, Casillas Perez BE, Giulia Di Giglio
M, Muratspahić E, Grebien F, Rattei T, Muttenthaler M, Cremer S, Gruber C. 2018.
Oxytocin-like signaling in ants influences metabolic gene expression and locomotor
activity. The FASEB Journal. 32(12), 6808–6821.
mla: Liutkeviciute, Zita, et al. “Oxytocin-like Signaling in Ants Influences Metabolic
Gene Expression and Locomotor Activity.” The FASEB Journal, vol. 32, no.
12, FASEB, 2018, pp. 6808–21, doi:10.1096/fj.201800443.
short: Z. Liutkeviciute, E. Gil Mansilla, T. Eder, B.E. Casillas Perez, M. Giulia
Di Giglio, E. Muratspahić, F. Grebien, T. Rattei, M. Muttenthaler, S. Cremer,
C. Gruber, The FASEB Journal 32 (2018) 6808–6821.
date_created: 2018-12-11T11:45:08Z
date_published: 2018-11-29T00:00:00Z
date_updated: 2023-09-13T09:37:32Z
day: '29'
department:
- _id: SyCr
doi: 10.1096/fj.201800443
external_id:
isi:
- '000449359700035'
pmid:
- '29939785'
intvolume: ' 32'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.1096/fj.201800443'
month: '11'
oa: 1
oa_version: Published Version
page: 6808-6821
pmid: 1
project:
- _id: 25E3D34E-B435-11E9-9278-68D0E5697425
name: Individual function and social role of oxytocin-like neuropeptides in ants
publication: The FASEB Journal
publication_identifier:
issn:
- '08926638'
publication_status: published
publisher: FASEB
publist_id: '7721'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Oxytocin-like signaling in ants influences metabolic gene expression and locomotor
activity
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 32
year: '2018'
...
---
_id: '195'
abstract:
- lang: eng
text: We demonstrate that identical impurities immersed in a two-dimensional many-particle
bath can be viewed as flux-tube-charged-particle composites described by fractional
statistics. In particular, we find that the bath manifests itself as an external
magnetic flux tube with respect to the impurities, and hence the time-reversal
symmetry is broken for the effective Hamiltonian describing the impurities. The
emerging flux tube acts as a statistical gauge field after a certain critical
coupling. This critical coupling corresponds to the intersection point between
the quasiparticle state and the phonon wing, where the angular momentum is transferred
from the impurity to the bath. This amounts to a novel configuration with emerging
anyons. The proposed setup paves the way to realizing anyons using electrons interacting
with superfluid helium or lattice phonons, as well as using atomic impurities
in ultracold gases.
article_number: '045402'
article_processing_charge: No
arxiv: 1
author:
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Yakaboylu E, Lemeshko M. Anyonic statistics of quantum impurities in two dimensions.
Physical Review B - Condensed Matter and Materials Physics. 2018;98(4).
doi:10.1103/PhysRevB.98.045402
apa: Yakaboylu, E., & Lemeshko, M. (2018). Anyonic statistics of quantum impurities
in two dimensions. Physical Review B - Condensed Matter and Materials Physics.
American Physical Society. https://doi.org/10.1103/PhysRevB.98.045402
chicago: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum
Impurities in Two Dimensions.” Physical Review B - Condensed Matter and Materials
Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.045402.
ieee: E. Yakaboylu and M. Lemeshko, “Anyonic statistics of quantum impurities in
two dimensions,” Physical Review B - Condensed Matter and Materials Physics,
vol. 98, no. 4. American Physical Society, 2018.
ista: Yakaboylu E, Lemeshko M. 2018. Anyonic statistics of quantum impurities in
two dimensions. Physical Review B - Condensed Matter and Materials Physics. 98(4),
045402.
mla: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities
in Two Dimensions.” Physical Review B - Condensed Matter and Materials Physics,
vol. 98, no. 4, 045402, American Physical Society, 2018, doi:10.1103/PhysRevB.98.045402.
short: E. Yakaboylu, M. Lemeshko, Physical Review B - Condensed Matter and Materials
Physics 98 (2018).
date_created: 2018-12-11T11:45:08Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-08T13:22:57Z
day: '15'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.98.045402
ec_funded: 1
external_id:
arxiv:
- '1712.00308'
isi:
- '000436939100007'
intvolume: ' 98'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.00308
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anyonic statistics of quantum impurities in two dimensions
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 98
year: '2018'
...
---
_id: '197'
abstract:
- lang: eng
text: Modern computer vision systems heavily rely on statistical machine learning
models, which typically require large amounts of labeled data to be learned reliably.
Moreover, very recently computer vision research widely adopted techniques for
representation learning, which further increase the demand for labeled data. However,
for many important practical problems there is relatively small amount of labeled
data available, so it is problematic to leverage full potential of the representation
learning methods. One way to overcome this obstacle is to invest substantial resources
into producing large labelled datasets. Unfortunately, this can be prohibitively
expensive in practice. In this thesis we focus on the alternative way of tackling
the aforementioned issue. We concentrate on methods, which make use of weakly-labeled
or even unlabeled data. Specifically, the first half of the thesis is dedicated
to the semantic image segmentation task. We develop a technique, which achieves
competitive segmentation performance and only requires annotations in a form of
global image-level labels instead of dense segmentation masks. Subsequently, we
present a new methodology, which further improves segmentation performance by
leveraging tiny additional feedback from a human annotator. By using our methods
practitioners can greatly reduce the amount of data annotation effort, which is
required to learn modern image segmentation models. In the second half of the
thesis we focus on methods for learning from unlabeled visual data. We study a
family of autoregressive models for modeling structure of natural images and discuss
potential applications of these models. Moreover, we conduct in-depth study of
one of these applications, where we develop the state-of-the-art model for the
probabilistic image colorization task.
acknowledgement: I also gratefully acknowledge the support of NVIDIA Corporation with
the donation of the GPUs used for this research.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
citation:
ama: Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural
Images. 2018. doi:10.15479/AT:ISTA:th_1021
apa: Kolesnikov, A. (2018). Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021
chicago: Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised
Modeling of Natural Images.” Institute of Science and Technology Austria, 2018.
https://doi.org/10.15479/AT:ISTA:th_1021.
ieee: A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of
Natural Images,” Institute of Science and Technology Austria, 2018.
ista: Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria.
mla: Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021.
short: A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of
Natural Images, Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:09Z
date_published: 2018-05-25T00:00:00Z
date_updated: 2023-09-07T12:51:46Z
day: '25'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:th_1021
ec_funded: 1
file:
- access_level: open_access
checksum: bc678e02468d8ebc39dc7267dfb0a1c4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:57Z
date_updated: 2020-07-14T12:45:22Z
file_id: '5113'
file_name: IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf
file_size: 12918758
relation: main_file
- access_level: closed
checksum: bc66973b086da5a043f1162dcfb1fde4
content_type: application/zip
creator: dernst
date_created: 2019-04-05T09:34:49Z
date_updated: 2020-07-14T12:45:22Z
file_id: '6225'
file_name: 2018_Thesis_Kolesnikov_source.zip
file_size: 55973760
relation: source_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '113'
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: '7718'
pubrep_id: '1021'
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: Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '198'
abstract:
- lang: eng
text: We consider a class of students learning a language from a teacher. The situation
can be interpreted as a group of child learners receiving input from the linguistic
environment. The teacher provides sample sentences. The students try to learn
the grammar from the teacher. In addition to just listening to the teacher, the
students can also communicate with each other. The students hold hypotheses about
the grammar and change them if they receive counter evidence. The process stops
when all students have converged to the correct grammar. We study how the time
to convergence depends on the structure of the classroom by introducing and evaluating
various complexity measures. We find that structured communication between students,
although potentially introducing confusion, can greatly reduce some of the complexity
measures. Our theory can also be interpreted as applying to the scientific process,
where nature is the teacher and the scientists are the students.
article_number: '20180073'
article_processing_charge: No
article_type: original
author:
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with
communication between learners. Journal of the Royal Society Interface.
2018;15(140). doi:10.1098/rsif.2018.0073
apa: Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language
acquisition with communication between learners. Journal of the Royal Society
Interface. The Royal Society. https://doi.org/10.1098/rsif.2018.0073
chicago: Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. “Language Acquisition with Communication between Learners.” Journal
of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
ieee: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition
with communication between learners,” Journal of the Royal Society Interface,
vol. 15, no. 140. The Royal Society, 2018.
ista: Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition
with communication between learners. Journal of the Royal Society Interface. 15(140),
20180073.
mla: Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between
Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073,
The Royal Society, 2018, doi:10.1098/rsif.2018.0073.
short: R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal
Society Interface 15 (2018).
date_created: 2018-12-11T11:45:09Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-10-18T06:36:00Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1098/rsif.2018.0073
ec_funded: 1
external_id:
isi:
- '000428576200023'
pmid:
- '29593089'
file:
- access_level: open_access
checksum: 444e1a9d98eb0e780671be82b13025f3
content_type: application/pdf
creator: dernst
date_created: 2019-02-12T07:54:37Z
date_updated: 2020-07-14T12:45:22Z
file_id: '5955'
file_name: 2018_RS_IbsenJensen.pdf
file_size: 219837
relation: main_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '140'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Journal of the Royal Society Interface
publication_identifier:
eissn:
- 1742-5662
publication_status: published
publisher: The Royal Society
publist_id: '7715'
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: https://dx.doi.org/10.6084/m9.figshare.c.4028971
record:
- id: '9814'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Language acquisition with communication between learners
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2018'
...
---
_id: '199'
abstract:
- lang: eng
text: Sex-biased genes are central to the study of sexual selection, sexual antagonism,
and sex chromosome evolution. We describe a comprehensive de novo assembled transcriptome
in the common frog Rana temporaria based on five developmental stages and three
adult tissues from both sexes, obtained from a population with karyotypically
homomorphic but genetically differentiated sex chromosomes. This allows the study
of sex-biased gene expression throughout development, and its effect on the rate
of gene evolution while accounting for pleiotropic expression, which is known
to negatively correlate with the evolutionary rate. Overall, sex-biased genes
had little overlap among developmental stages and adult tissues. Late developmental
stages and gonad tissues had the highest numbers of stage-or tissue-specific genes.
We find that pleiotropic gene expression is a better predictor than sex bias for
the evolutionary rate of genes, though it often interacts with sex bias. Although
genetically differentiated, the sex chromosomes were not enriched in sex-biased
genes, possibly due to a very recent arrest of XY recombination. These results
extend our understanding of the developmental dynamics, tissue specificity, and
genomic localization of sex-biased genes.
article_number: '294'
article_processing_charge: No
author:
- first_name: Wen
full_name: Ma, Wen
last_name: Ma
- first_name: Paris
full_name: Veltsos, Paris
last_name: Veltsos
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Nicolas
full_name: Rodrigues, Nicolas
last_name: Rodrigues
- first_name: Roberto
full_name: Sermier, Roberto
last_name: Sermier
- first_name: Daniel
full_name: Jeffries, Daniel
last_name: Jeffries
- first_name: Nicolas
full_name: Perrin, Nicolas
last_name: Perrin
citation:
ama: Ma W, Veltsos P, Toups MA, et al. Tissue specificity and dynamics of sex biased
gene expression in a common frog population with differentiated, yet homomorphic,
sex chromosomes. Genes. 2018;9(6). doi:10.3390/genes9060294
apa: Ma, W., Veltsos, P., Toups, M. A., Rodrigues, N., Sermier, R., Jeffries, D.,
& Perrin, N. (2018). Tissue specificity and dynamics of sex biased gene expression
in a common frog population with differentiated, yet homomorphic, sex chromosomes.
Genes. MDPI AG. https://doi.org/10.3390/genes9060294
chicago: Ma, Wen, Paris Veltsos, Melissa A Toups, Nicolas Rodrigues, Roberto Sermier,
Daniel Jeffries, and Nicolas Perrin. “Tissue Specificity and Dynamics of Sex Biased
Gene Expression in a Common Frog Population with Differentiated, yet Homomorphic,
Sex Chromosomes.” Genes. MDPI AG, 2018. https://doi.org/10.3390/genes9060294.
ieee: W. Ma et al., “Tissue specificity and dynamics of sex biased gene expression
in a common frog population with differentiated, yet homomorphic, sex chromosomes,”
Genes, vol. 9, no. 6. MDPI AG, 2018.
ista: Ma W, Veltsos P, Toups MA, Rodrigues N, Sermier R, Jeffries D, Perrin N. 2018.
Tissue specificity and dynamics of sex biased gene expression in a common frog
population with differentiated, yet homomorphic, sex chromosomes. Genes. 9(6),
294.
mla: Ma, Wen, et al. “Tissue Specificity and Dynamics of Sex Biased Gene Expression
in a Common Frog Population with Differentiated, yet Homomorphic, Sex Chromosomes.”
Genes, vol. 9, no. 6, 294, MDPI AG, 2018, doi:10.3390/genes9060294.
short: W. Ma, P. Veltsos, M.A. Toups, N. Rodrigues, R. Sermier, D. Jeffries, N.
Perrin, Genes 9 (2018).
date_created: 2018-12-11T11:45:09Z
date_published: 2018-06-12T00:00:00Z
date_updated: 2023-09-19T10:15:31Z
day: '12'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.3390/genes9060294
external_id:
isi:
- '000436494200026'
file:
- access_level: open_access
checksum: 423069beb1cd3cdd25bf3f464b38f1d7
content_type: application/pdf
creator: dernst
date_created: 2019-02-01T07:52:28Z
date_updated: 2020-07-14T12:45:22Z
file_id: '5905'
file_name: 2018_Genes_Ma.pdf
file_size: 3985796
relation: main_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Genes
publication_status: published
publisher: MDPI AG
publist_id: '7714'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tissue specificity and dynamics of sex biased gene expression in a common frog
population with differentiated, yet homomorphic, sex chromosomes
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: 9
year: '2018'
...
---
_id: '2'
abstract:
- lang: eng
text: Indirect reciprocity explores how humans act when their reputation is at stake,
and which social norms they use to assess the actions of others. A crucial question
in indirect reciprocity is which social norms can maintain stable cooperation
in a society. Past research has highlighted eight such norms, called “leading-eight”
strategies. This past research, however, is based on the assumption that all relevant
information about other population members is publicly available and that everyone
agrees on who is good or bad. Instead, here we explore the reputation dynamics
when information is private and noisy. We show that under these conditions, most
leading-eight strategies fail to evolve. Those leading-eight strategies that do
evolve are unable to sustain full cooperation.Indirect reciprocity is a mechanism
for cooperation based on shared moral systems and individual reputations. It assumes
that members of a community routinely observe and assess each other and that they
use this information to decide who is good or bad, and who deserves cooperation.
When information is transmitted publicly, such that all community members agree
on each other’s reputation, previous research has highlighted eight crucial moral
systems. These “leading-eight” strategies can maintain cooperation and resist
invasion by defectors. However, in real populations individuals often hold their
own private views of others. Once two individuals disagree about their opinion
of some third party, they may also see its subsequent actions in a different light.
Their opinions may further diverge over time. Herein, we explore indirect reciprocity
when information transmission is private and noisy. We find that in the presence
of perception errors, most leading-eight strategies cease to be stable. Even if
a leading-eight strategy evolves, cooperation rates may drop considerably when
errors are common. Our research highlights the role of reliable information and
synchronized reputations to maintain stable moral systems.
article_processing_charge: No
author:
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. Indirect reciprocity with
private, noisy, and incomplete information. PNAS. 2018;115(48):12241-12246.
doi:10.1073/pnas.1810565115
apa: Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018).
Indirect reciprocity with private, noisy, and incomplete information. PNAS.
National Academy of Sciences. https://doi.org/10.1073/pnas.1810565115
chicago: Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and
Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.”
PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1810565115.
ieee: C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity
with private, noisy, and incomplete information,” PNAS, vol. 115, no. 48.
National Academy of Sciences, pp. 12241–12246, 2018.
ista: Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity
with private, noisy, and incomplete information. PNAS. 115(48), 12241–12246.
mla: Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete
Information.” PNAS, vol. 115, no. 48, National Academy of Sciences, 2018,
pp. 12241–46, doi:10.1073/pnas.1810565115.
short: C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018)
12241–12246.
date_created: 2018-12-11T11:44:05Z
date_published: 2018-11-27T00:00:00Z
date_updated: 2025-07-14T09:10:09Z
day: '27'
department:
- _id: KrCh
doi: 10.1073/pnas.1810565115
ec_funded: 1
external_id:
isi:
- '000451351000063'
pmid:
- '30429320'
intvolume: ' 115'
isi: 1
issue: '48'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30429320
month: '11'
oa: 1
oa_version: Submitted Version
page: 12241-12246
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/no-cooperation-without-open-communication/
record:
- id: '10293'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Indirect reciprocity with private, noisy, and incomplete information
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '20'
abstract:
- lang: eng
text: 'Background: Norepinephrine (NE) signaling has a key role in white adipose
tissue (WAT) functions, including lipolysis, free fatty acid liberation and, under
certain conditions, conversion of white into brite (brown-in-white) adipocytes.
However, acute effects of NE stimulation have not been described at the transcriptional
network level. Results: We used RNA-seq to uncover a broad transcriptional response.
The inference of protein-protein and protein-DNA interaction networks allowed
us to identify a set of immediate-early genes (IEGs) with high betweenness, validating
our approach and suggesting a hierarchical control of transcriptional regulation.
In addition, we identified a transcriptional regulatory network with IEGs as master
regulators, including HSF1 and NFIL3 as novel NE-induced IEG candidates. Moreover,
a functional enrichment analysis and gene clustering into functional modules suggest
a crosstalk between metabolic, signaling, and immune responses. Conclusions: Altogether,
our network biology approach explores for the first time the immediate-early systems
level response of human adipocytes to acute sympathetic activation, thereby providing
a first network basis of early cell fate programs and crosstalks between metabolic
and transcriptional networks required for proper WAT function.'
acknowledgement: This work was funded by the German Centre for Diabetes Research (DZD)
and the Austrian Science Fund (FWF, P25729-B19).
article_processing_charge: No
article_type: original
author:
- first_name: Juan
full_name: Higareda Almaraz, Juan
last_name: Higareda Almaraz
- first_name: Michael
full_name: Karbiener, Michael
last_name: Karbiener
- first_name: Maude
full_name: Giroud, Maude
last_name: Giroud
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
orcid: 0000-0002-7462-0048
- first_name: Teresa
full_name: Gerhalter, Teresa
last_name: Gerhalter
- first_name: Stephan
full_name: Herzig, Stephan
last_name: Herzig
- first_name: Marcel
full_name: Scheideler, Marcel
last_name: Scheideler
citation:
ama: Higareda Almaraz J, Karbiener M, Giroud M, et al. Norepinephrine triggers an
immediate-early regulatory network response in primary human white adipocytes.
BMC Genomics. 2018;19(1). doi:10.1186/s12864-018-5173-0
apa: Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T.,
Herzig, S., & Scheideler, M. (2018). Norepinephrine triggers an immediate-early
regulatory network response in primary human white adipocytes. BMC Genomics.
BioMed Central. https://doi.org/10.1186/s12864-018-5173-0
chicago: Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler,
Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Norepinephrine Triggers
an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.”
BMC Genomics. BioMed Central, 2018. https://doi.org/10.1186/s12864-018-5173-0.
ieee: J. Higareda Almaraz et al., “Norepinephrine triggers an immediate-early
regulatory network response in primary human white adipocytes,” BMC Genomics,
vol. 19, no. 1. BioMed Central, 2018.
ista: Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S,
Scheideler M. 2018. Norepinephrine triggers an immediate-early regulatory network
response in primary human white adipocytes. BMC Genomics. 19(1).
mla: Higareda Almaraz, Juan, et al. “Norepinephrine Triggers an Immediate-Early
Regulatory Network Response in Primary Human White Adipocytes.” BMC Genomics,
vol. 19, no. 1, BioMed Central, 2018, doi:10.1186/s12864-018-5173-0.
short: J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S.
Herzig, M. Scheideler, BMC Genomics 19 (2018).
date_created: 2018-12-11T11:44:12Z
date_published: 2018-11-03T00:00:00Z
date_updated: 2023-09-13T09:10:47Z
day: '03'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1186/s12864-018-5173-0
external_id:
isi:
- '000450976700002'
file:
- access_level: open_access
checksum: a56516e734dab589dc7f3e1915973b4d
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:52:57Z
date_updated: 2020-07-14T12:45:23Z
file_id: '5712'
file_name: 2018_BMCGenomics_Higareda.pdf
file_size: 4629784
relation: main_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: BMC Genomics
publication_identifier:
issn:
- 1471-2164
publication_status: published
publisher: BioMed Central
publist_id: '8035'
quality_controlled: '1'
related_material:
record:
- id: '9807'
relation: research_data
status: public
- id: '9808'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Norepinephrine triggers an immediate-early regulatory network response in primary
human white adipocytes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2018'
...
---
_id: '200'
abstract:
- lang: eng
text: This thesis is concerned with the inference of current population structure
based on geo-referenced genetic data. The underlying idea is that population structure
affects its spatial genetic structure. Therefore, genotype information can be
utilized to estimate important demographic parameters such as migration rates.
These indirect estimates of population structure have become very attractive,
as genotype data is now widely available. However, there also has been much concern
about these approaches. Importantly, genetic structure can be influenced by many
complex patterns, which often cannot be disentangled. Moreover, many methods merely
fit heuristic patterns of genetic structure, and do not build upon population
genetics theory. Here, I describe two novel inference methods that address these
shortcomings. In Chapter 2, I introduce an inference scheme based on a new type
of signal, identity by descent (IBD) blocks. Recently, it has become feasible
to detect such long blocks of genome shared between pairs of samples. These blocks
are direct traces of recent coalescence events. As such, they contain ample signal
for inferring recent demography. I examine sharing of IBD blocks in two-dimensional
populations with local migration. Using a diffusion approximation, I derive formulas
for an isolation by distance pattern of long IBD blocks and show that sharing
of long IBD blocks approaches rapid exponential decay for growing sample distance.
I describe an inference scheme based on these results. It can robustly estimate
the dispersal rate and population density, which is demonstrated on simulated
data. I also show an application to estimate mean migration and the rate of recent
population growth within Eastern Europe. Chapter 3 is about a novel method to
estimate barriers to gene flow in a two dimensional population. This inference
scheme utilizes geographically localized allele frequency fluctuations - a classical
isolation by distance signal. The strength of these local fluctuations increases
on average next to a barrier, and there is less correlation across it. I again
use a framework of diffusion of ancestral lineages to model this effect, and provide
an efficient numerical implementation to fit the results to geo-referenced biallelic
SNP data. This inference scheme is able to robustly estimate strong barriers to
gene flow, as tests on simulated data confirm.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
citation:
ama: Ringbauer H. Inferring recent demography from spatial genetic structure. 2018.
doi:10.15479/AT:ISTA:th_963
apa: Ringbauer, H. (2018). Inferring recent demography from spatial genetic structure.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_963
chicago: Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_963.
ieee: H. Ringbauer, “Inferring recent demography from spatial genetic structure,”
Institute of Science and Technology Austria, 2018.
ista: Ringbauer H. 2018. Inferring recent demography from spatial genetic structure.
Institute of Science and Technology Austria.
mla: Ringbauer, Harald. Inferring Recent Demography from Spatial Genetic Structure.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_963.
short: H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-02-21T00:00:00Z
date_updated: 2025-05-28T11:57:06Z
day: '21'
ddc:
- '576'
degree_awarded: PhD
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:th_963
file:
- access_level: open_access
checksum: 8cc534d2b528ae017acf80874cce48c9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:55Z
date_updated: 2020-07-14T12:45:23Z
file_id: '5111'
file_name: IST-2018-963-v1+1_thesis.pdf
file_size: 5792935
relation: main_file
- access_level: closed
checksum: 6af18d7e5a7e2728ceda2f41ee24f628
content_type: application/zip
creator: dernst
date_created: 2019-04-05T09:30:12Z
date_updated: 2020-07-14T12:45:23Z
file_id: '6224'
file_name: 2018_thesis_ringbauer_source.zip
file_size: 113365
relation: source_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '146'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7713'
pubrep_id: '963'
related_material:
record:
- id: '563'
relation: part_of_dissertation
status: public
- id: '1074'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Inferring recent demography from spatial genetic structure
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '201'
abstract:
- lang: eng
text: 'We describe arrangements of three-dimensional spheres from a geometrical
and topological point of view. Real data (fitting this setup) often consist of
soft spheres which show certain degree of deformation while strongly packing against
each other. In this context, we answer the following questions: If we model a
soft packing of spheres by hard spheres that are allowed to overlap, can we measure
the volume in the overlapped areas? Can we be more specific about the overlap
volume, i.e. quantify how much volume is there covered exactly twice, three times,
or k times? What would be a good optimization criteria that rule the arrangement
of soft spheres while making a good use of the available space? Fixing a particular
criterion, what would be the optimal sphere configuration? The first result of
this thesis are short formulas for the computation of volumes covered by at least
k of the balls. The formulas exploit information contained in the order-k Voronoi
diagrams and its closely related Level-k complex. The used complexes lead to a
natural generalization into poset diagrams, a theoretical formalism that contains
the order-k and degree-k diagrams as special cases. In parallel, we define different
criteria to determine what could be considered an optimal arrangement from a geometrical
point of view. Fixing a criterion, we find optimal soft packing configurations
in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools
from computational topology on real physical data, to show the potentials of higher-order
diagrams in the description of melting crystals. The results of the experiments
leaves us with an open window to apply the theories developed in this thesis in
real applications.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
citation:
ama: Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026
apa: Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026
chicago: Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026.
ieee: M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology
Austria, 2018.
ista: Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and
Technology Austria.
mla: Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026.
short: M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T12:25:32Z
day: '11'
ddc:
- '514'
- '516'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_1026
file:
- access_level: closed
checksum: dd699303623e96d1478a6ae07210dd05
content_type: application/zip
creator: kschuh
date_created: 2019-02-05T07:43:31Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5918'
file_name: IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip
file_size: 11827713
relation: source_file
- access_level: open_access
checksum: ba163849a190d2b41d66fef0e4983294
content_type: application/pdf
creator: kschuh
date_created: 2019-02-05T07:43:45Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5919'
file_name: IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf
file_size: 4783846
relation: main_file
file_date_updated: 2020-07-14T12:45:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '171'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7712'
pubrep_id: '1026'
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: Multiple covers with balls
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '2015'
abstract:
- lang: eng
text: We consider the problem of learning a Bayesian network or directed acyclic
graph model from observational data. A number of constraint‐based, score‐based
and hybrid algorithms have been developed for this purpose. Statistical consistency
guarantees of these algorithms rely on the faithfulness assumption, which has
been shown to be restrictive especially for graphs with cycles in the skeleton.
We here propose the sparsest permutation (SP) algorithm, showing that learning
Bayesian networks is possible under strictly weaker assumptions than faithfulness.
This comes at a computational price, thereby indicating a statistical‐computational
trade‐off for causal inference algorithms. In the Gaussian noiseless setting,
we prove that the SP algorithm boils down to finding the permutation of the variables
with the sparsest Cholesky decomposition of the inverse covariance matrix, which
is equivalent to ℓ0‐penalized maximum likelihood estimation. We end with a simulation
study showing that in line with the proven stronger consistency guarantees, and
the SP algorithm compares favourably to standard causal inference algorithms in
terms of accuracy for a given sample size.
article_number: e183
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Garvesh
full_name: Raskutti, Garvesh
last_name: Raskutti
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations.
STAT. 2018;7(1). doi:10.1002/sta4.183
apa: Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based
on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183
chicago: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs
Based on Sparsest Permutations.” STAT. Wiley, 2018. https://doi.org/10.1002/sta4.183.
ieee: G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest
permutations,” STAT, vol. 7, no. 1. Wiley, 2018.
ista: Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest
permutations. STAT. 7(1), e183.
mla: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based
on Sparsest Permutations.” STAT, vol. 7, no. 1, e183, Wiley, 2018, doi:10.1002/sta4.183.
short: G. Raskutti, C. Uhler, STAT 7 (2018).
date_created: 2018-12-11T11:55:13Z
date_published: 2018-04-17T00:00:00Z
date_updated: 2021-01-12T06:54:44Z
day: '17'
doi: 10.1002/sta4.183
extern: '1'
external_id:
arxiv:
- '1307.0366'
intvolume: ' 7'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.0366
month: '04'
oa: 1
oa_version: Preprint
publication: STAT
publication_status: published
publisher: Wiley
publist_id: '5061'
quality_controlled: '1'
status: public
title: Learning directed acyclic graphs based on sparsest permutations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2018'
...
---
_id: '203'
abstract:
- lang: eng
text: Asymmetric auxin distribution is instrumental for the differential growth
that causes organ bending on tropic stimuli and curvatures during plant development.
Local differences in auxin concentrations are achieved mainly by polarized cellular
distribution of PIN auxin transporters, but whether other mechanisms involving
auxin homeostasis are also relevant for the formation of auxin gradients is not
clear. Here we show that auxin methylation is required for asymmetric auxin distribution
across the hypocotyl, particularly during its response to gravity. We found that
loss-of-function mutants in Arabidopsis IAA CARBOXYL METHYLTRANSFERASE1 (IAMT1)
prematurely unfold the apical hook, and that their hypocotyls are impaired in
gravitropic reorientation. This defect is linked to an auxin-dependent increase
in PIN gene expression, leading to an increased polar auxin transport and lack
of asymmetric distribution of PIN3 in the iamt1 mutant. Gravitropic reorientation
in the iamt1 mutant could be restored with either endodermis-specific expression
of IAMT1 or partial inhibition of polar auxin transport, which also results in
normal PIN gene expression levels. We propose that IAA methylation is necessary
in gravity-sensing cells to restrict polar auxin transport within the range of
auxin levels that allow for differential responses.
article_processing_charge: No
author:
- first_name: Mohamad
full_name: Abbas, Mohamad
id: 47E8FC1C-F248-11E8-B48F-1D18A9856A87
last_name: Abbas
- first_name: García J
full_name: Hernández, García J
last_name: Hernández
- first_name: Stephan
full_name: Pollmann, Stephan
last_name: Pollmann
- first_name: Sophia L
full_name: Samodelov, Sophia L
last_name: Samodelov
- first_name: Martina
full_name: Kolb, Martina
last_name: Kolb
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Ulrich Z
full_name: Hammes, Ulrich Z
last_name: Hammes
- first_name: Matias D
full_name: Zurbriggen, Matias D
last_name: Zurbriggen
- first_name: Miguel
full_name: Blázquez, Miguel
last_name: Blázquez
- first_name: David
full_name: Alabadí, David
last_name: Alabadí
citation:
ama: Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for
differential growth in Arabidopsis. PNAS. 2018;115(26):6864-6869. doi:10.1073/pnas.1806565115
apa: Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml,
J., … Alabadí, D. (2018). Auxin methylation is required for differential growth
in Arabidopsis. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1806565115
chicago: Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov,
Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez,
and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.”
PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1806565115.
ieee: M. Abbas et al., “Auxin methylation is required for differential growth
in Arabidopsis,” PNAS, vol. 115, no. 26. National Academy of Sciences,
pp. 6864–6869, 2018.
ista: Abbas M, Hernández GJ, Pollmann S, Samodelov SL, Kolb M, Friml J, Hammes UZ,
Zurbriggen MD, Blázquez M, Alabadí D. 2018. Auxin methylation is required for
differential growth in Arabidopsis. PNAS. 115(26), 6864–6869.
mla: Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth
in Arabidopsis.” PNAS, vol. 115, no. 26, National Academy of Sciences,
2018, pp. 6864–69, doi:10.1073/pnas.1806565115.
short: M. Abbas, G.J. Hernández, S. Pollmann, S.L. Samodelov, M. Kolb, J. Friml,
U.Z. Hammes, M.D. Zurbriggen, M. Blázquez, D. Alabadí, PNAS 115 (2018) 6864–6869.
date_created: 2018-12-11T11:45:11Z
date_published: 2018-06-26T00:00:00Z
date_updated: 2025-05-07T11:12:32Z
day: '26'
department:
- _id: JiFr
doi: 10.1073/pnas.1806565115
ec_funded: 1
external_id:
isi:
- '000436245000096'
intvolume: ' 115'
isi: 1
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprints.nottingham.ac.uk/52388/
month: '06'
oa: 1
oa_version: None
page: 6864-6869
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7710'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin methylation is required for differential growth in Arabidopsis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '21'
abstract:
- lang: eng
text: Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits
are thought to play a key role in several higher network functions, such as feedforward
and feedback inhibition, network oscillations, and pattern separation. Fast lateral
inhibition mediated by GABAergic interneurons may implement a winner-takes-all
mechanism in the hippocampal input layer. However, it is not clear whether the
functional connectivity rules of granule cells (GCs) and interneurons in the dentate
gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings
from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we
find that connectivity is structured in space, synapse-specific, and enriched
in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition
in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron)
is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits
itself). Thus, unique connectivity rules may enable the dentate gyrus to perform
specific higher-order computations
acknowledgement: This project received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung
(Z 312-B27, Wittgenstein award), both to P.J..
article_number: '4605'
article_processing_charge: No
article_type: original
author:
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
orcid: 0000-0003-2209-5242
- first_name: Xiaomin
full_name: Zhang, Xiaomin
id: 423EC9C2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons
obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit
in dentate gyrus. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-06899-3
apa: Espinoza Martinez, C., Guzmán, J., Zhang, X., & Jonas, P. M. (2018). Parvalbumin+
interneurons obey unique connectivity rules and establish a powerful lateral-inhibition
microcircuit in dentate gyrus. Nature Communications. Nature Publishing
Group. https://doi.org/10.1038/s41467-018-06899-3
chicago: Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas.
“Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful
Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications.
Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06899-3.
ieee: C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+
interneurons obey unique connectivity rules and establish a powerful lateral-inhibition
microcircuit in dentate gyrus,” Nature Communications, vol. 9, no. 1. Nature
Publishing Group, 2018.
ista: Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. 2018. Parvalbumin+ interneurons
obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit
in dentate gyrus. Nature Communications. 9(1), 4605.
mla: Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity
Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.”
Nature Communications, vol. 9, no. 1, 4605, Nature Publishing Group, 2018,
doi:10.1038/s41467-018-06899-3.
short: C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications
9 (2018).
date_created: 2018-12-11T11:44:12Z
date_published: 2018-11-02T00:00:00Z
date_updated: 2024-03-25T23:30:16Z
day: '02'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1038/s41467-018-06899-3
ec_funded: 1
external_id:
isi:
- '000449069700009'
file:
- access_level: open_access
checksum: 9fe2a63bd95a5067d896c087d07998f3
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:41:57Z
date_updated: 2020-07-14T12:45:28Z
file_id: '5715'
file_name: 2018_NatureComm_Espinoza.pdf
file_size: 4651930
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glumatergic synapse
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: The Wittgenstein Prize
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '8034'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/
record:
- id: '6363'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful
lateral-inhibition microcircuit in dentate gyrus
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: 9
year: '2018'
...
---
_id: '22'
abstract:
- lang: eng
text: Conventional ultra-high sensitivity detectors in the millimeter-wave range
are usually cooled as their own thermal noise at room temperature would mask the
weak received radiation. The need for cryogenic systems increases the cost and
complexity of the instruments, hindering the development of, among others, airborne
and space applications. In this work, the nonlinear parametric upconversion of
millimeter-wave radiation to the optical domain inside high-quality (Q) lithium
niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise
detection. We experimentally demonstrate coherent upconversion of millimeter-wave
signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing
the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows
that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling
the millimeter-wave WGM, effectively cooling the upconverted mode and allowing
ultra-low noise detection. By theoretically estimating the sensitivity of a correlation
radiometer based on the presented scheme, it is found that room-temperature radiometers
with better sensitivity than state-of-the-art high-electron-mobility transistor
(HEMT)-based radiometers can be designed. This detection paradigm can be used
to develop room-temperature instrumentation for radio astronomy, earth observation,
planetary missions, and imaging systems.
article_processing_charge: No
article_type: original
author:
- first_name: Gabriel
full_name: Botello, Gabriel
last_name: Botello
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: Kerlos
full_name: Abdalmalak, Kerlos
last_name: Abdalmalak
- first_name: Elliott
full_name: Brown, Elliott
last_name: Brown
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Sascha
full_name: Preu, Sascha
last_name: Preu
- first_name: Daniel
full_name: Segovia Vargas, Daniel
last_name: Segovia Vargas
- first_name: Dmitry
full_name: Strekalov, Dmitry
last_name: Strekalov
- first_name: Luis
full_name: Munoz, Luis
last_name: Munoz
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
citation:
ama: Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave
photonic radiometers based on efficient electro-optic upconverters. Optica.
2018;5(10):1210-1219. doi:10.1364/OPTICA.5.001210
apa: Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E.,
Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic
radiometers based on efficient electro-optic upconverters. Optica. https://doi.org/10.1364/OPTICA.5.001210
chicago: Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak,
Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave
Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica,
2018. https://doi.org/10.1364/OPTICA.5.001210.
ieee: G. Botello et al., “Sensitivity limits of millimeter-wave photonic
radiometers based on efficient electro-optic upconverters,” Optica, vol.
5, no. 10. pp. 1210–1219, 2018.
ista: Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G,
Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity
limits of millimeter-wave photonic radiometers based on efficient electro-optic
upconverters. Optica. 5(10), 1210–1219.
mla: Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers
Based on Efficient Electro-Optic Upconverters.” Optica, vol. 5, no. 10,
2018, pp. 1210–19, doi:10.1364/OPTICA.5.001210.
short: G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G.
Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica
5 (2018) 1210–1219.
date_created: 2018-12-11T11:44:12Z
date_published: 2018-10-20T00:00:00Z
date_updated: 2023-10-17T12:12:40Z
day: '20'
department:
- _id: JoFi
doi: 10.1364/OPTICA.5.001210
external_id:
isi:
- '000447853100007'
intvolume: ' 5'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'www.doi.org/10.1364/OPTICA.5.001210 '
month: '10'
oa: 1
oa_version: Published Version
page: 1210 - 1219
publication: Optica
publication_identifier:
issn:
- '23342536'
publication_status: published
publist_id: '8033'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sensitivity limits of millimeter-wave photonic radiometers based on efficient
electro-optic upconverters
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2018'
...
---
_id: '23'
abstract:
- lang: eng
text: The strong atomistic spin–orbit coupling of holes makes single-shot spin readout
measurements difficult because it reduces the spin lifetimes. By integrating the
charge sensor into a high bandwidth radio frequency reflectometry setup, we were
able to demonstrate single-shot readout of a germanium quantum dot hole spin and
measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT
are reported, with a total readout visibility of about 70%. By analyzing separately
the spin-to-charge conversion and charge readout fidelities, we have obtained
insight into the processes limiting the visibilities of hole spins. The analyses
suggest that high hole visibilities are feasible at realistic experimental conditions,
underlying the potential of hole spins for the realization of viable qubit devices.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
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
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Joshua M
full_name: Milem, Joshua M
id: 4CDE0A96-F248-11E8-B48F-1D18A9856A87
last_name: Milem
- first_name: Friedrich
full_name: Schäffler, Friedrich
last_name: Schäffler
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot
readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217
apa: Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., &
Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters.
American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217
chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich
Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” Nano
Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217.
ieee: L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros,
“Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11.
American Chemical Society, pp. 7141–7145, 2018.
ista: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018.
Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.
mla: Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters,
vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.
short: L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros,
Nano Letters 18 (2018) 7141–7145.
date_created: 2018-12-11T11:44:13Z
date_published: 2018-10-25T00:00:00Z
date_updated: 2023-09-18T09:30:37Z
day: '25'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1021/acs.nanolett.8b03217
ec_funded: 1
external_id:
isi:
- '000451102100064'
pmid:
- '30359041'
file:
- access_level: open_access
checksum: 3e6034a94c6b5335e939145d88bdb371
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:08Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5194'
file_name: IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf
file_size: 1361441
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '11'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 7141 - 7145
pmid: 1
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
publication: Nano Letters
publication_identifier:
issn:
- '15306984'
publication_status: published
publisher: American Chemical Society
publist_id: '8032'
pubrep_id: '1065'
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '69'
relation: dissertation_contains
status: public
- id: '7996'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Single-shot readout of hole spins in Ge
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: 18
year: '2018'
...
---
_id: '24'
abstract:
- lang: eng
text: Partially-observable Markov decision processes (POMDPs) with discounted-sum
payoff are a standard framework to model a wide range of problems related to decision
making under uncertainty. Traditionally, the goal has been to obtain policies
that optimize the expectation of the discounted-sum payoff. A key drawback of
the expectation measure is that even low probability events with extreme payoff
can significantly affect the expectation, and thus the obtained policies are not
necessarily risk-averse. An alternate approach is to optimize the probability
that the payoff is above a certain threshold, which allows obtaining risk-averse
policies, but ignores optimization of the expectation. We consider the expectation
optimization with probabilistic guarantee (EOPG) problem, where the goal is to
optimize the expectation ensuring that the payoff is above a given threshold with
at least a specified probability. We present several results on the EOPG problem,
including the first algorithm to solve it.
acknowledgement: "This research was supported by the Vienna Science and Technology
Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and
an ERC Start Grant (279307:Graph Games).\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Adrian
full_name: Elgyütt, Adrian
id: 4A2E9DBA-F248-11E8-B48F-1D18A9856A87
last_name: Elgyütt
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Owen
full_name: Rouillé, Owen
last_name: Rouillé
citation:
ama: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with
probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018.
IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652'
apa: 'Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation
optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
(Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference
on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652'
chicago: Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé.
“Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum
Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.
ieee: 'K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization
with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented
at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm,
Sweden, 2018, vol. 2018, pp. 4692–4699.'
ista: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization
with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI:
International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.'
mla: Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic
Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018,
pp. 4692–99, doi:10.24963/ijcai.2018/652.
short: K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp.
4692–4699.
conference:
end_date: 2018-07-19
location: Stockholm, Sweden
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2018-07-13
date_created: 2018-12-11T11:44:13Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2025-06-02T08:53:48Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.24963/ijcai.2018/652
ec_funded: 1
external_id:
arxiv:
- '1804.10601'
isi:
- '000764175404117'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10601
month: '07'
oa: 1
oa_version: Preprint
page: 4692 - 4699
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: IJCAI
publist_id: '8031'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum
objectives
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '6664'
abstract:
- lang: eng
text: Reed-Muller (RM) and polar codes are a class of capacity-achieving channel
coding schemes with the same factor graph representation. Low-complexity decoding
algorithms fall short in providing a good error-correction performance for RM
and polar codes. Using the symmetric group of RM and polar codes, the specific
decoding algorithm can be carried out on multiple permutations of the factor graph
to boost the error-correction performance. However, this approach results in high
decoding complexity. In this paper, we first derive the total number of factor
graph permutations on which the decoding can be performed. We further propose
a successive permutation (SP) scheme which finds the permutations on the fly,
thus the decoding always progresses on a single factor graph permutation. We show
that SP can be used to improve the error-correction performance of RM and polar
codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping
the memory requirements of the decoders unaltered. Our results for RM and polar
codes of length 128 and rate 0.5 show that when SP is used and at a target frame
error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for
RM and polar codes respectively.
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: 'Warren '
full_name: 'Gross, Warren '
last_name: Gross
citation:
ama: 'Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes
by successive factor graph permutations. In: 2018 IEEE 10th International Symposium
on Turbo Codes & Iterative Information Processing. IEEE; 2018:1-5. doi:10.1109/istc.2018.8625281'
apa: 'Hashemi, S. A., Doan, N., Mondelli, M., & Gross, W. (2018). Decoding Reed-Muller
and polar codes by successive factor graph permutations. In 2018 IEEE 10th
International Symposium on Turbo Codes & Iterative Information Processing
(pp. 1–5). Hong Kong, China: IEEE. https://doi.org/10.1109/istc.2018.8625281'
chicago: Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren Gross. “Decoding
Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In 2018
IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing,
1–5. IEEE, 2018. https://doi.org/10.1109/istc.2018.8625281.
ieee: S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and
polar codes by successive factor graph permutations,” in 2018 IEEE 10th International
Symposium on Turbo Codes & Iterative Information Processing, Hong Kong,
China, 2018, pp. 1–5.
ista: 'Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar
codes by successive factor graph permutations. 2018 IEEE 10th International Symposium
on Turbo Codes & Iterative Information Processing. ISTC: Symposium on Turbo
Codes & Iterative Information Processing, 1–5.'
mla: Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive
Factor Graph Permutations.” 2018 IEEE 10th International Symposium on Turbo
Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5, doi:10.1109/istc.2018.8625281.
short: S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International
Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp.
1–5.
conference:
end_date: 2018-12-07
location: Hong Kong, China
name: 'ISTC: Symposium on Turbo Codes & Iterative Information Processing'
start_date: 2018-12-03
date_created: 2019-07-23T09:12:43Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:29Z
day: '01'
doi: 10.1109/istc.2018.8625281
extern: '1'
external_id:
arxiv:
- '1807.03912'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.03912
month: '12'
oa: 1
oa_version: Preprint
page: 1-5
publication: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information
Processing
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Decoding Reed-Muller and polar codes by successive factor graph permutations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_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'
...