[{"title":"Capturing turbulent dynamics and statistics in experiments with unstable periodic orbits","article_number":"064501","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.02367"}],"oa":1,"publication_status":"published","article_type":"original","ec_funded":1,"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"abstract":[{"lang":"eng","text":"In laboratory studies and numerical simulations, we observe clear signatures of unstable time-periodic solutions in a moderately turbulent quasi-two-dimensional flow. We validate the dynamical relevance of such solutions by demonstrating that turbulent flows in both experiment and numerics transiently display time-periodic dynamics when they shadow unstable periodic orbits (UPOs). We show that UPOs we computed are also statistically significant, with turbulent flows spending a sizable fraction of the total time near these solutions. As a result, the average rates of energy input and dissipation for the turbulent flow and frequently visited UPOs differ only by a few percent."}],"type":"journal_article","acknowledgement":"M. F. S. and R. O. G. acknowledge funding from the National Science Foundation (CMMI-1234436, DMS1125302, CMMI-1725587) and Defense Advanced Research Projects Agency (HR0011-16-2-0033). B. S.has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme FP7/2007–2013/ under REA Grant Agreement No. 291734.","publication":"Physical Review Letters","year":"2020","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2020-10-08T17:27:32Z","language":[{"iso":"eng"}],"intvolume":"       125","doi":"10.1103/physrevlett.125.064501","_id":"8634","month":"08","keyword":["General Physics and Astronomy"],"day":"05","issue":"6","quality_controlled":"1","arxiv":1,"oa_version":"Preprint","scopus_import":"1","isi":1,"publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"status":"public","citation":{"apa":"Suri, B., Kageorge, L., Grigoriev, R. O., &#38; Schatz, M. F. (2020). Capturing turbulent dynamics and statistics in experiments with unstable periodic orbits. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.125.064501\">https://doi.org/10.1103/physrevlett.125.064501</a>","ista":"Suri B, Kageorge L, Grigoriev RO, Schatz MF. 2020. Capturing turbulent dynamics and statistics in experiments with unstable periodic orbits. Physical Review Letters. 125(6), 064501.","short":"B. Suri, L. Kageorge, R.O. Grigoriev, M.F. Schatz, Physical Review Letters 125 (2020).","ama":"Suri B, Kageorge L, Grigoriev RO, Schatz MF. Capturing turbulent dynamics and statistics in experiments with unstable periodic orbits. <i>Physical Review Letters</i>. 2020;125(6). doi:<a href=\"https://doi.org/10.1103/physrevlett.125.064501\">10.1103/physrevlett.125.064501</a>","ieee":"B. Suri, L. Kageorge, R. O. Grigoriev, and M. F. Schatz, “Capturing turbulent dynamics and statistics in experiments with unstable periodic orbits,” <i>Physical Review Letters</i>, vol. 125, no. 6. American Physical Society, 2020.","chicago":"Suri, Balachandra, Logan Kageorge, Roman O. Grigoriev, and Michael F. Schatz. “Capturing Turbulent Dynamics and Statistics in Experiments with Unstable Periodic Orbits.” <i>Physical Review Letters</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/physrevlett.125.064501\">https://doi.org/10.1103/physrevlett.125.064501</a>.","mla":"Suri, Balachandra, et al. “Capturing Turbulent Dynamics and Statistics in Experiments with Unstable Periodic Orbits.” <i>Physical Review Letters</i>, vol. 125, no. 6, 064501, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/physrevlett.125.064501\">10.1103/physrevlett.125.064501</a>."},"publisher":"American Physical Society","date_updated":"2025-04-15T06:50:02Z","department":[{"_id":"BjHo"}],"volume":125,"date_published":"2020-08-05T00:00:00Z","author":[{"first_name":"Balachandra","last_name":"Suri","id":"47A5E706-F248-11E8-B48F-1D18A9856A87","full_name":"Suri, Balachandra"},{"last_name":"Kageorge","full_name":"Kageorge, Logan","first_name":"Logan"},{"full_name":"Grigoriev, Roman O.","last_name":"Grigoriev","first_name":"Roman O."},{"first_name":"Michael F.","last_name":"Schatz","full_name":"Schatz, Michael F."}],"article_processing_charge":"No","external_id":{"isi":["000555785600005"],"arxiv":["2008.02367"]}},{"file_date_updated":"2020-10-12T12:02:09Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","type":"journal_article","acknowledgement":"This work was supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013, ERC grant agreement 335980_EinME) and Startup package to the Ivankov laboratory at Skolkovo Institute of Science and Technology. The work was started at the School of Molecular and Theoretical Biology 2017 supported by the Zimin Foundation. N.S.B. was supported by the Woman Scientists Support Grant in Centre for Genomic Regulation (CRG). ","publication":"Bioinformatics","ddc":["000","570"],"doi":"10.1093/bioinformatics/btz841","intvolume":"        36","_id":"8645","language":[{"iso":"eng"}],"date_created":"2020-10-11T22:01:14Z","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publication_status":"published","oa":1,"title":"HypercubeME: Two hundred million combinatorially complete datasets from a single experiment","file":[{"file_id":"8649","date_updated":"2020-10-12T12:02:09Z","creator":"dernst","file_size":308341,"access_level":"open_access","success":1,"relation":"main_file","checksum":"21d6f71839deb3b83e4a356193f72767","content_type":"application/pdf","file_name":"2020_Bioinformatics_Esteban.pdf","date_created":"2020-10-12T12:02:09Z"}],"page":"1960-1962","abstract":[{"lang":"eng","text":"Epistasis, the context-dependence of the contribution of an amino acid substitution to fitness, is common in evolution. To detect epistasis, fitness must be measured for at least four genotypes: the reference genotype, two different single mutants and a double mutant with both of the single mutations. For higher-order epistasis of the order n, fitness has to be measured for all 2n genotypes of an n-dimensional hypercube in genotype space forming a ‘combinatorially complete dataset’. So far, only a handful of such datasets have been produced by manual curation. Concurrently, random mutagenesis experiments have produced measurements of fitness and other phenotypes in a high-throughput manner, potentially containing a number of combinatorially complete datasets. We present an effective recursive algorithm for finding all hypercube structures in random mutagenesis experimental data. To test the algorithm, we applied it to the data from a recent HIS3 protein dataset and found all 199 847 053 unique combinatorially complete genotype combinations of dimensionality ranging from 2 to 12. The algorithm may be useful for researchers looking for higher-order epistasis in their high-throughput experimental data."}],"ec_funded":1,"project":[{"name":"Systematic investigation of epistasis in molecular evolution","call_identifier":"FP7","_id":"26120F5C-B435-11E9-9278-68D0E5697425","grant_number":"335980"}],"date_updated":"2025-05-14T11:04:01Z","publisher":"Oxford University Press","citation":{"short":"L.A. Esteban, L.R. Lonishin, D.M. Bobrovskiy, G. Leleytner, N.S. Bogatyreva, F. Kondrashov, D.N. Ivankov, Bioinformatics 36 (2020) 1960–1962.","apa":"Esteban, L. A., Lonishin, L. R., Bobrovskiy, D. M., Leleytner, G., Bogatyreva, N. S., Kondrashov, F., &#38; Ivankov, D. N. (2020). HypercubeME: Two hundred million combinatorially complete datasets from a single experiment. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btz841\">https://doi.org/10.1093/bioinformatics/btz841</a>","ista":"Esteban LA, Lonishin LR, Bobrovskiy DM, Leleytner G, Bogatyreva NS, Kondrashov F, Ivankov DN. 2020. HypercubeME: Two hundred million combinatorially complete datasets from a single experiment. Bioinformatics. 36(6), 1960–1962.","ieee":"L. A. Esteban <i>et al.</i>, “HypercubeME: Two hundred million combinatorially complete datasets from a single experiment,” <i>Bioinformatics</i>, vol. 36, no. 6. Oxford University Press, pp. 1960–1962, 2020.","chicago":"Esteban, Laura A, Lyubov R Lonishin, Daniil M Bobrovskiy, Gregory Leleytner, Natalya S Bogatyreva, Fyodor Kondrashov, and Dmitry N  Ivankov. “HypercubeME: Two Hundred Million Combinatorially Complete Datasets from a Single Experiment.” <i>Bioinformatics</i>. Oxford University Press, 2020. <a href=\"https://doi.org/10.1093/bioinformatics/btz841\">https://doi.org/10.1093/bioinformatics/btz841</a>.","mla":"Esteban, Laura A., et al. “HypercubeME: Two Hundred Million Combinatorially Complete Datasets from a Single Experiment.” <i>Bioinformatics</i>, vol. 36, no. 6, Oxford University Press, 2020, pp. 1960–62, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btz841\">10.1093/bioinformatics/btz841</a>.","ama":"Esteban LA, Lonishin LR, Bobrovskiy DM, et al. HypercubeME: Two hundred million combinatorially complete datasets from a single experiment. <i>Bioinformatics</i>. 2020;36(6):1960-1962. doi:<a href=\"https://doi.org/10.1093/bioinformatics/btz841\">10.1093/bioinformatics/btz841</a>"},"department":[{"_id":"FyKo"}],"publication_identifier":{"issn":["1367-4803"],"eissn":["1460-2059"]},"isi":1,"status":"public","pmid":1,"author":[{"first_name":"Laura A","last_name":"Esteban","full_name":"Esteban, Laura A"},{"first_name":"Lyubov R","last_name":"Lonishin","full_name":"Lonishin, Lyubov R"},{"first_name":"Daniil M","full_name":"Bobrovskiy, Daniil M","last_name":"Bobrovskiy"},{"first_name":"Gregory","full_name":"Leleytner, Gregory","last_name":"Leleytner"},{"last_name":"Bogatyreva","full_name":"Bogatyreva, Natalya S","first_name":"Natalya S"},{"first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor","last_name":"Kondrashov","orcid":"0000-0001-8243-4694"},{"last_name":"Ivankov","full_name":"Ivankov, Dmitry N ","first_name":"Dmitry N "}],"has_accepted_license":"1","external_id":{"isi":["000538696800054"],"pmid":["31742320"]},"article_processing_charge":"No","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"volume":36,"date_published":"2020-03-15T00:00:00Z","day":"15","month":"03","quality_controlled":"1","oa_version":"Published Version","scopus_import":"1","issue":"6"},{"scopus_import":"1","oa_version":"Published Version","quality_controlled":"1","day":"09","month":"10","has_accepted_license":"1","external_id":{"isi":["000581681000001"]},"article_processing_charge":"Yes","author":[{"full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","first_name":"Areg"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","first_name":"Mikhail"},{"first_name":"Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","full_name":"Volosniev, Artem"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":3,"date_published":"2020-10-09T00:00:00Z","department":[{"_id":"MiLe"}],"corr_author":"1","date_updated":"2025-04-14T07:43:50Z","publisher":"Springer Nature","citation":{"mla":"Ghazaryan, Areg, et al. “Filtering Spins by Scattering from a Lattice of Point Magnets.” <i>Communications Physics</i>, vol. 3, 178, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s42005-020-00445-8\">10.1038/s42005-020-00445-8</a>.","chicago":"Ghazaryan, Areg, Mikhail Lemeshko, and Artem Volosniev. “Filtering Spins by Scattering from a Lattice of Point Magnets.” <i>Communications Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s42005-020-00445-8\">https://doi.org/10.1038/s42005-020-00445-8</a>.","ieee":"A. Ghazaryan, M. Lemeshko, and A. Volosniev, “Filtering spins by scattering from a lattice of point magnets,” <i>Communications Physics</i>, vol. 3. Springer Nature, 2020.","ama":"Ghazaryan A, Lemeshko M, Volosniev A. Filtering spins by scattering from a lattice of point magnets. <i>Communications Physics</i>. 2020;3. doi:<a href=\"https://doi.org/10.1038/s42005-020-00445-8\">10.1038/s42005-020-00445-8</a>","short":"A. Ghazaryan, M. Lemeshko, A. Volosniev, Communications Physics 3 (2020).","ista":"Ghazaryan A, Lemeshko M, Volosniev A. 2020. Filtering spins by scattering from a lattice of point magnets. Communications Physics. 3, 178.","apa":"Ghazaryan, A., Lemeshko, M., &#38; Volosniev, A. (2020). Filtering spins by scattering from a lattice of point magnets. <i>Communications Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42005-020-00445-8\">https://doi.org/10.1038/s42005-020-00445-8</a>"},"status":"public","isi":1,"publication_identifier":{"issn":["2399-3650"]},"abstract":[{"text":"Nature creates electrons with two values of the spin projection quantum number. In certain applications, it is important to filter electrons with one spin projection from the rest. Such filtering is not trivial, since spin-dependent interactions are often weak, and cannot lead to any substantial effect. Here we propose an efficient spin filter based upon scattering from a two-dimensional crystal, which is made of aligned point magnets. The polarization of the outgoing electron flux is controlled by the crystal, and reaches maximum at specific values of the parameters. In our scheme, polarization increase is accompanied by higher reflectivity of the crystal. High transmission is feasible in scattering from a quantum cavity made of two crystals. Our findings can be used for studies of low-energy spin-dependent scattering from two-dimensional ordered structures made of magnetic atoms or aligned chiral molecules.","lang":"eng"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","call_identifier":"FWF"},{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"article_type":"original","publication_status":"published","oa":1,"article_number":"178","file":[{"success":1,"relation":"main_file","access_level":"open_access","file_size":1462934,"creator":"dernst","date_updated":"2020-10-14T15:16:28Z","file_id":"8662","date_created":"2020-10-14T15:16:28Z","file_name":"2020_CommPhysics_Ghazaryan.pdf","checksum":"60cd35b99f0780acffc7b6060e49ec8b","content_type":"application/pdf"}],"title":"Filtering spins by scattering from a lattice of point magnets","_id":"8652","ddc":["530"],"doi":"10.1038/s42005-020-00445-8","intvolume":"         3","language":[{"iso":"eng"}],"date_created":"2020-10-13T09:48:59Z","year":"2020","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file_date_updated":"2020-10-14T15:16:28Z","license":"https://creativecommons.org/licenses/by/4.0/","publication":"Communications Physics","acknowledgement":"This work has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411 (A.G.V. and A.G.). M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting\r\nGrant No. 801770 (ANGULON).","type":"journal_article"},{"issue":"10","quality_controlled":"1","arxiv":1,"oa_version":"Preprint","scopus_import":"1","month":"10","day":"01","date_published":"2020-10-01T00:00:00Z","volume":61,"author":[{"first_name":"Haonan","last_name":"Zhang","id":"D8F41E38-9E66-11E9-A9E2-65C2E5697425","full_name":"Zhang, Haonan"}],"external_id":{"isi":["000578529200001"],"arxiv":["2007.06644"]},"article_processing_charge":"No","isi":1,"publication_identifier":{"issn":["0022-2488"]},"status":"public","citation":{"short":"H. Zhang, Journal of Mathematical Physics 61 (2020).","apa":"Zhang, H. (2020). Equality conditions of data processing inequality for α-z Rényi relative entropies. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0022787\">https://doi.org/10.1063/5.0022787</a>","ista":"Zhang H. 2020. Equality conditions of data processing inequality for α-z Rényi relative entropies. Journal of Mathematical Physics. 61(10), 102201.","ieee":"H. Zhang, “Equality conditions of data processing inequality for α-z Rényi relative entropies,” <i>Journal of Mathematical Physics</i>, vol. 61, no. 10. AIP Publishing, 2020.","chicago":"Zhang, Haonan. “Equality Conditions of Data Processing Inequality for α-z Rényi Relative Entropies.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2020. <a href=\"https://doi.org/10.1063/5.0022787\">https://doi.org/10.1063/5.0022787</a>.","mla":"Zhang, Haonan. “Equality Conditions of Data Processing Inequality for α-z Rényi Relative Entropies.” <i>Journal of Mathematical Physics</i>, vol. 61, no. 10, 102201, AIP Publishing, 2020, doi:<a href=\"https://doi.org/10.1063/5.0022787\">10.1063/5.0022787</a>.","ama":"Zhang H. Equality conditions of data processing inequality for α-z Rényi relative entropies. <i>Journal of Mathematical Physics</i>. 2020;61(10). doi:<a href=\"https://doi.org/10.1063/5.0022787\">10.1063/5.0022787</a>"},"publisher":"AIP Publishing","date_updated":"2025-07-10T11:57:14Z","corr_author":"1","department":[{"_id":"JaMa"}],"ec_funded":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"abstract":[{"lang":"eng","text":"The α–z Rényi relative entropies are a two-parameter family of Rényi relative entropies that are quantum generalizations of the classical α-Rényi relative entropies. In the work [Adv. Math. 365, 107053 (2020)], we decided the full range of (α, z) for which the data processing inequality (DPI) is valid. In this paper, we give algebraic conditions for the equality in DPI. For the full range of parameters (α, z), we give necessary conditions and sufficient conditions. For most parameters, we give equivalent conditions. This generalizes and strengthens the results of Leditzky et al. [Lett. Math. Phys. 107, 61–80 (2017)]."}],"title":"Equality conditions of data processing inequality for α-z Rényi relative entropies","article_number":"102201","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.06644"}],"oa":1,"article_type":"original","publication_status":"published","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-10-18T22:01:36Z","language":[{"iso":"eng"}],"intvolume":"        61","doi":"10.1063/5.0022787","_id":"8670","acknowledgement":"This research was supported by the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. The author would like to thank Anna Vershynina and Sarah Chehade for their helpful comments.","type":"journal_article","publication":"Journal of Mathematical Physics"},{"arxiv":1,"scopus_import":"1","oa_version":"Submitted Version","quality_controlled":"1","issue":"2","day":"01","month":"10","has_accepted_license":"1","article_processing_charge":"No","external_id":{"arxiv":["1805.10672"]},"author":[{"last_name":"Shakiba","full_name":"Shakiba, A.","first_name":"A."},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar"},{"first_name":"M.R.","last_name":"Hooshmandasl","full_name":"Hooshmandasl, M.R."},{"full_name":"Alambardar Meybodi, M.","last_name":"Alambardar Meybodi","first_name":"M."}],"date_published":"2020-10-01T00:00:00Z","volume":15,"department":[{"_id":"KrCh"}],"citation":{"ista":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 15(2), 117–128.","apa":"Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., &#38; Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. <i>Iranian Journal of Mathematical Sciences and Informatics</i>. Iranian Academic Center for Education, Culture and Research. <a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">https://doi.org/10.29252/ijmsi.15.2.117</a>","short":"A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian Journal of Mathematical Sciences and Informatics 15 (2020) 117–128.","ama":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. A note on belief structures and s-approximation spaces. <i>Iranian Journal of Mathematical Sciences and Informatics</i>. 2020;15(2):117-128. doi:<a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">10.29252/ijmsi.15.2.117</a>","mla":"Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.” <i>Iranian Journal of Mathematical Sciences and Informatics</i>, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:<a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">10.29252/ijmsi.15.2.117</a>.","chicago":"Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar Meybodi. “A Note on Belief Structures and S-Approximation Spaces.” <i>Iranian Journal of Mathematical Sciences and Informatics</i>. Iranian Academic Center for Education, Culture and Research, 2020. <a href=\"https://doi.org/10.29252/ijmsi.15.2.117\">https://doi.org/10.29252/ijmsi.15.2.117</a>.","ieee":"A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” <i>Iranian Journal of Mathematical Sciences and Informatics</i>, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020."},"publisher":"Iranian Academic Center for Education, Culture and Research","date_updated":"2025-04-15T07:55:04Z","status":"public","publication_identifier":{"eissn":["2008-9473"],"issn":["1735-4463"]},"abstract":[{"lang":"eng","text":"We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory. We also demonstrate that one can induce a natural belief structure on one set, given a belief structure on another set, if the two sets are related by a partial monotone S-approximation space. "}],"project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies"}],"oa":1,"publication_status":"published","article_type":"original","page":"117-128","title":"A note on belief structures and s-approximation spaces","file":[{"file_size":261688,"access_level":"open_access","relation":"main_file","success":1,"file_id":"8676","date_updated":"2020-10-19T11:14:20Z","creator":"dernst","date_created":"2020-10-19T11:14:20Z","content_type":"application/pdf","checksum":"f299661a6d51cda6d255a76be696f48d","file_name":"2020_ijmsi_Shakiba_accepted.pdf"}],"_id":"8671","ddc":["000"],"doi":"10.29252/ijmsi.15.2.117","intvolume":"        15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","date_created":"2020-10-18T22:01:36Z","language":[{"iso":"eng"}],"file_date_updated":"2020-10-19T11:14:20Z","publication":"Iranian Journal of Mathematical Sciences and Informatics","acknowledgement":"We are very grateful to the anonymous reviewer for detailed comments and suggestions that significantly improved the presentation of this paper. The research was partially supported by a DOC fellowship of the Austrian Academy of Sciences.","type":"journal_article"},{"oa":1,"article_type":"original","publication_status":"published","page":"195-208","file":[{"file_name":"2020_DevelopmCell_Chaigne.pdf","checksum":"88e1a031a61689165d19a19c2f16d795","content_type":"application/pdf","date_created":"2021-02-04T10:20:02Z","date_updated":"2021-02-04T10:20:02Z","creator":"dernst","file_id":"9086","success":1,"relation":"main_file","file_size":6929686,"access_level":"open_access"}],"title":"Abscission couples cell division to embryonic stem cell fate","abstract":[{"text":"Cell fate transitions are key to development and homeostasis. It is thus essential to understand the cellular mechanisms controlling fate transitions. Cell division has been implicated in fate decisions in many stem cell types, including neuronal and epithelial progenitors. In other stem cells, such as embryonic stem (ES) cells, the role of division remains unclear. Here, we show that exit from naive pluripotency in mouse ES cells generally occurs after a division. We further show that exit timing is strongly correlated between sister cells, which remain connected by cytoplasmic bridges long after division, and that bridge abscission progressively accelerates as cells exit naive pluripotency. Finally, interfering with abscission impairs naive pluripotency exit, and artificially inducing abscission accelerates it. Altogether, our data indicate that a switch in the division machinery leading to faster abscission regulates pluripotency exit. Our study identifies abscission as a key cellular process coupling cell division to fate transitions.","lang":"eng"}],"file_date_updated":"2021-02-04T10:20:02Z","publication":"Developmental Cell","type":"journal_article","acknowledgement":"This work was supported by the Medical Research Council UK (MRC Program award MC_UU_12018/5 ), the European Research Council (starting grant 311637 -MorphoCorDiv and consolidator grant 820188 -NanoMechShape to E.K.P.), and the Leverhulme Trust (Leverhulme Prize in Biological Sciences to E.K.P.). K.J.C. acknowledges support from the Royal Society (Royal Society Research Fellowship). A.C. acknowledges support from EMBO ( ALTF 2015-563 ), the Wellcome Trust ( 201334/Z/16/Z ), and the Fondation Bettencourt-Schueller (Prix Jeune Chercheur, 2015).","_id":"8672","intvolume":"        55","ddc":["570"],"doi":"10.1016/j.devcel.2020.09.001","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","date_created":"2020-10-18T22:01:37Z","language":[{"iso":"eng"}],"day":"26","month":"10","scopus_import":"1","oa_version":"Published Version","quality_controlled":"1","issue":"2","department":[{"_id":"EdHa"}],"publisher":"Elsevier","citation":{"ieee":"A. Chaigne <i>et al.</i>, “Abscission couples cell division to embryonic stem cell fate,” <i>Developmental Cell</i>, vol. 55, no. 2. Elsevier, pp. 195–208, 2020.","mla":"Chaigne, Agathe, et al. “Abscission Couples Cell Division to Embryonic Stem Cell Fate.” <i>Developmental Cell</i>, vol. 55, no. 2, Elsevier, 2020, pp. 195–208, doi:<a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">10.1016/j.devcel.2020.09.001</a>.","chicago":"Chaigne, Agathe, Céline Labouesse, Ian J. White, Meghan Agnew, Edouard B Hannezo, Kevin J. Chalut, and Ewa K. Paluch. “Abscission Couples Cell Division to Embryonic Stem Cell Fate.” <i>Developmental Cell</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">https://doi.org/10.1016/j.devcel.2020.09.001</a>.","ama":"Chaigne A, Labouesse C, White IJ, et al. Abscission couples cell division to embryonic stem cell fate. <i>Developmental Cell</i>. 2020;55(2):195-208. doi:<a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">10.1016/j.devcel.2020.09.001</a>","short":"A. Chaigne, C. Labouesse, I.J. White, M. Agnew, E.B. Hannezo, K.J. Chalut, E.K. Paluch, Developmental Cell 55 (2020) 195–208.","apa":"Chaigne, A., Labouesse, C., White, I. J., Agnew, M., Hannezo, E. B., Chalut, K. J., &#38; Paluch, E. K. (2020). Abscission couples cell division to embryonic stem cell fate. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2020.09.001\">https://doi.org/10.1016/j.devcel.2020.09.001</a>","ista":"Chaigne A, Labouesse C, White IJ, Agnew M, Hannezo EB, Chalut KJ, Paluch EK. 2020. Abscission couples cell division to embryonic stem cell fate. Developmental Cell. 55(2), 195–208."},"date_updated":"2025-07-10T11:57:15Z","status":"public","isi":1,"publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"article_processing_charge":"No","has_accepted_license":"1","external_id":{"isi":["000582501100012"],"pmid":["32979313"]},"author":[{"first_name":"Agathe","full_name":"Chaigne, Agathe","last_name":"Chaigne"},{"first_name":"Céline","full_name":"Labouesse, Céline","last_name":"Labouesse"},{"full_name":"White, Ian J.","last_name":"White","first_name":"Ian J."},{"first_name":"Meghan","last_name":"Agnew","full_name":"Agnew, Meghan"},{"id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B","last_name":"Hannezo","orcid":"0000-0001-6005-1561","first_name":"Edouard B"},{"last_name":"Chalut","full_name":"Chalut, Kevin J.","first_name":"Kevin J."},{"first_name":"Ewa K.","last_name":"Paluch","full_name":"Paluch, Ewa K."}],"pmid":1,"volume":55,"date_published":"2020-10-26T00:00:00Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"quality_controlled":"1","scopus_import":"1","oa_version":"None","day":"01","month":"10","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"external_id":{"isi":["000583337200011"]},"article_processing_charge":"No","date_published":"2020-10-01T00:00:00Z","volume":2,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/new-deep-learning-models/","relation":"press_release","description":"News on IST Homepage"}]},"date_updated":"2025-04-15T06:25:57Z","citation":{"ama":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. Neural circuit policies enabling auditable autonomy. <i>Nature Machine Intelligence</i>. 2020;2:642-652. doi:<a href=\"https://doi.org/10.1038/s42256-020-00237-3\">10.1038/s42256-020-00237-3</a>","ieee":"M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural circuit policies enabling auditable autonomy,” <i>Nature Machine Intelligence</i>, vol. 2. Springer Nature, pp. 642–652, 2020.","mla":"Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.” <i>Nature Machine Intelligence</i>, vol. 2, Springer Nature, 2020, pp. 642–52, doi:<a href=\"https://doi.org/10.1038/s42256-020-00237-3\">10.1038/s42256-020-00237-3</a>.","chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Thomas A Henzinger, Daniela Rus, and Radu Grosu. “Neural Circuit Policies Enabling Auditable Autonomy.” <i>Nature Machine Intelligence</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s42256-020-00237-3\">https://doi.org/10.1038/s42256-020-00237-3</a>.","apa":"Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., &#38; Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. <i>Nature Machine Intelligence</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42256-020-00237-3\">https://doi.org/10.1038/s42256-020-00237-3</a>","ista":"Lechner M, Hasani R, Amini A, Henzinger TA, Rus D, Grosu R. 2020. Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. 2, 642–652.","short":"M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature Machine Intelligence 2 (2020) 642–652."},"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"publication_identifier":{"eissn":["2522-5839"]},"isi":1,"status":"public","abstract":[{"lang":"eng","text":"A central goal of artificial intelligence in high-stakes decision-making applications is to design a single algorithm that simultaneously expresses generalizability by learning coherent representations of their world and interpretable explanations of its dynamics. Here, we combine brain-inspired neural computation principles and scalable deep learning architectures to design compact neural controllers for task-specific compartments of a full-stack autonomous vehicle control system. We discover that a single algorithm with 19 control neurons, connecting 32 encapsulated input features to outputs by 253 synapses, learns to map high-dimensional inputs into steering commands. This system shows superior generalizability, interpretability and robustness compared with orders-of-magnitude larger black-box learning systems. The obtained neural agents enable high-fidelity autonomy for task-specific parts of a complex autonomous system."}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"publication_status":"published","article_type":"original","title":"Neural circuit policies enabling auditable autonomy","page":"642-652","doi":"10.1038/s42256-020-00237-3","intvolume":"         2","_id":"8679","language":[{"iso":"eng"}],"date_created":"2020-10-19T13:46:06Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2020","type":"journal_article","publication":"Nature Machine Intelligence"},{"ec_funded":1,"project":[{"grant_number":"742573","call_identifier":"H2020","_id":"260F1432-B435-11E9-9278-68D0E5697425","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation"}],"abstract":[{"text":"Animal development entails the organization of specific cell types in space and time, and spatial patterns must form in a robust manner. In the zebrafish spinal cord, neural progenitors form stereotypic patterns despite noisy morphogen signaling and large-scale cellular rearrangements during morphogenesis and growth. By directly measuring adhesion forces and preferences for three types of endogenous neural progenitors, we provide evidence for the differential adhesion model in which differences in intercellular adhesion mediate cell sorting. Cell type–specific combinatorial expression of different classes of cadherins (N-cadherin, cadherin 11, and protocadherin 19) results in homotypic preference ex vivo and patterning robustness in vivo. Furthermore, the differential adhesion code is regulated by the sonic hedgehog morphogen gradient. We propose that robust patterning during tissue morphogenesis results from interplay between adhesion-based self-organization and morphogen-directed patterning.","lang":"eng"}],"page":"113-116","title":"An adhesion code ensures robust pattern formation during tissue morphogenesis","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/803635v1"}],"article_type":"original","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","language":[{"iso":"eng"}],"date_created":"2020-10-19T14:09:38Z","intvolume":"       370","doi":"10.1126/science.aba6637","_id":"8680","acknowledgement":"We thank the members of the Megason and Heisenberg labs for critical discussions of and technical assistance during the work and B. Appel, S. Holley, J. Jontes, and D. Gilmour for transgenic fish. This work is supported by the Damon Runyon Cancer Foundation, a NICHD K99 fellowship (1K99HD092623), a Travelling Fellowship of the Company of Biologists, a Collaborative Research grant from the Burroughs Wellcome Foundation (T.Y.-C.T.), NIH grant  01GM107733 (T.Y.-C.T. and S.G.M.), NIH grant R01NS102322 (T.C.-C. and H.K.), and an ERC advanced grant\r\n(MECSPEC) (C.-P.H.).","type":"journal_article","publication":"Science","issue":"6512","quality_controlled":"1","oa_version":"Preprint","scopus_import":"1","month":"10","keyword":["Multidisciplinary"],"day":"02","date_published":"2020-10-02T00:00:00Z","volume":370,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/sticking-together/","relation":"press_release","description":"News on IST Homepage"}]},"pmid":1,"author":[{"first_name":"Tony Y.-C.","full_name":"Tsai, Tony Y.-C.","last_name":"Tsai"},{"first_name":"Mateusz K","last_name":"Sikora","full_name":"Sikora, Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peng","orcid":"0000-0002-5419-7756","last_name":"Xia","full_name":"Xia, Peng","id":"4AB6C7D0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Colak-Champollion, Tugba","last_name":"Colak-Champollion","first_name":"Tugba"},{"full_name":"Knaut, Holger","last_name":"Knaut","first_name":"Holger"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J"},{"full_name":"Megason, Sean G.","last_name":"Megason","first_name":"Sean G."}],"external_id":{"pmid":["33004519"],"isi":["000579169000053"]},"article_processing_charge":"No","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"isi":1,"status":"public","publisher":"American Association for the Advancement of Science","citation":{"ieee":"T. Y.-C. Tsai <i>et al.</i>, “An adhesion code ensures robust pattern formation during tissue morphogenesis,” <i>Science</i>, vol. 370, no. 6512. American Association for the Advancement of Science, pp. 113–116, 2020.","mla":"Tsai, Tony Y. C., et al. “An Adhesion Code Ensures Robust Pattern Formation during Tissue Morphogenesis.” <i>Science</i>, vol. 370, no. 6512, American Association for the Advancement of Science, 2020, pp. 113–16, doi:<a href=\"https://doi.org/10.1126/science.aba6637\">10.1126/science.aba6637</a>.","chicago":"Tsai, Tony Y.-C., Mateusz K Sikora, Peng Xia, Tugba Colak-Champollion, Holger Knaut, Carl-Philipp J Heisenberg, and Sean G. Megason. “An Adhesion Code Ensures Robust Pattern Formation during Tissue Morphogenesis.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.aba6637\">https://doi.org/10.1126/science.aba6637</a>.","ama":"Tsai TY-C, Sikora MK, Xia P, et al. An adhesion code ensures robust pattern formation during tissue morphogenesis. <i>Science</i>. 2020;370(6512):113-116. doi:<a href=\"https://doi.org/10.1126/science.aba6637\">10.1126/science.aba6637</a>","short":"T.Y.-C. Tsai, M.K. Sikora, P. Xia, T. Colak-Champollion, H. Knaut, C.-P.J. Heisenberg, S.G. Megason, Science 370 (2020) 113–116.","apa":"Tsai, T. Y.-C., Sikora, M. K., Xia, P., Colak-Champollion, T., Knaut, H., Heisenberg, C.-P. J., &#38; Megason, S. G. (2020). An adhesion code ensures robust pattern formation during tissue morphogenesis. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aba6637\">https://doi.org/10.1126/science.aba6637</a>","ista":"Tsai TY-C, Sikora MK, Xia P, Colak-Champollion T, Knaut H, Heisenberg C-PJ, Megason SG. 2020. An adhesion code ensures robust pattern formation during tissue morphogenesis. Science. 370(6512), 113–116."},"date_updated":"2025-06-12T07:00:41Z","department":[{"_id":"CaHe"}]},{"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file_date_updated":"2020-10-27T14:57:50Z","type":"journal_article","acknowledgement":"We thank Udi Karpas, Roy Harpaz, Tal Tamir, Adam Haber, and Amir Bar for discussions and suggestions; and especially Oren Forkosh and Walter Senn for invaluable discussions of the learning rule. This work was supported by European Research Council Grant 311238 (to E.S.) and Israel Science Foundation Grant 1629/12 (to E.S.); as well as research support from Martin Kushner Schnur and Mr. and Mrs. Lawrence Feis (E.S.); National Institute of Mental Health Grant R01MH109180 (to R.K.); a Pew Scholarship in Biomedical Sciences (to R.K.); Simons Collaboration on the Global Brain Grant 542997 (to R.K. and E.S.); and a CRCNS (Collaborative Research in Computational Neuroscience) grant (to R.K. and E.S.).","publication":"Proceedings of the National Academy of Sciences of the United States of America","doi":"10.1073/pnas.1912804117","ddc":["570"],"intvolume":"       117","_id":"8698","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","language":[{"iso":"eng"}],"date_created":"2020-10-25T23:01:16Z","oa":1,"publication_status":"published","article_type":"original","page":"25066-25073","title":"Learning probabilistic neural representations with randomly connected circuits","file":[{"file_id":"8713","creator":"cziletti","date_updated":"2020-10-27T14:57:50Z","access_level":"open_access","file_size":1755359,"success":1,"relation":"main_file","checksum":"c6a24fdecf3f28faf447078e7a274a88","content_type":"application/pdf","file_name":"2020_PNAS_Maoz.pdf","date_created":"2020-10-27T14:57:50Z"}],"abstract":[{"lang":"eng","text":"The brain represents and reasons probabilistically about complex stimuli and motor actions using a noisy, spike-based neural code. A key building block for such neural computations, as well as the basis for supervised and unsupervised learning, is the ability to estimate the surprise or likelihood of incoming high-dimensional neural activity patterns. Despite progress in statistical modeling of neural responses and deep learning, current approaches either do not scale to large neural populations or cannot be implemented using biologically realistic mechanisms. Inspired by the sparse and random connectivity of real neuronal circuits, we present a model for neural codes that accurately estimates the likelihood of individual spiking patterns and has a straightforward, scalable, efficient, learnable, and realistic neural implementation. This model’s performance on simultaneously recorded spiking activity of >100 neurons in the monkey visual and prefrontal cortices is comparable with or better than that of state-of-the-art models. Importantly, the model can be learned using a small number of samples and using a local learning rule that utilizes noise intrinsic to neural circuits. Slower, structural changes in random connectivity, consistent with rewiring and pruning processes, further improve the efficiency and sparseness of the resulting neural representations. Our results merge insights from neuroanatomy, machine learning, and theoretical neuroscience to suggest random sparse connectivity as a key design principle for neuronal computation."}],"publisher":"National Academy of Sciences","citation":{"ama":"Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. Learning probabilistic neural representations with randomly connected circuits. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2020;117(40):25066-25073. doi:<a href=\"https://doi.org/10.1073/pnas.1912804117\">10.1073/pnas.1912804117</a>","ieee":"O. Maoz, G. Tkačik, M. S. Esteki, R. Kiani, and E. Schneidman, “Learning probabilistic neural representations with randomly connected circuits,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40. National Academy of Sciences, pp. 25066–25073, 2020.","chicago":"Maoz, Ori, Gašper Tkačik, Mohamad Saleh Esteki, Roozbeh Kiani, and Elad Schneidman. “Learning Probabilistic Neural Representations with Randomly Connected Circuits.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1912804117\">https://doi.org/10.1073/pnas.1912804117</a>.","mla":"Maoz, Ori, et al. “Learning Probabilistic Neural Representations with Randomly Connected Circuits.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40, National Academy of Sciences, 2020, pp. 25066–73, doi:<a href=\"https://doi.org/10.1073/pnas.1912804117\">10.1073/pnas.1912804117</a>.","apa":"Maoz, O., Tkačik, G., Esteki, M. S., Kiani, R., &#38; Schneidman, E. (2020). Learning probabilistic neural representations with randomly connected circuits. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1912804117\">https://doi.org/10.1073/pnas.1912804117</a>","ista":"Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. 2020. Learning probabilistic neural representations with randomly connected circuits. Proceedings of the National Academy of Sciences of the United States of America. 117(40), 25066–25073.","short":"O. Maoz, G. Tkačik, M.S. Esteki, R. Kiani, E. Schneidman, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 25066–25073."},"date_updated":"2025-07-10T11:57:16Z","department":[{"_id":"GaTk"}],"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"isi":1,"status":"public","author":[{"first_name":"Ori","full_name":"Maoz, Ori","last_name":"Maoz"},{"first_name":"Gašper","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","orcid":"0000-0002-6699-1455"},{"last_name":"Esteki","full_name":"Esteki, Mohamad Saleh","first_name":"Mohamad Saleh"},{"full_name":"Kiani, Roozbeh","last_name":"Kiani","first_name":"Roozbeh"},{"last_name":"Schneidman","full_name":"Schneidman, Elad","first_name":"Elad"}],"pmid":1,"has_accepted_license":"1","external_id":{"pmid":["32948691"],"isi":["000579045200012"]},"article_processing_charge":"No","date_published":"2020-10-06T00:00:00Z","volume":117,"tmp":{"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)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"day":"06","month":"10","quality_controlled":"1","oa_version":"Published Version","scopus_import":"1","issue":"40"},{"month":"10","day":"06","issue":"40","arxiv":1,"oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","status":"public","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"isi":1,"department":[{"_id":"MiLe"}],"citation":{"ama":"Paris E, Tseng Y, Paerschke E, et al. Strain engineering of the charge and spin-orbital interactions in Sr2IrO4. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2020;117(40):24764-24770. doi:<a href=\"https://doi.org/10.1073/pnas.2012043117\">10.1073/pnas.2012043117</a>","chicago":"Paris, Eugenio, Yi Tseng, Ekaterina Paerschke, Wenliang Zhang, Mary H Upton, Anna Efimenko, Katharina Rolfs, et al. “Strain Engineering of the Charge and Spin-Orbital Interactions in Sr2IrO4.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.2012043117\">https://doi.org/10.1073/pnas.2012043117</a>.","mla":"Paris, Eugenio, et al. “Strain Engineering of the Charge and Spin-Orbital Interactions in Sr2IrO4.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40, National Academy of Sciences, 2020, pp. 24764–70, doi:<a href=\"https://doi.org/10.1073/pnas.2012043117\">10.1073/pnas.2012043117</a>.","ieee":"E. Paris <i>et al.</i>, “Strain engineering of the charge and spin-orbital interactions in Sr2IrO4,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 117, no. 40. National Academy of Sciences, pp. 24764–24770, 2020.","ista":"Paris E, Tseng Y, Paerschke E, Zhang W, Upton MH, Efimenko A, Rolfs K, McNally DE, Maurel L, Naamneh M, Caputo M, Strocov VN, Wang Z, Casa D, Schneider CW, Pomjakushina E, Wohlfeld K, Radovic M, Schmitt T. 2020. Strain engineering of the charge and spin-orbital interactions in Sr2IrO4. Proceedings of the National Academy of Sciences of the United States of America. 117(40), 24764–24770.","apa":"Paris, E., Tseng, Y., Paerschke, E., Zhang, W., Upton, M. H., Efimenko, A., … Schmitt, T. (2020). Strain engineering of the charge and spin-orbital interactions in Sr2IrO4. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2012043117\">https://doi.org/10.1073/pnas.2012043117</a>","short":"E. Paris, Y. Tseng, E. Paerschke, W. Zhang, M.H. Upton, A. Efimenko, K. Rolfs, D.E. McNally, L. Maurel, M. Naamneh, M. Caputo, V.N. Strocov, Z. Wang, D. Casa, C.W. Schneider, E. Pomjakushina, K. Wohlfeld, M. Radovic, T. Schmitt, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 24764–24770."},"publisher":"National Academy of Sciences","date_updated":"2025-07-10T11:57:17Z","date_published":"2020-10-06T00:00:00Z","volume":117,"tmp":{"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)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"external_id":{"arxiv":["2009.12262"],"pmid":["32958669"],"isi":["000579059100029"]},"article_processing_charge":"No","has_accepted_license":"1","pmid":1,"author":[{"full_name":"Paris, Eugenio","last_name":"Paris","first_name":"Eugenio"},{"full_name":"Tseng, Yi","last_name":"Tseng","first_name":"Yi"},{"id":"8275014E-6063-11E9-9B7F-6338E6697425","full_name":"Paerschke, Ekaterina","orcid":"0000-0003-0853-8182","last_name":"Paerschke","first_name":"Ekaterina"},{"first_name":"Wenliang","last_name":"Zhang","full_name":"Zhang, Wenliang"},{"last_name":"Upton","full_name":"Upton, Mary H","first_name":"Mary H"},{"first_name":"Anna","last_name":"Efimenko","full_name":"Efimenko, Anna"},{"full_name":"Rolfs, Katharina","last_name":"Rolfs","first_name":"Katharina"},{"first_name":"Daniel E","last_name":"McNally","full_name":"McNally, Daniel E"},{"first_name":"Laura","last_name":"Maurel","full_name":"Maurel, Laura"},{"last_name":"Naamneh","full_name":"Naamneh, Muntaser","first_name":"Muntaser"},{"full_name":"Caputo, Marco","last_name":"Caputo","first_name":"Marco"},{"first_name":"Vladimir N","full_name":"Strocov, Vladimir N","last_name":"Strocov"},{"last_name":"Wang","full_name":"Wang, Zhiming","first_name":"Zhiming"},{"last_name":"Casa","full_name":"Casa, Diego","first_name":"Diego"},{"last_name":"Schneider","full_name":"Schneider, Christof W","first_name":"Christof W"},{"first_name":"Ekaterina","full_name":"Pomjakushina, Ekaterina","last_name":"Pomjakushina"},{"first_name":"Krzysztof","last_name":"Wohlfeld","full_name":"Wohlfeld, Krzysztof"},{"first_name":"Milan","full_name":"Radovic, Milan","last_name":"Radovic"},{"full_name":"Schmitt, Thorsten","last_name":"Schmitt","first_name":"Thorsten"}],"page":"24764-24770","title":"Strain engineering of the charge and spin-orbital interactions in Sr2IrO4","file":[{"creator":"cziletti","date_updated":"2020-10-28T11:53:12Z","file_id":"8715","success":1,"relation":"main_file","access_level":"open_access","file_size":1176522,"file_name":"2020_PNAS_Paris.pdf","checksum":"1638fa36b442e2868576c6dd7d6dc505","content_type":"application/pdf","date_created":"2020-10-28T11:53:12Z"}],"oa":1,"publication_status":"published","article_type":"original","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"In the high spin–orbit-coupled Sr2IrO4, the high sensitivity of the ground state to the details of the local lattice structure shows a large potential for the manipulation of the functional properties by inducing local lattice distortions. We use epitaxial strain to modify the Ir–O bond geometry in Sr2IrO4 and perform momentum-dependent resonant inelastic X-ray scattering (RIXS) at the metal and at the ligand sites to unveil the response of the low-energy elementary excitations. We observe that the pseudospin-wave dispersion for tensile-strained Sr2IrO4 films displays large softening along the [h,0] direction, while along the [h,h] direction it shows hardening. This evolution reveals a renormalization of the magnetic interactions caused by a strain-driven cross-over from anisotropic to isotropic interactions between the magnetic moments. Moreover, we detect dispersive electron–hole pair excitations which shift to lower (higher) energies upon compressive (tensile) strain, manifesting a reduction (increase) in the size of the charge gap. This behavior shows an intimate coupling between charge excitations and lattice distortions in Sr2IrO4, originating from the modified hopping elements between the t2g orbitals. Our work highlights the central role played by the lattice degrees of freedom in determining both the pseudospin and charge excitations of Sr2IrO4 and provides valuable information toward the control of the ground state of complex oxides in the presence of high spin–orbit coupling."}],"publication":"Proceedings of the National Academy of Sciences of the United States of America","type":"journal_article","acknowledgement":"We gratefully acknowledge C. Sahle for experimental support at the ID20 beamline of the ESRF. The soft X-ray experiments were carried out at the ADRESS beamline of the Swiss Light Source, Paul Scherrer Institut (PSI). E. Paris and T.S. thank X. Lu and C. Monney for valuable discussions. The work at PSI is supported by the Swiss National Science Foundation (SNSF) through Project 200021_178867, the NCCR (National Centre of Competence in Research) MARVEL (Materials’ Revolution: Computational Design and Discovery of Novel Materials) and the Sinergia network Mott Physics Beyond the Heisenberg Model (MPBH) (SNSF Research Grants CRSII2_160765/1 and CRSII2_141962). K.W. acknowledges support by the Narodowe Centrum Nauki Projects 2016/22/E/ST3/00560 and 2016/23/B/ST3/00839. E.M.P. and M.N. acknowledge funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreements 754411 and 701647, respectively. M.R. was supported by the Swiss National Science Foundation under Project 200021 – 182695. This research used resources of the APS, a U.S. Department of Energy (DOE) Office of Science User Facility operated for the DOE Office of Science by Argonne National Laboratory under Contract DE-AC02-06CH11357.","file_date_updated":"2020-10-28T11:53:12Z","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-10-25T23:01:17Z","language":[{"iso":"eng"}],"_id":"8699","intvolume":"       117","doi":"10.1073/pnas.2012043117","ddc":["530"]},{"publication":"Molecular Biology","type":"journal_article","acknowledgement":"We would like to thank the staff of CCU Genome for sequencing, Tat’yana Pestova, Christopher Helen, and Lyudmila Yur’evna Frolova for the plasmids provided, as well as the laboratory staff for productive discussion of the results. We also thank former laboratory employees Yuliya Vladimirovna Bocharova and Polina Nikolaevna Kryuchkova for the exceptional contribution to the present work.","_id":"8700","doi":"10.1134/S0026893320050088","intvolume":"        54","date_created":"2020-10-25T23:01:17Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","publication_status":"published","article_type":"original","title":"The influence of A/G composition of 3' stop codon contexts on translation termination efficiency in eukaryotes","page":"739-748","abstract":[{"lang":"eng","text":"Translation termination is a finishing step of protein biosynthesis. The significant role in this process belongs not only to protein factors of translation termination but also to the nearest nucleotide environment of stop codons. There are numerous descriptions of stop codons readthrough, which is due to specific nucleotide sequences behind them. However, represented data are segmental and don’t explain the mechanism of the nucleotide context influence on translation termination. It is well known that stop codon UAA usage is preferential for A/T-rich genes, and UAG, UGA—for G/C-rich genes, which is related to an expression level of these genes. We investigated the connection between a frequency of nucleotides occurrence in 3' area of stop codons in the human genome and their influence on translation termination efficiency. We found that 3' context motif, which is cognate to the sequence of a stop codon, stimulates translation termination. At the same time, the nucleotide composition of 3' sequence that differs from stop codon, decreases translation termination efficiency."}],"department":[{"_id":"FyKo"}],"date_updated":"2025-07-10T12:01:20Z","citation":{"ama":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. <i>Molecular Biology</i>. 2020;54(5):739-748. doi:<a href=\"https://doi.org/10.1134/S0026893320050088\">10.1134/S0026893320050088</a>","mla":"Sokolova, E. E., et al. “The Influence of A/G Composition of 3’ Stop Codon Contexts on Translation Termination Efficiency in Eukaryotes.” <i>Molecular Biology</i>, vol. 54, no. 5, Springer Nature, 2020, pp. 739–48, doi:<a href=\"https://doi.org/10.1134/S0026893320050088\">10.1134/S0026893320050088</a>.","chicago":"Sokolova, E. E., Petr Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva. “The Influence of A/G Composition of 3’ Stop Codon Contexts on Translation Termination Efficiency in Eukaryotes.” <i>Molecular Biology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1134/S0026893320050088\">https://doi.org/10.1134/S0026893320050088</a>.","ieee":"E. E. Sokolova, P. Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva, “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes,” <i>Molecular Biology</i>, vol. 54, no. 5. Springer Nature, pp. 739–748, 2020.","ista":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. 2020. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molecular Biology. 54(5), 739–748.","apa":"Sokolova, E. E., Vlasov, P., Egorova, T. V., Shuvalov, A. V., &#38; Alkalaeva, E. Z. (2020). The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. <i>Molecular Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1134/S0026893320050088\">https://doi.org/10.1134/S0026893320050088</a>","short":"E.E. Sokolova, P. Vlasov, T.V. Egorova, A.V. Shuvalov, E.Z. Alkalaeva, Molecular Biology 54 (2020) 739–748."},"publisher":"Springer Nature","status":"public","publication_identifier":{"eissn":["1608-3245"],"issn":["0026-8933"]},"isi":1,"external_id":{"isi":["000579441200009"]},"article_processing_charge":"No","author":[{"last_name":"Sokolova","full_name":"Sokolova, E. E.","first_name":"E. E."},{"id":"38BB9AC4-F248-11E8-B48F-1D18A9856A87","full_name":"Vlasov, Petr","last_name":"Vlasov","first_name":"Petr"},{"first_name":"T. V.","last_name":"Egorova","full_name":"Egorova, T. V."},{"last_name":"Shuvalov","full_name":"Shuvalov, A. V.","first_name":"A. V."},{"full_name":"Alkalaeva, E. Z.","last_name":"Alkalaeva","first_name":"E. Z."}],"related_material":{"record":[{"status":"public","relation":"original","id":"8701"}]},"date_published":"2020-09-01T00:00:00Z","volume":54,"day":"01","month":"09","oa_version":"None","scopus_import":"1","quality_controlled":"1","issue":"5"},{"department":[{"_id":"FyKo"}],"date_updated":"2025-07-10T12:01:20Z","citation":{"short":"E.E. Sokolova, P. Vlasov, T.V. Egorova, A.V. Shuvalov, E.Z. Alkalaeva, Molekuliarnaia biologiia 54 (2020) 837–848.","ista":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. 2020. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. Molekuliarnaia biologiia. 54(5), 837–848.","apa":"Sokolova, E. E., Vlasov, P., Egorova, T. V., Shuvalov, A. V., &#38; Alkalaeva, E. Z. (2020). The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. <i>Molekuliarnaia biologiia</i>. Russian Academy of Sciences. <a href=\"https://doi.org/10.31857/S0026898420050080\">https://doi.org/10.31857/S0026898420050080</a>","mla":"Sokolova, E. E., et al. “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes.” <i>Molekuliarnaia biologiia</i>, vol. 54, no. 5, Russian Academy of Sciences, 2020, pp. 837–48, doi:<a href=\"https://doi.org/10.31857/S0026898420050080\">10.31857/S0026898420050080</a>.","chicago":"Sokolova, E. E., Petr Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva. “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes.” <i>Molekuliarnaia biologiia</i>. Russian Academy of Sciences, 2020. <a href=\"https://doi.org/10.31857/S0026898420050080\">https://doi.org/10.31857/S0026898420050080</a>.","ieee":"E. E. Sokolova, P. Vlasov, T. V. Egorova, A. V. Shuvalov, and E. Z. Alkalaeva, “The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes,” <i>Molekuliarnaia biologiia</i>, vol. 54, no. 5. Russian Academy of Sciences, pp. 837–848, 2020.","ama":"Sokolova EE, Vlasov P, Egorova TV, Shuvalov AV, Alkalaeva EZ. The influence of A/G composition of 3’ stop codon contexts on translation termination efficiency in eukaryotes. <i>Molekuliarnaia biologiia</i>. 2020;54(5):837-848. doi:<a href=\"https://doi.org/10.31857/S0026898420050080\">10.31857/S0026898420050080</a>"},"publisher":"Russian Academy of Sciences","status":"public","publication_identifier":{"issn":["0026-8984"]},"external_id":{"pmid":["33009793"]},"article_processing_charge":"No","pmid":1,"author":[{"first_name":"E. E.","last_name":"Sokolova","full_name":"Sokolova, E. E."},{"full_name":"Vlasov, Petr","id":"38BB9AC4-F248-11E8-B48F-1D18A9856A87","last_name":"Vlasov","first_name":"Petr"},{"full_name":"Egorova, T. V.","last_name":"Egorova","first_name":"T. V."},{"first_name":"A. V.","full_name":"Shuvalov, A. V.","last_name":"Shuvalov"},{"first_name":"E. Z.","last_name":"Alkalaeva","full_name":"Alkalaeva, E. Z."}],"related_material":{"record":[{"status":"public","id":"8700","relation":"translation"}]},"volume":54,"date_published":"2020-09-01T00:00:00Z","day":"01","month":"09","scopus_import":"1","oa_version":"None","quality_controlled":"1","issue":"5","publication":"Molekuliarnaia biologiia","type":"journal_article","_id":"8701","doi":"10.31857/S0026898420050080","intvolume":"        54","language":[{"iso":"rus"}],"date_created":"2020-10-25T23:01:17Z","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publication_status":"published","title":"The influence of A/G composition of 3' stop codon contexts on translation termination efficiency in eukaryotes","page":"837-848","abstract":[{"text":"Translation termination is a finishing step of protein biosynthesis. The significant role in this process belongs not only to protein factors of translation termination but also to the nearest nucleotide environment of stop codons. There are numerous descriptions of stop codons readthrough, which is due to specific nucleotide sequences behind them. However, represented data are segmental and don’t explain the mechanism of the nucleotide context influence on translation termination. It is well known that stop codon UAA usage is preferential for A/T-rich genes, and UAG, UGA—for G/C-rich genes, which is related to an expression level of these genes. We investigated the connection between a frequency of nucleotides occurrence in 3' area of stop codons in the human genome and their influence on translation termination efficiency. We found that 3' context motif, which is cognate to the sequence of a stop codon, stimulates translation termination. At the same time, the nucleotide composition of 3' sequence that differs from stop codon, decreases translation termination efficiency.","lang":"eng"}]},{"day":"01","month":"05","quality_controlled":"1","conference":{"end_date":"2020-08-31","location":"Paris, France","name":"ICRA: International Conference on Robotics and Automation","start_date":"2020-05-31"},"scopus_import":"1","oa_version":"Submitted Version","citation":{"ama":"Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In: <i>Proceedings - IEEE International Conference on Robotics and Automation</i>. IEEE; 2020:5446-5452. doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>","ieee":"M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme,” in <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, Paris, France, 2020, pp. 5446–5452.","mla":"Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, IEEE, 2020, pp. 5446–52, doi:<a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">10.1109/ICRA40945.2020.9196608</a>.","chicago":"Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.” In <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, 5446–52. IEEE, 2020. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>.","apa":"Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In <i>Proceedings - IEEE International Conference on Robotics and Automation</i> (pp. 5446–5452). Paris, France: IEEE. <a href=\"https://doi.org/10.1109/ICRA40945.2020.9196608\">https://doi.org/10.1109/ICRA40945.2020.9196608</a>","ista":"Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, , 5446–5452.","short":"M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452."},"publisher":"IEEE","date_updated":"2025-07-10T12:01:21Z","department":[{"_id":"ToHe"}],"isi":1,"publication_identifier":{"isbn":["9781728173955"],"issn":["1050-4729"]},"status":"public","author":[{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"external_id":{"isi":["000712319503110"]},"article_processing_charge":"No","has_accepted_license":"1","date_published":"2020-05-01T00:00:00Z","oa":1,"publication_status":"published","page":"5446-5452","alternative_title":["ICRA"],"title":"Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme","file":[{"date_created":"2020-11-06T10:58:49Z","checksum":"fccf7b986ac78046918a298cc6849a50","content_type":"application/pdf","file_name":"2020_ICRA_Lechner.pdf","access_level":"open_access","file_size":1070010,"relation":"main_file","success":1,"file_id":"8733","creator":"dernst","date_updated":"2020-11-06T10:58:49Z"}],"abstract":[{"lang":"eng","text":"Traditional robotic control suits require profound task-specific knowledge for designing, building and testing control software. The rise of Deep Learning has enabled end-to-end solutions to be learned entirely from data, requiring minimal knowledge about the application area. We design a learning scheme to train end-to-end linear dynamical systems (LDS)s by gradient descent in imitation learning robotic domains. We introduce a new regularization loss component together with a learning algorithm that improves the stability of the learned autonomous system, by forcing the eigenvalues of the internal state updates of an LDS to be negative reals. We evaluate our approach on a series of real-life and simulated robotic experiments, in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures. Our results show that our stabilizing method significantly improves test performance of LDS, enabling such linear models to match the performance of contemporary nonlinear RNN architectures. A video of the obstacle avoidance performance of our method on a mobile robot, in unseen environments, compared to other methods can be viewed at https://youtu.be/mhEsCoNao5E."}],"project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"file_date_updated":"2020-11-06T10:58:49Z","type":"conference","acknowledgement":"M.L. is supported in parts by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing Company.","publication":"Proceedings - IEEE International Conference on Robotics and Automation","ddc":["000"],"doi":"10.1109/ICRA40945.2020.9196608","_id":"8704","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-10-25T23:01:19Z","language":[{"iso":"eng"}]},{"date_created":"2020-11-02T10:04:46Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2020","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"_id":"8721","doi":"10.1126/science.aba3178","intvolume":"       370","publication":"Science","type":"journal_article","acknowledgement":"We acknowledge M. Glanc and Y. Zhang for providing entryclones; Vienna Biocenter Core Facilities (VBCF) for recombinantprotein production and purification; Vienna Biocenter Massspectrometry Facility, Bioimaging, and Life Science Facilities at IST Austria and Proteomics Core Facility CEITEC for a great assistance.Funding:This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement 742985) and Austrian Science Fund (FWF): I 3630-B25 to J.F.and by grants from the Austrian Academy of Science through the Gregor Mendel Institute (Y.B.) and the Austrian Agency for International Cooperation in Education and Research (D.D.); the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001) (W.S.); the Research Foundation–Flanders (FWO;Odysseus II G0D0515N) and a European Research Council grant (ERC; StG TORPEDO; 714055) to B.D.R., B.Y., and E.M.; and the Hertha Firnberg Programme postdoctoral fellowship (T-947) from the FWF Austrian Science Fund to E.S.-L.; J.H. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at IST Austria.","project":[{"call_identifier":"H2020","grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630","call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425"},{"grant_number":"25239","_id":"2699E3D2-B435-11E9-9278-68D0E5697425","name":"Cell surface receptor complexes for PIN polarity and auxin-mediated development"}],"ec_funded":1,"abstract":[{"text":"Spontaneously arising channels that transport the phytohormone auxin provide positional cues for self-organizing aspects of plant development such as flexible vasculature regeneration or its patterning during leaf venation. The auxin canalization hypothesis proposes a feedback between auxin signaling and transport as the underlying mechanism, but molecular players await discovery. We identified part of the machinery that routes auxin transport. The auxin-regulated receptor CAMEL (Canalization-related Auxin-regulated Malectin-type RLK) together with CANAR (Canalization-related Receptor-like kinase) interact with and phosphorylate PIN auxin transporters. camel and canar mutants are impaired in PIN1 subcellular trafficking and auxin-mediated PIN polarization, which macroscopically manifests as defects in leaf venation and vasculature regeneration after wounding. The CAMEL-CANAR receptor complex is part of the auxin feedback that coordinates polarization of individual cells during auxin canalization.","lang":"eng"}],"title":"Receptor kinase module targets PIN-dependent auxin transport during canalization","page":"550-557","publication_status":"published","article_type":"original","main_file_link":[{"url":"https://europepmc.org/article/MED/33122378#free-full-text","open_access":"1"}],"oa":1,"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/molecular-compass-for-cell-orientation/","description":"News on IST Homepage"}]},"date_published":"2020-10-30T00:00:00Z","volume":370,"article_processing_charge":"No","external_id":{"pmid":["33122378"],"isi":["000583031800041"]},"pmid":1,"author":[{"first_name":"Jakub","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","full_name":"Hajny, Jakub","last_name":"Hajny","orcid":"0000-0003-2140-7195"},{"first_name":"Tomas","full_name":"Prat, Tomas","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","last_name":"Prat"},{"full_name":"Rydza, N","last_name":"Rydza","first_name":"N"},{"orcid":"0000-0002-7244-7237","last_name":"Rodriguez Solovey","full_name":"Rodriguez Solovey, Lesia","id":"3922B506-F248-11E8-B48F-1D18A9856A87","first_name":"Lesia"},{"first_name":"Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","full_name":"Tan, Shutang","orcid":"0000-0002-0471-8285","last_name":"Tan"},{"full_name":"Verstraeten, Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","orcid":"0000-0001-7241-2328","first_name":"Inge"},{"orcid":"0000-0003-2267-106X","last_name":"Domjan","full_name":"Domjan, David","id":"C684CD7A-257E-11EA-9B6F-D8588B4F947F","first_name":"David"},{"first_name":"E","last_name":"Mazur","full_name":"Mazur, E"},{"first_name":"E","full_name":"Smakowska-Luzan, E","last_name":"Smakowska-Luzan"},{"full_name":"Smet, W","last_name":"Smet","first_name":"W"},{"last_name":"Mor","full_name":"Mor, E","first_name":"E"},{"last_name":"Nolf","full_name":"Nolf, J","first_name":"J"},{"full_name":"Yang, B","last_name":"Yang","first_name":"B"},{"first_name":"W","full_name":"Grunewald, W","last_name":"Grunewald"},{"first_name":"Gergely","last_name":"Molnar","full_name":"Molnar, Gergely","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Y","full_name":"Belkhadir, Y","last_name":"Belkhadir"},{"first_name":"B","full_name":"De Rybel, B","last_name":"De Rybel"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jiří"}],"status":"public","isi":1,"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"department":[{"_id":"JiFr"}],"date_updated":"2025-04-14T07:45:00Z","citation":{"apa":"Hajny, J., Prat, T., Rydza, N., Rodriguez Solovey, L., Tan, S., Verstraeten, I., … Friml, J. (2020). Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>","ista":"Hajny J, Prat T, Rydza N, Rodriguez Solovey L, Tan S, Verstraeten I, Domjan D, Mazur E, Smakowska-Luzan E, Smet W, Mor E, Nolf J, Yang B, Grunewald W, Molnar G, Belkhadir Y, De Rybel B, Friml J. 2020. Receptor kinase module targets PIN-dependent auxin transport during canalization. Science. 370(6516), 550–557.","short":"J. Hajny, T. Prat, N. Rydza, L. Rodriguez Solovey, S. Tan, I. Verstraeten, D. Domjan, E. Mazur, E. Smakowska-Luzan, W. Smet, E. Mor, J. Nolf, B. Yang, W. Grunewald, G. Molnar, Y. Belkhadir, B. De Rybel, J. Friml, Science 370 (2020) 550–557.","ama":"Hajny J, Prat T, Rydza N, et al. Receptor kinase module targets PIN-dependent auxin transport during canalization. <i>Science</i>. 2020;370(6516):550-557. doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>","ieee":"J. Hajny <i>et al.</i>, “Receptor kinase module targets PIN-dependent auxin transport during canalization,” <i>Science</i>, vol. 370, no. 6516. American Association for the Advancement of Science, pp. 550–557, 2020.","mla":"Hajny, Jakub, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>, vol. 370, no. 6516, American Association for the Advancement of Science, 2020, pp. 550–57, doi:<a href=\"https://doi.org/10.1126/science.aba3178\">10.1126/science.aba3178</a>.","chicago":"Hajny, Jakub, Tomas Prat, N Rydza, Lesia Rodriguez Solovey, Shutang Tan, Inge Verstraeten, David Domjan, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport during Canalization.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.aba3178\">https://doi.org/10.1126/science.aba3178</a>."},"publisher":"American Association for the Advancement of Science","issue":"6516","scopus_import":"1","oa_version":"Published Version","quality_controlled":"1","month":"10","day":"30"},{"status":"public","isi":1,"department":[{"_id":"DaAl"}],"citation":{"ieee":"S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler, “Taming unbalanced training workloads in deep learning with partial collective operations,” in <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, San Diego, CA, United States, 2020, pp. 45–61.","chicago":"Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 45–61. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>.","mla":"Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2020, pp. 45–61, doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>.","ama":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. Taming unbalanced training workloads in deep learning with partial collective operations. In: <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2020:45-61. doi:<a href=\"https://doi.org/10.1145/3332466.3374528\">10.1145/3332466.3374528</a>","short":"S. Li, T.B.-N. Tal Ben-Nun, S.D. Girolamo, D.-A. Alistarh, T. Hoefler, in:, Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 45–61.","apa":"Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., &#38; Hoefler, T. (2020). Taming unbalanced training workloads in deep learning with partial collective operations. In <i>Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 45–61). San Diego, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3332466.3374528\">https://doi.org/10.1145/3332466.3374528</a>","ista":"Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 2020. Taming unbalanced training workloads in deep learning with partial collective operations. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 45–61."},"publisher":"Association for Computing Machinery","date_updated":"2025-04-14T07:49:12Z","date_published":"2020-02-01T00:00:00Z","external_id":{"arxiv":["1908.04207"],"isi":["000564476500004"]},"article_processing_charge":"No","author":[{"first_name":"Shigang","full_name":"Li, Shigang","last_name":"Li"},{"first_name":"Tal Ben-Nun","last_name":"Tal Ben-Nun","full_name":"Tal Ben-Nun, Tal Ben-Nun"},{"full_name":"Girolamo, Salvatore Di","last_name":"Girolamo","first_name":"Salvatore Di"},{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Hoefler","full_name":"Hoefler, Torsten","first_name":"Torsten"}],"month":"02","day":"01","arxiv":1,"scopus_import":"1","oa_version":"Preprint","quality_controlled":"1","conference":{"location":"San Diego, CA, United States","end_date":"2020-02-26","start_date":"2020-02-22","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming"},"publication":"Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","type":"conference","year":"2020","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-11-05T15:25:30Z","language":[{"iso":"eng"}],"_id":"8722","doi":"10.1145/3332466.3374528","page":"45-61","title":"Taming unbalanced training workloads in deep learning with partial collective operations","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1908.04207","open_access":"1"}],"publication_status":"published","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"Load imbalance pervasively exists in distributed deep learning training systems, either caused by the inherent imbalance in learned tasks or by the system itself. Traditional synchronous Stochastic Gradient Descent (SGD)\r\nachieves good accuracy for a wide variety of tasks, but relies on global synchronization to accumulate the gradients at every training step. In this paper, we propose eager-SGD, which relaxes the global synchronization for\r\ndecentralized accumulation. To implement eager-SGD, we propose to use two partial collectives: solo and majority. With solo allreduce, the faster processes contribute their gradients eagerly without waiting for the slower processes, whereas with majority allreduce, at least half of the participants must contribute gradients before continuing, all without using a central parameter server. We theoretically prove the convergence of the algorithms and describe the partial collectives in detail. Experimental results on load-imbalanced environments (CIFAR-10, ImageNet, and UCF101 datasets) show\r\nthat eager-SGD achieves 1.27x speedup over the state-of-the-art synchronous SGD, without losing accuracy."}]},{"oa":1,"publication_status":"published","page":"3:1-3:18","title":"The splay-list: A distribution-adaptive concurrent skip-list","file":[{"date_created":"2021-03-11T12:33:35Z","file_name":"2020_LIPIcs_Aksenov.pdf","content_type":"application/pdf","checksum":"a626a9c47df52b6f6d97edd910dae4ba","relation":"main_file","success":1,"access_level":"open_access","file_size":740358,"creator":"dernst","date_updated":"2021-03-11T12:33:35Z","file_id":"9237"}],"abstract":[{"text":"The design and implementation of efficient concurrent data structures have\r\nseen significant attention. However, most of this work has focused on\r\nconcurrent data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads, objects are often accessed at different rates, since access\r\ndistributions may be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to translate efficiently in the concurrent case.\r\n  In this paper, we investigate distribution-adaptive concurrent data\r\nstructures and propose a new design called the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list, with the key distinction that\r\nthe height of each element adapts dynamically to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements decrease in height. We\r\nshow that the splay-list provides order-optimal amortized complexity bounds for\r\na subset of operations while being amenable to efficient concurrent\r\nimplementation. Experimental results show that the splay-list can leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns, and can outperform the only previously-known distribution-adaptive\r\ndesign in certain settings.","lang":"eng"}],"ec_funded":1,"project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2021-03-11T12:33:35Z","acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML.","type":"conference","publication":"34th International Symposium on Distributed Computing","doi":"10.4230/LIPIcs.DISC.2020.3","intvolume":"       179","series_title":"LIPIcs","ddc":["000"],"_id":"8725","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","date_created":"2020-11-05T15:26:17Z","language":[{"iso":"eng"}],"day":"03","month":"08","quality_controlled":"1","conference":{"name":"DISC: Symposium on Distributed Computing","start_date":"2020-10-12","end_date":"2020-10-16","location":"Freiburg, Germany"},"arxiv":1,"scopus_import":"1","oa_version":"Published Version","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., &#38; Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in <i>34th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In <i>34th International Symposium on Distributed Computing</i>, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">https://doi.org/10.4230/LIPIcs.DISC.2020.3</a>.","mla":"Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.3\">10.4230/LIPIcs.DISC.2020.3</a>"},"date_updated":"2025-04-14T07:49:12Z","department":[{"_id":"DaAl"}],"publication_identifier":{"isbn":["9783959771689"],"issn":["1868-8969"]},"status":"public","author":[{"last_name":"Aksenov","full_name":"Aksenov, Vitaly","first_name":"Vitaly"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"full_name":"Drozdova, Alexandra","last_name":"Drozdova","first_name":"Alexandra"},{"first_name":"Amirkeivan","full_name":"Mohtashami, Amirkeivan","last_name":"Mohtashami"}],"external_id":{"arxiv":["2008.01009"]},"article_processing_charge":"No","has_accepted_license":"1","volume":179,"date_published":"2020-08-03T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)"}},{"language":[{"iso":"eng"}],"date_created":"2020-11-06T07:21:00Z","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.3390/condmat5030053","ddc":["530"],"intvolume":"         5","_id":"8726","type":"journal_article","publication":"Condensed Matter","file_date_updated":"2020-11-06T07:24:40Z","ec_funded":1,"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"abstract":[{"lang":"eng","text":"Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling."}],"title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","file":[{"success":1,"relation":"main_file","file_size":768336,"access_level":"open_access","date_updated":"2020-11-06T07:24:40Z","creator":"dernst","file_id":"8727","date_created":"2020-11-06T07:24:40Z","file_name":"2020_CondensedMatter_Gotfryd.pdf","content_type":"application/pdf","checksum":"a57a698ff99a11b6665bafd1bac7afbc"}],"article_number":"53","publication_status":"published","article_type":"original","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":5,"date_published":"2020-08-26T00:00:00Z","author":[{"last_name":"Gotfryd","full_name":"Gotfryd, Dorota","first_name":"Dorota"},{"first_name":"Ekaterina","id":"8275014E-6063-11E9-9B7F-6338E6697425","full_name":"Paerschke, Ekaterina","orcid":"0000-0003-0853-8182","last_name":"Paerschke"},{"first_name":"Krzysztof","full_name":"Wohlfeld, Krzysztof","last_name":"Wohlfeld"},{"first_name":"Andrzej M.","last_name":"Oleś","full_name":"Oleś, Andrzej M."}],"article_processing_charge":"No","external_id":{"arxiv":["2009.11773"]},"has_accepted_license":"1","publication_identifier":{"issn":["2410-3896"]},"status":"public","date_updated":"2025-04-14T07:43:50Z","publisher":"MDPI","citation":{"chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>.","mla":"Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” <i>Condensed Matter</i>, vol. 5, no. 3, 53, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>.","ieee":"D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” <i>Condensed Matter</i>, vol. 5, no. 3. MDPI, 2020.","ama":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. 2020;5(3). doi:<a href=\"https://doi.org/10.3390/condmat5030053\">10.3390/condmat5030053</a>","short":"D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).","ista":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3), 53.","apa":"Gotfryd, D., Paerschke, E., Wohlfeld, K., &#38; Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. <i>Condensed Matter</i>. MDPI. <a href=\"https://doi.org/10.3390/condmat5030053\">https://doi.org/10.3390/condmat5030053</a>"},"department":[{"_id":"MiLe"}],"issue":"3","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","arxiv":1,"month":"08","day":"26"},{"issue":"17","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","month":"10","day":"26","volume":117,"date_published":"2020-10-26T00:00:00Z","author":[{"first_name":"Retno","full_name":"Miranti, Retno","last_name":"Miranti"},{"first_name":"Ricky Dwi","full_name":"Septianto, Ricky Dwi","last_name":"Septianto"},{"first_name":"Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"first_name":"Maksym V.","last_name":"Kovalenko","full_name":"Kovalenko, Maksym V."},{"first_name":"Nobuhiro","full_name":"Matsushita, Nobuhiro","last_name":"Matsushita"},{"first_name":"Yoshihiro","full_name":"Iwasa, Yoshihiro","last_name":"Iwasa"},{"last_name":"Bisri","full_name":"Bisri, Satria Zulkarnaen","first_name":"Satria Zulkarnaen"}],"article_processing_charge":"No","external_id":{"isi":["000591639700001"]},"publication_identifier":{"issn":["0003-6951"],"eissn":["1077-3118"]},"isi":1,"status":"public","citation":{"ista":"Miranti R, Septianto RD, Ibáñez M, Kovalenko MV, Matsushita N, Iwasa Y, Bisri SZ. 2020. Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. Applied Physics Letters. 117(17), 173101.","apa":"Miranti, R., Septianto, R. D., Ibáñez, M., Kovalenko, M. V., Matsushita, N., Iwasa, Y., &#38; Bisri, S. Z. (2020). Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. <i>Applied Physics Letters</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0025965\">https://doi.org/10.1063/5.0025965</a>","short":"R. Miranti, R.D. Septianto, M. Ibáñez, M.V. Kovalenko, N. Matsushita, Y. Iwasa, S.Z. Bisri, Applied Physics Letters 117 (2020).","ama":"Miranti R, Septianto RD, Ibáñez M, et al. Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids. <i>Applied Physics Letters</i>. 2020;117(17). doi:<a href=\"https://doi.org/10.1063/5.0025965\">10.1063/5.0025965</a>","mla":"Miranti, Retno, et al. “Electron Transport in Iodide-Capped Core@shell PbTe@PbS Colloidal Nanocrystal Solids.” <i>Applied Physics Letters</i>, vol. 117, no. 17, 173101, AIP Publishing, 2020, doi:<a href=\"https://doi.org/10.1063/5.0025965\">10.1063/5.0025965</a>.","chicago":"Miranti, Retno, Ricky Dwi Septianto, Maria Ibáñez, Maksym V. Kovalenko, Nobuhiro Matsushita, Yoshihiro Iwasa, and Satria Zulkarnaen Bisri. “Electron Transport in Iodide-Capped Core@shell PbTe@PbS Colloidal Nanocrystal Solids.” <i>Applied Physics Letters</i>. AIP Publishing, 2020. <a href=\"https://doi.org/10.1063/5.0025965\">https://doi.org/10.1063/5.0025965</a>.","ieee":"R. Miranti <i>et al.</i>, “Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids,” <i>Applied Physics Letters</i>, vol. 117, no. 17. AIP Publishing, 2020."},"publisher":"AIP Publishing","date_updated":"2023-09-05T11:57:23Z","department":[{"_id":"MaIb"}],"abstract":[{"text":"Research in the field of colloidal semiconductor nanocrystals (NCs) has progressed tremendously, mostly because of their exceptional optoelectronic properties. Core@shell NCs, in which one or more inorganic layers overcoat individual NCs, recently received significant attention due to their remarkable optical characteristics. Reduced Auger recombination, suppressed blinking, and enhanced carrier multiplication are among the merits of core@shell NCs. Despite their importance in device development, the influence of the shell and the surface modification of the core@shell NC assemblies on the charge carrier transport remains a pertinent research objective. Type-II PbTe@PbS core@shell NCs, in which exclusive electron transport was demonstrated, still exhibit instability of their electron \r\n ransport. Here, we demonstrate the enhancement of electron transport and stability in PbTe@PbS core@shell NC assemblies using iodide as a surface passivating ligand. The combination of the PbS shelling and the use of the iodide ligand contributes to the addition of one mobile electron for each core@shell NC. Furthermore, both electron mobility and on/off current modulation ratio values of the core@shell NC field-effect transistor are steady with the usage of iodide. Excellent stability in these exclusively electron-transporting core@shell NCs paves the way for their utilization in electronic devices. ","lang":"eng"}],"title":"Electron transport in iodide-capped core@shell PbTe@PbS colloidal nanocrystal solids","article_number":"173101","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1063/5.0025965"}],"oa":1,"article_type":"original","publication_status":"published","year":"2020","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2020-11-09T08:05:43Z","language":[{"iso":"eng"}],"doi":"10.1063/5.0025965","intvolume":"       117","_id":"8746","acknowledgement":"This work was partly supported by Grants-in-Aid for Scientific Research by Young Scientist A (KAKENHI Wakate-A) No.\r\nJP17H04802, Grants-in-Aid for Scientific Research No. JP19H05602 from the Japan Society for the Promotion of Science, and RIKEN Incentive Research Grant (Shoreikadai) 2016. M.V.K. and M.I. acknowledge financial support from the European Union (EU) via FP7 ERC Starting Grant 2012 (Project NANOSOLID, GA No. 306733) and ETH Zurich via ETH career seed grant (No. SEED-18 16-2). We acknowledge Mrs. T. Kikitsu and Dr. D. Hashizume (RIKEN-CEMS) for access to the transmission electron microscope facility.","type":"journal_article","publication":"Applied Physics Letters"},{"issue":"40","scopus_import":"1","oa_version":"None","quality_controlled":"1","month":"10","day":"28","date_published":"2020-10-28T00:00:00Z","volume":8,"article_processing_charge":"No","external_id":{"isi":["000581559100015"]},"author":[{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","last_name":"Liu","first_name":"Yu"},{"full_name":"Calcabrini, Mariano","last_name":"Calcabrini","first_name":"Mariano"},{"first_name":"Congcong","full_name":"Xing, Congcong","last_name":"Xing"},{"first_name":"Xu","last_name":"Han","full_name":"Han, Xu"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"first_name":"Doris","full_name":"Cadavid, Doris","last_name":"Cadavid"},{"first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"status":"public","isi":1,"department":[{"_id":"MaIb"}],"corr_author":"1","date_updated":"2025-04-14T07:43:50Z","citation":{"ama":"Zhang Y, Liu Y, Calcabrini M, et al. Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. <i>Journal of Materials Chemistry C</i>. 2020;8(40):14092-14099. doi:<a href=\"https://doi.org/10.1039/D0TC02182B\">10.1039/D0TC02182B</a>","ieee":"Y. Zhang <i>et al.</i>, “Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks,” <i>Journal of Materials Chemistry C</i>, vol. 8, no. 40. Royal Society of Chemistry, pp. 14092–14099, 2020.","chicago":"Zhang, Yu, Yu Liu, Mariano Calcabrini, Congcong Xing, Xu Han, Jordi Arbiol, Doris Cadavid, Maria Ibáñez, and Andreu Cabot. “Bismuth Telluride-Copper Telluride Nanocomposites from Heterostructured Building Blocks.” <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry, 2020. <a href=\"https://doi.org/10.1039/D0TC02182B\">https://doi.org/10.1039/D0TC02182B</a>.","mla":"Zhang, Yu, et al. “Bismuth Telluride-Copper Telluride Nanocomposites from Heterostructured Building Blocks.” <i>Journal of Materials Chemistry C</i>, vol. 8, no. 40, Royal Society of Chemistry, 2020, pp. 14092–99, doi:<a href=\"https://doi.org/10.1039/D0TC02182B\">10.1039/D0TC02182B</a>.","apa":"Zhang, Y., Liu, Y., Calcabrini, M., Xing, C., Han, X., Arbiol, J., … Cabot, A. (2020). Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. <i>Journal of Materials Chemistry C</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/D0TC02182B\">https://doi.org/10.1039/D0TC02182B</a>","ista":"Zhang Y, Liu Y, Calcabrini M, Xing C, Han X, Arbiol J, Cadavid D, Ibáñez M, Cabot A. 2020. Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks. Journal of Materials Chemistry C. 8(40), 14092–14099.","short":"Y. Zhang, Y. Liu, M. Calcabrini, C. Xing, X. Han, J. Arbiol, D. Cadavid, M. Ibáñez, A. Cabot, Journal of Materials Chemistry C 8 (2020) 14092–14099."},"publisher":"Royal Society of Chemistry","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"ec_funded":1,"abstract":[{"text":"Appropriately designed nanocomposites allow improving the thermoelectric performance by several mechanisms, including phonon scattering, modulation doping and energy filtering, while additionally promoting better mechanical properties than those of crystalline materials. Here, a strategy for producing Bi2Te3–Cu2xTe nanocomposites based on the consolidation of heterostructured nanoparticles is described and the thermoelectric properties of the obtained materials are investigated. We first detail a two-step solution-based process to produce Bi2Te3–Cu2xTe heteronanostructures, based on the growth of Cu2xTe nanocrystals on the surface of Bi2Te3 nanowires. We characterize the structural and chemical properties of the synthesized nanostructures and of the nanocomposites\r\nproduced by hot-pressing the particles at moderate temperatures. Besides, the transport properties of the nanocomposites are investigated as a function of the amount of Cu introduced. Overall, the presence of Cu decreases the material thermal conductivity through promotion of phonon scattering, modulates the charge carrier concentration through electron spillover, and increases the Seebeck coefficient through filtering of charge carriers at energy barriers. These effects result in an improvement of over 50% of the thermoelectric figure of merit of Bi2Te3.","lang":"eng"}],"title":"Bismuth telluride-copper telluride nanocomposites from heterostructured building blocks","page":"14092-14099","article_type":"original","publication_status":"published","date_created":"2020-11-09T08:37:51Z","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2020","_id":"8747","intvolume":"         8","doi":"10.1039/D0TC02182B","publication":"Journal of Materials Chemistry C","acknowledgement":"This work was supported by the European Regional Development Funds and by the Spanish Ministerio de Economı´a y\r\nCompetitividad through the project SEHTOP (ENE2016-77798-C4-3-R). Y. Z. and X. H., thank the China Scholarship Council for scholarship support. M. C. has received funding from the European Union’s Horizon 2020 Research and Innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. M. I. acknowledges financial support from IST Austria. Y. L. acknowledges funding from the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie grant agreement no. 754411. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat \r\nAuto`noma de Barcelona Materials Science PhD program.","type":"journal_article"},{"scopus_import":"1","oa_version":"Preprint","arxiv":1,"quality_controlled":"1","conference":{"name":"MEMOCODE: Conference on Formal Methods and Models for System Design","start_date":"2020-12-02","end_date":"2020-12-04","location":"Virtual Conference"},"month":"12","day":"04","date_published":"2020-12-04T00:00:00Z","external_id":{"arxiv":["2006.12325"],"isi":["000661920400013"]},"article_processing_charge":"No","author":[{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"full_name":"Freire, Daniel","last_name":"Freire","first_name":"Daniel"},{"last_name":"Schilling","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"}],"status":"public","publication_identifier":{"isbn":["9781728191485"]},"isi":1,"department":[{"_id":"ToHe"}],"date_updated":"2025-04-15T06:26:12Z","citation":{"short":"M. Forets, D. Freire, C. Schilling, in:, 18th ACM-IEEE International Conference on Formal Methods and Models for System Design, IEEE, 2020.","apa":"Forets, M., Freire, D., &#38; Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. Virtual Conference: IEEE. <a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">https://doi.org/10.1109/MEMOCODE51338.2020.9314994</a>","ista":"Forets M, Freire D, Schilling C. 2020. Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. MEMOCODE: Conference on Formal Methods and Models for System Design, 9314994.","ieee":"M. Forets, D. Freire, and C. Schilling, “Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions,” in <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>, Virtual Conference, 2020.","chicago":"Forets, Marcelo, Daniel Freire, and Christian Schilling. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.” In <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">https://doi.org/10.1109/MEMOCODE51338.2020.9314994</a>.","mla":"Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.” <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>, 9314994, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">10.1109/MEMOCODE51338.2020.9314994</a>.","ama":"Forets M, Freire D, Schilling C. Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In: <i>18th ACM-IEEE International Conference on Formal Methods and Models for System Design</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/MEMOCODE51338.2020.9314994\">10.1109/MEMOCODE51338.2020.9314994</a>"},"publisher":"IEEE","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"Efficiently handling time-triggered and possibly nondeterministic switches\r\nfor hybrid systems reachability is a challenging task. In this paper we present\r\nan approach based on conservative set-based enclosure of the dynamics that can\r\nhandle systems with uncertain parameters and inputs, where the uncertainties\r\nare bound to given intervals. The method is evaluated on the plant model of an\r\nexperimental electro-mechanical braking system with periodic controller. In\r\nthis model, the fast-switching controller dynamics requires simulation time\r\nscales of the order of nanoseconds. Accurate set-based computations for\r\nrelatively large time horizons are known to be expensive. However, by\r\nappropriately decoupling the time variable with respect to the spatial\r\nvariables, and enclosing the uncertain parameters using interval matrix maps\r\nacting on zonotopes, we show that the computation time can be lowered to 5000\r\ntimes faster with respect to previous works. This is a step forward in formal\r\nverification of hybrid systems because reduced run-times allow engineers to\r\nintroduce more expressiveness in their models with a relatively inexpensive\r\ncomputational cost."}],"title":"Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions","publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.12325"}],"article_number":"9314994","language":[{"iso":"eng"}],"date_created":"2020-11-10T07:04:57Z","year":"2020","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8750","doi":"10.1109/MEMOCODE51338.2020.9314994","publication":"18th ACM-IEEE International Conference on Formal Methods and Models for System Design","type":"conference"}]