[{"citation":{"mla":"Liutkeviciute, Zita, et al. “Oxytocin-like Signaling in Ants Influences Metabolic Gene Expression and Locomotor Activity.” <i>The FASEB Journal</i>, vol. 32, no. 12, FASEB, 2018, pp. 6808–21, doi:<a href=\"https://doi.org/10.1096/fj.201800443\">10.1096/fj.201800443</a>.","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. <i>The FASEB Journal</i>. FASEB. <a href=\"https://doi.org/10.1096/fj.201800443\">https://doi.org/10.1096/fj.201800443</a>","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.” <i>The FASEB Journal</i>. FASEB, 2018. <a href=\"https://doi.org/10.1096/fj.201800443\">https://doi.org/10.1096/fj.201800443</a>.","ama":"Liutkeviciute Z, Gil Mansilla E, Eder T, et al. Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity. <i>The FASEB Journal</i>. 2018;32(12):6808-6821. doi:<a href=\"https://doi.org/10.1096/fj.201800443\">10.1096/fj.201800443</a>","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.","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.","ieee":"Z. Liutkeviciute <i>et al.</i>, “Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity,” <i>The FASEB Journal</i>, vol. 32, no. 12. FASEB, pp. 6808–6821, 2018."},"publication_identifier":{"issn":["08926638"]},"type":"journal_article","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","_id":"194","quality_controlled":"1","project":[{"name":"Individual function and social role of oxytocin-like neuropeptides in ants","_id":"25E3D34E-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","publisher":"FASEB","author":[{"full_name":"Liutkeviciute, Zita","first_name":"Zita","last_name":"Liutkeviciute"},{"full_name":"Gil Mansilla, Esther","last_name":"Gil Mansilla","first_name":"Esther"},{"full_name":"Eder, Thomas","last_name":"Eder","first_name":"Thomas"},{"last_name":"Casillas Perez","first_name":"Barbara E","id":"351ED2AA-F248-11E8-B48F-1D18A9856A87","full_name":"Casillas Perez, Barbara E"},{"full_name":"Giulia Di Giglio, Maria","last_name":"Giulia Di Giglio","first_name":"Maria"},{"last_name":"Muratspahić","first_name":"Edin","full_name":"Muratspahić, Edin"},{"full_name":"Grebien, Florian","first_name":"Florian","last_name":"Grebien"},{"first_name":"Thomas","last_name":"Rattei","full_name":"Rattei, Thomas"},{"full_name":"Muttenthaler, Markus","last_name":"Muttenthaler","first_name":"Markus"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"},{"full_name":"Gruber, Christian","first_name":"Christian","last_name":"Gruber"}],"title":"Oxytocin-like signaling in ants influences metabolic gene expression and locomotor activity","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","publist_id":"7721","department":[{"_id":"SyCr"}],"language":[{"iso":"eng"}],"article_type":"original","pmid":1,"volume":32,"date_created":"2018-12-11T11:45:08Z","day":"29","status":"public","main_file_link":[{"open_access":"1","url":" https://doi.org/10.1096/fj.201800443"}],"doi":"10.1096/fj.201800443","publication":"The FASEB Journal","isi":1,"oa_version":"Published Version","month":"11","intvolume":"        32","date_published":"2018-11-29T00:00:00Z","date_updated":"2023-09-13T09:37:32Z","issue":"12","oa":1,"external_id":{"isi":["000449359700035"],"pmid":["29939785"]},"page":"6808-6821","year":"2018"},{"title":"Anyonic statistics of quantum impurities in two dimensions","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp","last_name":"Yakaboylu","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","full_name":"Lemeshko, Mikhail"}],"publisher":"American Physical Society","language":[{"iso":"eng"}],"department":[{"_id":"MiLe"}],"article_processing_charge":"No","quality_controlled":"1","_id":"195","type":"journal_article","scopus_import":"1","arxiv":1,"abstract":[{"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.","lang":"eng"}],"citation":{"ama":"Yakaboylu E, Lemeshko M. Anyonic statistics of quantum impurities in two dimensions. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2018;98(4). doi:<a href=\"https://doi.org/10.1103/PhysRevB.98.045402\">10.1103/PhysRevB.98.045402</a>","short":"E. Yakaboylu, M. Lemeshko, Physical Review B - Condensed Matter and Materials Physics 98 (2018).","ieee":"E. Yakaboylu and M. Lemeshko, “Anyonic statistics of quantum impurities in two dimensions,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, 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.","chicago":"Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities in Two Dimensions.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevB.98.045402\">https://doi.org/10.1103/PhysRevB.98.045402</a>.","apa":"Yakaboylu, E., &#38; Lemeshko, M. (2018). Anyonic statistics of quantum impurities in two dimensions. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.98.045402\">https://doi.org/10.1103/PhysRevB.98.045402</a>","mla":"Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities in Two Dimensions.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 98, no. 4, 045402, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevB.98.045402\">10.1103/PhysRevB.98.045402</a>."},"publication_status":"published","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"},{"call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425"}],"issue":"4","oa":1,"date_updated":"2023-09-08T13:22:57Z","article_number":"045402","month":"07","intvolume":"        98","date_published":"2018-07-15T00:00:00Z","year":"2018","external_id":{"arxiv":["1712.00308"],"isi":["000436939100007"]},"status":"public","day":"15","date_created":"2018-12-11T11:45:08Z","volume":98,"isi":1,"ec_funded":1,"oa_version":"Submitted Version","doi":"10.1103/PhysRevB.98.045402","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.00308"}],"publication":"Physical Review B - Condensed Matter and Materials Physics"},{"type":"dissertation","file_date_updated":"2020-07-14T12:45:22Z","abstract":[{"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.","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"citation":{"short":"A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images, Institute of Science and Technology Austria, 2018.","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.","ama":"Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">10.15479/AT:ISTA:th_1021</a>","chicago":"Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">https://doi.org/10.15479/AT:ISTA:th_1021</a>.","apa":"Kolesnikov, A. (2018). <i>Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">https://doi.org/10.15479/AT:ISTA:th_1021</a>","mla":"Kolesnikov, Alexander. <i>Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">10.15479/AT:ISTA:th_1021</a>."},"_id":"197","publication_status":"published","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:45:22Z","date_created":"2018-12-12T10:14:57Z","file_name":"IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf","checksum":"bc678e02468d8ebc39dc7267dfb0a1c4","relation":"main_file","access_level":"open_access","creator":"system","file_size":12918758,"content_type":"application/pdf","file_id":"5113"},{"file_name":"2018_Thesis_Kolesnikov_source.zip","date_updated":"2020-07-14T12:45:22Z","date_created":"2019-04-05T09:34:49Z","file_size":55973760,"creator":"dernst","file_id":"6225","content_type":"application/zip","relation":"source_file","checksum":"bc66973b086da5a043f1162dcfb1fde4","access_level":"closed"}],"author":[{"last_name":"Kolesnikov","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images","department":[{"_id":"ChLa"}],"publist_id":"7718","article_processing_charge":"No","pubrep_id":"1021","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"day":"25","status":"public","date_created":"2018-12-11T11:45:09Z","ddc":["004"],"doi":"10.15479/AT:ISTA:th_1021","degree_awarded":"PhD","ec_funded":1,"oa_version":"Published Version","acknowledgement":"I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.","month":"05","alternative_title":["ISTA Thesis"],"date_published":"2018-05-25T00:00:00Z","oa":1,"date_updated":"2023-09-07T12:51:46Z","page":"113","year":"2018"},{"publication_status":"published","project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"}],"quality_controlled":"1","_id":"198","scopus_import":"1","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."}],"type":"journal_article","file_date_updated":"2020-07-14T12:45:22Z","citation":{"mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” <i>Journal of the Royal Society Interface</i>, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:<a href=\"https://doi.org/10.1098/rsif.2018.0073\">10.1098/rsif.2018.0073</a>.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018). Language acquisition with communication between learners. <i>Journal of the Royal Society Interface</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsif.2018.0073\">https://doi.org/10.1098/rsif.2018.0073</a>","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” <i>Journal of the Royal Society Interface</i>. The Royal Society, 2018. <a href=\"https://doi.org/10.1098/rsif.2018.0073\">https://doi.org/10.1098/rsif.2018.0073</a>.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. <i>Journal of the Royal Society Interface</i>. 2018;15(140). doi:<a href=\"https://doi.org/10.1098/rsif.2018.0073\">10.1098/rsif.2018.0073</a>","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” <i>Journal of the Royal Society Interface</i>, 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."},"publication_identifier":{"eissn":["1742-5662"]},"article_type":"original","language":[{"iso":"eng"}],"publist_id":"7715","department":[{"_id":"KrCh"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"title":"Language acquisition with communication between learners","file":[{"date_created":"2019-02-12T07:54:37Z","date_updated":"2020-07-14T12:45:22Z","file_name":"2018_RS_IbsenJensen.pdf","access_level":"open_access","checksum":"444e1a9d98eb0e780671be82b13025f3","relation":"main_file","file_id":"5955","content_type":"application/pdf","file_size":219837,"creator":"dernst"}],"publisher":"The Royal Society","has_accepted_license":"1","oa_version":"Submitted Version","ec_funded":1,"isi":1,"related_material":{"record":[{"id":"9814","status":"public","relation":"research_data"}],"link":[{"relation":"supplementary_material","url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971"}]},"publication":"Journal of the Royal Society Interface","doi":"10.1098/rsif.2018.0073","status":"public","day":"01","date_created":"2018-12-11T11:45:09Z","ddc":["000"],"volume":15,"pmid":1,"year":"2018","external_id":{"isi":["000428576200023"],"pmid":["29593089"]},"oa":1,"issue":"140","date_updated":"2023-10-18T06:36:00Z","article_number":"20180073","date_published":"2018-03-01T00:00:00Z","intvolume":"        15","month":"03"},{"publication_status":"published","file_date_updated":"2020-07-14T12:45:22Z","type":"journal_article","scopus_import":"1","abstract":[{"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.","lang":"eng"}],"citation":{"ieee":"W. Ma <i>et al.</i>, “Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes,” <i>Genes</i>, vol. 9, no. 6. MDPI AG, 2018.","short":"W. Ma, P. Veltsos, M.A. Toups, N. Rodrigues, R. Sermier, D. Jeffries, N. Perrin, Genes 9 (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.","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. <i>Genes</i>. 2018;9(6). doi:<a href=\"https://doi.org/10.3390/genes9060294\">10.3390/genes9060294</a>","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.” <i>Genes</i>. MDPI AG, 2018. <a href=\"https://doi.org/10.3390/genes9060294\">https://doi.org/10.3390/genes9060294</a>.","apa":"Ma, W., Veltsos, P., Toups, M. A., Rodrigues, N., Sermier, R., Jeffries, D., &#38; Perrin, N. (2018). Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes. <i>Genes</i>. MDPI AG. <a href=\"https://doi.org/10.3390/genes9060294\">https://doi.org/10.3390/genes9060294</a>","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.” <i>Genes</i>, vol. 9, no. 6, 294, MDPI AG, 2018, doi:<a href=\"https://doi.org/10.3390/genes9060294\">10.3390/genes9060294</a>."},"quality_controlled":"1","_id":"199","department":[{"_id":"BeVi"}],"publist_id":"7714","article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"MDPI AG","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:45:22Z","date_created":"2019-02-01T07:52:28Z","file_name":"2018_Genes_Ma.pdf","relation":"main_file","access_level":"open_access","checksum":"423069beb1cd3cdd25bf3f464b38f1d7","content_type":"application/pdf","file_id":"5905","file_size":3985796,"creator":"dernst"}],"title":"Tissue specificity and dynamics of sex biased gene expression in a common frog population with differentiated, yet homomorphic, sex chromosomes","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Ma","first_name":"Wen","full_name":"Ma, Wen"},{"last_name":"Veltsos","first_name":"Paris","full_name":"Veltsos, Paris"},{"first_name":"Melissa A","id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9752-7380","last_name":"Toups","full_name":"Toups, Melissa A"},{"full_name":"Rodrigues, Nicolas","first_name":"Nicolas","last_name":"Rodrigues"},{"full_name":"Sermier, Roberto","first_name":"Roberto","last_name":"Sermier"},{"last_name":"Jeffries","first_name":"Daniel","full_name":"Jeffries, Daniel"},{"last_name":"Perrin","first_name":"Nicolas","full_name":"Perrin, Nicolas"}],"doi":"10.3390/genes9060294","publication":"Genes","isi":1,"oa_version":"Published Version","volume":9,"status":"public","day":"12","date_created":"2018-12-11T11:45:09Z","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)"},"ddc":["570"],"external_id":{"isi":["000436494200026"]},"year":"2018","article_number":"294","intvolume":"         9","month":"06","date_published":"2018-06-12T00:00:00Z","issue":"6","oa":1,"date_updated":"2023-09-19T10:15:31Z"},{"publication":"PNAS","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30429320","open_access":"1"}],"doi":"10.1073/pnas.1810565115","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10293"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/no-cooperation-without-open-communication/"}]},"ec_funded":1,"oa_version":"Submitted Version","isi":1,"volume":115,"pmid":1,"date_created":"2018-12-11T11:44:05Z","day":"27","status":"public","page":"12241-12246","external_id":{"isi":["000451351000063"],"pmid":["30429320"]},"year":"2018","date_published":"2018-11-27T00:00:00Z","month":"11","intvolume":"       115","date_updated":"2025-07-14T09:10:09Z","oa":1,"issue":"48","project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"publication_status":"published","citation":{"mla":"Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” <i>PNAS</i>, vol. 115, no. 48, National Academy of Sciences, 2018, pp. 12241–46, doi:<a href=\"https://doi.org/10.1073/pnas.1810565115\">10.1073/pnas.1810565115</a>.","apa":"Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1810565115\">https://doi.org/10.1073/pnas.1810565115</a>","chicago":"Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1810565115\">https://doi.org/10.1073/pnas.1810565115</a>.","ieee":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” <i>PNAS</i>, vol. 115, no. 48. National Academy of Sciences, pp. 12241–12246, 2018.","short":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018) 12241–12246.","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.","ama":"Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. Indirect reciprocity with private, noisy, and incomplete information. <i>PNAS</i>. 2018;115(48):12241-12246. doi:<a href=\"https://doi.org/10.1073/pnas.1810565115\">10.1073/pnas.1810565115</a>"},"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","type":"journal_article","_id":"2","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publisher":"National Academy of Sciences","title":"Indirect reciprocity with private, noisy, and incomplete information","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmid, Laura","last_name":"Schmid","orcid":"0000-0002-6978-7329","first_name":"Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}]},{"publication_status":"published","_id":"20","quality_controlled":"1","citation":{"apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s12864-018-5173-0\">https://doi.org/10.1186/s12864-018-5173-0</a>","mla":"Higareda Almaraz, Juan, et al. “Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” <i>BMC Genomics</i>, vol. 19, no. 1, BioMed Central, 2018, doi:<a href=\"https://doi.org/10.1186/s12864-018-5173-0\">10.1186/s12864-018-5173-0</a>.","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).","ieee":"J. Higareda Almaraz <i>et al.</i>, “Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes,” <i>BMC Genomics</i>, vol. 19, no. 1. BioMed Central, 2018.","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, BMC Genomics 19 (2018).","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. <i>BMC Genomics</i>. 2018;19(1). doi:<a href=\"https://doi.org/10.1186/s12864-018-5173-0\">10.1186/s12864-018-5173-0</a>","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.” <i>BMC Genomics</i>. BioMed Central, 2018. <a href=\"https://doi.org/10.1186/s12864-018-5173-0\">https://doi.org/10.1186/s12864-018-5173-0</a>."},"publication_identifier":{"issn":["1471-2164"]},"scopus_import":"1","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."}],"file_date_updated":"2020-07-14T12:45:23Z","type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","publist_id":"8035","department":[{"_id":"SiHi"}],"author":[{"first_name":"Juan","last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan"},{"full_name":"Karbiener, Michael","first_name":"Michael","last_name":"Karbiener"},{"full_name":"Giroud, Maude","last_name":"Giroud","first_name":"Maude"},{"orcid":"0000-0002-7462-0048","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","full_name":"Pauler, Florian"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"full_name":"Herzig, Stephan","last_name":"Herzig","first_name":"Stephan"},{"full_name":"Scheideler, Marcel","last_name":"Scheideler","first_name":"Marcel"}],"title":"Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_name":"2018_BMCGenomics_Higareda.pdf","date_updated":"2020-07-14T12:45:23Z","date_created":"2018-12-17T14:52:57Z","creator":"dernst","file_size":4629784,"content_type":"application/pdf","file_id":"5712","checksum":"a56516e734dab589dc7f3e1915973b4d","access_level":"open_access","relation":"main_file"}],"has_accepted_license":"1","publisher":"BioMed Central","related_material":{"record":[{"id":"9807","relation":"research_data","status":"public"},{"status":"public","relation":"research_data","id":"9808"}]},"oa_version":"Published Version","isi":1,"publication":"BMC Genomics","doi":"10.1186/s12864-018-5173-0","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)"},"ddc":["570"],"date_created":"2018-12-11T11:44:12Z","day":"03","status":"public","volume":19,"year":"2018","external_id":{"isi":["000450976700002"]},"date_updated":"2023-09-13T09:10:47Z","oa":1,"issue":"1","date_published":"2018-11-03T00:00:00Z","intvolume":"        19","month":"11","acknowledgement":"This work was funded by the German Centre for Diabetes Research (DZD) and the Austrian Science Fund (FWF, P25729-B19)."},{"_id":"200","publication_identifier":{"issn":["2663-337X"]},"citation":{"chicago":"Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_963\">https://doi.org/10.15479/AT:ISTA:th_963</a>.","ama":"Ringbauer H. Inferring recent demography from spatial genetic structure. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_963\">10.15479/AT:ISTA:th_963</a>","short":"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.","ieee":"H. Ringbauer, “Inferring recent demography from spatial genetic structure,” Institute of Science and Technology Austria, 2018.","mla":"Ringbauer, Harald. <i>Inferring Recent Demography from Spatial Genetic Structure</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_963\">10.15479/AT:ISTA:th_963</a>.","apa":"Ringbauer, H. (2018). <i>Inferring recent demography from spatial genetic structure</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_963\">https://doi.org/10.15479/AT:ISTA:th_963</a>"},"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."}],"file_date_updated":"2020-07-14T12:45:23Z","type":"dissertation","publication_status":"published","title":"Inferring recent demography from spatial genetic structure","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Ringbauer","orcid":"0000-0002-4884-9682","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","first_name":"Harald","full_name":"Ringbauer, Harald"}],"file":[{"content_type":"application/pdf","file_id":"5111","file_size":5792935,"creator":"system","relation":"main_file","checksum":"8cc534d2b528ae017acf80874cce48c9","access_level":"open_access","file_name":"IST-2018-963-v1+1_thesis.pdf","date_updated":"2020-07-14T12:45:23Z","date_created":"2018-12-12T10:14:55Z"},{"content_type":"application/zip","file_id":"6224","creator":"dernst","file_size":113365,"access_level":"closed","relation":"source_file","checksum":"6af18d7e5a7e2728ceda2f41ee24f628","file_name":"2018_thesis_ringbauer_source.zip","date_updated":"2020-07-14T12:45:23Z","date_created":"2019-04-05T09:30:12Z"}],"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"pubrep_id":"963","article_processing_charge":"No","department":[{"_id":"NiBa"}],"publist_id":"7713","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"date_created":"2018-12-11T11:45:10Z","ddc":["576"],"status":"public","day":"21","supervisor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"563"},{"relation":"part_of_dissertation","status":"public","id":"1074"}]},"oa_version":"Published Version","degree_awarded":"PhD","doi":"10.15479/AT:ISTA:th_963","date_updated":"2025-05-28T11:57:06Z","oa":1,"date_published":"2018-02-21T00:00:00Z","alternative_title":["ISTA Thesis"],"month":"02","year":"2018","page":"146","license":"https://creativecommons.org/licenses/by-nc/4.0/"},{"publication_status":"published","_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."}],"type":"dissertation","file_date_updated":"2020-07-14T12:45:24Z","citation":{"chicago":"Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">https://doi.org/10.15479/AT:ISTA:th_1026</a>.","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.","short":"M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology Austria, 2018.","ama":"Iglesias Ham M. Multiple covers with balls. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">10.15479/AT:ISTA:th_1026</a>","mla":"Iglesias Ham, Mabel. <i>Multiple Covers with Balls</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">10.15479/AT:ISTA:th_1026</a>.","apa":"Iglesias Ham, M. (2018). <i>Multiple covers with balls</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1026\">https://doi.org/10.15479/AT:ISTA:th_1026</a>"},"publication_identifier":{"issn":["2663-337X"]},"pubrep_id":"1026","language":[{"iso":"eng"}],"publist_id":"7712","department":[{"_id":"HeEd"}],"article_processing_charge":"No","author":[{"full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel","last_name":"Iglesias Ham"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Multiple covers with balls","file":[{"date_updated":"2020-07-14T12:45:24Z","date_created":"2019-02-05T07:43:31Z","file_name":"IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip","checksum":"dd699303623e96d1478a6ae07210dd05","access_level":"closed","relation":"source_file","content_type":"application/zip","file_id":"5918","creator":"kschuh","file_size":11827713},{"file_name":"IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf","date_created":"2019-02-05T07:43:45Z","date_updated":"2020-07-14T12:45:24Z","creator":"kschuh","file_size":4783846,"file_id":"5919","content_type":"application/pdf","access_level":"open_access","checksum":"ba163849a190d2b41d66fef0e4983294","relation":"main_file"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","oa_version":"Published Version","doi":"10.15479/AT:ISTA:th_1026","degree_awarded":"PhD","day":"11","status":"public","supervisor":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"date_created":"2018-12-11T11:45:10Z","ddc":["514","516"],"year":"2018","page":"171","oa":1,"date_updated":"2023-09-07T12:25:32Z","alternative_title":["ISTA Thesis"],"date_published":"2018-06-11T00:00:00Z","month":"06"},{"publication":"STAT","doi":"10.1002/sta4.183","main_file_link":[{"url":"http://arxiv.org/abs/1307.0366","open_access":"1"}],"oa_version":"Preprint","volume":7,"status":"public","day":"17","date_created":"2018-12-11T11:55:13Z","external_id":{"arxiv":["1307.0366"]},"year":"2018","article_number":"e183","date_published":"2018-04-17T00:00:00Z","intvolume":"         7","month":"04","oa":1,"issue":"1","date_updated":"2021-01-12T06:54:44Z","publication_status":"published","arxiv":1,"abstract":[{"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.","lang":"eng"}],"type":"journal_article","citation":{"ama":"Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations. <i>STAT</i>. 2018;7(1). doi:<a href=\"https://doi.org/10.1002/sta4.183\">10.1002/sta4.183</a>","short":"G. Raskutti, C. Uhler, STAT 7 (2018).","ista":"Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest permutations. STAT. 7(1), e183.","ieee":"G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest permutations,” <i>STAT</i>, vol. 7, no. 1. Wiley, 2018.","chicago":"Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” <i>STAT</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/sta4.183\">https://doi.org/10.1002/sta4.183</a>.","apa":"Raskutti, G., &#38; Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. <i>STAT</i>. Wiley. <a href=\"https://doi.org/10.1002/sta4.183\">https://doi.org/10.1002/sta4.183</a>","mla":"Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” <i>STAT</i>, vol. 7, no. 1, e183, Wiley, 2018, doi:<a href=\"https://doi.org/10.1002/sta4.183\">10.1002/sta4.183</a>."},"extern":"1","quality_controlled":"1","_id":"2015","publist_id":"5061","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Wiley","author":[{"full_name":"Raskutti, Garvesh","first_name":"Garvesh","last_name":"Raskutti"},{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Learning directed acyclic graphs based on sparsest permutations"},{"status":"public","day":"26","date_created":"2018-12-11T11:45:11Z","volume":115,"ec_funded":1,"oa_version":"None","isi":1,"publication":"PNAS","main_file_link":[{"url":"http://eprints.nottingham.ac.uk/52388/","open_access":"1"}],"doi":"10.1073/pnas.1806565115","oa":1,"issue":"26","date_updated":"2025-05-07T11:12:32Z","date_published":"2018-06-26T00:00:00Z","month":"06","intvolume":"       115","year":"2018","external_id":{"isi":["000436245000096"]},"page":"6864-6869","quality_controlled":"1","_id":"203","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","type":"journal_article","citation":{"mla":"Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” <i>PNAS</i>, vol. 115, no. 26, National Academy of Sciences, 2018, pp. 6864–69, doi:<a href=\"https://doi.org/10.1073/pnas.1806565115\">10.1073/pnas.1806565115</a>.","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. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1806565115\">https://doi.org/10.1073/pnas.1806565115</a>","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.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1806565115\">https://doi.org/10.1073/pnas.1806565115</a>.","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.","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.","ieee":"M. Abbas <i>et al.</i>, “Auxin methylation is required for differential growth in Arabidopsis,” <i>PNAS</i>, vol. 115, no. 26. National Academy of Sciences, pp. 6864–6869, 2018.","ama":"Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for differential growth in Arabidopsis. <i>PNAS</i>. 2018;115(26):6864-6869. doi:<a href=\"https://doi.org/10.1073/pnas.1806565115\">10.1073/pnas.1806565115</a>"},"publication_status":"published","project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"282300"}],"title":"Auxin methylation is required for differential growth in Arabidopsis","author":[{"full_name":"Abbas, Mohamad","id":"47E8FC1C-F248-11E8-B48F-1D18A9856A87","first_name":"Mohamad","last_name":"Abbas"},{"first_name":"García J","last_name":"Hernández","full_name":"Hernández, García J"},{"first_name":"Stephan","last_name":"Pollmann","full_name":"Pollmann, Stephan"},{"first_name":"Sophia L","last_name":"Samodelov","full_name":"Samodelov, Sophia L"},{"full_name":"Kolb, Martina","first_name":"Martina","last_name":"Kolb"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí"},{"full_name":"Hammes, Ulrich Z","last_name":"Hammes","first_name":"Ulrich Z"},{"last_name":"Zurbriggen","first_name":"Matias D","full_name":"Zurbriggen, Matias D"},{"full_name":"Blázquez, Miguel","last_name":"Blázquez","first_name":"Miguel"},{"full_name":"Alabadí, David","last_name":"Alabadí","first_name":"David"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"publist_id":"7710","department":[{"_id":"JiFr"}],"article_processing_charge":"No"},{"isi":1,"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"id":"6363","status":"public","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/","description":"News on IST Homepage","relation":"press_release"}]},"doi":"10.1038/s41467-018-06899-3","publication":"Nature Communications","status":"public","day":"02","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)"},"date_created":"2018-12-11T11:44:12Z","ddc":["570"],"volume":9,"year":"2018","external_id":{"isi":["000449069700009"]},"issue":"1","oa":1,"date_updated":"2024-03-25T23:30:16Z","article_number":"4605","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..","month":"11","intvolume":"         9","date_published":"2018-11-02T00:00:00Z","publication_status":"published","project":[{"name":"Biophysics and circuit function of a giant cortical glumatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00312"}],"quality_controlled":"1","_id":"21","file_date_updated":"2020-07-14T12:45:28Z","type":"journal_article","abstract":[{"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","lang":"eng"}],"scopus_import":"1","citation":{"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.” <i>Nature Communications</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41467-018-06899-3\">https://doi.org/10.1038/s41467-018-06899-3</a>.","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.","short":"C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications 9 (2018).","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,” <i>Nature Communications</i>, vol. 9, no. 1. Nature Publishing Group, 2018.","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. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-06899-3\">10.1038/s41467-018-06899-3</a>","mla":"Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” <i>Nature Communications</i>, vol. 9, no. 1, 4605, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-06899-3\">10.1038/s41467-018-06899-3</a>.","apa":"Espinoza Martinez, C., Guzmán, J., Zhang, X., &#38; Jonas, P. M. (2018). Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-018-06899-3\">https://doi.org/10.1038/s41467-018-06899-3</a>"},"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"PeJo"}],"publist_id":"8034","article_processing_charge":"No","file":[{"access_level":"open_access","checksum":"9fe2a63bd95a5067d896c087d07998f3","relation":"main_file","file_id":"5715","content_type":"application/pdf","file_size":4651930,"creator":"dernst","date_created":"2018-12-17T15:41:57Z","date_updated":"2020-07-14T12:45:28Z","file_name":"2018_NatureComm_Espinoza.pdf"}],"title":"Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Espinoza Martinez","orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","full_name":"Espinoza Martinez, Claudia "},{"first_name":"José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242","last_name":"Guzmán","full_name":"Guzmán, José"},{"full_name":"Zhang, Xiaomin","last_name":"Zhang","first_name":"Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jonas","orcid":"0000-0001-5001-4804","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"}],"publisher":"Nature Publishing Group","has_accepted_license":"1"},{"date_updated":"2023-10-17T12:12:40Z","oa":1,"issue":"10","date_published":"2018-10-20T00:00:00Z","intvolume":"         5","month":"10","year":"2018","external_id":{"isi":["000447853100007"]},"page":"1210 - 1219","date_created":"2018-12-11T11:44:12Z","status":"public","day":"20","volume":5,"oa_version":"Published Version","isi":1,"publication":"Optica","doi":"10.1364/OPTICA.5.001210","main_file_link":[{"url":"www.doi.org/10.1364/OPTICA.5.001210 ","open_access":"1"}],"author":[{"last_name":"Botello","first_name":"Gabriel","full_name":"Botello, Gabriel"},{"full_name":"Sedlmeir, Florian","first_name":"Florian","last_name":"Sedlmeir"},{"last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R"},{"full_name":"Abdalmalak, Kerlos","first_name":"Kerlos","last_name":"Abdalmalak"},{"first_name":"Elliott","last_name":"Brown","full_name":"Brown, Elliott"},{"full_name":"Leuchs, Gerd","first_name":"Gerd","last_name":"Leuchs"},{"full_name":"Preu, Sascha","first_name":"Sascha","last_name":"Preu"},{"last_name":"Segovia Vargas","first_name":"Daniel","full_name":"Segovia Vargas, Daniel"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"full_name":"Munoz, Luis","first_name":"Luis","last_name":"Munoz"},{"full_name":"Schwefel, Harald","first_name":"Harald","last_name":"Schwefel"}],"title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"JoFi"}],"publist_id":"8033","_id":"22","quality_controlled":"1","publication_identifier":{"issn":["23342536"]},"citation":{"ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. 2018;5(10):1210-1219. doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>","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.","ieee":"G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, 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.","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.” <i>Optica</i>, 2018. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>.","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. <i>Optica</i>. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10, 2018, pp. 1210–19, doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>."},"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."}],"scopus_import":"1","type":"journal_article","publication_status":"published"},{"file":[{"file_id":"5194","content_type":"application/pdf","file_size":1361441,"creator":"system","relation":"main_file","checksum":"3e6034a94c6b5335e939145d88bdb371","access_level":"open_access","file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf","date_created":"2018-12-12T10:16:08Z","date_updated":"2020-07-14T12:45:37Z"}],"title":"Single-shot readout of hole spins in Ge","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","orcid":"0000-0003-2424-8636","last_name":"Vukušić","full_name":"Vukušić, Lada"},{"last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","full_name":"Kukucka, Josip"},{"full_name":"Watzinger, Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes","last_name":"Watzinger"},{"full_name":"Milem, Joshua M","first_name":"Joshua M","id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87","last_name":"Milem"},{"last_name":"Schäffler","first_name":"Friedrich","full_name":"Schäffler, Friedrich"},{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","last_name":"Katsaros","full_name":"Katsaros, Georgios"}],"has_accepted_license":"1","publisher":"American Chemical Society","language":[{"iso":"eng"}],"pubrep_id":"1065","article_processing_charge":"No","publist_id":"8032","department":[{"_id":"GeKa"}],"_id":"23","quality_controlled":"1","publication_identifier":{"issn":["15306984"]},"citation":{"apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., &#38; Katsaros, G. (2018). Single-shot readout of hole spins in Ge. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">https://doi.org/10.1021/acs.nanolett.8b03217</a>","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” <i>Nano Letters</i>, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">10.1021/acs.nanolett.8b03217</a>.","ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. <i>Nano Letters</i>. 2018;18(11):7141-7145. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">10.1021/acs.nanolett.8b03217</a>","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,” <i>Nano Letters</i>, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018.","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","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.","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.” <i>Nano Letters</i>. American Chemical Society, 2018. <a href=\"https://doi.org/10.1021/acs.nanolett.8b03217\">https://doi.org/10.1021/acs.nanolett.8b03217</a>."},"file_date_updated":"2020-07-14T12:45:37Z","type":"journal_article","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","project":[{"call_identifier":"FP7","grant_number":"335497","_id":"25517E86-B435-11E9-9278-68D0E5697425","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires"}],"publication_status":"published","date_updated":"2023-09-18T09:30:37Z","issue":"11","oa":1,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"intvolume":"        18","month":"10","date_published":"2018-10-25T00:00:00Z","year":"2018","page":"7141 - 7145","external_id":{"pmid":["30359041"],"isi":["000451102100064"]},"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)"},"date_created":"2018-12-11T11:44:13Z","ddc":["530"],"status":"public","day":"25","pmid":1,"volume":18,"related_material":{"record":[{"id":"7977","relation":"popular_science"},{"status":"public","relation":"dissertation_contains","id":"69"},{"status":"public","relation":"dissertation_contains","id":"7996"}]},"isi":1,"oa_version":"Published Version","ec_funded":1,"doi":"10.1021/acs.nanolett.8b03217","publication":"Nano Letters"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"8031","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","full_name":"Elgyütt, Adrian"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr"},{"full_name":"Rouillé, Owen","first_name":"Owen","last_name":"Rouillé"}],"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IJCAI","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"publication_status":"published","_id":"24","quality_controlled":"1","citation":{"apa":"Chatterjee, K., Elgyütt, A., Novotný, P., &#38; 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. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>","mla":"Chatterjee, Krishnendu, et al. <i>Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives</i>. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>.","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:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 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.","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.","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. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>."},"arxiv":1,"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","type":"conference","year":"2018","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"page":"4692 - 4699","conference":{"location":"Stockholm, Sweden","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13"},"date_updated":"2025-06-02T08:53:48Z","oa":1,"date_published":"2018-07-01T00:00:00Z","intvolume":"      2018","month":"07","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","ec_funded":1,"oa_version":"Preprint","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"doi":"10.24963/ijcai.2018/652","date_created":"2018-12-11T11:44:13Z","day":"01","status":"public","volume":2018},{"publication":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing","publication_status":"published","doi":"10.1109/istc.2018.8625281","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.03912"}],"oa_version":"Preprint","extern":"1","citation":{"apa":"Hashemi, S. A., Doan, N., Mondelli, M., &#38; Gross, W. (2018). Decoding Reed-Muller and polar codes by successive factor graph permutations. In <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i> (pp. 1–5). Hong Kong, China: IEEE. <a href=\"https://doi.org/10.1109/istc.2018.8625281\">https://doi.org/10.1109/istc.2018.8625281</a>","mla":"Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>, IEEE, 2018, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/istc.2018.8625281\">10.1109/istc.2018.8625281</a>.","ama":"Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes by successive factor graph permutations. In: <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>. IEEE; 2018:1-5. doi:<a href=\"https://doi.org/10.1109/istc.2018.8625281\">10.1109/istc.2018.8625281</a>","ieee":"S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and polar codes by successive factor graph permutations,” in <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>, Hong Kong, China, 2018, pp. 1–5.","short":"S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing, IEEE, 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 &#38; Iterative Information Processing. ISTC: Symposium on Turbo Codes &#38; Iterative Information Processing, 1–5.","chicago":"Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren  Gross. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In <i>2018 IEEE 10th International Symposium on Turbo Codes &#38; Iterative Information Processing</i>, 1–5. IEEE, 2018. <a href=\"https://doi.org/10.1109/istc.2018.8625281\">https://doi.org/10.1109/istc.2018.8625281</a>."},"arxiv":1,"abstract":[{"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.","lang":"eng"}],"type":"conference","date_created":"2019-07-23T09:12:43Z","_id":"6664","quality_controlled":"1","day":"01","status":"public","page":"1-5","external_id":{"arxiv":["1807.03912"]},"conference":{"name":"ISTC: Symposium on Turbo Codes & Iterative Information Processing","end_date":"2018-12-07","start_date":"2018-12-03","location":"Hong Kong, China"},"language":[{"iso":"eng"}],"year":"2018","date_published":"2018-12-01T00:00:00Z","month":"12","publisher":"IEEE","date_updated":"2021-01-12T08:08:29Z","oa":1,"author":[{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"last_name":"Doan","first_name":"Nghia","full_name":"Doan, Nghia"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Gross, Warren ","last_name":"Gross","first_name":"Warren "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Decoding Reed-Muller and polar codes by successive factor graph permutations"},{"conference":{"location":"Guangzhou, China","end_date":"2018-11-29","start_date":"2018-11-25","name":"ITW: Information Theory Workshop"},"page":"1-5","external_id":{"arxiv":["1711.01339"]},"year":"2018","language":[{"iso":"eng"}],"publisher":"IEEE","month":"11","date_published":"2018-11-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Fazeli, Arman","last_name":"Fazeli","first_name":"Arman"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco"},{"last_name":"Vardy","first_name":"Alexander","full_name":"Vardy, Alexander"}],"title":"Binary linear codes with optimal scaling: Polar codes with large kernels","oa":1,"date_updated":"2024-03-07T12:18:50Z","main_file_link":[{"url":"https://arxiv.org/abs/1711.01339","open_access":"1"}],"publication_status":"published","doi":"10.1109/itw.2018.8613428","publication":"2018 IEEE Information Theory Workshop","oa_version":"Preprint","related_material":{"record":[{"id":"9002","status":"public","relation":"later_version"}]},"type":"conference","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,"extern":"1","citation":{"apa":"Fazeli, A., Hassani, H., Mondelli, M., &#38; Vardy, A. (2018). Binary linear codes with optimal scaling: Polar codes with large kernels. In <i>2018 IEEE Information Theory Workshop</i> (pp. 1–5). Guangzhou, China: IEEE. <a href=\"https://doi.org/10.1109/itw.2018.8613428\">https://doi.org/10.1109/itw.2018.8613428</a>","mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” <i>2018 IEEE Information Theory Workshop</i>, IEEE, 2018, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/itw.2018.8613428\">10.1109/itw.2018.8613428</a>.","ama":"Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. In: <i>2018 IEEE Information Theory Workshop</i>. IEEE; 2018:1-5. doi:<a href=\"https://doi.org/10.1109/itw.2018.8613428\">10.1109/itw.2018.8613428</a>","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5.","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” in <i>2018 IEEE Information Theory Workshop</i>, 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.","chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In <i>2018 IEEE Information Theory Workshop</i>, 1–5. IEEE, 2018. <a href=\"https://doi.org/10.1109/itw.2018.8613428\">https://doi.org/10.1109/itw.2018.8613428</a>."},"day":"01","quality_controlled":"1","status":"public","_id":"6665","date_created":"2019-07-23T11:01:42Z"},{"publisher":"IEEE","date_published":"2018-09-01T00:00:00Z","intvolume":"        66","month":"09","title":"Decoder partitioning: Towards practical list decoding of polar codes","author":[{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Hassani","first_name":"S. Hamed","full_name":"Hassani, S. Hamed"},{"first_name":"Carlo","last_name":"Condo","full_name":"Condo, Carlo"},{"full_name":"Urbanke, Rudiger L.","first_name":"Rudiger L.","last_name":"Urbanke"},{"first_name":"Warren J.","last_name":"Gross","full_name":"Gross, Warren J."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"9","date_updated":"2021-01-12T08:08:31Z","page":"3749-3759","year":"2018","language":[{"iso":"eng"}],"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."}],"type":"journal_article","volume":66,"publication_identifier":{"eissn":["1558-0857"]},"extern":"1","citation":{"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.” <i>IEEE Transactions on Communications</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">https://doi.org/10.1109/tcomm.2018.2832207</a>.","ama":"Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. Decoder partitioning: Towards practical list decoding of polar codes. <i>IEEE Transactions on Communications</i>. 2018;66(9):3749-3759. doi:<a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">10.1109/tcomm.2018.2832207</a>","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.","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,” <i>IEEE Transactions on Communications</i>, vol. 66, no. 9. IEEE, pp. 3749–3759, 2018.","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.","mla":"Hashemi, Seyyed Ali, et al. “Decoder Partitioning: Towards Practical List Decoding of Polar Codes.” <i>IEEE Transactions on Communications</i>, vol. 66, no. 9, IEEE, 2018, pp. 3749–59, doi:<a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">10.1109/tcomm.2018.2832207</a>.","apa":"Hashemi, S. A., Mondelli, M., Hassani, S. H., Condo, C., Urbanke, R. L., &#38; Gross, W. J. (2018). Decoder partitioning: Towards practical list decoding of polar codes. <i>IEEE Transactions on Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/tcomm.2018.2832207\">https://doi.org/10.1109/tcomm.2018.2832207</a>"},"day":"01","quality_controlled":"1","status":"public","_id":"6674","date_created":"2019-07-24T08:59:41Z","publication":"IEEE Transactions on Communications","publication_status":"published","doi":"10.1109/tcomm.2018.2832207","oa_version":"None"},{"day":"16","status":"public","quality_controlled":"1","date_created":"2019-07-24T09:10:38Z","_id":"6675","arxiv":1,"abstract":[{"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.","lang":"eng"}],"type":"conference","extern":"1","citation":{"chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” In <i>2018 IEEE International Symposium on Information Theory</i>, 351–55. IEEE, 2018. <a href=\"https://doi.org/10.1109/isit.2018.8437479\">https://doi.org/10.1109/isit.2018.8437479</a>.","ama":"Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive relay channel. In: <i>2018 IEEE International Symposium on Information Theory</i>. IEEE; 2018:351-355. doi:<a href=\"https://doi.org/10.1109/isit.2018.8437479\">10.1109/isit.2018.8437479</a>","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.","short":"M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–355.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” in <i>2018 IEEE International Symposium on Information Theory</i>, Vail, CO, United States, 2018, pp. 351–355.","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” <i>2018 IEEE International Symposium on Information Theory</i>, IEEE, 2018, pp. 351–55, doi:<a href=\"https://doi.org/10.1109/isit.2018.8437479\">10.1109/isit.2018.8437479</a>.","apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2018). A new coding paradigm for the primitive relay channel. In <i>2018 IEEE International Symposium on Information Theory</i> (pp. 351–355). Vail, CO, United States: IEEE. <a href=\"https://doi.org/10.1109/isit.2018.8437479\">https://doi.org/10.1109/isit.2018.8437479</a>"},"publication_identifier":{"eissn":["2157-8117"]},"oa_version":"Preprint","related_material":{"record":[{"status":"public","relation":"later_version","id":"7007"}]},"publication":"2018 IEEE International Symposium on Information Theory","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1801.03153"}],"doi":"10.1109/isit.2018.8437479","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"full_name":"Hassani, Hamed","last_name":"Hassani","first_name":"Hamed"},{"full_name":"Urbanke, Rudiger","last_name":"Urbanke","first_name":"Rudiger"}],"title":"A new coding paradigm for the primitive relay channel","date_updated":"2023-02-23T12:56:49Z","publisher":"IEEE","date_published":"2018-06-16T00:00:00Z","month":"06","year":"2018","language":[{"iso":"eng"}],"conference":{"location":"Vail, CO, United States","start_date":"2018-06-17","end_date":"2018-06-22","name":"ISIT: International Symposium on Information Theory "},"external_id":{"arxiv":["1801.03153"]},"page":"351-355"},{"extern":"1","publication_identifier":{"issn":["0018-9448","1557-9654"]},"citation":{"ama":"Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric channels. <i>IEEE Transactions on Information Theory</i>. 2018;64(5):3371-3393. doi:<a href=\"https://doi.org/10.1109/tit.2018.2789885\">10.1109/tit.2018.2789885</a>","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.","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.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric channels,” <i>IEEE Transactions on Information Theory</i>, vol. 64, no. 5. IEEE, pp. 3371–3393, 2018.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger  Urbanke. “How to Achieve the Capacity of Asymmetric Channels.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/tit.2018.2789885\">https://doi.org/10.1109/tit.2018.2789885</a>.","apa":"Mondelli, M., Hassani, H., &#38; Urbanke, R. (2018). How to achieve the capacity of asymmetric channels. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2018.2789885\">https://doi.org/10.1109/tit.2018.2789885</a>","mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” <i>IEEE Transactions on Information Theory</i>, vol. 64, no. 5, IEEE, 2018, pp. 3371–93, doi:<a href=\"https://doi.org/10.1109/tit.2018.2789885\">10.1109/tit.2018.2789885</a>."},"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."}],"arxiv":1,"type":"journal_article","_id":"6678","quality_controlled":"1","publication_status":"published","publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"How to achieve the capacity of asymmetric channels","author":[{"full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"},{"first_name":"Rudiger ","last_name":"Urbanke","full_name":"Urbanke, Rudiger "}],"language":[{"iso":"eng"}],"article_type":"original","volume":64,"date_created":"2019-07-24T12:38:49Z","status":"public","day":"01","publication":"IEEE Transactions on Information Theory","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.7373"}],"doi":"10.1109/tit.2018.2789885","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"6740"}]},"oa_version":"Preprint","date_published":"2018-05-01T00:00:00Z","intvolume":"        64","month":"05","date_updated":"2023-02-23T12:50:46Z","oa":1,"issue":"5","page":"3371-3393","external_id":{"arxiv":["1406.7373"]},"year":"2018"}]