[{"ddc":["570"],"date_created":"2018-12-11T11:44:27Z","status":"public","day":"10","volume":2,"related_material":{"record":[{"id":"5585","status":"public","relation":"popular_science"},{"id":"6371","status":"public","relation":"dissertation_contains"}]},"isi":1,"ec_funded":1,"oa_version":"Submitted Version","doi":"10.1038/s41559-018-0651-y","publication":"Nature Ecology and Evolution","date_updated":"2024-03-25T23:30:27Z","issue":"10","oa":1,"intvolume":"         2","month":"09","date_published":"2018-09-10T00:00:00Z","year":"2018","external_id":{"isi":["000447947600021"]},"page":"1633 - 1643","_id":"67","quality_controlled":"1","citation":{"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,” <i>Nature Ecology and Evolution</i>, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643.","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. <i>Nature Ecology and Evolution</i>. 2018;2(10):1633-1643. doi:<a href=\"https://doi.org/10.1038/s41559-018-0651-y\">10.1038/s41559-018-0651-y</a>","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.” <i>Nature Ecology and Evolution</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41559-018-0651-y\">https://doi.org/10.1038/s41559-018-0651-y</a>.","apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., &#38; Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. <i>Nature Ecology and Evolution</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41559-018-0651-y\">https://doi.org/10.1038/s41559-018-0651-y</a>","mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” <i>Nature Ecology and Evolution</i>, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:<a href=\"https://doi.org/10.1038/s41559-018-0651-y\">10.1038/s41559-018-0651-y</a>."},"file_date_updated":"2020-07-14T12:47:37Z","type":"journal_article","scopus_import":"1","abstract":[{"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.","lang":"eng"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"},{"name":"Selective Barriers to Horizontal Gene Transfer","_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","call_identifier":"H2020"},{"grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)"}],"publication_status":"published","file":[{"date_created":"2020-05-14T11:28:52Z","date_updated":"2020-07-14T12:47:37Z","file_name":"2018_NatureEcology_Igler.pdf","access_level":"open_access","relation":"main_file","checksum":"383a2e2c944a856e2e821ec8e7bf71b6","content_type":"application/pdf","file_id":"7830","creator":"dernst","file_size":1135973}],"title":"Evolutionary potential of transcription factors for gene regulatory rewiring","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"46613666-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia","last_name":"Igler","full_name":"Igler, Claudia"},{"first_name":"Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator","full_name":"Lagator, Mato"},{"full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","last_name":"Bollback","full_name":"Bollback, Jonathan P"},{"first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"}],"has_accepted_license":"1","publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"publist_id":"7987"},{"oa_version":"Preprint","publication":"2018 IEEE Global Communications Conference ","publication_status":"published","doi":"10.1109/glocom.2018.8647308","main_file_link":[{"url":"https://arxiv.org/abs/1806.11195","open_access":"1"}],"day":"01","quality_controlled":"1","status":"public","date_created":"2019-07-30T06:43:15Z","_id":"6728","arxiv":1,"abstract":[{"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 .","lang":"eng"}],"type":"conference","citation":{"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 <i>2018 IEEE Global Communications Conference </i>, Abu Dhabi, United Arab Emirates, 2018.","ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar codes on permuted factor graphs. 2018 IEEE Global Communications Conference . GLOBECOM: Global Communications Conference.","ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on permuted factor graphs. In: <i>2018 IEEE Global Communications Conference </i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/glocom.2018.8647308\">10.1109/glocom.2018.8647308</a>","chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On the Decoding of Polar Codes on Permuted Factor Graphs.” In <i>2018 IEEE Global Communications Conference </i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/glocom.2018.8647308\">https://doi.org/10.1109/glocom.2018.8647308</a>.","apa":"Doan, N., Hashemi, S. A., Mondelli, M., &#38; Gross, W. J. (2018). On the decoding of polar codes on permuted factor graphs. In <i>2018 IEEE Global Communications Conference </i>. Abu Dhabi, United Arab Emirates: IEEE. <a href=\"https://doi.org/10.1109/glocom.2018.8647308\">https://doi.org/10.1109/glocom.2018.8647308</a>","mla":"Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.” <i>2018 IEEE Global Communications Conference </i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/glocom.2018.8647308\">10.1109/glocom.2018.8647308</a>."},"extern":"1","publication_identifier":{"isbn":["9781538647271"]},"year":"2018","language":[{"iso":"eng"}],"conference":{"location":"Abu Dhabi, United Arab Emirates","name":"GLOBECOM: Global Communications Conference","start_date":"2018-12-09","end_date":"2018-12-13"},"external_id":{"arxiv":["1806.11195"]},"title":"On the decoding of polar codes on permuted factor graphs","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Doan, Nghia","first_name":"Nghia","last_name":"Doan"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"},{"last_name":"Gross","first_name":"Warren J.","full_name":"Gross, Warren J."}],"date_updated":"2021-01-12T08:08:42Z","publisher":"IEEE","date_published":"2018-12-01T00:00:00Z","month":"12"},{"file":[{"file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","date_created":"2019-08-08T06:55:21Z","date_updated":"2020-07-14T12:47:40Z","file_size":1056278,"creator":"dernst","content_type":"application/pdf","file_id":"6775","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","relation":"main_file","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský","full_name":"Filakovský, Marek"},{"orcid":"0000-0001-8878-8397","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Franek, Peter"},{"full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568"},{"first_name":"Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","last_name":"Zhechev","full_name":"Zhechev, Stephan Y"}],"title":"Computing simplicial representatives of homotopy group elements","has_accepted_license":"1","publisher":"Springer","language":[{"iso":"eng"}],"article_type":"original","department":[{"_id":"UlWa"}],"_id":"6774","quality_controlled":"1","citation":{"apa":"Filakovský, M., Franek, P., Wagner, U., &#38; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. Springer. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>.","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. <i>Journal of Applied and Computational Topology</i>. 2018;2(3-4):177-231. doi:<a href=\"https://doi.org/10.1007/s41468-018-0021-5\">10.1007/s41468-018-0021-5</a>","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” <i>Journal of Applied and Computational Topology</i>, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.","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.” <i>Journal of Applied and Computational Topology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s41468-018-0021-5\">https://doi.org/10.1007/s41468-018-0021-5</a>."},"publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"type":"journal_article","file_date_updated":"2020-07-14T12:47:40Z","abstract":[{"lang":"eng","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(𝑋) ."}],"project":[{"call_identifier":"FWF","grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","name":"Robust invariants of Nonlinear Systems"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"publication_status":"published","date_updated":"2023-09-07T13:10:36Z","issue":"3-4","oa":1,"month":"12","intvolume":"         2","date_published":"2018-12-01T00:00:00Z","year":"2018","page":"177-231","date_created":"2019-08-08T06:47:40Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["514"],"day":"01","status":"public","volume":2,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6681"}]},"oa_version":"Published Version","doi":"10.1007/s41468-018-0021-5","publication":"Journal of Applied and Computational Topology"},{"oa":1,"date_updated":"2023-09-07T12:29:07Z","month":"09","date_published":"2018-09-01T00:00:00Z","alternative_title":["ISTA Thesis"],"year":"2018","page":"92","supervisor":[{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"day":"01","status":"public","date_created":"2018-12-11T11:44:27Z","ddc":["004","519"],"ec_funded":1,"oa_version":"Published Version","doi":"10.15479/AT:ISTA:TH1048","degree_awarded":"PhD","file":[{"file_name":"2018_Thesis_Zimin.pdf","date_created":"2019-04-09T07:32:47Z","date_updated":"2020-07-14T12:47:40Z","file_size":1036137,"creator":"dernst","file_id":"6253","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"e849dd40a915e4d6c5572b51b517f098"},{"file_size":637490,"creator":"dernst","content_type":"application/zip","file_id":"6254","access_level":"closed","relation":"source_file","checksum":"da092153cec55c97461bd53c45c5d139","file_name":"2018_Thesis_Zimin_Source.zip","date_created":"2019-04-09T07:32:47Z","date_updated":"2020-07-14T12:47:40Z"}],"title":"Learning from dependent data","author":[{"last_name":"Zimin","first_name":"Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87","full_name":"Zimin, Alexander"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","pubrep_id":"1048","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"publist_id":"7986","article_processing_charge":"No","_id":"68","file_date_updated":"2020-07-14T12:47:40Z","type":"dissertation","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."}],"citation":{"chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">https://doi.org/10.15479/AT:ISTA:TH1048</a>.","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria.","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","ama":"Zimin A. Learning from dependent data. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">10.15479/AT:ISTA:TH1048</a>","mla":"Zimin, Alexander. <i>Learning from Dependent Data</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">10.15479/AT:ISTA:TH1048</a>.","apa":"Zimin, A. (2018). <i>Learning from dependent data</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH1048\">https://doi.org/10.15479/AT:ISTA:TH1048</a>"},"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7"}]},{"language":[{"iso":"eng"}],"pubrep_id":"1047","article_processing_charge":"No","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"publist_id":"7985","file":[{"date_updated":"2020-07-14T12:47:44Z","date_created":"2019-04-09T07:00:40Z","file_name":"2018_Thesis_Vukusic.pdf","relation":"main_file","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","access_level":"open_access","creator":"dernst","file_size":28452385,"content_type":"application/pdf","file_id":"6247"},{"file_id":"6248","content_type":"application/zip","file_size":53058704,"creator":"dernst","relation":"source_file","access_level":"closed","checksum":"7856771d9cd401fe0b311191076db6e1","file_name":"2018_Thesis_Vukusic_source.zip","date_updated":"2020-07-14T12:47:44Z","date_created":"2019-04-09T07:00:40Z"}],"author":[{"id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","orcid":"0000-0003-2424-8636","last_name":"Vukušić","full_name":"Vukušić, Lada"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","publication_status":"published","_id":"69","citation":{"mla":"Vukušić, Lada. <i>Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">10.15479/AT:ISTA:TH_1047</a>.","apa":"Vukušić, L. (2018). <i>Charge sensing and spin relaxation times of holes in Ge hut wires</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">https://doi.org/10.15479/AT:ISTA:TH_1047</a>","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">https://doi.org/10.15479/AT:ISTA:TH_1047</a>.","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1047\">10.15479/AT:ISTA:TH_1047</a>","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018."},"publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2020-07-14T12:47:44Z","type":"dissertation","abstract":[{"lang":"eng","text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires."}],"year":"2018","page":"103","date_updated":"2023-09-26T15:50:22Z","oa":1,"month":"09","alternative_title":["ISTA Thesis"],"date_published":"2018-09-01T00:00:00Z","related_material":{"record":[{"id":"23","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"840"}]},"oa_version":"Published Version","degree_awarded":"PhD","doi":"10.15479/AT:ISTA:TH_1047","date_created":"2018-12-11T11:44:28Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530","600"],"supervisor":[{"last_name":"Katsaros","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","full_name":"Katsaros, Georgios"}],"day":"01","status":"public"},{"doi":"10.1007/s00440-017-0787-8","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.08767"}],"publication":"Probability Theory and Related Fields","oa_version":"Preprint","ec_funded":1,"volume":171,"date_created":"2018-12-11T11:47:56Z","day":"14","status":"public","external_id":{"arxiv":["1605.08767"]},"year":"2018","month":"06","intvolume":"       171","date_published":"2018-06-14T00:00:00Z","article_number":"543-616","date_updated":"2021-01-12T08:09:33Z","issue":"1-2","oa":1,"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804"}],"publication_status":"published","citation":{"mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” <i>Probability Theory and Related Fields</i>, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00440-017-0787-8\">10.1007/s00440-017-0787-8</a>.","apa":"Lee, J., &#38; Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. <i>Probability Theory and Related Fields</i>. Springer. <a href=\"https://doi.org/10.1007/s00440-017-0787-8\">https://doi.org/10.1007/s00440-017-0787-8</a>","chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” <i>Probability Theory and Related Fields</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00440-017-0787-8\">https://doi.org/10.1007/s00440-017-0787-8</a>.","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. <i>Probability Theory and Related Fields</i>. 2018;171(1-2). doi:<a href=\"https://doi.org/10.1007/s00440-017-0787-8\">10.1007/s00440-017-0787-8</a>","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.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” <i>Probability Theory and Related Fields</i>, vol. 171, no. 1–2. Springer, 2018."},"type":"journal_article","scopus_import":1,"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."}],"arxiv":1,"_id":"690","quality_controlled":"1","publist_id":"7017","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"publisher":"Springer","title":"Local law and Tracy–Widom limit for sparse random matrices","author":[{"last_name":"Lee","first_name":"Jii","full_name":"Lee, Jii"},{"last_name":"Schnelli","orcid":"0000-0003-0954-3231","first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","full_name":"Schnelli, Kevin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"GaNo"}],"publist_id":"7016","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"BMJ Publishing Group","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","author":[{"last_name":"Marin Valencia","first_name":"Isaac","full_name":"Marin Valencia, Isaac"},{"orcid":"0000-0002-7673-7178","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia"},{"first_name":"Anide","last_name":"Johansen","full_name":"Johansen, Anide"},{"first_name":"Başak","last_name":"Rosti","full_name":"Rosti, Başak"},{"last_name":"Issa","first_name":"Mahmoud","full_name":"Issa, Mahmoud"},{"last_name":"Musaev","first_name":"Damir","full_name":"Musaev, Damir"},{"first_name":"Gifty","last_name":"Bhat","full_name":"Bhat, Gifty"},{"first_name":"Eric","last_name":"Scott","full_name":"Scott, Eric"},{"last_name":"Silhavy","first_name":"Jennifer","full_name":"Silhavy, Jennifer"},{"full_name":"Stanley, Valentina","first_name":"Valentina","last_name":"Stanley"},{"first_name":"Rasim","last_name":"Rosti","full_name":"Rosti, Rasim"},{"last_name":"Gleeson","first_name":"Jeremy","full_name":"Gleeson, Jeremy"},{"first_name":"Farhad","last_name":"Imam","full_name":"Imam, Farhad"},{"full_name":"Zaki, Maha","last_name":"Zaki","first_name":"Maha"},{"full_name":"Gleeson, Joseph","first_name":"Joseph","last_name":"Gleeson"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","project":[{"grant_number":"401299","_id":"254BA948-B435-11E9-9278-68D0E5697425","name":"Probing development and reversibility of autism spectrum disorders"}],"type":"journal_article","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."}],"scopus_import":"1","citation":{"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. <i>Journal of Medical Genetics</i>. BMJ Publishing Group. <a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">https://doi.org/10.1136/jmedgenet-2017-104627</a>","mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” <i>Journal of Medical Genetics</i>, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:<a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">10.1136/jmedgenet-2017-104627</a>.","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. <i>Journal of Medical Genetics</i>. 2018;55(1):48-54. doi:<a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">10.1136/jmedgenet-2017-104627</a>","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.","ieee":"I. Marin Valencia <i>et al.</i>, “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” <i>Journal of Medical Genetics</i>, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","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.","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.” <i>Journal of Medical Genetics</i>. BMJ Publishing Group, 2018. <a href=\"https://doi.org/10.1136/jmedgenet-2017-104627\">https://doi.org/10.1136/jmedgenet-2017-104627</a>."},"publication_identifier":{"issn":["0022-2593"]},"quality_controlled":"1","_id":"691","page":"48 - 54","external_id":{"pmid":["28626029"],"isi":["000418199800007"]},"year":"2018","intvolume":"        55","month":"01","date_published":"2018-01-01T00:00:00Z","issue":"1","oa":1,"date_updated":"2023-10-16T09:55:43Z","doi":"10.1136/jmedgenet-2017-104627","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/"}],"publication":"Journal of Medical Genetics","isi":1,"oa_version":"Submitted Version","pmid":1,"volume":55,"day":"01","status":"public","date_created":"2018-12-11T11:47:57Z"},{"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"HeEd"}],"publist_id":"7014","language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"Springer","file":[{"relation":"main_file","checksum":"1febcfc1266486053a069e3425ea3713","access_level":"open_access","file_size":1140860,"creator":"kschuh","content_type":"application/pdf","file_id":"7222","date_updated":"2020-07-14T12:47:44Z","date_created":"2020-01-03T11:35:08Z","file_name":"2018_Springer_Akopyan.pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"3-Webs generated by confocal conics and circles","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"}],"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","citation":{"short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64.","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” <i>Geometriae Dedicata</i>, vol. 194, no. 1. Springer, pp. 55–64, 2018.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. <i>Geometriae Dedicata</i>. 2018;194(1):55-64. doi:<a href=\"https://doi.org/10.1007/s10711-017-0265-6\">10.1007/s10711-017-0265-6</a>","chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” <i>Geometriae Dedicata</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s10711-017-0265-6\">https://doi.org/10.1007/s10711-017-0265-6</a>.","apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. <i>Geometriae Dedicata</i>. Springer. <a href=\"https://doi.org/10.1007/s10711-017-0265-6\">https://doi.org/10.1007/s10711-017-0265-6</a>","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” <i>Geometriae Dedicata</i>, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:<a href=\"https://doi.org/10.1007/s10711-017-0265-6\">10.1007/s10711-017-0265-6</a>."},"type":"journal_article","file_date_updated":"2020-07-14T12:47:44Z","abstract":[{"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.","lang":"eng"}],"scopus_import":"1","_id":"692","quality_controlled":"1","page":"55 - 64","external_id":{"isi":["000431418800004"]},"year":"2018","month":"06","intvolume":"       194","date_published":"2018-06-01T00:00:00Z","date_updated":"2023-09-08T11:40:29Z","issue":"1","oa":1,"doi":"10.1007/s10711-017-0265-6","publication":"Geometriae Dedicata","isi":1,"ec_funded":1,"oa_version":"Published Version","volume":194,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:47:57Z","ddc":["510"],"day":"01","status":"public"},{"quality_controlled":"1","_id":"6941","type":"conference","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"}],"scopus_import":"1","citation":{"mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” <i>22nd International Conference on Financial Cryptography and Data Security</i>, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &#38; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In <i>22nd International Conference on Financial Cryptography and Data Security</i> (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>","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 <i>22nd International Conference on Financial Cryptography and Data Security</i>, 10957:480–99. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>.","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 <i>22nd International Conference on Financial Cryptography and Data Security</i>, 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.","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.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: <i>22nd International Conference on Financial Cryptography and Data Security</i>. Vol 10957. Springer Nature; 2018:480-499. doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>"},"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783662583869","9783662583876"],"issn":["0302-9743"]},"publication_status":"published","project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815"}],"author":[{"first_name":"Sunoo","last_name":"Park","full_name":"Park, Sunoo"},{"first_name":"Albert","last_name":"Kwon","full_name":"Kwon, Albert"},{"full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"full_name":"Alwen, Joel F","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"SpaceMint: A cryptocurrency based on proofs of space","publisher":"Springer Nature","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"article_processing_charge":"No","day":"07","status":"public","date_created":"2019-10-14T06:35:38Z","volume":10957,"isi":1,"oa_version":"Submitted Version","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/528"}],"doi":"10.1007/978-3-662-58387-6_26","publication":"22nd International Conference on Financial Cryptography and Data Security","oa":1,"date_updated":"2023-09-19T15:02:13Z","intvolume":"     10957","month":"12","alternative_title":["LNCS"],"date_published":"2018-12-07T00:00:00Z","year":"2018","conference":{"end_date":"2018-03-02","start_date":"2018-02-26","name":"FC: Financial Cryptography and Data Security","location":"Nieuwpoort, Curacao"},"page":"480-499","external_id":{"isi":["000540656400026"]}},{"date_updated":"2023-10-17T11:50:05Z","oa":1,"issue":"6417","date_published":"2018-11-23T00:00:00Z","month":"11","intvolume":"       362","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.","year":"2018","external_id":{"isi":["000451124500041"]},"page":"941 - 945","date_created":"2018-12-11T11:44:07Z","status":"public","day":"23","volume":362,"related_material":{"record":[{"id":"13055","status":"public","relation":"research_data"}],"link":[{"url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/","description":"News on IST Homepage","relation":"press_release"}]},"oa_version":"Published Version","ec_funded":1,"isi":1,"publication":"Science","main_file_link":[{"open_access":"1","url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf"}],"doi":"10.1126/science.aat4793","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Stroeymeyt, Nathalie","first_name":"Nathalie","last_name":"Stroeymeyt"},{"full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse"},{"last_name":"Crespi","first_name":"Alessandro","full_name":"Crespi, Alessandro"},{"full_name":"Mersch, Danielle","first_name":"Danielle","last_name":"Mersch"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","full_name":"Cremer, Sylvia"},{"first_name":"Laurent","last_name":"Keller","full_name":"Keller, Laurent"}],"title":"Social network plasticity decreases disease transmission in a eusocial insect","publisher":"AAAS","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","publist_id":"8049","department":[{"_id":"SyCr"}],"_id":"7","quality_controlled":"1","citation":{"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.” <i>Science</i>. AAAS, 2018. <a href=\"https://doi.org/10.1126/science.aat4793\">https://doi.org/10.1126/science.aat4793</a>.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. <i>Science</i>. 2018;362(6417):941-945. doi:<a href=\"https://doi.org/10.1126/science.aat4793\">10.1126/science.aat4793</a>","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,” <i>Science</i>, 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.","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.","mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” <i>Science</i>, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:<a href=\"https://doi.org/10.1126/science.aat4793\">10.1126/science.aat4793</a>.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., &#38; Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.aat4793\">https://doi.org/10.1126/science.aat4793</a>"},"publication_identifier":{"issn":["1095-9203"]},"scopus_import":"1","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"}],"type":"journal_article","project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071","call_identifier":"FP7"}],"publication_status":"published"},{"publication":"Latin American Journal of Probability and Mathematical Statistics","doi":"10.30757/ALEA.v15-49","ec_funded":1,"oa_version":"Published Version","isi":1,"volume":15,"date_created":"2018-12-11T11:44:28Z","ddc":["510"],"status":"public","day":"01","page":"1311-1334","external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"year":"2018","date_published":"2018-10-01T00:00:00Z","intvolume":"        15","month":"10","date_updated":"2023-10-10T13:11:29Z","oa":1,"issue":"2","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804"},{"call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","publication_identifier":{"issn":["1980-0436"]},"citation":{"short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” <i>Latin American Journal of Probability and Mathematical Statistics</i>, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","ista":"Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334.","ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. <i>Latin American Journal of Probability and Mathematical Statistics</i>. 2018;15(2):1311-1334. doi:<a href=\"https://doi.org/10.30757/ALEA.v15-49\">10.30757/ALEA.v15-49</a>","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” <i>Latin American Journal of Probability and Mathematical Statistics</i>. Instituto Nacional de Matematica Pura e Aplicada, 2018. <a href=\"https://doi.org/10.30757/ALEA.v15-49\">https://doi.org/10.30757/ALEA.v15-49</a>.","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. <i>Latin American Journal of Probability and Mathematical Statistics</i>. Instituto Nacional de Matematica Pura e Aplicada. <a href=\"https://doi.org/10.30757/ALEA.v15-49\">https://doi.org/10.30757/ALEA.v15-49</a>","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” <i>Latin American Journal of Probability and Mathematical Statistics</i>, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:<a href=\"https://doi.org/10.30757/ALEA.v15-49\">10.30757/ALEA.v15-49</a>."},"abstract":[{"text":"We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes.","lang":"eng"}],"arxiv":1,"scopus_import":"1","type":"journal_article","file_date_updated":"2020-07-14T12:47:46Z","_id":"70","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"Instituto Nacional de Matematica Pura e Aplicada","author":[{"full_name":"Nejjar, Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Nejjar"}],"title":"Transition to shocks in TASEP and decoupling of last passage times","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","file_id":"5981","creator":"kschuh","file_size":394851,"relation":"main_file","checksum":"2ded46aa284a836a8cbb34133a64f1cb","access_level":"open_access","file_name":"2018_ALEA_Nejjar.pdf","date_created":"2019-02-14T09:44:10Z","date_updated":"2020-07-14T12:47:46Z"}]},{"external_id":{"arxiv":["1508.07902"]},"page":"1668-1682","year":"2018","date_published":"2018-07-01T00:00:00Z","month":"07","intvolume":"        40","date_updated":"2021-01-12T08:11:32Z","oa":1,"issue":"7","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"doi":"10.1109/TPAMI.2017.2730884","oa_version":"Preprint","volume":40,"date_created":"2018-12-11T11:48:01Z","status":"public","day":"01","department":[{"_id":"VlKo"}],"publist_id":"6992","language":[{"iso":"eng"}],"publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Shekhovtsov, Alexander","last_name":"Shekhovtsov","first_name":"Alexander"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Swoboda"},{"last_name":"Savchynskyy","first_name":"Bogdan","full_name":"Savchynskyy, Bogdan"}],"title":"Maximum persistency via iterative relaxed inference with graphical models","publication_status":"published","citation":{"ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2018;40(7):1668-1682. doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>.","apa":"Shekhovtsov, A., Swoboda, P., &#38; Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>."},"publication_identifier":{"issn":["01628828"]},"scopus_import":1,"abstract":[{"text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.","lang":"eng"}],"arxiv":1,"type":"journal_article","_id":"703","quality_controlled":"1"},{"volume":55,"date_created":"2018-12-11T11:48:02Z","status":"public","day":"01","doi":"10.1007/s12035-017-0688-y","publication":"Molecular Neurobiology","isi":1,"oa_version":"None","month":"06","intvolume":"        55","date_published":"2018-06-01T00:00:00Z","date_updated":"2023-09-19T09:58:11Z","issue":"6","external_id":{"isi":["000431991500025"]},"page":"4857 – 4869","year":"2018","citation":{"short":"A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G. Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.","ista":"Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G. 2018. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.","ieee":"A. Miklosi <i>et al.</i>, “Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” <i>Molecular Neurobiology</i>, vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.","ama":"Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. <i>Molecular Neurobiology</i>. 2018;55(6):4857 – 4869. doi:<a href=\"https://doi.org/10.1007/s12035-017-0688-y\">10.1007/s12035-017-0688-y</a>","chicago":"Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” <i>Molecular Neurobiology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s12035-017-0688-y\">https://doi.org/10.1007/s12035-017-0688-y</a>.","apa":"Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D., &#38; Lubec, G. (2018). Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. <i>Molecular Neurobiology</i>. Springer. <a href=\"https://doi.org/10.1007/s12035-017-0688-y\">https://doi.org/10.1007/s12035-017-0688-y</a>","mla":"Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” <i>Molecular Neurobiology</i>, vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:<a href=\"https://doi.org/10.1007/s12035-017-0688-y\">10.1007/s12035-017-0688-y</a>."},"type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","text":"Although dopamine receptors D1 and D2 play key roles in hippocampal function, their synaptic localization within the hippocampus has not been fully elucidated. In order to understand precise functions of pre- or postsynaptic dopamine receptors (DRs), the development of protocols to differentiate pre- and postsynaptic DRs is essential. So far, most studies on determination and quantification of DRs did not discriminate between subsynaptic localization. Therefore, the aim of the study was to generate a robust workflow for the localization of DRs. This work provides the basis for future work on hippocampal DRs, in light that DRs may have different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi isolated by a sucrose gradient protocol were prepared for super-resolution direct stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594 enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites. D1R immunoreactivity clusters were observed within the presynaptic active zone as well as at perisynaptic sites at the edge of the presynaptic active zone. The results may be useful for the interpretation of previous studies and the design of future work on DRs in the hippocampus. Moreover, the reduction of the complexity of brain tissue by the use of synaptosomal preparations and dSTORM technology may represent a useful tool for synaptic localization of brain proteins."}],"_id":"705","quality_controlled":"1","publication_status":"published","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes","author":[{"first_name":"Andras","last_name":"Miklosi","full_name":"Miklosi, Andras"},{"full_name":"Del Favero, Giorgia","last_name":"Del Favero","first_name":"Giorgia"},{"last_name":"Bulat","first_name":"Tanja","full_name":"Bulat, Tanja"},{"full_name":"Höger, Harald","first_name":"Harald","last_name":"Höger"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"last_name":"Marko","first_name":"Doris","full_name":"Marko, Doris"},{"first_name":"Gert","last_name":"Lubec","full_name":"Lubec, Gert"}],"article_processing_charge":"No","publist_id":"6991","department":[{"_id":"RySh"}],"language":[{"iso":"eng"}]},{"publication_status":"published","_id":"7058","quality_controlled":"1","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"extern":"1","citation":{"ama":"Modic KA, Ramshaw BJ, Shekhter A, Varma CM. Chiral spin order in some purported Kitaev spin-liquid compounds. <i>Physical Review B</i>. 2018;98(20). doi:<a href=\"https://doi.org/10.1103/physrevb.98.205110\">10.1103/physrevb.98.205110</a>","short":"K.A. Modic, B.J. Ramshaw, A. Shekhter, C.M. Varma, Physical Review B 98 (2018).","ista":"Modic KA, Ramshaw BJ, Shekhter A, Varma CM. 2018. Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. 98(20), 205110.","ieee":"K. A. Modic, B. J. Ramshaw, A. Shekhter, and C. M. Varma, “Chiral spin order in some purported Kitaev spin-liquid compounds,” <i>Physical Review B</i>, vol. 98, no. 20. APS, 2018.","chicago":"Modic, Kimberly A, B. J. Ramshaw, A. Shekhter, and C. M. Varma. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” <i>Physical Review B</i>. APS, 2018. <a href=\"https://doi.org/10.1103/physrevb.98.205110\">https://doi.org/10.1103/physrevb.98.205110</a>.","apa":"Modic, K. A., Ramshaw, B. J., Shekhter, A., &#38; Varma, C. M. (2018). Chiral spin order in some purported Kitaev spin-liquid compounds. <i>Physical Review B</i>. APS. <a href=\"https://doi.org/10.1103/physrevb.98.205110\">https://doi.org/10.1103/physrevb.98.205110</a>","mla":"Modic, Kimberly A., et al. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” <i>Physical Review B</i>, vol. 98, no. 20, 205110, APS, 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.98.205110\">10.1103/physrevb.98.205110</a>."},"arxiv":1,"abstract":[{"text":"We examine recent magnetic torque measurements in two compounds, γ−Li2IrO3 and RuCl3, which have been discussed as possible realizations of the Kitaev model. The analysis of the reported discontinuity in torque, as an external magnetic field is rotated across the c axis in both crystals, suggests that they have a translationally invariant chiral spin order of the form ⟨Si⋅(Sj×Sk)⟩≠0 in the ground state and persisting over a very wide range of magnetic field and temperature. An extraordinary |B|B2 dependence of the torque for small fields, beside the usual B2 part, is predicted by the chiral spin order. Data for small fields are available for γ−Li2IrO3 and are found to be consistent with the prediction upon further analysis. Other experiments such as inelastic scattering and thermal Hall effect and several questions raised by the discovery of chiral spin order, including its topological consequences, are discussed.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","title":"Chiral spin order in some purported Kitaev spin-liquid compounds","author":[{"full_name":"Modic, Kimberly A","last_name":"Modic","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A"},{"last_name":"Ramshaw","first_name":"B. J.","full_name":"Ramshaw, B. J."},{"last_name":"Shekhter","first_name":"A.","full_name":"Shekhter, A."},{"full_name":"Varma, C. M.","first_name":"C. M.","last_name":"Varma"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"APS","oa_version":"Preprint","publication":"Physical Review B","doi":"10.1103/physrevb.98.205110","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.06637"}],"date_created":"2019-11-19T13:01:31Z","day":"05","status":"public","volume":98,"year":"2018","external_id":{"arxiv":["1807.06637"]},"date_updated":"2021-01-12T08:11:36Z","oa":1,"issue":"20","date_published":"2018-11-05T00:00:00Z","intvolume":"        98","month":"11","article_number":"205110 "},{"publication":"Nature Communications","doi":"10.1038/s41467-018-06412-w","oa_version":"Published Version","volume":9,"status":"public","day":"28","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"],"date_created":"2019-11-19T13:02:20Z","page":"3975","year":"2018","date_published":"2018-09-28T00:00:00Z","month":"09","intvolume":"         9","oa":1,"issue":"1","date_updated":"2021-01-12T08:11:37Z","publication_status":"published","abstract":[{"text":"Unusual behavior in quantum materials commonly arises from their effective low-dimensional physics, reflecting the underlying anisotropy in the spin and charge degrees of freedom. Here we introduce the magnetotropic coefficient k = ∂2F/∂θ2, the second derivative of the free energy F with respect to the magnetic field orientation θ in the crystal. We show that the magnetotropic coefficient can be quantitatively determined from a shift in the resonant frequency of a commercially available atomic force microscopy cantilever under magnetic field. This detection method enables part per 100 million sensitivity and the ability to measure magnetic anisotropy in nanogram-scale samples, as demonstrated on the Weyl semimetal NbP. Measurement of the magnetotropic coefficient in the spin-liquid candidate RuCl3 highlights its sensitivity to anisotropic phase transitions and allows a quantitative comparison to other thermodynamic coefficients via the Ehrenfest relations.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:48Z","type":"journal_article","extern":"1","publication_identifier":{"issn":["2041-1723"]},"citation":{"mla":"Modic, Kimberly A., et al. “Resonant Torsion Magnetometry in Anisotropic Quantum Materials.” <i>Nature Communications</i>, vol. 9, no. 1, Springer Nature, 2018, p. 3975, doi:<a href=\"https://doi.org/10.1038/s41467-018-06412-w\">10.1038/s41467-018-06412-w</a>.","apa":"Modic, K. A., Bachmann, M. D., Ramshaw, B. J., Arnold, F., Shirer, K. R., Estry, A., … Moll, P. J. W. (2018). Resonant torsion magnetometry in anisotropic quantum materials. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-018-06412-w\">https://doi.org/10.1038/s41467-018-06412-w</a>","chicago":"Modic, Kimberly A, Maja D. Bachmann, B. J. Ramshaw, F. Arnold, K. R. Shirer, Amelia Estry, J. B. Betts, et al. “Resonant Torsion Magnetometry in Anisotropic Quantum Materials.” <i>Nature Communications</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41467-018-06412-w\">https://doi.org/10.1038/s41467-018-06412-w</a>.","ama":"Modic KA, Bachmann MD, Ramshaw BJ, et al. Resonant torsion magnetometry in anisotropic quantum materials. <i>Nature Communications</i>. 2018;9(1):3975. doi:<a href=\"https://doi.org/10.1038/s41467-018-06412-w\">10.1038/s41467-018-06412-w</a>","ista":"Modic KA, Bachmann MD, Ramshaw BJ, Arnold F, Shirer KR, Estry A, Betts JB, Ghimire NJ, Bauer ED, Schmidt M, Baenitz M, Svanidze E, McDonald RD, Shekhter A, Moll PJW. 2018. Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. 9(1), 3975.","ieee":"K. A. Modic <i>et al.</i>, “Resonant torsion magnetometry in anisotropic quantum materials,” <i>Nature Communications</i>, vol. 9, no. 1. Springer Nature, p. 3975, 2018.","short":"K.A. Modic, M.D. Bachmann, B.J. Ramshaw, F. Arnold, K.R. Shirer, A. Estry, J.B. Betts, N.J. Ghimire, E.D. Bauer, M. Schmidt, M. Baenitz, E. Svanidze, R.D. McDonald, A. Shekhter, P.J.W. Moll, Nature Communications 9 (2018) 3975."},"quality_controlled":"1","_id":"7059","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Springer Nature","has_accepted_license":"1","title":"Resonant torsion magnetometry in anisotropic quantum materials","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Modic","orcid":"0000-0001-9760-3147","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A"},{"full_name":"Bachmann, Maja D.","first_name":"Maja D.","last_name":"Bachmann"},{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"full_name":"Arnold, F.","first_name":"F.","last_name":"Arnold"},{"full_name":"Shirer, K. R.","last_name":"Shirer","first_name":"K. R."},{"last_name":"Estry","first_name":"Amelia","full_name":"Estry, Amelia"},{"last_name":"Betts","first_name":"J. B.","full_name":"Betts, J. B."},{"full_name":"Ghimire, Nirmal J.","last_name":"Ghimire","first_name":"Nirmal J."},{"first_name":"E. D.","last_name":"Bauer","full_name":"Bauer, E. D."},{"last_name":"Schmidt","first_name":"Marcus","full_name":"Schmidt, Marcus"},{"full_name":"Baenitz, Michael","last_name":"Baenitz","first_name":"Michael"},{"full_name":"Svanidze, E.","first_name":"E.","last_name":"Svanidze"},{"first_name":"Ross D.","last_name":"McDonald","full_name":"McDonald, Ross D."},{"full_name":"Shekhter, Arkady","first_name":"Arkady","last_name":"Shekhter"},{"last_name":"Moll","first_name":"Philip J. W.","full_name":"Moll, Philip J. W."}],"file":[{"content_type":"application/pdf","file_id":"7088","file_size":1257681,"creator":"dernst","relation":"main_file","checksum":"46a313c816e66899d4dad2cf3583e5b0","access_level":"open_access","file_name":"2018_NatureComm_Modic.pdf","date_created":"2019-11-20T12:48:58Z","date_updated":"2020-07-14T12:47:48Z"}]},{"oa_version":"None","publication":"Science","doi":"10.1126/science.aan3178","publication_status":"published","date_created":"2019-11-19T13:03:16Z","_id":"7060","quality_controlled":"1","status":"public","day":"03","volume":361,"citation":{"mla":"Giraldo-Gallo, P., et al. “Scale-Invariant Magnetoresistance in a Cuprate Superconductor.” <i>Science</i>, vol. 361, no. 6401, AAAS, 2018, pp. 479–81, doi:<a href=\"https://doi.org/10.1126/science.aan3178\">10.1126/science.aan3178</a>.","apa":"Giraldo-Gallo, P., Galvis, J. A., Stegen, Z., Modic, K. A., Balakirev, F. F., Betts, J. B., … Shekhter, A. (2018). Scale-invariant magnetoresistance in a cuprate superconductor. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.aan3178\">https://doi.org/10.1126/science.aan3178</a>","chicago":"Giraldo-Gallo, P., J. A. Galvis, Z. Stegen, Kimberly A Modic, F. F. Balakirev, J. B. Betts, X. Lian, et al. “Scale-Invariant Magnetoresistance in a Cuprate Superconductor.” <i>Science</i>. AAAS, 2018. <a href=\"https://doi.org/10.1126/science.aan3178\">https://doi.org/10.1126/science.aan3178</a>.","ieee":"P. Giraldo-Gallo <i>et al.</i>, “Scale-invariant magnetoresistance in a cuprate superconductor,” <i>Science</i>, vol. 361, no. 6401. AAAS, pp. 479–481, 2018.","ista":"Giraldo-Gallo P, Galvis JA, Stegen Z, Modic KA, Balakirev FF, Betts JB, Lian X, Moir C, Riggs SC, Wu J, Bollinger AT, He X, Božović I, Ramshaw BJ, McDonald RD, Boebinger GS, Shekhter A. 2018. Scale-invariant magnetoresistance in a cuprate superconductor. Science. 361(6401), 479–481.","short":"P. Giraldo-Gallo, J.A. Galvis, Z. Stegen, K.A. Modic, F.F. Balakirev, J.B. Betts, X. Lian, C. Moir, S.C. Riggs, J. Wu, A.T. Bollinger, X. He, I. Božović, B.J. Ramshaw, R.D. McDonald, G.S. Boebinger, A. Shekhter, Science 361 (2018) 479–481.","ama":"Giraldo-Gallo P, Galvis JA, Stegen Z, et al. Scale-invariant magnetoresistance in a cuprate superconductor. <i>Science</i>. 2018;361(6401):479-481. doi:<a href=\"https://doi.org/10.1126/science.aan3178\">10.1126/science.aan3178</a>"},"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"extern":"1","abstract":[{"lang":"eng","text":"The anomalous metallic state in the high-temperature superconducting cuprates is masked by superconductivity near a quantum critical point. Applying high magnetic fields to suppress superconductivity has enabled detailed studies of the normal state, yet the direct effect of strong magnetic fields on the metallic state is poorly understood. We report the high-field magnetoresistance of thin-film La2–xSrxCuO4 cuprate in the vicinity of the critical doping, 0.161 ≤ p ≤ 0.190. We find that the metallic state exposed by suppressing superconductivity is characterized by magnetoresistance that is linear in magnetic fields up to 80 tesla. The magnitude of the linear-in-field resistivity mirrors the magnitude and doping evolution of the well-known linear-in-temperature resistivity that has been associated with quantum criticality in high-temperature superconductors."}],"type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","year":"2018","page":"479-481","article_processing_charge":"No","date_updated":"2021-01-12T08:11:37Z","title":"Scale-invariant magnetoresistance in a cuprate superconductor","author":[{"first_name":"P.","last_name":"Giraldo-Gallo","full_name":"Giraldo-Gallo, P."},{"full_name":"Galvis, J. A.","last_name":"Galvis","first_name":"J. A."},{"first_name":"Z.","last_name":"Stegen","full_name":"Stegen, Z."},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A","last_name":"Modic","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A"},{"first_name":"F. F.","last_name":"Balakirev","full_name":"Balakirev, F. F."},{"first_name":"J. B.","last_name":"Betts","full_name":"Betts, J. B."},{"last_name":"Lian","first_name":"X.","full_name":"Lian, X."},{"first_name":"C.","last_name":"Moir","full_name":"Moir, C."},{"full_name":"Riggs, S. C.","last_name":"Riggs","first_name":"S. C."},{"full_name":"Wu, J.","first_name":"J.","last_name":"Wu"},{"full_name":"Bollinger, A. T.","last_name":"Bollinger","first_name":"A. T."},{"full_name":"He, X.","first_name":"X.","last_name":"He"},{"last_name":"Božović","first_name":"I.","full_name":"Božović, I."},{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"first_name":"R. D.","last_name":"McDonald","full_name":"McDonald, R. D."},{"full_name":"Boebinger, G. S.","first_name":"G. S.","last_name":"Boebinger"},{"first_name":"A.","last_name":"Shekhter","full_name":"Shekhter, A."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6401","date_published":"2018-08-03T00:00:00Z","intvolume":"       361","month":"08","publisher":"AAAS"},{"oa_version":"Published Version","publication":"Nature Communications","doi":"10.1038/s41467-018-04542-9","date_created":"2019-11-19T13:10:33Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"],"day":"07","status":"public","volume":9,"year":"2018","date_updated":"2021-01-12T08:11:38Z","oa":1,"issue":"1","date_published":"2018-06-07T00:00:00Z","intvolume":"         9","month":"06","article_number":"2217","publication_status":"published","_id":"7062","quality_controlled":"1","publication_identifier":{"issn":["2041-1723"]},"extern":"1","citation":{"chicago":"Ramshaw, B. J., Kimberly A Modic, Arkady Shekhter, Yi Zhang, Eun-Ah Kim, Philip J. W. Moll, Maja D. Bachmann, et al. “Quantum Limit Transport and Destruction of the Weyl Nodes in TaAs.” <i>Nature Communications</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41467-018-04542-9\">https://doi.org/10.1038/s41467-018-04542-9</a>.","ieee":"B. J. Ramshaw <i>et al.</i>, “Quantum limit transport and destruction of the Weyl nodes in TaAs,” <i>Nature Communications</i>, vol. 9, no. 1. Springer Nature, 2018.","ista":"Ramshaw BJ, Modic KA, Shekhter A, Zhang Y, Kim E-A, Moll PJW, Bachmann MD, Chan MK, Betts JB, Balakirev F, Migliori A, Ghimire NJ, Bauer ED, Ronning F, McDonald RD. 2018. Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. 9(1), 2217.","short":"B.J. Ramshaw, K.A. Modic, A. Shekhter, Y. Zhang, E.-A. Kim, P.J.W. Moll, M.D. Bachmann, M.K. Chan, J.B. Betts, F. Balakirev, A. Migliori, N.J. Ghimire, E.D. Bauer, F. Ronning, R.D. McDonald, Nature Communications 9 (2018).","ama":"Ramshaw BJ, Modic KA, Shekhter A, et al. Quantum limit transport and destruction of the Weyl nodes in TaAs. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-04542-9\">10.1038/s41467-018-04542-9</a>","mla":"Ramshaw, B. J., et al. “Quantum Limit Transport and Destruction of the Weyl Nodes in TaAs.” <i>Nature Communications</i>, vol. 9, no. 1, 2217, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-04542-9\">10.1038/s41467-018-04542-9</a>.","apa":"Ramshaw, B. J., Modic, K. A., Shekhter, A., Zhang, Y., Kim, E.-A., Moll, P. J. W., … McDonald, R. D. (2018). Quantum limit transport and destruction of the Weyl nodes in TaAs. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-018-04542-9\">https://doi.org/10.1038/s41467-018-04542-9</a>"},"abstract":[{"text":"Weyl fermions are a recently discovered ingredient for correlated states of electronic matter. A key difficulty has been that real materials also contain non-Weyl quasiparticles, and disentangling the experimental signatures has proven challenging. Here we use magnetic fields up to 95 T to drive the Weyl semimetal TaAs far into its quantum limit, where only the purely chiral 0th Landau levels of the Weyl fermions are occupied. We find the electrical resistivity to be nearly independent of magnetic field up to 50 T: unusual for conventional metals but consistent with the chiral anomaly for Weyl fermions. Above 50 T we observe a two-order-of-magnitude increase in resistivity, indicating that a gap opens in the chiral Landau levels. Above 80 T we observe strong ultrasonic attenuation below 2 K, suggesting a mesoscopically textured state of matter. These results point the way to inducing new correlated states of matter in the quantum limit of Weyl semimetals.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:48Z","type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","title":"Quantum limit transport and destruction of the Weyl nodes in TaAs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"full_name":"Modic, Kimberly A","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","last_name":"Modic"},{"full_name":"Shekhter, Arkady","first_name":"Arkady","last_name":"Shekhter"},{"last_name":"Zhang","first_name":"Yi","full_name":"Zhang, Yi"},{"first_name":"Eun-Ah","last_name":"Kim","full_name":"Kim, Eun-Ah"},{"first_name":"Philip J. W.","last_name":"Moll","full_name":"Moll, Philip J. W."},{"full_name":"Bachmann, Maja D.","last_name":"Bachmann","first_name":"Maja D."},{"full_name":"Chan, M. K.","last_name":"Chan","first_name":"M. K."},{"last_name":"Betts","first_name":"J. B.","full_name":"Betts, J. B."},{"first_name":"F.","last_name":"Balakirev","full_name":"Balakirev, F."},{"first_name":"A.","last_name":"Migliori","full_name":"Migliori, A."},{"full_name":"Ghimire, N. J.","first_name":"N. J.","last_name":"Ghimire"},{"full_name":"Bauer, E. D.","first_name":"E. D.","last_name":"Bauer"},{"full_name":"Ronning, F.","first_name":"F.","last_name":"Ronning"},{"full_name":"McDonald, R. D.","first_name":"R. D.","last_name":"McDonald"}],"file":[{"file_id":"7089","content_type":"application/pdf","file_size":1794797,"creator":"dernst","checksum":"9c53f9a1f06a4d83d5fe879d2478b7d7","relation":"main_file","access_level":"open_access","file_name":"2018_NatureComm_Ramshaw.pdf","date_updated":"2020-07-14T12:47:48Z","date_created":"2019-11-20T13:55:44Z"}],"has_accepted_license":"1","publisher":"Springer Nature"},{"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"International Union of Crystallography (IUCr)","has_accepted_license":"1","author":[{"first_name":"Edoardo","last_name":"Martino","full_name":"Martino, Edoardo"},{"full_name":"Arakcheeva, Alla","first_name":"Alla","last_name":"Arakcheeva"},{"full_name":"Autès, Gabriel","first_name":"Gabriel","last_name":"Autès"},{"first_name":"Andrea","last_name":"Pisoni","full_name":"Pisoni, Andrea"},{"last_name":"Bachmann","first_name":"Maja D.","full_name":"Bachmann, Maja D."},{"full_name":"Modic, Kimberly A","first_name":"Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","last_name":"Modic"},{"last_name":"Helm","first_name":"Toni","full_name":"Helm, Toni"},{"full_name":"Yazyev, Oleg V.","last_name":"Yazyev","first_name":"Oleg V."},{"first_name":"Philip J. W.","last_name":"Moll","full_name":"Moll, Philip J. W."},{"last_name":"Forró","first_name":"László","full_name":"Forró, László"},{"full_name":"Katrych, Sergiy","first_name":"Sergiy","last_name":"Katrych"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity","file":[{"relation":"main_file","checksum":"5c6180c7d19da599dd50a067eb2efd50","access_level":"open_access","content_type":"application/pdf","file_id":"7090","file_size":1563353,"creator":"dernst","date_created":"2019-11-20T14:00:27Z","date_updated":"2020-07-14T12:47:48Z","file_name":"2018_IUCrJ_Martino.pdf"}],"publication_status":"published","abstract":[{"lang":"eng","text":"The high-pressure synthesis and incommensurately modulated structure are reported for the new compound Sr2Pt8−xAs, with x = 0.715 (5). The structure consists of Sr2Pt3As layers alternating with Pt-only corrugated grids. Ab initio calculations predict a metallic character with a dominant role of the Pt d electrons. The electrical resistivity (ρ) and Seebeck coefficient confirm the metallic character, but surprisingly, ρ showed a near-flat temperature dependence. This observation fits the description of the Mooij correlation for electrical resistivity in disordered metals, originally developed for statistically distributed point defects. The discussed material has a long-range crystallographic order, but the high concentration of Pt vacancies, incommensurately ordered, strongly influences the electronic conduction properties. This result extends the range of validity of the Mooij correlation to long-range ordered incommensurately modulated vacancies. Motivated by the layered structure, the resistivity anisotropy was measured in a focused-ion-beam micro-fabricated well oriented single crystal. A low resistivity anisotropy indicates that the layers are electrically coupled and conduction channels along different directions are intermixed."}],"file_date_updated":"2020-07-14T12:47:48Z","type":"journal_article","citation":{"short":"E. Martino, A. Arakcheeva, G. Autès, A. Pisoni, M.D. Bachmann, K.A. Modic, T. Helm, O.V. Yazyev, P.J.W. Moll, L. Forró, S. Katrych, IUCrJ 5 (2018) 470–477.","ieee":"E. Martino <i>et al.</i>, “Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity,” <i>IUCrJ</i>, vol. 5, no. 4. International Union of Crystallography (IUCr), pp. 470–477, 2018.","ista":"Martino E, Arakcheeva A, Autès G, Pisoni A, Bachmann MD, Modic KA, Helm T, Yazyev OV, Moll PJW, Forró L, Katrych S. 2018. Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. 5(4), 470–477.","ama":"Martino E, Arakcheeva A, Autès G, et al. Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. <i>IUCrJ</i>. 2018;5(4):470-477. doi:<a href=\"https://doi.org/10.1107/s2052252518007303\">10.1107/s2052252518007303</a>","chicago":"Martino, Edoardo, Alla Arakcheeva, Gabriel Autès, Andrea Pisoni, Maja D. Bachmann, Kimberly A Modic, Toni Helm, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated Metal with Saturated Resistivity.” <i>IUCrJ</i>. International Union of Crystallography (IUCr), 2018. <a href=\"https://doi.org/10.1107/s2052252518007303\">https://doi.org/10.1107/s2052252518007303</a>.","apa":"Martino, E., Arakcheeva, A., Autès, G., Pisoni, A., Bachmann, M. D., Modic, K. A., … Katrych, S. (2018). Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. <i>IUCrJ</i>. International Union of Crystallography (IUCr). <a href=\"https://doi.org/10.1107/s2052252518007303\">https://doi.org/10.1107/s2052252518007303</a>","mla":"Martino, Edoardo, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated Metal with Saturated Resistivity.” <i>IUCrJ</i>, vol. 5, no. 4, International Union of Crystallography (IUCr), 2018, pp. 470–77, doi:<a href=\"https://doi.org/10.1107/s2052252518007303\">10.1107/s2052252518007303</a>."},"extern":"1","publication_identifier":{"eissn":["2052-2525"]},"quality_controlled":"1","_id":"7063","page":"470-477","year":"2018","date_published":"2018-07-01T00:00:00Z","intvolume":"         5","month":"07","oa":1,"issue":"4","date_updated":"2021-01-12T08:11:38Z","publication":"IUCrJ","doi":"10.1107/s2052252518007303","oa_version":"Published Version","volume":5,"day":"01","status":"public","date_created":"2019-11-19T13:11:15Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"]},{"has_accepted_license":"1","publisher":"OpenProceedings","title":"Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Grubic","first_name":"Demjan","full_name":"Grubic, Demjan"},{"full_name":"Tam, Leo","first_name":"Leo","last_name":"Tam"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"first_name":"Ce","last_name":"Zhang","full_name":"Zhang, Ce"}],"file":[{"date_created":"2019-11-26T14:23:04Z","date_updated":"2020-07-14T12:47:49Z","file_name":"2018_OpenProceedings_Grubic.pdf","access_level":"open_access","checksum":"ec979b56abc71016d6e6adfdadbb4afe","relation":"main_file","file_id":"7118","content_type":"application/pdf","file_size":1603204,"creator":"dernst"}],"article_processing_charge":"No","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783893180783"],"issn":["2367-2005"]},"citation":{"apa":"Grubic, D., Tam, L., Alistarh, D.-A., &#38; Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In <i>Proceedings of the 21st International Conference on Extending Database Technology</i> (pp. 145–156). Vienna, Austria: OpenProceedings. <a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">https://doi.org/10.5441/002/EDBT.2018.14</a>","mla":"Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” <i>Proceedings of the 21st International Conference on Extending Database Technology</i>, OpenProceedings, 2018, pp. 145–56, doi:<a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">10.5441/002/EDBT.2018.14</a>.","ama":"Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: <i>Proceedings of the 21st International Conference on Extending Database Technology</i>. OpenProceedings; 2018:145-156. doi:<a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">10.5441/002/EDBT.2018.14</a>","short":"D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.","ieee":"D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in <i>Proceedings of the 21st International Conference on Extending Database Technology</i>, Vienna, Austria, 2018, pp. 145–156.","ista":"Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156.","chicago":"Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In <i>Proceedings of the 21st International Conference on Extending Database Technology</i>, 145–56. OpenProceedings, 2018. <a href=\"https://doi.org/10.5441/002/EDBT.2018.14\">https://doi.org/10.5441/002/EDBT.2018.14</a>."},"scopus_import":1,"abstract":[{"text":"Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.","lang":"eng"}],"type":"conference","file_date_updated":"2020-07-14T12:47:49Z","_id":"7116","quality_controlled":"1","publication_status":"published","date_published":"2018-03-26T00:00:00Z","month":"03","date_updated":"2023-02-23T12:59:17Z","oa":1,"page":"145-156","conference":{"start_date":"2018-03-26","end_date":"2018-03-29","name":"EDBT: Conference on Extending Database Technology","location":"Vienna, Austria"},"year":"2018","ddc":["000"],"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_created":"2019-11-26T14:19:11Z","status":"public","day":"26","publication":"Proceedings of the 21st International Conference on Extending Database Technology","doi":"10.5441/002/EDBT.2018.14","oa_version":"Published Version"},{"department":[{"_id":"DaAl"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"ACM","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"}],"title":"Space-optimal majority in population protocols","publication_status":"published","abstract":[{"lang":"eng","text":"Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.\r\n\r\nOn the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time."}],"arxiv":1,"type":"conference","publication_identifier":{"isbn":["9781611975031"]},"citation":{"chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2221–39. ACM, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.144\">https://doi.org/10.1137/1.9781611975031.144</a>.","ista":"Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239.","short":"D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.","ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2018, pp. 2221–2239.","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ACM; 2018:2221-2239. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.144\">10.1137/1.9781611975031.144</a>","mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, ACM, 2018, pp. 2221–39, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.144\">10.1137/1.9781611975031.144</a>.","apa":"Alistarh, D.-A., Aspnes, J., &#38; Gelashvili, R. (2018). Space-optimal majority in population protocols. In <i>Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 2221–2239). New Orleans, LA, United States: ACM. <a href=\"https://doi.org/10.1137/1.9781611975031.144\">https://doi.org/10.1137/1.9781611975031.144</a>"},"quality_controlled":"1","_id":"7123","conference":{"start_date":"2018-01-07","end_date":"2018-01-10","name":"SODA: Symposium on Discrete Algorithms","location":"New Orleans, LA, United States"},"external_id":{"arxiv":["1704.04947"],"isi":["000483921200145"]},"page":"2221-2239","year":"2018","date_published":"2018-01-30T00:00:00Z","month":"01","oa":1,"date_updated":"2023-09-19T15:03:16Z","publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms","main_file_link":[{"url":"https://arxiv.org/abs/1704.04947","open_access":"1"}],"doi":"10.1137/1.9781611975031.144","oa_version":"Preprint","isi":1,"day":"30","status":"public","date_created":"2019-11-26T15:10:55Z"}]