[{"quality_controlled":"1","title":"Learning directed acyclic graphs based on sparsest permutations","date_published":"2018-04-17T00:00:00Z","date_created":"2018-12-11T11:55:13Z","article_processing_charge":"No","volume":7,"publication":"STAT","year":"2018","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.0366"}],"_id":"2015","external_id":{"arxiv":["1307.0366"]},"type":"journal_article","author":[{"last_name":"Raskutti","full_name":"Raskutti, Garvesh","first_name":"Garvesh"},{"last_name":"Uhler","orcid":"0000-0002-7008-0216","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest permutations. STAT. 7(1), e183.","apa":"Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183","mla":"Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT, vol. 7, no. 1, e183, Wiley, 2018, doi:10.1002/sta4.183.","ama":"Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations. STAT. 2018;7(1). doi:10.1002/sta4.183","short":"G. Raskutti, C. Uhler, STAT 7 (2018).","chicago":"Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT. Wiley, 2018. https://doi.org/10.1002/sta4.183.","ieee":"G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest permutations,” STAT, vol. 7, no. 1. Wiley, 2018."},"date_updated":"2021-01-12T06:54:44Z","oa_version":"Preprint","publisher":"Wiley","article_type":"original","intvolume":" 7","article_number":"e183","arxiv":1,"language":[{"iso":"eng"}],"status":"public","doi":"10.1002/sta4.183","publist_id":"5061","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"}],"issue":"1","month":"04","extern":"1","day":"17","publication_status":"published"},{"scopus_import":"1","external_id":{"isi":["000436245000096"]},"_id":"203","author":[{"full_name":"Abbas, Mohamad","first_name":"Mohamad","id":"47E8FC1C-F248-11E8-B48F-1D18A9856A87","last_name":"Abbas"},{"first_name":"García J","full_name":"Hernández, García J","last_name":"Hernández"},{"last_name":"Pollmann","full_name":"Pollmann, Stephan","first_name":"Stephan"},{"full_name":"Samodelov, Sophia L","first_name":"Sophia L","last_name":"Samodelov"},{"last_name":"Kolb","full_name":"Kolb, Martina","first_name":"Martina"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml"},{"first_name":"Ulrich Z","full_name":"Hammes, Ulrich Z","last_name":"Hammes"},{"full_name":"Zurbriggen, Matias D","first_name":"Matias D","last_name":"Zurbriggen"},{"first_name":"Miguel","full_name":"Blázquez, Miguel","last_name":"Blázquez"},{"last_name":"Alabadí","full_name":"Alabadí, David","first_name":"David"}],"oa":1,"citation":{"ieee":"M. Abbas et al., “Auxin methylation is required for differential growth in Arabidopsis,” PNAS, vol. 115, no. 26. National Academy of Sciences, pp. 6864–6869, 2018.","chicago":"Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov, Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez, and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1806565115.","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.","ama":"Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for differential growth in Arabidopsis. PNAS. 2018;115(26):6864-6869. doi:10.1073/pnas.1806565115","apa":"Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml, J., … Alabadí, D. (2018). Auxin methylation is required for differential growth in Arabidopsis. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1806565115","mla":"Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.” PNAS, vol. 115, no. 26, National Academy of Sciences, 2018, pp. 6864–69, doi:10.1073/pnas.1806565115.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"JiFr"}],"oa_version":"None","date_updated":"2025-05-07T11:12:32Z","type":"journal_article","quality_controlled":"1","date_published":"2018-06-26T00:00:00Z","title":"Auxin methylation is required for differential growth in Arabidopsis","project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"volume":115,"article_processing_charge":"No","publication":"PNAS","main_file_link":[{"url":"http://eprints.nottingham.ac.uk/52388/","open_access":"1"}],"year":"2018","date_created":"2018-12-11T11:45:11Z","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"}],"doi":"10.1073/pnas.1806565115","publist_id":"7710","issue":"26","status":"public","ec_funded":1,"day":"26","publication_status":"published","month":"06","isi":1,"publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"page":"6864-6869","intvolume":" 115"},{"article_type":"original","intvolume":" 9","article_number":"4605","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/"}],"record":[{"status":"public","relation":"dissertation_contains","id":"6363"}]},"month":"11","isi":1,"ec_funded":1,"day":"02","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..","publication_status":"published","status":"public","doi":"10.1038/s41467-018-06899-3","publist_id":"8034","abstract":[{"lang":"eng","text":"Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits are thought to play a key role in several higher network functions, such as feedforward and feedback inhibition, network oscillations, and pattern separation. Fast lateral inhibition mediated by GABAergic interneurons may implement a winner-takes-all mechanism in the hippocampal input layer. However, it is not clear whether the functional connectivity rules of granule cells (GCs) and interneurons in the dentate gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we find that connectivity is structured in space, synapse-specific, and enriched in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron) is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits itself). Thus, unique connectivity rules may enable the dentate gyrus to perform specific higher-order computations"}],"issue":"1","date_created":"2018-12-11T11:44:12Z","ddc":["570"],"article_processing_charge":"No","volume":9,"publication":"Nature Communications","year":"2018","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","date_published":"2018-11-02T00:00:00Z","title":"Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus","project":[{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"},{"name":"The Wittgenstein Prize","grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"type":"journal_article","author":[{"id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","full_name":"Espinoza Martinez, Claudia ","orcid":"0000-0003-4710-2082","last_name":"Espinoza Martinez"},{"last_name":"Guzmán","orcid":"0000-0003-2209-5242","first_name":"José","full_name":"Guzmán, José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zhang","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","first_name":"Xiaomin","full_name":"Zhang, Xiaomin"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.","chicago":"Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06899-3.","ama":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-06899-3","short":"C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications 9 (2018).","mla":"Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications, vol. 9, no. 1, 4605, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06899-3.","apa":"Espinoza Martinez, C., Guzmán, J., Zhang, X., & Jonas, P. M. (2018). Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06899-3","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."},"has_accepted_license":"1","department":[{"_id":"PeJo"}],"file":[{"access_level":"open_access","file_id":"5715","date_created":"2018-12-17T15:41:57Z","file_name":"2018_NatureComm_Espinoza.pdf","date_updated":"2020-07-14T12:45:28Z","content_type":"application/pdf","file_size":4651930,"checksum":"9fe2a63bd95a5067d896c087d07998f3","relation":"main_file","creator":"dernst"}],"oa_version":"Published Version","date_updated":"2024-03-25T23:30:16Z","_id":"21","scopus_import":"1","file_date_updated":"2020-07-14T12:45:28Z","external_id":{"isi":["000449069700009"]}},{"publication_status":"published","day":"20","isi":1,"month":"10","issue":"10","doi":"10.1364/OPTICA.5.001210","abstract":[{"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.","lang":"eng"}],"publist_id":"8033","status":"public","publication_identifier":{"issn":["23342536"]},"language":[{"iso":"eng"}],"intvolume":" 5","page":"1210 - 1219","article_type":"original","date_updated":"2023-10-17T12:12:40Z","oa_version":"Published Version","department":[{"_id":"JoFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. https://doi.org/10.1364/OPTICA.5.001210","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, vol. 5, no. 10, 2018, pp. 1210–19, doi:10.1364/OPTICA.5.001210.","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.","ieee":"G. Botello et al., “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” Optica, vol. 5, no. 10. pp. 1210–1219, 2018.","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, 2018. https://doi.org/10.1364/OPTICA.5.001210.","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.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 2018;5(10):1210-1219. doi:10.1364/OPTICA.5.001210"},"oa":1,"author":[{"first_name":"Gabriel","full_name":"Botello, Gabriel","last_name":"Botello"},{"full_name":"Sedlmeir, Florian","first_name":"Florian","last_name":"Sedlmeir"},{"last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Abdalmalak","full_name":"Abdalmalak, Kerlos","first_name":"Kerlos"},{"last_name":"Brown","full_name":"Brown, Elliott","first_name":"Elliott"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"last_name":"Preu","first_name":"Sascha","full_name":"Preu, Sascha"},{"full_name":"Segovia Vargas, Daniel","first_name":"Daniel","last_name":"Segovia Vargas"},{"last_name":"Strekalov","first_name":"Dmitry","full_name":"Strekalov, Dmitry"},{"last_name":"Munoz","first_name":"Luis","full_name":"Munoz, Luis"},{"last_name":"Schwefel","full_name":"Schwefel, Harald","first_name":"Harald"}],"type":"journal_article","external_id":{"isi":["000447853100007"]},"scopus_import":"1","_id":"22","year":"2018","main_file_link":[{"open_access":"1","url":"www.doi.org/10.1364/OPTICA.5.001210 "}],"publication":"Optica","volume":5,"article_processing_charge":"No","date_created":"2018-12-11T11:44:12Z","title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","date_published":"2018-10-20T00:00:00Z","quality_controlled":"1"},{"_id":"23","external_id":{"pmid":["30359041"],"isi":["000451102100064"]},"file_date_updated":"2020-07-14T12:45:37Z","scopus_import":"1","pubrep_id":"1065","type":"journal_article","date_updated":"2023-09-18T09:30:37Z","oa_version":"Published Version","department":[{"_id":"GeKa"}],"file":[{"creator":"system","relation":"main_file","checksum":"3e6034a94c6b5335e939145d88bdb371","date_created":"2018-12-12T10:16:08Z","file_id":"5194","access_level":"open_access","file_size":1361441,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:37Z","file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf"}],"citation":{"apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., & Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.","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.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217.","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217","ieee":"L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros, “Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","author":[{"first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","full_name":"Vukušić, Lada","orcid":"0000-0003-2424-8636","last_name":"Vukušić"},{"first_name":"Josip","full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","last_name":"Kukucka"},{"id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes","full_name":"Watzinger, Hannes","last_name":"Watzinger"},{"last_name":"Milem","first_name":"Joshua M","id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87","full_name":"Milem, Joshua M"},{"last_name":"Schäffler","full_name":"Schäffler, Friedrich","first_name":"Friedrich"},{"orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros"}],"oa":1,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"project":[{"name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497","_id":"25517E86-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_published":"2018-10-25T00:00:00Z","title":"Single-shot readout of hole spins in Ge","quality_controlled":"1","ddc":["530"],"date_created":"2018-12-11T11:44:13Z","year":"2018","publication":"Nano Letters","volume":18,"article_processing_charge":"No","pmid":1,"status":"public","publication_identifier":{"issn":["15306984"]},"issue":"11","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"abstract":[{"lang":"eng","text":"The strong atomistic spin–orbit coupling of holes makes single-shot spin readout measurements difficult because it reduces the spin lifetimes. By integrating the charge sensor into a high bandwidth radio frequency reflectometry setup, we were able to demonstrate single-shot readout of a germanium quantum dot hole spin and measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT are reported, with a total readout visibility of about 70%. By analyzing separately the spin-to-charge conversion and charge readout fidelities, we have obtained insight into the processes limiting the visibilities of hole spins. The analyses suggest that high hole visibilities are feasible at realistic experimental conditions, underlying the potential of hole spins for the realization of viable qubit devices."}],"publist_id":"8032","doi":"10.1021/acs.nanolett.8b03217","isi":1,"related_material":{"record":[{"relation":"popular_science","id":"7977"},{"relation":"dissertation_contains","id":"69","status":"public"},{"id":"7996","relation":"dissertation_contains","status":"public"}]},"month":"10","publication_status":"published","day":"25","ec_funded":1,"publisher":"American Chemical Society","intvolume":" 18","page":"7141 - 7145","language":[{"iso":"eng"}]},{"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","date_published":"2018-07-01T00:00:00Z","quality_controlled":"1","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"article_processing_charge":"No","volume":2018,"date_created":"2018-12-11T11:44:13Z","external_id":{"arxiv":["1804.10601"],"isi":["000764175404117"]},"scopus_import":"1","_id":"24","oa_version":"Preprint","date_updated":"2025-06-02T08:53:48Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 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.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian","last_name":"Elgyütt"},{"full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"last_name":"Rouillé","first_name":"Owen","full_name":"Rouillé, Owen"}],"oa":1,"type":"conference","publisher":"IJCAI","language":[{"iso":"eng"}],"arxiv":1,"intvolume":" 2018","page":"4692 - 4699","doi":"10.24963/ijcai.2018/652","abstract":[{"lang":"eng","text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it."}],"publist_id":"8031","status":"public","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","publication_status":"published","day":"01","ec_funded":1,"isi":1,"month":"07"},{"quality_controlled":"1","title":"Decoding Reed-Muller and polar codes by successive factor graph permutations","date_published":"2018-12-01T00:00:00Z","publisher":"IEEE","conference":{"start_date":"2018-12-03","location":"Hong Kong, China","end_date":"2018-12-07","name":"ISTC: Symposium on Turbo Codes & Iterative Information Processing"},"publication":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing","language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.03912"}],"year":"2018","page":"1-5","date_created":"2019-07-23T09:12:43Z","doi":"10.1109/istc.2018.8625281","abstract":[{"lang":"eng","text":"Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding can be performed. We further propose a successive permutation (SP) scheme which finds the permutations on the fly, thus the decoding always progresses on a single factor graph permutation. We show that SP can be used to improve the error-correction performance of RM and polar codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping the memory requirements of the decoders unaltered. Our results for RM and polar codes of length 128 and rate 0.5 show that when SP is used and at a target frame error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for RM and polar codes respectively."}],"external_id":{"arxiv":["1807.03912"]},"status":"public","_id":"6664","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","citation":{"ista":"Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar codes by successive factor graph permutations. 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing. ISTC: Symposium on Turbo Codes & Iterative Information Processing, 1–5.","mla":"Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5, doi:10.1109/istc.2018.8625281.","apa":"Hashemi, S. A., Doan, N., Mondelli, M., & Gross, W. (2018). Decoding Reed-Muller and polar codes by successive factor graph permutations. In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (pp. 1–5). Hong Kong, China: IEEE. https://doi.org/10.1109/istc.2018.8625281","short":"S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5.","ama":"Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes by successive factor graph permutations. In: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing. IEEE; 2018:1-5. doi:10.1109/istc.2018.8625281","chicago":"Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren Gross. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, 1–5. IEEE, 2018. https://doi.org/10.1109/istc.2018.8625281.","ieee":"S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and polar codes by successive factor graph permutations,” in 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, Hong Kong, China, 2018, pp. 1–5."},"author":[{"first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi"},{"full_name":"Doan, Nghia","first_name":"Nghia","last_name":"Doan"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco"},{"first_name":"Warren ","full_name":"Gross, Warren ","last_name":"Gross"}],"oa":1,"extern":"1","oa_version":"Preprint","publication_status":"published","date_updated":"2021-01-12T08:08:29Z","type":"conference","month":"12"},{"_id":"6665","status":"public","external_id":{"arxiv":["1711.01339"]},"doi":"10.1109/itw.2018.8613428","abstract":[{"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).","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"9002","relation":"later_version"}]},"month":"11","type":"conference","date_updated":"2024-03-07T12:18:50Z","oa_version":"Preprint","publication_status":"published","author":[{"full_name":"Fazeli, Arman","first_name":"Arman","last_name":"Fazeli"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"},{"last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"full_name":"Vardy, Alexander","first_name":"Alexander","last_name":"Vardy"}],"oa":1,"extern":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. In: 2018 IEEE Information Theory Workshop. IEEE; 2018:1-5. doi:10.1109/itw.2018.8613428","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5.","chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In 2018 IEEE Information Theory Workshop, 1–5. IEEE, 2018. https://doi.org/10.1109/itw.2018.8613428.","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” in 2018 IEEE Information Theory Workshop, Guangzhou, China, 2018, pp. 1–5.","ista":"Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory Workshop. ITW: Information Theory Workshop, 1–5.","mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5, doi:10.1109/itw.2018.8613428.","apa":"Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428"},"conference":{"end_date":"2018-11-29","location":"Guangzhou, China","start_date":"2018-11-25","name":"ITW: Information Theory Workshop"},"publisher":"IEEE","date_published":"2018-11-01T00:00:00Z","title":"Binary linear codes with optimal scaling: Polar codes with large kernels","quality_controlled":"1","date_created":"2019-07-23T11:01:42Z","page":"1-5","main_file_link":[{"url":"https://arxiv.org/abs/1711.01339","open_access":"1"}],"year":"2018","arxiv":1,"language":[{"iso":"eng"}],"publication":"2018 IEEE Information Theory Workshop"},{"main_file_link":[{"url":"https://arxiv.org/abs/1801.03153","open_access":"1"}],"year":"2018","arxiv":1,"language":[{"iso":"eng"}],"publication":"2018 IEEE International Symposium on Information Theory","date_created":"2019-07-24T09:10:38Z","page":"351-355","title":"A new coding paradigm for the primitive relay channel","date_published":"2018-06-16T00:00:00Z","quality_controlled":"1","conference":{"name":"ISIT: International Symposium on Information Theory ","location":"Vail, CO, United States","start_date":"2018-06-17","end_date":"2018-06-22"},"publisher":"IEEE","date_updated":"2023-02-23T12:56:49Z","oa_version":"Preprint","publication_status":"published","oa":1,"extern":"1","author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"},{"first_name":"Rudiger","full_name":"Urbanke, Rudiger","last_name":"Urbanke"}],"citation":{"ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” in 2018 IEEE International Symposium on Information Theory, Vail, CO, United States, 2018, pp. 351–355.","ama":"Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive relay channel. In: 2018 IEEE International Symposium on Information Theory. IEEE; 2018:351-355. doi:10.1109/isit.2018.8437479","short":"M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–355.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” In 2018 IEEE International Symposium on Information Theory, 351–55. IEEE, 2018. https://doi.org/10.1109/isit.2018.8437479.","ista":"Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive relay channel. 2018 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory , 351–355.","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–55, doi:10.1109/isit.2018.8437479.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2018). A new coding paradigm for the primitive relay channel. In 2018 IEEE International Symposium on Information Theory (pp. 351–355). Vail, CO, United States: IEEE. https://doi.org/10.1109/isit.2018.8437479"},"day":"16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","related_material":{"record":[{"id":"7007","relation":"later_version","status":"public"}]},"type":"conference","external_id":{"arxiv":["1801.03153"]},"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"}],"doi":"10.1109/isit.2018.8437479","_id":"6675","status":"public","publication_identifier":{"eissn":["2157-8117"]}},{"date_created":"2019-07-24T12:38:49Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.7373"}],"year":"2018","volume":64,"publication":"IEEE Transactions on Information Theory","title":"How to achieve the capacity of asymmetric channels","date_published":"2018-05-01T00:00:00Z","quality_controlled":"1","type":"journal_article","oa_version":"Preprint","date_updated":"2023-02-23T12:50:46Z","oa":1,"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"last_name":"Urbanke","first_name":"Rudiger ","full_name":"Urbanke, Rudiger "}],"citation":{"ama":"Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393. doi:10.1109/tit.2018.2789885","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory. IEEE, 2018. https://doi.org/10.1109/tit.2018.2789885.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric channels,” IEEE Transactions on Information Theory, vol. 64, no. 5. IEEE, pp. 3371–3393, 2018.","ista":"Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.","mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp. 3371–93, doi:10.1109/tit.2018.2789885.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2018.2789885"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6678","external_id":{"arxiv":["1406.7373"]},"intvolume":" 64","article_type":"original","page":"3371-3393","language":[{"iso":"eng"}],"arxiv":1,"publisher":"IEEE","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6740"}]},"month":"05","publication_status":"published","extern":"1","day":"01","status":"public","publication_identifier":{"issn":["0018-9448","1557-9654"]},"issue":"5","doi":"10.1109/tit.2018.2789885","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."}]},{"publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"intvolume":" 2","article_type":"original","page":"1633 - 1643","issue":"10","doi":"10.1038/s41559-018-0651-y","abstract":[{"lang":"eng","text":"Gene regulatory networks evolve through rewiring of individual components—that is, through changes in regulatory connections. However, the mechanistic basis of regulatory rewiring is poorly understood. Using a canonical gene regulatory system, we quantify the properties of transcription factors that determine the evolutionary potential for rewiring of regulatory connections: robustness, tunability and evolvability. In vivo repression measurements of two repressors at mutated operator sites reveal their contrasting evolutionary potential: while robustness and evolvability were positively correlated, both were in trade-off with tunability. Epistatic interactions between adjacent operators alleviated this trade-off. A thermodynamic model explains how the differences in robustness, tunability and evolvability arise from biophysical characteristics of repressor–DNA binding. The model also uncovers that the energy matrix, which describes how mutations affect repressor–DNA binding, encodes crucial information about the evolutionary potential of a repressor. The biophysical determinants of evolutionary potential for regulatory rewiring constitute a mechanistic framework for understanding network evolution."}],"publist_id":"7987","status":"public","publication_status":"published","day":"10","ec_funded":1,"isi":1,"month":"09","related_material":{"record":[{"status":"public","id":"5585","relation":"popular_science"},{"id":"6371","relation":"dissertation_contains","status":"public"}]},"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Selective Barriers to Horizontal Gene Transfer","grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)","grant_number":"24573"}],"title":"Evolutionary potential of transcription factors for gene regulatory rewiring","date_published":"2018-09-10T00:00:00Z","quality_controlled":"1","year":"2018","publication":"Nature Ecology and Evolution","volume":2,"article_processing_charge":"No","ddc":["570"],"date_created":"2018-12-11T11:44:27Z","external_id":{"isi":["000447947600021"]},"file_date_updated":"2020-07-14T12:47:37Z","scopus_import":"1","_id":"67","oa_version":"Submitted Version","date_updated":"2024-03-25T23:30:27Z","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"file":[{"checksum":"383a2e2c944a856e2e821ec8e7bf71b6","relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"7830","date_created":"2020-05-14T11:28:52Z","file_name":"2018_NatureEcology_Igler.pdf","date_updated":"2020-07-14T12:47:37Z","content_type":"application/pdf","file_size":1135973}],"has_accepted_license":"1","citation":{"mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.","apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y","ista":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2(10), 1633–1643.","ieee":"C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary potential of transcription factors for gene regulatory rewiring,” Nature Ecology and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.","chicago":"Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y.","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Igler","first_name":"Claudia","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","full_name":"Lagator, Mato","first_name":"Mato"},{"last_name":"Tkacik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","full_name":"Tkacik, Gasper"},{"last_name":"Bollback","first_name":"Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612"},{"last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"}],"oa":1,"type":"journal_article"},{"publication":"2018 IEEE Global Communications Conference ","arxiv":1,"language":[{"iso":"eng"}],"year":"2018","main_file_link":[{"url":"https://arxiv.org/abs/1806.11195","open_access":"1"}],"date_created":"2019-07-30T06:43:15Z","quality_controlled":"1","date_published":"2018-12-01T00:00:00Z","title":"On the decoding of polar codes on permuted factor graphs","publisher":"IEEE","conference":{"location":"Abu Dhabi, United Arab Emirates","start_date":"2018-12-09","end_date":"2018-12-13","name":"GLOBECOM: Global Communications Conference"},"citation":{"mla":"Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.” 2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308.","apa":"Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308","ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar codes on permuted factor graphs. 2018 IEEE Global Communications Conference . GLOBECOM: Global Communications Conference.","chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308.","ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on permuted factor graphs. In: 2018 IEEE Global Communications Conference . IEEE; 2018. doi:10.1109/glocom.2018.8647308","short":"N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications Conference , IEEE, 2018.","ieee":"N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of polar codes on permuted factor graphs,” in 2018 IEEE Global Communications Conference , Abu Dhabi, United Arab Emirates, 2018."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","extern":"1","oa":1,"author":[{"first_name":"Nghia","full_name":"Doan, Nghia","last_name":"Doan"},{"last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli"},{"last_name":"Gross","full_name":"Gross, Warren J.","first_name":"Warren J."}],"date_updated":"2021-01-12T08:08:42Z","publication_status":"published","oa_version":"Preprint","type":"conference","month":"12","abstract":[{"lang":"eng","text":"Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error correction performance with a small number of permutations. In this paper, we first show that the permutations on the factor graph can be mapped into suitable permutations on the codeword positions. As a result, we can make use of a single decoder for all the permutations. In addition, we introduce a method to construct a set of predetermined permutations which can provide the correct codeword if the decoding fails on the original permutation. We show that for the 5G polar code of length 1024, the error-correction performance of the proposed decoder is more than 0.25 dB better than that of the BP decoder with the same number of random permutations at the frame error rate of 10 -4 ."}],"doi":"10.1109/glocom.2018.8647308","external_id":{"arxiv":["1806.11195"]},"publication_identifier":{"isbn":["9781538647271"]},"status":"public","_id":"6728"},{"date_created":"2019-08-08T06:47:40Z","ddc":["514"],"volume":2,"publication":"Journal of Applied and Computational Topology","year":"2018","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","date_published":"2018-12-01T00:00:00Z","title":"Computing simplicial representatives of homotopy group elements","project":[{"_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Robust invariants of Nonlinear Systems","grant_number":"M01980"},{"name":"FWF Open Access Fund","call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"type":"journal_article","oa":1,"author":[{"last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Filakovský, Marek"},{"first_name":"Peter","full_name":"Franek, Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8878-8397","last_name":"Franek"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","last_name":"Wagner"},{"last_name":"Zhechev","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y","full_name":"Zhechev, Stephan Y"}],"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.","apa":"Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5"},"file":[{"file_id":"6775","date_created":"2019-08-08T06:55:21Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:40Z","file_size":1056278,"file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","creator":"dernst","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","relation":"main_file"}],"department":[{"_id":"UlWa"}],"date_updated":"2023-09-07T13:10:36Z","oa_version":"Published Version","_id":"6774","file_date_updated":"2020-07-14T12:47:40Z","page":"177-231","article_type":"original","intvolume":" 2","language":[{"iso":"eng"}],"publisher":"Springer","related_material":{"record":[{"status":"public","id":"6681","relation":"dissertation_contains"}]},"month":"12","day":"01","publication_status":"published","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"status":"public","abstract":[{"text":"A central problem of algebraic topology is to understand the homotopy groups 𝜋𝑑(𝑋) of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group 𝜋1(𝑋) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with 𝜋1(𝑋) trivial), compute the higher homotopy group 𝜋𝑑(𝑋) for any given 𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of 𝜋𝑑(𝑋) , 𝑑≥2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of 𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere 𝑆𝑑 to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes 𝜋𝑑(𝑋) and represents its elements as simplicial maps from a suitable triangulation of the d-sphere 𝑆𝑑 to X. For fixed d, the algorithm runs in time exponential in size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed 𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of 𝜋𝑑(𝑋) , the size of the triangulation of 𝑆𝑑 on which the map is defined, is exponential in size(𝑋) .","lang":"eng"}],"doi":"10.1007/s41468-018-0021-5","issue":"3-4"},{"date_created":"2018-12-11T11:44:27Z","ddc":["004","519"],"year":"2018","article_processing_charge":"No","date_published":"2018-09-01T00:00:00Z","title":"Learning from dependent data","project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"pubrep_id":"1048","type":"dissertation","file":[{"date_created":"2019-04-09T07:32:47Z","file_id":"6253","access_level":"open_access","file_size":1036137,"date_updated":"2020-07-14T12:47:40Z","content_type":"application/pdf","file_name":"2018_Thesis_Zimin.pdf","creator":"dernst","relation":"main_file","checksum":"e849dd40a915e4d6c5572b51b517f098"},{"creator":"dernst","checksum":"da092153cec55c97461bd53c45c5d139","relation":"source_file","file_id":"6254","date_created":"2019-04-09T07:32:47Z","access_level":"closed","content_type":"application/zip","date_updated":"2020-07-14T12:47:40Z","file_size":637490,"file_name":"2018_Thesis_Zimin_Source.zip"}],"department":[{"_id":"ChLa"}],"date_updated":"2023-09-07T12:29:07Z","oa_version":"Published Version","oa":1,"author":[{"last_name":"Zimin","full_name":"Zimin, Alexander","first_name":"Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","citation":{"ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","ama":"Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048","short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria.","apa":"Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048","mla":"Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"68","file_date_updated":"2020-07-14T12:47:40Z","page":"92","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"alternative_title":["ISTA Thesis"],"month":"09","publication_status":"published","ec_funded":1,"day":"01","degree_awarded":"PhD","status":"public","publication_identifier":{"issn":["2663-337X"]},"publist_id":"7986","abstract":[{"lang":"eng","text":"The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability."}],"doi":"10.15479/AT:ISTA:TH1048"},{"title":"Charge sensing and spin relaxation times of holes in Ge hut wires","date_published":"2018-09-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","year":"2018","date_created":"2018-12-11T11:44:28Z","ddc":["530","600"],"file_date_updated":"2020-07-14T12:47:44Z","_id":"69","author":[{"orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","full_name":"Vukušić, Lada","last_name":"Vukušić"}],"oa":1,"citation":{"mla":"Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018."},"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_size":28452385,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:44Z","file_name":"2018_Thesis_Vukusic.pdf","date_created":"2019-04-09T07:00:40Z","file_id":"6247","access_level":"open_access","creator":"dernst","relation":"main_file","checksum":"c570b656e30749cd65b1c7e13a9ce0a8"},{"access_level":"closed","date_created":"2019-04-09T07:00:40Z","file_id":"6248","file_name":"2018_Thesis_Vukusic_source.zip","file_size":53058704,"content_type":"application/zip","date_updated":"2020-07-14T12:47:44Z","relation":"source_file","checksum":"7856771d9cd401fe0b311191076db6e1","creator":"dernst"}],"department":[{"_id":"GeKa"},{"_id":"GradSch"}],"oa_version":"Published Version","date_updated":"2023-09-26T15:50:22Z","type":"dissertation","pubrep_id":"1047","supervisor":[{"orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros"}],"publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"page":"103","abstract":[{"text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires.","lang":"eng"}],"doi":"10.15479/AT:ISTA:TH_1047","publist_id":"7985","publication_identifier":{"issn":["2663-337X"]},"status":"public","degree_awarded":"PhD","day":"01","publication_status":"published","month":"09","related_material":{"record":[{"status":"public","id":"23","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"840","status":"public"}]},"alternative_title":["ISTA Thesis"]},{"publication_status":"published","day":"14","ec_funded":1,"month":"06","issue":"1-2","publist_id":"7017","doi":"10.1007/s00440-017-0787-8","abstract":[{"lang":"eng","text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1."}],"status":"public","language":[{"iso":"eng"}],"arxiv":1,"article_number":"543-616","intvolume":" 171","publisher":"Springer","oa_version":"Preprint","date_updated":"2021-01-12T08:09:33Z","department":[{"_id":"LaEr"}],"citation":{"ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.","ista":"Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.","apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"full_name":"Lee, Jii","first_name":"Jii","last_name":"Lee"},{"orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","full_name":"Schnelli, Kevin","last_name":"Schnelli"}],"type":"journal_article","external_id":{"arxiv":["1605.08767"]},"scopus_import":1,"_id":"690","year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"publication":"Probability Theory and Related Fields","volume":171,"date_created":"2018-12-11T11:47:56Z","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"title":"Local law and Tracy–Widom limit for sparse random matrices","date_published":"2018-06-14T00:00:00Z","quality_controlled":"1"},{"publication":"Journal of Medical Genetics","article_processing_charge":"No","volume":55,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/","open_access":"1"}],"year":"2018","date_created":"2018-12-11T11:47:57Z","quality_controlled":"1","project":[{"grant_number":"401299","name":"Probing development and reversibility of autism spectrum disorders","_id":"254BA948-B435-11E9-9278-68D0E5697425"}],"date_published":"2018-01-01T00:00:00Z","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","citation":{"ieee":"I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","chicago":"Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group, 2018. https://doi.org/10.1136/jmedgenet-2017-104627.","ama":"Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54. doi:10.1136/jmedgenet-2017-104627","short":"I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev, G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki, J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54.","mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.","apa":"Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev, D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627","ista":"Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 55(1), 48–54."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Marin Valencia","full_name":"Marin Valencia, Isaac","first_name":"Isaac"},{"orcid":"0000-0002-7673-7178","first_name":"Gaia","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino"},{"first_name":"Anide","full_name":"Johansen, Anide","last_name":"Johansen"},{"full_name":"Rosti, Başak","first_name":"Başak","last_name":"Rosti"},{"full_name":"Issa, Mahmoud","first_name":"Mahmoud","last_name":"Issa"},{"full_name":"Musaev, Damir","first_name":"Damir","last_name":"Musaev"},{"first_name":"Gifty","full_name":"Bhat, Gifty","last_name":"Bhat"},{"last_name":"Scott","full_name":"Scott, Eric","first_name":"Eric"},{"last_name":"Silhavy","first_name":"Jennifer","full_name":"Silhavy, Jennifer"},{"last_name":"Stanley","first_name":"Valentina","full_name":"Stanley, Valentina"},{"last_name":"Rosti","first_name":"Rasim","full_name":"Rosti, Rasim"},{"last_name":"Gleeson","full_name":"Gleeson, Jeremy","first_name":"Jeremy"},{"full_name":"Imam, Farhad","first_name":"Farhad","last_name":"Imam"},{"first_name":"Maha","full_name":"Zaki, Maha","last_name":"Zaki"},{"last_name":"Gleeson","full_name":"Gleeson, Joseph","first_name":"Joseph"}],"oa":1,"date_updated":"2023-10-16T09:55:43Z","oa_version":"Submitted Version","department":[{"_id":"GaNo"}],"type":"journal_article","scopus_import":"1","external_id":{"isi":["000418199800007"],"pmid":["28626029"]},"_id":"691","language":[{"iso":"eng"}],"page":"48 - 54","article_type":"original","intvolume":" 55","publisher":"BMJ Publishing Group","day":"01","publication_status":"published","isi":1,"month":"01","abstract":[{"lang":"eng","text":"Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function."}],"doi":"10.1136/jmedgenet-2017-104627","publist_id":"7016","issue":"1","publication_identifier":{"issn":["0022-2593"]},"pmid":1,"status":"public"},{"article_type":"original","page":"55 - 64","intvolume":" 194","language":[{"iso":"eng"}],"publisher":"Springer","month":"06","isi":1,"ec_funded":1,"day":"01","publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them."}],"doi":"10.1007/s10711-017-0265-6","publist_id":"7014","issue":"1","date_created":"2018-12-11T11:47:57Z","ddc":["510"],"volume":194,"article_processing_charge":"Yes (via OA deal)","publication":"Geometriae Dedicata","year":"2018","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","date_published":"2018-06-01T00:00:00Z","title":"3-Webs generated by confocal conics and circles","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"type":"journal_article","oa":1,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan"}],"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64.","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.","apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 2018;194(1):55-64. doi:10.1007/s10711-017-0265-6","chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018."},"file":[{"relation":"main_file","checksum":"1febcfc1266486053a069e3425ea3713","creator":"kschuh","file_name":"2018_Springer_Akopyan.pdf","file_size":1140860,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:44Z","access_level":"open_access","date_created":"2020-01-03T11:35:08Z","file_id":"7222"}],"department":[{"_id":"HeEd"}],"date_updated":"2023-09-08T11:40:29Z","oa_version":"Published Version","_id":"692","scopus_import":"1","file_date_updated":"2020-07-14T12:47:44Z","external_id":{"isi":["000431418800004"]}},{"scopus_import":"1","external_id":{"isi":["000540656400026"]},"_id":"6941","oa":1,"author":[{"last_name":"Park","first_name":"Sunoo","full_name":"Park, Sunoo"},{"full_name":"Kwon, Albert","first_name":"Albert","last_name":"Kwon"},{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter","first_name":"Peter","last_name":"Gazi"},{"first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"citation":{"ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"KrPi"}],"oa_version":"Submitted Version","date_updated":"2023-09-19T15:02:13Z","type":"conference","quality_controlled":"1","date_published":"2018-12-07T00:00:00Z","title":"SpaceMint: A cryptocurrency based on proofs of space","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"conference":{"name":"FC: Financial Cryptography and Data Security","location":"Nieuwpoort, Curacao","start_date":"2018-02-26","end_date":"2018-03-02"},"article_processing_charge":"No","volume":10957,"publication":"22nd International Conference on Financial Cryptography and Data Security","year":"2018","main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"date_created":"2019-10-14T06:35:38Z","abstract":[{"text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.","lang":"eng"}],"doi":"10.1007/978-3-662-58387-6_26","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783662583869","9783662583876"]},"status":"public","ec_funded":1,"day":"07","publication_status":"published","month":"12","isi":1,"alternative_title":["LNCS"],"publisher":"Springer Nature","language":[{"iso":"eng"}],"page":"480-499","intvolume":" 10957"},{"scopus_import":"1","external_id":{"isi":["000451124500041"]},"_id":"7","oa":1,"author":[{"last_name":"Stroeymeyt","first_name":"Nathalie","full_name":"Stroeymeyt, Nathalie"},{"last_name":"Grasse","first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alessandro","full_name":"Crespi, Alessandro","last_name":"Crespi"},{"last_name":"Mersch","first_name":"Danielle","full_name":"Mersch, Danielle"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer"},{"last_name":"Keller","full_name":"Keller, Laurent","first_name":"Laurent"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect,” Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 941–945.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. Science. 2018;362(6417):941-945. doi:10.1126/science.aat4793","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect. Science. 362(6417), 941–945.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Science. AAAS. https://doi.org/10.1126/science.aat4793","mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:10.1126/science.aat4793."},"department":[{"_id":"SyCr"}],"date_updated":"2023-10-17T11:50:05Z","oa_version":"Published Version","type":"journal_article","quality_controlled":"1","date_published":"2018-11-23T00:00:00Z","title":"Social network plasticity decreases disease transmission in a eusocial insect","project":[{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects"}],"article_processing_charge":"No","volume":362,"publication":"Science","year":"2018","main_file_link":[{"open_access":"1","url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf"}],"date_created":"2018-12-11T11:44:07Z","publist_id":"8049","doi":"10.1126/science.aat4793","abstract":[{"text":"Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups.","lang":"eng"}],"issue":"6417","publication_identifier":{"issn":["1095-9203"]},"status":"public","ec_funded":1,"day":"23","acknowledgement":"This project was funded by two European Research Council Advanced Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research Council Starting Grant (SocialVaccines, 243071) to S.C.","publication_status":"published","month":"11","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/","description":"News on IST Homepage"}],"record":[{"status":"public","relation":"research_data","id":"13055"}]},"isi":1,"publisher":"AAAS","language":[{"iso":"eng"}],"page":"941 - 945","article_type":"original","intvolume":" 362"}]