[{"type":"journal_article","abstract":[{"lang":"eng","text":" We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but do so under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding. Our proof is based on the construction and analysis of binary polar codes with large kernels. When communicating reliably at rates within ε>0 of capacity, the code length n often scales as O(1/εμ), where the constant μ is called the scaling exponent. It is known that the optimal scaling exponent is μ=2, and it is achieved by random linear codes. The scaling exponent of conventional polar codes (based on the 2×2 kernel) on the BEC is μ=3.63. This falls far short of the optimal scaling guaranteed by random codes. Our main contribution is a rigorous proof of the following result: for the BEC, there exist ℓ×ℓ binary kernels, such that polar codes constructed from these kernels achieve scaling exponent μ(ℓ) that tends to the optimal value of 2 as ℓ grows. We furthermore characterize precisely how large ℓ needs to be as a function of the gap between μ(ℓ) and 2. The resulting binary codes maintain the recursive structure of conventional polar codes, and thereby achieve construction complexity O(n) and encoding/decoding complexity O(nlogn)."}],"issue":"9","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"9002","title":"Binary linear codes with optimal scaling: Polar codes with large kernels","status":"public","intvolume":" 67","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"IEEE Transactions on Information Theory","citation":{"mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” IEEE Transactions on Information Theory, vol. 67, no. 9, IEEE, 2021, pp. 5693–710, doi:10.1109/TIT.2020.3038806.","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, IEEE Transactions on Information Theory 67 (2021) 5693–5710.","chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” IEEE Transactions on Information Theory. IEEE, 2021. https://doi.org/10.1109/TIT.2020.3038806.","ama":"Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. 2021;67(9):5693-5710. doi:10.1109/TIT.2020.3038806","ista":"Fazeli A, Hassani H, Mondelli M, Vardy A. 2021. Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. 67(9), 5693–5710.","apa":"Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2021). Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2020.3038806","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” IEEE Transactions on Information Theory, vol. 67, no. 9. IEEE, pp. 5693–5710, 2021."},"article_type":"original","page":"5693-5710","date_published":"2021-09-01T00:00:00Z","year":"2021","publication_status":"published","publisher":"IEEE","department":[{"_id":"MaMo"}],"author":[{"full_name":"Fazeli, Arman","first_name":"Arman","last_name":"Fazeli"},{"first_name":"Hamed","last_name":"Hassani","full_name":"Hassani, Hamed"},{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"full_name":"Vardy, Alexander","first_name":"Alexander","last_name":"Vardy"}],"related_material":{"record":[{"id":"6665","relation":"earlier_version","status":"public"}]},"date_created":"2021-01-10T23:01:18Z","date_updated":"2024-03-07T12:18:50Z","volume":67,"month":"09","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"external_id":{"arxiv":["1711.01339"]},"quality_controlled":"1","doi":"10.1109/TIT.2020.3038806","language":[{"iso":"eng"}]},{"ddc":["570"],"title":"Regulation of size and scale in vertebrate spinal cord development","status":"public","_id":"7883","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"checksum":"f0a7745d48afa09ea7025e876a0145a8","date_updated":"2020-11-24T13:11:39Z","date_created":"2020-11-24T13:11:39Z","file_id":"8800","relation":"main_file","creator":"dernst","file_size":2527276,"content_type":"application/pdf","access_level":"open_access","file_name":"2020_WIREs_DevBio_KuzmiczKowalska.pdf"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"All vertebrates have a spinal cord with dimensions and shape specific to their species. Yet how species‐specific organ size and shape are achieved is a fundamental unresolved question in biology. The formation and sculpting of organs begins during embryonic development. As it develops, the spinal cord extends in anterior–posterior direction in synchrony with the overall growth of the body. The dorsoventral (DV) and apicobasal lengths of the spinal cord neuroepithelium also change, while at the same time a characteristic pattern of neural progenitor subtypes along the DV axis is established and elaborated. At the basis of these changes in tissue size and shape are biophysical determinants, such as the change in cell number, cell size and shape, and anisotropic tissue growth. These processes are controlled by global tissue‐scale regulators, such as morphogen signaling gradients as well as mechanical forces. Current challenges in the field are to uncover how these tissue‐scale regulatory mechanisms are translated to the cellular and molecular level, and how regulation of distinct cellular processes gives rise to an overall defined size. Addressing these questions will help not only to achieve a better understanding of how size is controlled, but also of how tissue size is coordinated with the specification of pattern.","lang":"eng"}],"article_type":"original","citation":{"chicago":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental Biology. Wiley, 2021. https://doi.org/10.1002/wdev.383.","short":"K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental Biology (2021).","mla":"Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental Biology, e383, Wiley, 2021, doi:10.1002/wdev.383.","apa":"Kuzmicz-Kowalska, K., & Kicheva, A. (2021). Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology. Wiley. https://doi.org/10.1002/wdev.383","ieee":"K. Kuzmicz-Kowalska and A. Kicheva, “Regulation of size and scale in vertebrate spinal cord development,” Wiley Interdisciplinary Reviews: Developmental Biology. Wiley, 2021.","ista":"Kuzmicz-Kowalska K, Kicheva A. 2021. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology., e383.","ama":"Kuzmicz-Kowalska K, Kicheva A. Regulation of size and scale in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology. 2021. doi:10.1002/wdev.383"},"publication":"Wiley Interdisciplinary Reviews: Developmental Biology","date_published":"2021-04-15T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"15","department":[{"_id":"AnKi"}],"publisher":"Wiley","publication_status":"published","pmid":1,"acknowledgement":"Austrian Academy of Sciences, Grant/Award Number: DOC fellowship for Katarzyna Kuzmicz-Kowalska; Austrian Science Fund, Grant/Award Number: F78 (Stem Cell Modulation); H2020 European Research Council, Grant/Award Number: 680037","year":"2021","date_updated":"2024-03-07T15:03:00Z","date_created":"2020-05-24T22:01:00Z","related_material":{"record":[{"id":"14323","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"4CED352A-F248-11E8-B48F-1D18A9856A87","last_name":"Kuzmicz-Kowalska","first_name":"Katarzyna","full_name":"Kuzmicz-Kowalska, Katarzyna"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna"}],"article_number":"e383","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"file_date_updated":"2020-11-24T13:11:39Z","project":[{"call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037"},{"name":"The role of morphogens in the regulation of neural tube growth","_id":"267AF0E4-B435-11E9-9278-68D0E5697425"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F07802","name":"Morphogen control of growth and pattern in the spinal cord"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000531419400001"],"pmid":["32391980"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1002/wdev.383","publication_identifier":{"eissn":["17597692"],"issn":["17597684"]},"month":"04"},{"citation":{"ieee":"A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” Discrete and Computational Geometry, vol. 65. Springer Nature, pp. 1166–1198, 2021.","apa":"Brown, A., & Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00206-y","ista":"Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.","ama":"Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198. doi:10.1007/s00454-020-00206-y","chicago":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00206-y.","short":"A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.","mla":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:10.1007/s00454-020-00206-y."},"publication":"Discrete and Computational Geometry","page":"1166-1198","article_type":"original","date_published":"2021-06-01T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","_id":"7905","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 65","title":"Sheaf-theoretic stratification learning from geometric and topological perspectives","ddc":["510"],"status":"public","oa_version":"Published Version","file":[{"date_updated":"2020-11-25T09:06:41Z","date_created":"2020-11-25T09:06:41Z","success":1,"checksum":"487a84ea5841b75f04f66d7ebd71b67e","file_id":"8803","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":1013730,"file_name":"2020_DiscreteCompGeometry_Brown.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"text":"We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2), 195–222, 2020). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000536324700001"],"arxiv":["1712.07734"]},"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"isi":1,"quality_controlled":"1","doi":"10.1007/s00454-020-00206-y","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"06","year":"2021","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375. The authors would like to thank the anonymous referees for their insightful comments.","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","author":[{"full_name":"Brown, Adam","id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam","last_name":"Brown"},{"full_name":"Wang, Bei","last_name":"Wang","first_name":"Bei"}],"volume":65,"date_updated":"2024-03-07T15:01:58Z","date_created":"2020-05-30T10:26:04Z","file_date_updated":"2020-11-25T09:06:41Z"},{"article_type":"original","citation":{"ista":"Cipolloni G, Erdös L, Schröder DJ. 2021. Edge universality for non-Hermitian random matrices. Probability Theory and Related Fields.","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Edge universality for non-Hermitian random matrices,” Probability Theory and Related Fields. Springer Nature, 2021.","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2021). Edge universality for non-Hermitian random matrices. Probability Theory and Related Fields. Springer Nature. https://doi.org/10.1007/s00440-020-01003-7","ama":"Cipolloni G, Erdös L, Schröder DJ. Edge universality for non-Hermitian random matrices. Probability Theory and Related Fields. 2021. doi:10.1007/s00440-020-01003-7","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Edge Universality for Non-Hermitian Random Matrices.” Probability Theory and Related Fields. Springer Nature, 2021. https://doi.org/10.1007/s00440-020-01003-7.","mla":"Cipolloni, Giorgio, et al. “Edge Universality for Non-Hermitian Random Matrices.” Probability Theory and Related Fields, Springer Nature, 2021, doi:10.1007/s00440-020-01003-7.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability Theory and Related Fields (2021)."},"publication":"Probability Theory and Related Fields","date_published":"2021-02-01T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","status":"public","title":"Edge universality for non-Hermitian random matrices","ddc":["510"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"8601","file":[{"creator":"dernst","content_type":"application/pdf","file_size":497032,"access_level":"open_access","file_name":"2020_ProbTheory_Cipolloni.pdf","success":1,"checksum":"611ae28d6055e1e298d53a57beb05ef4","date_updated":"2020-10-05T14:53:40Z","date_created":"2020-10-05T14:53:40Z","file_id":"8612","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"We consider large non-Hermitian real or complex random matrices X with independent, identically distributed centred entries. We prove that their local eigenvalue statistics near the spectral edge, the unit circle, coincide with those of the Ginibre ensemble, i.e. when the matrix elements of X are Gaussian. This result is the non-Hermitian counterpart of the universality of the Tracy–Widom distribution at the spectral edges of the Wigner ensemble."}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"external_id":{"arxiv":["1908.00969"],"isi":["000572724600002"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00440-020-01003-7","publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"month":"02","department":[{"_id":"LaEr"}],"publisher":"Springer Nature","publication_status":"published","year":"2021","date_created":"2020-10-04T22:01:37Z","date_updated":"2024-03-07T15:07:53Z","author":[{"full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","first_name":"Giorgio"},{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schröder, Dominik J","last_name":"Schröder","first_name":"Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"file_date_updated":"2020-10-05T14:53:40Z"},{"ddc":["510"],"title":"New inertial relaxed method for solving split feasibilities","status":"public","intvolume":" 15","_id":"7925","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2021_OptimizationLetters_Shehu.pdf","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","file_size":2148882,"file_id":"15089","relation":"main_file","date_updated":"2024-03-07T14:58:51Z","date_created":"2024-03-07T14:58:51Z","success":1,"checksum":"63c5f31cd04626152a19f97a2476281b"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"In this paper, we introduce a relaxed CQ method with alternated inertial step for solving split feasibility problems. We give convergence of the sequence generated by our method under some suitable assumptions. Some numerical implementations from sparse signal and image deblurring are reported to show the efficiency of our method."}],"article_type":"original","page":"2109-2126","publication":"Optimization Letters","citation":{"ieee":"Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” Optimization Letters, vol. 15. Springer Nature, pp. 2109–2126, 2021.","apa":"Shehu, Y., & Gibali, A. (2021). New inertial relaxed method for solving split feasibilities. Optimization Letters. Springer Nature. https://doi.org/10.1007/s11590-020-01603-1","ista":"Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126.","ama":"Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. Optimization Letters. 2021;15:2109-2126. doi:10.1007/s11590-020-01603-1","chicago":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” Optimization Letters. Springer Nature, 2021. https://doi.org/10.1007/s11590-020-01603-1.","short":"Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.","mla":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” Optimization Letters, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:10.1007/s11590-020-01603-1."},"date_published":"2021-09-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Springer Nature","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are grateful to the referees for their insightful comments which have improved the earlier version of the manuscript greatly. The first author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","year":"2021","date_created":"2020-06-04T11:28:33Z","date_updated":"2024-03-07T15:00:43Z","volume":15,"author":[{"full_name":"Shehu, Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","first_name":"Yekini","last_name":"Shehu"},{"first_name":"Aviv","last_name":"Gibali","full_name":"Gibali, Aviv"}],"file_date_updated":"2024-03-07T14:58:51Z","ec_funded":1,"quality_controlled":"1","isi":1,"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000537342300001"]},"language":[{"iso":"eng"}],"doi":"10.1007/s11590-020-01603-1","month":"09","publication_identifier":{"issn":["1862-4472"],"eissn":["1862-4480"]}},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","page":"2947–2967","article_type":"original","citation":{"chicago":"Vandael, David H, Yuji Okamoto, Carolina Borges Merjane, Victor M Vargas Barroso, Benjamin Suter, and Peter M Jonas. “Subcellular Patch-Clamp Techniques for Single-Bouton Stimulation and Simultaneous Pre- and Postsynaptic Recording at Cortical Synapses.” Nature Protocols. Springer Nature, 2021. https://doi.org/10.1038/s41596-021-00526-0.","mla":"Vandael, David H., et al. “Subcellular Patch-Clamp Techniques for Single-Bouton Stimulation and Simultaneous Pre- and Postsynaptic Recording at Cortical Synapses.” Nature Protocols, vol. 16, no. 6, Springer Nature, 2021, pp. 2947–2967, doi:10.1038/s41596-021-00526-0.","short":"D.H. Vandael, Y. Okamoto, C. Borges Merjane, V.M. Vargas Barroso, B. Suter, P.M. Jonas, Nature Protocols 16 (2021) 2947–2967.","ista":"Vandael DH, Okamoto Y, Borges Merjane C, Vargas Barroso VM, Suter B, Jonas PM. 2021. Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. 16(6), 2947–2967.","ieee":"D. H. Vandael, Y. Okamoto, C. Borges Merjane, V. M. Vargas Barroso, B. Suter, and P. M. Jonas, “Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses,” Nature Protocols, vol. 16, no. 6. Springer Nature, pp. 2947–2967, 2021.","apa":"Vandael, D. H., Okamoto, Y., Borges Merjane, C., Vargas Barroso, V. M., Suter, B., & Jonas, P. M. (2021). Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. Springer Nature. https://doi.org/10.1038/s41596-021-00526-0","ama":"Vandael DH, Okamoto Y, Borges Merjane C, Vargas Barroso VM, Suter B, Jonas PM. Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses. Nature Protocols. 2021;16(6):2947–2967. doi:10.1038/s41596-021-00526-0"},"publication":"Nature Protocols","date_published":"2021-06-01T00:00:00Z","type":"journal_article","issue":"6","abstract":[{"text":"Rigorous investigation of synaptic transmission requires analysis of unitary synaptic events by simultaneous recording from presynaptic terminals and postsynaptic target neurons. However, this has been achieved at only a limited number of model synapses, including the squid giant synapse and the mammalian calyx of Held. Cortical presynaptic terminals have been largely inaccessible to direct presynaptic recording, due to their small size. Here, we describe a protocol for improved subcellular patch-clamp recording in rat and mouse brain slices, with the synapse in a largely intact environment. Slice preparation takes ~2 h, recording ~3 h and post hoc morphological analysis 2 d. Single presynaptic hippocampal mossy fiber terminals are stimulated minimally invasively in the bouton-attached configuration, in which the cytoplasmic content remains unperturbed, or in the whole-bouton configuration, in which the cytoplasmic composition can be precisely controlled. Paired pre–postsynaptic recordings can be integrated with biocytin labeling and morphological analysis, allowing correlative investigation of synapse structure and function. Paired recordings can be obtained from mossy fiber terminals in slices from both rats and mice, implying applicability to genetically modified synapses. Paired recordings can also be performed together with axon tract stimulation or optogenetic activation, allowing comparison of unitary and compound synaptic events in the same target cell. Finally, paired recordings can be combined with spontaneous event analysis, permitting collection of miniature events generated at a single identified synapse. In conclusion, the subcellular patch-clamp techniques detailed here should facilitate analysis of biophysics, plasticity and circuit function of cortical synapses in the mammalian central nervous system.","lang":"eng"}],"intvolume":" 16","status":"public","ddc":["570"],"title":"Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses","_id":"9438","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"embargo":"2021-12-01","file_id":"9639","relation":"main_file","checksum":"7eb580abd8893cdb0b410cf41bc8c263","date_updated":"2021-12-02T23:30:05Z","date_created":"2021-07-08T12:27:55Z","access_level":"open_access","file_name":"VandaeletalAuthorVersion2021.pdf","creator":"cziletti","content_type":"application/pdf","file_size":38574802}],"oa_version":"Submitted Version","publication_identifier":{"issn":["17542189"],"eissn":["17502799"]},"month":"06","project":[{"grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020"},{"grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Structural plasticity at mossy fiber-CA3 synapses","call_identifier":"FWF","_id":"2696E7FE-B435-11E9-9278-68D0E5697425","grant_number":"V00739"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000650528700003"],"pmid":["33990799"]},"oa":1,"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"}],"doi":"10.1038/s41596-021-00526-0","ec_funded":1,"file_date_updated":"2021-12-02T23:30:05Z","department":[{"_id":"PeJo"}],"publisher":"Springer Nature","publication_status":"published","pmid":1,"acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J., V 739-B27 to C.B.M.). We are grateful to F. Marr and C. Altmutter for excellent technical assistance and cell reconstruction, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria, especially T. Asenov and Miba machine shop, for maximally efficient support.","year":"2021","volume":16,"date_created":"2021-05-30T22:01:24Z","date_updated":"2023-08-10T22:30:51Z","author":[{"full_name":"Vandael, David H","first_name":"David H","last_name":"Vandael","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676"},{"id":"3337E116-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0408-6094","first_name":"Yuji","last_name":"Okamoto","full_name":"Okamoto, Yuji"},{"full_name":"Borges Merjane, Carolina","first_name":"Carolina","last_name":"Borges Merjane","id":"4305C450-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0005-401X"},{"last_name":"Vargas Barroso","first_name":"Victor M","id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87","full_name":"Vargas Barroso, Victor M"},{"full_name":"Suter, Benjamin","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9885-6936","first_name":"Benjamin","last_name":"Suter"},{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M"}]},{"related_material":{"record":[{"id":"6351","relation":"part_of_dissertation","status":"public"},{"id":"6943","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8002"}]},"author":[{"full_name":"Hörmayer, Lukas","orcid":"0000-0001-8295-2926","id":"2EEE7A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Hörmayer","first_name":"Lukas"}],"date_updated":"2023-09-07T13:38:33Z","date_created":"2021-09-09T07:37:20Z","year":"2021","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","ec_funded":1,"file_date_updated":"2021-09-15T22:30:26Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","doi":"10.15479/at:ista:9992","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"supervisor":[{"full_name":"Friml, Jiří","first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"degree_awarded":"PhD","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"project":[{"_id":"262EF96E-B435-11E9-9278-68D0E5697425","grant_number":"P29988","call_identifier":"FWF","name":"RNA-directed DNA methylation in plant development"},{"_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"}],"publication_identifier":{"issn":["2663-337X"]},"month":"09","file":[{"relation":"source_file","file_id":"9993","checksum":"c763064adaa720e16066c1a4f9682bbb","date_created":"2021-09-09T07:29:48Z","date_updated":"2021-09-15T22:30:26Z","access_level":"closed","embargo_to":"open_access","file_name":"Thesis_vupload.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":25179004,"creator":"lhoermaye"},{"content_type":"application/pdf","file_size":6246900,"creator":"lhoermaye","file_name":"Thesis_vfinal_pdfa.pdf","access_level":"open_access","date_created":"2021-09-09T14:25:08Z","date_updated":"2021-09-15T22:30:26Z","checksum":"53911b06e93d7cdbbf4c7f4c162fa70f","relation":"main_file","file_id":"9996","embargo":"2021-09-09"}],"oa_version":"Published Version","_id":"9992","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Wound healing in the Arabidopsis root meristem","status":"public","ddc":["575"],"abstract":[{"lang":"eng","text":"Blood – this is what animals use to heal wounds fast and efficient. Plants do not have blood circulation and their cells cannot move. However, plants have evolved remarkable capacities to regenerate tissues and organs preventing further damage. In my PhD research, I studied the wound healing in the Arabidopsis root. I used a UV laser to ablate single cells in the root tip and observed the consequent wound healing. Interestingly, the inner adjacent cells induced a\r\ndivision plane switch and subsequently adopted the cell type of the killed cell to replace it. We termed this form of wound healing “restorative divisions”. This initial observation triggered the questions of my PhD studies: How and why do cells orient their division planes, how do they feel the wound and why does this happen only in inner adjacent cells.\r\nFor answering these questions, I used a quite simple experimental setup: 5 day - old seedlings were stained with propidium iodide to visualize cell walls and dead cells; ablation was carried out using a special laser cutter and a confocal microscope. Adaptation of the novel vertical microscope system made it possible to observe wounds in real time. This revealed that restorative divisions occur at increased frequency compared to normal divisions. Additionally,\r\nthe major plant hormone auxin accumulates in wound adjacent cells and drives the expression of the wound-stress responsive transcription factor ERF115. Using this as a marker gene for wound responses, we found that an important part of wound signalling is the sensing of the collapse of the ablated cell. The collapse causes a radical pressure drop, which results in strong tissue deformations. These deformations manifest in an invasion of the now free spot specifically by the inner adjacent cells within seconds, probably because of higher pressure of the inner tissues. Long-term imaging revealed that those deformed cells continuously expand towards the wound hole and that this is crucial for the restorative division. These wound-expanding cells exhibit an abnormal, biphasic polarity of microtubule arrays\r\nbefore the division. Experiments inhibiting cell expansion suggest that it is the biphasic stretching that induces those MT arrays. Adapting the micromanipulator aspiration system from animal scientists at our institute confirmed the hypothesis that stretching influences microtubule stability. In conclusion, this shows that microtubules react to tissue deformation\r\nand this facilitates the observed division plane switch. This puts mechanical cues and tensions at the most prominent position for explaining the growth and wound healing properties of plants. Hence, it shines light onto the importance of understanding mechanical signal transduction. "}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2021-09-13T00:00:00Z","citation":{"ama":"Hörmayer L. Wound healing in the Arabidopsis root meristem. 2021. doi:10.15479/at:ista:9992","ista":"Hörmayer L. 2021. Wound healing in the Arabidopsis root meristem. Institute of Science and Technology Austria.","ieee":"L. Hörmayer, “Wound healing in the Arabidopsis root meristem,” Institute of Science and Technology Austria, 2021.","apa":"Hörmayer, L. (2021). Wound healing in the Arabidopsis root meristem. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9992","mla":"Hörmayer, Lukas. Wound Healing in the Arabidopsis Root Meristem. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9992.","short":"L. Hörmayer, Wound Healing in the Arabidopsis Root Meristem, Institute of Science and Technology Austria, 2021.","chicago":"Hörmayer, Lukas. “Wound Healing in the Arabidopsis Root Meristem.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9992."},"page":"168","has_accepted_license":"1","article_processing_charge":"No","day":"13"},{"ec_funded":1,"file_date_updated":"2022-06-18T22:30:03Z","volume":1,"date_created":"2022-03-04T08:32:36Z","date_updated":"2023-08-10T22:30:10Z","related_material":{"record":[{"id":"10110","status":"public","relation":"software"}],"link":[{"url":"https://ista.ac.at/en/news/spot-the-difference/","relation":"press_release"}]},"author":[{"full_name":"Guzmán, José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242","first_name":"José","last_name":"Guzmán"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl","full_name":"Schlögl, Alois"},{"full_name":"Espinoza Martinez, Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082","first_name":"Claudia ","last_name":"Espinoza Martinez"},{"id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","first_name":"Xiaomin","last_name":"Zhang","full_name":"Zhang, Xiaomin"},{"full_name":"Suter, Benjamin","orcid":"0000-0002-9885-6936","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","last_name":"Suter","first_name":"Benjamin"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"PeJo"}],"publisher":"Springer Nature","publication_status":"published","year":"2021","acknowledgement":"We thank A. Aertsen, N. Kopell, W. Maass, A. Roth, F. Stella and T. Vogels for critically reading earlier versions of the manuscript. We are grateful to F. Marr and C. Altmutter for excellent technical assistance, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria for efficient support. Finally, we thank T. Carnevale, L. Erdös, M. Hines, D. Nykamp and D. Schröder for useful discussions, and R. Friedrich and S. Wiechert for sharing unpublished data. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692, P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J. and P 31815 to S.J.G.).","publication_identifier":{"issn":["2662-8457"]},"month":"12","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"doi":"10.1038/s43588-021-00157-1","project":[{"call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/647800","open_access":"1"}],"issue":"12","abstract":[{"lang":"eng","text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks."}],"type":"journal_article","oa_version":"Submitted Version","file":[{"creator":"patrickd","file_size":1699466,"content_type":"application/pdf","access_level":"open_access","file_name":"Guzmanetal2021.pdf","checksum":"9fec5b667909ef52be96d502e4f8c2ae","date_updated":"2022-06-18T22:30:03Z","date_created":"2022-06-02T12:51:07Z","embargo":"2022-06-17","file_id":"11430","relation":"main_file"},{"access_level":"open_access","file_name":"Guzmanetal2021Suppl.pdf","creator":"patrickd","file_size":3005651,"content_type":"application/pdf","file_id":"11431","embargo":"2022-06-17","title":"Supplementary Material","relation":"supplementary_material","checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","date_updated":"2022-06-18T22:30:03Z","date_created":"2022-06-02T12:53:47Z"}],"intvolume":" 1","status":"public","ddc":["610"],"title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10816","article_processing_charge":"No","has_accepted_license":"1","day":"16","keyword":["general medicine"],"scopus_import":"1","date_published":"2021-12-16T00:00:00Z","page":"830-842","article_type":"original","citation":{"chicago":"Guzmán, José, Alois Schlögl, Claudia Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” Nature Computational Science. Springer Nature, 2021. https://doi.org/10.1038/s43588-021-00157-1.","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","mla":"Guzmán, José, et al. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” Nature Computational Science, vol. 1, no. 12, Springer Nature, 2021, pp. 830–42, doi:10.1038/s43588-021-00157-1.","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network,” Nature Computational Science, vol. 1, no. 12. Springer Nature, pp. 830–842, 2021.","apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., & Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-021-00157-1","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 1(12), 830–842.","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 2021;1(12):830-842. doi:10.1038/s43588-021-00157-1"},"publication":"Nature Computational Science"},{"has_accepted_license":"1","month":"12","day":"16","tmp":{"short":"GPL 3.0","name":"GNU General Public License 3.0","legal_code_url":"https://www.gnu.org/licenses/gpl-3.0.en.html"},"oa":1,"citation":{"mla":"Guzmán, José, et al. How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network. IST Austria, 2021, doi:10.15479/AT:ISTA:10110.","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, (2021).","chicago":"Guzmán, José, Alois Schlögl, Claudia Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” IST Austria, 2021. https://doi.org/10.15479/AT:ISTA:10110.","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. 2021. doi:10.15479/AT:ISTA:10110","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network, IST Austria, 10.15479/AT:ISTA:10110.","apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., & Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. IST Austria. https://doi.org/10.15479/AT:ISTA:10110","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network.” IST Austria, 2021."},"date_published":"2021-12-16T00:00:00Z","doi":"10.15479/AT:ISTA:10110","type":"software","license":"https://opensource.org/licenses/GPL-3.0","file_date_updated":"2021-10-08T08:46:04Z","abstract":[{"text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.","lang":"eng"}],"department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"publisher":"IST Austria","ddc":["005"],"status":"public","title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10110","year":"2021","file":[{"success":1,"checksum":"f92f8931cad0aa7e411c1715337bf408","date_updated":"2021-10-08T08:46:04Z","date_created":"2021-10-08T08:46:04Z","file_id":"10114","relation":"main_file","creator":"cchlebak","file_size":332990101,"content_type":"application/x-zip-compressed","access_level":"open_access","file_name":"patternseparation-main (1).zip"}],"date_created":"2021-10-08T06:44:22Z","date_updated":"2024-03-28T23:30:11Z","related_material":{"record":[{"id":"10816","status":"public","relation":"used_for_analysis_in"}],"link":[{"description":"News on IST Webpage","relation":"press_release","url":"https://ist.ac.at/en/news/spot-the-difference/"}]},"author":[{"last_name":"Guzmán","first_name":"José","orcid":"0000-0003-2209-5242","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","full_name":"Guzmán, José"},{"full_name":"Schlögl, Alois","first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100"},{"last_name":"Espinoza Martinez","first_name":"Claudia ","orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","full_name":"Espinoza Martinez, Claudia "},{"full_name":"Zhang, Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","first_name":"Xiaomin","last_name":"Zhang"},{"full_name":"Suter, Benjamin","first_name":"Benjamin","last_name":"Suter","id":"4952F31E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9885-6936"},{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}]},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11932"}]},"author":[{"full_name":"Nardin, Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570","first_name":"Michele","last_name":"Nardin"},{"full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gašper","last_name":"Tkačik"},{"full_name":"Savin, Cristina","id":"3933349E-F248-11E8-B48F-1D18A9856A87","last_name":"Savin","first_name":"Cristina"}],"oa_version":"Preprint","date_created":"2021-10-04T06:23:34Z","date_updated":"2024-03-28T23:30:16Z","_id":"10077","year":"2021","acknowledgement":"We thank Peter Baracskay, Karola Kaefer and Hugo Malagon-Vina for the acquisition of the data. We thank Federico Stella for comments on an earlier version of the manuscript. MN was supported by European Union Horizon 2020 grant 665385, JC was supported by European Research Council consolidator grant 281511, GT was supported by the Austrian Science Fund (FWF) grant P34015, CS was supported by an IST fellow grant, National Institute of Mental Health Award 1R01MH125571-01, by the National Science Foundation under NSF Award No. 1922658 and a Google faculty award.","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Cold Spring Harbor Laboratory","department":[{"_id":"GradSch"},{"_id":"JoCs"},{"_id":"GaTk"}],"status":"public","title":"The structure of hippocampal CA1 interactions optimizes spatial coding across experience","publication_status":"submitted","ec_funded":1,"abstract":[{"lang":"eng","text":"Although much is known about how single neurons in the hippocampus represent an animal’s position, how cell-cell interactions contribute to spatial coding remains poorly understood. Using a novel statistical estimator and theoretical modeling, both developed in the framework of maximum entropy models, we reveal highly structured cell-to-cell interactions whose statistics depend on familiar vs. novel environment. In both conditions the circuit interactions optimize the encoding of spatial information, but for regimes that differ in the signal-to-noise ratio of their spatial inputs. Moreover, the topology of the interactions facilitates linear decodability, making the information easy to read out by downstream circuits. These findings suggest that the efficient coding hypothesis is not applicable only to individual neuron properties in the sensory periphery, but also to neural interactions in the central brain."}],"type":"preprint","date_published":"2021-09-29T00:00:00Z","doi":"10.1101/2021.09.28.460602","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/2021.09.28.460602"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"citation":{"ama":"Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv. doi:10.1101/2021.09.28.460602","apa":"Nardin, M., Csicsvari, J. L., Tkačik, G., & Savin, C. (n.d.). The structure of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.09.28.460602","ieee":"M. Nardin, J. L. Csicsvari, G. Tkačik, and C. Savin, “The structure of hippocampal CA1 interactions optimizes spatial coding across experience,” bioRxiv. Cold Spring Harbor Laboratory.","ista":"Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv, 10.1101/2021.09.28.460602.","short":"M. Nardin, J.L. Csicsvari, G. Tkačik, C. Savin, BioRxiv (n.d.).","mla":"Nardin, Michele, et al. “The Structure of Hippocampal CA1 Interactions Optimizes Spatial Coding across Experience.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2021.09.28.460602.","chicago":"Nardin, Michele, Jozsef L Csicsvari, Gašper Tkačik, and Cristina Savin. “The Structure of Hippocampal CA1 Interactions Optimizes Spatial Coding across Experience.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.09.28.460602."},"publication":"bioRxiv","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"_id":"257A4776-B435-11E9-9278-68D0E5697425","grant_number":"281511","call_identifier":"FP7","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex"},{"name":"Efficient coding with biophysical realism","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","grant_number":"P34015"}],"article_processing_charge":"No","day":"29","month":"09"},{"publication_identifier":{"eissn":["1755-4349"],"issn":["1755-4330"]},"month":"03","doi":"10.1038/s41557-021-00643-z","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"}],"external_id":{"isi":["000629296400001"],"pmid":["33723377"]},"oa":1,"quality_controlled":"1","isi":1,"file_date_updated":"2021-09-16T22:30:03Z","author":[{"last_name":"Petit","first_name":"Yann K.","full_name":"Petit, Yann K."},{"full_name":"Mourad, Eléonore","first_name":"Eléonore","last_name":"Mourad"},{"first_name":"Christian","last_name":"Prehal","full_name":"Prehal, Christian"},{"first_name":"Christian","last_name":"Leypold","full_name":"Leypold, Christian"},{"full_name":"Windischbacher, Andreas","last_name":"Windischbacher","first_name":"Andreas"},{"full_name":"Mijailovic, Daniel","last_name":"Mijailovic","first_name":"Daniel"},{"full_name":"Slugovc, Christian","last_name":"Slugovc","first_name":"Christian"},{"first_name":"Sergey M.","last_name":"Borisov","full_name":"Borisov, Sergey M."},{"full_name":"Zojer, Egbert","first_name":"Egbert","last_name":"Zojer"},{"last_name":"Brutti","first_name":"Sergio","full_name":"Brutti, Sergio"},{"full_name":"Fontaine, Olivier","first_name":"Olivier","last_name":"Fontaine"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander"}],"volume":13,"date_created":"2021-03-16T11:12:20Z","date_updated":"2023-09-05T15:34:44Z","pmid":1,"acknowledgement":"S.A.F. is indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 636069) as well as IST Austria. O.F thanks the French National Research Agency (STORE-EX Labex Project ANR-10-LABX-76-01). We thank EL-Cell GmbH (Hamburg, Germany) for the pressure test cell. We thank R. Saf for help with the mass spectrometry, J. Schlegl for manufacturing instrumentation, M. Winkler of Acib GmbH, G. Strohmeier and R. Fürst for HPLC measurements and S. Mondal and S. Stadlbauer for kinetic measurements.","year":"2021","publisher":"Springer Nature","department":[{"_id":"StFr"}],"publication_status":"published","has_accepted_license":"1","article_processing_charge":"No","day":"15","scopus_import":"1","keyword":["General Chemistry","General Chemical Engineering"],"date_published":"2021-03-15T00:00:00Z","citation":{"mla":"Petit, Yann K., et al. “Mechanism of Mediated Alkali Peroxide Oxidation and Triplet versus Singlet Oxygen Formation.” Nature Chemistry, vol. 13, no. 5, Springer Nature, 2021, pp. 465–71, doi:10.1038/s41557-021-00643-z.","short":"Y.K. Petit, E. Mourad, C. Prehal, C. Leypold, A. Windischbacher, D. Mijailovic, C. Slugovc, S.M. Borisov, E. Zojer, S. Brutti, O. Fontaine, S.A. Freunberger, Nature Chemistry 13 (2021) 465–471.","chicago":"Petit, Yann K., Eléonore Mourad, Christian Prehal, Christian Leypold, Andreas Windischbacher, Daniel Mijailovic, Christian Slugovc, et al. “Mechanism of Mediated Alkali Peroxide Oxidation and Triplet versus Singlet Oxygen Formation.” Nature Chemistry. Springer Nature, 2021. https://doi.org/10.1038/s41557-021-00643-z.","ama":"Petit YK, Mourad E, Prehal C, et al. Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation. Nature Chemistry. 2021;13(5):465-471. doi:10.1038/s41557-021-00643-z","ista":"Petit YK, Mourad E, Prehal C, Leypold C, Windischbacher A, Mijailovic D, Slugovc C, Borisov SM, Zojer E, Brutti S, Fontaine O, Freunberger SA. 2021. Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation. Nature Chemistry. 13(5), 465–471.","ieee":"Y. K. Petit et al., “Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation,” Nature Chemistry, vol. 13, no. 5. Springer Nature, pp. 465–471, 2021.","apa":"Petit, Y. K., Mourad, E., Prehal, C., Leypold, C., Windischbacher, A., Mijailovic, D., … Freunberger, S. A. (2021). Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation. Nature Chemistry. Springer Nature. https://doi.org/10.1038/s41557-021-00643-z"},"publication":"Nature Chemistry","page":"465-471","article_type":"original","issue":"5","abstract":[{"lang":"eng","text":"Aprotic alkali metal–O2 batteries face two major obstacles to their chemistry occurring efficiently, the insulating nature of the formed alkali superoxides/peroxides and parasitic reactions that are caused by the highly reactive singlet oxygen (1O2). Redox mediators are recognized to be key for improving rechargeability. However, it is unclear how they affect 1O2 formation, which hinders strategies for their improvement. Here we clarify the mechanism of mediated peroxide and superoxide oxidation and thus explain how redox mediators either enhance or suppress 1O2 formation. We show that charging commences with peroxide oxidation to a superoxide intermediate and that redox potentials above ~3.5 V versus Li/Li+ drive 1O2 evolution from superoxide oxidation, while disproportionation always generates some 1O2. We find that 1O2 suppression requires oxidation to be faster than the generation of 1O2 from disproportionation. Oxidation rates decrease with growing driving force following Marcus inverted-region behaviour, establishing a region of maximum rate."}],"type":"journal_article","oa_version":"Submitted Version","file":[{"checksum":"3ee3f8dd79ed1b7bb0929fce184c8012","date_created":"2021-03-22T11:46:00Z","date_updated":"2021-09-16T22:30:03Z","file_id":"9276","embargo":"2021-09-15","relation":"main_file","creator":"dernst","file_size":1811448,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_NatureChem_Petit_acceptedVersion.pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9250","intvolume":" 13","ddc":["540"],"status":"public","title":"Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation"},{"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"CaHe"}],"year":"2021","date_updated":"2023-09-07T13:33:27Z","date_created":"2021-07-01T14:50:17Z","author":[{"full_name":"Caballero Mancebo, Silvia","first_name":"Silvia","last_name":"Caballero Mancebo","id":"2F1E1758-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5223-3346"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9750"},{"relation":"part_of_dissertation","status":"public","id":"9006"}]},"file_date_updated":"2022-07-02T22:30:06Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"supervisor":[{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"NanoFab"},{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"doi":"10.15479/at:ista:9623","month":"07","publication_identifier":{"isbn":["978-3-99078-012-1"],"issn":["2663-337X"]},"ddc":["570"],"title":"Fertilization-induced deformations are controlled by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9623","oa_version":"Published Version","file":[{"embargo_to":"open_access","file_name":"PhDThesis_SCM.docx","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":131946790,"creator":"scaballe","relation":"source_file","file_id":"9624","date_created":"2021-07-01T14:48:54Z","date_updated":"2022-07-02T22:30:06Z","checksum":"e039225a47ef32666d59bf35ddd30ecf"},{"embargo":"2022-07-01","file_id":"9625","relation":"main_file","date_created":"2021-07-01T14:46:25Z","date_updated":"2022-07-02T22:30:06Z","checksum":"dd4d78962ea94ad95e97ca7d9af08f4b","file_name":"PhDThesis_SCM.pdf","access_level":"open_access","creator":"scaballe","file_size":17094958,"content_type":"application/pdf"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"Cytoplasmic reorganizations are essential for morphogenesis. In large cells like oocytes, these reorganizations become crucial in patterning the oocyte for later stages of embryonic development. Ascidians oocytes reorganize their cytoplasm (ooplasm) in a spectacular manner. Ooplasmic reorganization is initiated at fertilization with the contraction of the actomyosin cortex along the animal-vegetal axis of the oocyte, driving the accumulation of cortical endoplasmic reticulum (cER), maternal mRNAs associated to it and a mitochondria-rich subcortical layer – the myoplasm – in a region of the vegetal pole termed contraction pole (CP). Here we have used the species Phallusia mammillata to investigate the changes in cell shape that accompany these reorganizations and the mechanochemical mechanisms underlining CP formation.\r\nWe report that the length of the animal-vegetal (AV) axis oscillates upon fertilization: it first undergoes a cycle of fast elongation-lengthening followed by a slow expansion of mainly the vegetal pole (VP) of the cell. We show that the fast oscillation corresponds to a dynamic polarization of the actin cortex as a result of a fertilization-induced increase in cortical tension in the oocyte that triggers a rupture of the cortex at the animal pole and the establishment of vegetal-directed cortical flows. These flows are responsible for the vegetal accumulation of actin causing the VP to flatten. \r\nWe find that the slow expansion of the VP, leading to CP formation, correlates with a relaxation of the vegetal cortex and that the myoplasm plays a role in the expansion. We show that the myoplasm is a solid-like layer that buckles under compression forces arising from the contracting actin cortex at the VP. Straightening of the myoplasm when actin flows stops, facilitates the expansion of the VP and the CP. Altogether, our results present a previously unrecognized role for the myoplasm in ascidian ooplasmic segregation. \r\n","lang":"eng"}],"page":"111","citation":{"chicago":"Caballero Mancebo, Silvia. “Fertilization-Induced Deformations Are Controlled by the Actin Cortex and a Mitochondria-Rich Subcortical Layer in Ascidian Oocytes.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9623.","mla":"Caballero Mancebo, Silvia. Fertilization-Induced Deformations Are Controlled by the Actin Cortex and a Mitochondria-Rich Subcortical Layer in Ascidian Oocytes. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9623.","short":"S. Caballero Mancebo, Fertilization-Induced Deformations Are Controlled by the Actin Cortex and a Mitochondria-Rich Subcortical Layer in Ascidian Oocytes, Institute of Science and Technology Austria, 2021.","ista":"Caballero Mancebo S. 2021. Fertilization-induced deformations are controlled by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes. Institute of Science and Technology Austria.","ieee":"S. Caballero Mancebo, “Fertilization-induced deformations are controlled by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes,” Institute of Science and Technology Austria, 2021.","apa":"Caballero Mancebo, S. (2021). Fertilization-induced deformations are controlled by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9623","ama":"Caballero Mancebo S. Fertilization-induced deformations are controlled by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes. 2021. doi:10.15479/at:ista:9623"},"date_published":"2021-07-01T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No"},{"type":"journal_article","abstract":[{"text":"Cytoplasm is a gel-like crowded environment composed of various macromolecules, organelles, cytoskeletal networks, and cytosol. The structure of the cytoplasm is highly organized and heterogeneous due to the crowding of its constituents and their effective compartmentalization. In such an environment, the diffusive dynamics of the molecules are restricted, an effect that is further amplified by clustering and anchoring of molecules. Despite the crowded nature of the cytoplasm at the microscopic scale, large-scale reorganization of the cytoplasm is essential for important cellular functions, such as cell division and polarization. How such mesoscale reorganization of the cytoplasm is achieved, especially for large cells such as oocytes or syncytial tissues that can span hundreds of micrometers in size, is only beginning to be understood. In this review, we will discuss recent advances in elucidating the molecular, cellular, and biophysical mechanisms by which the cytoskeleton drives cytoplasmic reorganization across different scales, structures, and species.","lang":"eng"}],"issue":"2","title":"Cytoplasm's got moves","status":"public","intvolume":" 56","_id":"9006","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","scopus_import":"1","day":"25","article_processing_charge":"No","article_type":"original","page":"P213-226","publication":"Developmental Cell","citation":{"chicago":"Shamipour, Shayan, Silvia Caballero Mancebo, and Carl-Philipp J Heisenberg. “Cytoplasm’s Got Moves.” Developmental Cell. Elsevier, 2021. https://doi.org/10.1016/j.devcel.2020.12.002.","short":"S. Shamipour, S. Caballero Mancebo, C.-P.J. Heisenberg, Developmental Cell 56 (2021) P213-226.","mla":"Shamipour, Shayan, et al. “Cytoplasm’s Got Moves.” Developmental Cell, vol. 56, no. 2, Elsevier, 2021, pp. P213-226, doi:10.1016/j.devcel.2020.12.002.","apa":"Shamipour, S., Caballero Mancebo, S., & Heisenberg, C.-P. J. (2021). Cytoplasm’s got moves. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2020.12.002","ieee":"S. Shamipour, S. Caballero Mancebo, and C.-P. J. Heisenberg, “Cytoplasm’s got moves,” Developmental Cell, vol. 56, no. 2. Elsevier, pp. P213-226, 2021.","ista":"Shamipour S, Caballero Mancebo S, Heisenberg C-PJ. 2021. Cytoplasm’s got moves. Developmental Cell. 56(2), P213-226.","ama":"Shamipour S, Caballero Mancebo S, Heisenberg C-PJ. Cytoplasm’s got moves. Developmental Cell. 2021;56(2):P213-226. doi:10.1016/j.devcel.2020.12.002"},"date_published":"2021-01-25T00:00:00Z","publication_status":"published","publisher":"Elsevier","department":[{"_id":"CaHe"}],"acknowledgement":"We would like to thank Justine Renno for illustrations and Edouard Hannezo and members of the Heisenberg group for their comments on previous versions of the manuscript.","year":"2021","pmid":1,"date_created":"2021-01-17T23:01:10Z","date_updated":"2024-03-28T23:30:19Z","volume":56,"author":[{"full_name":"Shamipour, Shayan","first_name":"Shayan","last_name":"Shamipour","id":"40B34FE2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Silvia","last_name":"Caballero Mancebo","id":"2F1E1758-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5223-3346","full_name":"Caballero Mancebo, Silvia"},{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"related_material":{"record":[{"id":"9623","relation":"dissertation_contains","status":"public"}]},"month":"01","publication_identifier":{"issn":["15345807"],"eissn":["18781551"]},"isi":1,"quality_controlled":"1","external_id":{"pmid":["33321104"],"isi":["000613273900009"]},"main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2020.12.002","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.devcel.2020.12.002"},{"ec_funded":1,"file_date_updated":"2021-05-28T12:39:43Z","article_number":"3058","volume":12,"date_created":"2021-05-28T11:49:46Z","date_updated":"2024-03-28T23:30:23Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"7800"},{"id":"12401","status":"public","relation":"dissertation_contains"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/defective-gene-slows-down-brain-cells/"}]},"author":[{"id":"4739D480-F248-11E8-B48F-1D18A9856A87","first_name":"Jasmin","last_name":"Morandell","full_name":"Morandell, Jasmin"},{"full_name":"Schwarz, Lena A","id":"29A8453C-F248-11E8-B48F-1D18A9856A87","first_name":"Lena A","last_name":"Schwarz"},{"full_name":"Basilico, Bernadette","first_name":"Bernadette","last_name":"Basilico","id":"36035796-5ACA-11E9-A75E-7AF2E5697425","orcid":"0000-0003-1843-3173"},{"last_name":"Tasciyan","first_name":"Saren","orcid":"0000-0003-1671-393X","id":"4323B49C-F248-11E8-B48F-1D18A9856A87","full_name":"Tasciyan, Saren"},{"last_name":"Dimchev","first_name":"Georgi A","orcid":"0000-0001-8370-6161","id":"38C393BE-F248-11E8-B48F-1D18A9856A87","full_name":"Dimchev, Georgi A"},{"full_name":"Nicolas, Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87","last_name":"Nicolas","first_name":"Armel"},{"last_name":"Sommer","first_name":"Christoph M","orcid":"0000-0003-1216-9105","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","full_name":"Sommer, Christoph M"},{"last_name":"Kreuzinger","first_name":"Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kreuzinger, Caroline"},{"first_name":"Christoph","last_name":"Dotter","id":"4C66542E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9033-9096","full_name":"Dotter, Christoph"},{"id":"3B2ABCF4-F248-11E8-B48F-1D18A9856A87","last_name":"Knaus","first_name":"Lisa","full_name":"Knaus, Lisa"},{"full_name":"Dobler, Zoe","first_name":"Zoe","last_name":"Dobler","id":"D23090A2-9057-11EA-883A-A8396FC7A38F"},{"full_name":"Cacci, Emanuele","last_name":"Cacci","first_name":"Emanuele"},{"full_name":"Schur, Florian KM","first_name":"Florian KM","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078"},{"first_name":"Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G"},{"full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178"}],"publisher":"Springer Nature","department":[{"_id":"GaNo"},{"_id":"JoDa"},{"_id":"FlSc"},{"_id":"MiSi"},{"_id":"LifeSc"},{"_id":"Bio"}],"publication_status":"published","acknowledgement":"We thank A. Coll Manzano, F. Freeman, M. Ladron de Guevara, and A. Ç. Yahya for technical assistance, S. Deixler, A. Lepold, and A. Schlerka for the management of our animal colony, as well as M. Schunn and the Preclinical Facility team for technical assistance. We thank K. Heesom and her team at the University of Bristol Proteomics Facility for the proteomics sample preparation, data generation, and analysis support. We thank Y. B. Simon for kindly providing the plasmid for lentiviral labeling. Further, we thank M. Sixt for his advice regarding cell migration and the fruitful discussions. This work was supported by the ISTPlus postdoctoral fellowship (Grant Agreement No. 754411) to B.B., by the European Union’s Horizon 2020 research and innovation program (ERC) grant 715508 (REVERSEAUTISM), and by the Austrian Science Fund (FWF) to G.N. (DK W1232-B24 and SFB F7807-B) and to J.G.D (I3600-B27).","year":"2021","publication_identifier":{"eissn":["2041-1723"]},"month":"05","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"PreCl"}],"doi":"10.1038/s41467-021-23123-x","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models","grant_number":"715508","_id":"25444568-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Drug Targets","call_identifier":"FWF","grant_number":"W1232-B24","_id":"2548AE96-B435-11E9-9278-68D0E5697425"},{"grant_number":"F07807","_id":"05A0D778-7A3F-11EA-A408-12923DDC885E","name":"Neural stem cells in autism and epilepsy"},{"call_identifier":"FWF","name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600","_id":"265CB4D0-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000658769900010"]},"issue":"1","abstract":[{"text":"De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3 lead to autism spectrum disorder (ASD). In mouse, constitutive haploinsufficiency leads to motor coordination deficits as well as ASD-relevant social and cognitive impairments. However, induction of Cul3 haploinsufficiency later in life does not lead to ASD-relevant behaviors, pointing to an important role of Cul3 during a critical developmental window. Here we show that Cul3 is essential to regulate neuronal migration and, therefore, constitutive Cul3 heterozygous mutant mice display cortical lamination abnormalities. At the molecular level, we found that Cul3 controls neuronal migration by tightly regulating the amount of Plastin3 (Pls3), a previously unrecognized player of neural migration. Furthermore, we found that Pls3 cell-autonomously regulates cell migration by regulating actin cytoskeleton organization, and its levels are inversely proportional to neural migration speed. Finally, we provide evidence that cellular phenotypes associated with autism-linked gene haploinsufficiency can be rescued by transcriptional activation of the intact allele in vitro, offering a proof of concept for a potential therapeutic approach for ASDs.","lang":"eng"}],"type":"journal_article","file":[{"date_created":"2021-05-28T12:39:43Z","date_updated":"2021-05-28T12:39:43Z","checksum":"337e0f7959c35ec959984cacdcb472ba","success":1,"relation":"main_file","file_id":"9430","file_size":9358599,"content_type":"application/pdf","creator":"kschuh","file_name":"2021_NatureCommunications_Morandell.pdf","access_level":"open_access"}],"oa_version":"Published Version","intvolume":" 12","ddc":["572"],"status":"public","title":"Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development","_id":"9429","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","has_accepted_license":"1","day":"24","keyword":["General Biochemistry","Genetics and Molecular Biology"],"date_published":"2021-05-24T00:00:00Z","article_type":"original","citation":{"ista":"Morandell J, Schwarz LA, Basilico B, Tasciyan S, Dimchev GA, Nicolas A, Sommer CM, Kreuzinger C, Dotter C, Knaus L, Dobler Z, Cacci E, Schur FK, Danzl JG, Novarino G. 2021. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. Nature Communications. 12(1), 3058.","ieee":"J. Morandell et al., “Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.","apa":"Morandell, J., Schwarz, L. A., Basilico, B., Tasciyan, S., Dimchev, G. A., Nicolas, A., … Novarino, G. (2021). Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-23123-x","ama":"Morandell J, Schwarz LA, Basilico B, et al. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-23123-x","chicago":"Morandell, Jasmin, Lena A Schwarz, Bernadette Basilico, Saren Tasciyan, Georgi A Dimchev, Armel Nicolas, Christoph M Sommer, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-23123-x.","mla":"Morandell, Jasmin, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” Nature Communications, vol. 12, no. 1, 3058, Springer Nature, 2021, doi:10.1038/s41467-021-23123-x.","short":"J. Morandell, L.A. Schwarz, B. Basilico, S. Tasciyan, G.A. Dimchev, A. Nicolas, C.M. Sommer, C. Kreuzinger, C. Dotter, L. Knaus, Z. Dobler, E. Cacci, F.K. Schur, J.G. Danzl, G. Novarino, Nature Communications 12 (2021)."},"publication":"Nature Communications"},{"_id":"10058","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases","status":"public","ddc":["621","539"],"file":[{"file_id":"10061","relation":"source_file","date_updated":"2022-12-20T23:30:07Z","date_created":"2021-09-30T14:29:14Z","checksum":"ad6bcb24083ed7c02baaf1885c9ea3d5","file_name":"PHD_Thesis_Jirovec_Source.zip","embargo_to":"open_access","access_level":"closed","creator":"djirovec","file_size":32397600,"content_type":"application/x-zip-compressed"},{"file_name":"PHD_Thesis_pdfa2b_1.pdf","access_level":"open_access","content_type":"application/pdf","file_size":26910829,"creator":"djirovec","relation":"main_file","file_id":"10087","embargo":"2022-10-06","date_created":"2021-10-05T07:56:49Z","date_updated":"2022-12-20T23:30:07Z","checksum":"5fbe08d4f66d1153e04c47971538fae8"}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"Quantum information and computation has become a vast field paved with opportunities for researchers and investors. As large multinational companies and international funds are heavily investing in quantum technologies it is still a question which platform is best suited for the task of realizing a scalable quantum processor. In this work we investigate hole spins in Ge quantum wells. These hold great promise as they possess several favorable properties: a small effective mass, a strong spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine noise. All these characteristics helped Ge hole spin qubits to evolve from a single qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated a qubit approach leveraging the large out-of-plane g-factors of heavy hole states in Ge quantum dots. We found this qubit to be reproducibly operable at extremely low magnetic field and at large speeds while maintaining coherence. This was possible because large differences of g-factors in adjacent dots can be achieved in the out-of-plane direction. In the in-plane direction the small g-factors, on the other hand, can be altered very effectively by the confinement potentials. Here, we found that this can even lead to a sign change of the g-factors. The resulting g-factor difference alters the dynamics of the system drastically and produces effects typically attributed to a spin-orbit induced spin-flip term. The investigations carried out in this thesis give further insights into the possibilities of holes in Ge and reveal new physical properties that need to be considered when designing future spin qubit experiments.","lang":"eng"}],"citation":{"ama":"Jirovec D. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases. 2021. doi:10.15479/at:ista:10058","ista":"Jirovec D. 2021. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases. Institute of Science and Technology Austria.","apa":"Jirovec, D. (2021). Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10058","ieee":"D. Jirovec, “Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases,” Institute of Science and Technology Austria, 2021.","mla":"Jirovec, Daniel. Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional Ge Hole Gases. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10058.","short":"D. Jirovec, Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional Ge Hole Gases, Institute of Science and Technology Austria, 2021.","chicago":"Jirovec, Daniel. “Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional Ge Hole Gases.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10058."},"page":"151","date_published":"2021-10-05T00:00:00Z","keyword":["qubits","quantum computing","holes"],"has_accepted_license":"1","article_processing_charge":"No","day":"05","acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No P30207, and the Nomis foundation.","year":"2021","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"8831"},{"id":"10065","status":"public","relation":"part_of_dissertation"},{"id":"10066","relation":"part_of_dissertation","status":"public"},{"id":"8909","status":"public","relation":"part_of_dissertation"},{"id":"5816","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Jirovec, Daniel","last_name":"Jirovec","first_name":"Daniel","orcid":"0000-0002-7197-4801","id":"4C473F58-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2021-09-30T07:53:49Z","date_updated":"2023-09-08T11:41:08Z","file_date_updated":"2022-12-20T23:30:07Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"Hole spin orbit qubits in Ge quantum wells","call_identifier":"FWF","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207"}],"doi":"10.15479/at:ista:10058","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"publication_identifier":{"issn":["2663-337X"]},"month":"10"},{"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Nature Materials","citation":{"ama":"Jirovec D, Hofmann AC, Ballabio A, et al. A singlet triplet hole spin qubit in planar Ge. Nature Materials. 2021;20(8):1106–1112. doi:10.1038/s41563-021-01022-2","ista":"Jirovec D, Hofmann AC, Ballabio A, Mutter PM, Tavani G, Botifoll M, Crippa A, Kukucka J, Sagi O, Martins F, Saez Mollejo J, Prieto Gonzalez I, Borovkov M, Arbiol J, Chrastina D, Isella G, Katsaros G. 2021. A singlet triplet hole spin qubit in planar Ge. Nature Materials. 20(8), 1106–1112.","apa":"Jirovec, D., Hofmann, A. C., Ballabio, A., Mutter, P. M., Tavani, G., Botifoll, M., … Katsaros, G. (2021). A singlet triplet hole spin qubit in planar Ge. Nature Materials. Springer Nature. https://doi.org/10.1038/s41563-021-01022-2","ieee":"D. Jirovec et al., “A singlet triplet hole spin qubit in planar Ge,” Nature Materials, vol. 20, no. 8. Springer Nature, pp. 1106–1112, 2021.","mla":"Jirovec, Daniel, et al. “A Singlet Triplet Hole Spin Qubit in Planar Ge.” Nature Materials, vol. 20, no. 8, Springer Nature, 2021, pp. 1106–1112, doi:10.1038/s41563-021-01022-2.","short":"D. Jirovec, A.C. Hofmann, A. Ballabio, P.M. Mutter, G. Tavani, M. Botifoll, A. Crippa, J. Kukucka, O. Sagi, F. Martins, J. Saez Mollejo, I. Prieto Gonzalez, M. Borovkov, J. Arbiol, D. Chrastina, G. Isella, G. Katsaros, Nature Materials 20 (2021) 1106–1112.","chicago":"Jirovec, Daniel, Andrea C Hofmann, Andrea Ballabio, Philipp M. Mutter, Giulio Tavani, Marc Botifoll, Alessandro Crippa, et al. “A Singlet Triplet Hole Spin Qubit in Planar Ge.” Nature Materials. Springer Nature, 2021. https://doi.org/10.1038/s41563-021-01022-2."},"article_type":"original","page":"1106–1112","date_published":"2021-08-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Spin qubits are considered to be among the most promising candidates for building a quantum processor. Group IV hole spin qubits have moved into the focus of interest due to the ease of operation and compatibility with Si technology. In addition, Ge offers the option for monolithic superconductor-semiconductor integration. Here we demonstrate a hole spin qubit operating at fields below 10 mT, the critical field of Al, by exploiting the large out-of-plane hole g-factors in planar Ge and by encoding the qubit into the singlet-triplet states of a double quantum dot. We observe electrically controlled X and Z-rotations with tunable frequencies exceeding 100 MHz and dephasing times of 1μs which we extend beyond 15μs with echo techniques. These results show that Ge hole singlet triplet qubits outperform their electronic Si and GaAs based counterparts in speed and coherence, respectively. In addition, they are on par with Ge single spin qubits, but can be operated at much lower fields underlining their potential for on chip integration with superconducting technologies.","lang":"eng"}],"issue":"8","_id":"8909","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"A singlet triplet hole spin qubit in planar Ge","status":"public","intvolume":" 20","oa_version":"Preprint","month":"08","publication_identifier":{"eissn":["1476-4660"],"issn":["1476-1122"]},"oa":1,"external_id":{"arxiv":["2011.13755"],"isi":["000657596400001"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.13755"}],"isi":1,"quality_controlled":"1","project":[{"name":"Majorana bound states in Ge/SiGe heterostructures","call_identifier":"H2020","grant_number":"844511","_id":"26A151DA-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"FWF","name":"Hole spin orbit qubits in Ge quantum wells","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207"},{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"262116AA-B435-11E9-9278-68D0E5697425"}],"doi":"10.1038/s41563-021-01022-2","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"ec_funded":1,"year":"2021","acknowledgement":"This research was supported by the Scientific Service Units of Institute of Science and Technology (IST) Austria through resources provided by the Miba Machine Shop and the nanofabrication facility, and was made possible with the support of the NOMIS Foundation. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under Marie Sklodowska-Curie grant agreements no. 844511 and no. 75441, and by the Austrian Science Fund FWF-P 30207 project. A.B. acknowledges support from the European Union Horizon 2020 FET project microSPIRE, no. 766955. M. Botifoll and J.A. acknowledge funding from Generalitat de Catalunya 2017 SGR 327. The Catalan Institute of Nanoscience and Nanotechnology (ICN2) is supported by the Severo Ochoa programme from the Spanish Ministery of Economy (MINECO) (grant no. SEV-2017-0706) and is funded by the Catalonian Research Centre (CERCA) Programme, Generalitat de Catalunya. Part of the present work has been performed within the framework of the Universitat Autónoma de Barcelona Materials Science PhD programme. Part of the HAADF scanning transmission electron microscopy was conducted in the Laboratorio de Microscopias Avanzadas at Instituto de Nanociencia de Aragon, Universidad de Zaragoza. ICN2 acknowledge support from the Spanish Superior Council of Scientific Research (CSIC) Research Platform on Quantum Technologies PTI-001. M.B. acknowledges funding from the Catalan Agency for Management of University and Research Grants (AGAUR) Generalitat de Catalunya formation of investigators (FI) PhD grant.","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"GeKa"},{"_id":"NanoFab"},{"_id":"GradSch"}],"author":[{"full_name":"Jirovec, Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7197-4801","first_name":"Daniel","last_name":"Jirovec"},{"id":"340F461A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea C","last_name":"Hofmann","full_name":"Hofmann, Andrea C"},{"full_name":"Ballabio, Andrea","first_name":"Andrea","last_name":"Ballabio"},{"full_name":"Mutter, Philipp M.","last_name":"Mutter","first_name":"Philipp M."},{"first_name":"Giulio","last_name":"Tavani","full_name":"Tavani, Giulio"},{"first_name":"Marc","last_name":"Botifoll","full_name":"Botifoll, Marc"},{"first_name":"Alessandro","last_name":"Crippa","id":"1F2B21A2-F6E7-11E9-9B82-F7DBE5697425","orcid":"0000-0002-2968-611X","full_name":"Crippa, Alessandro"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","last_name":"Kukucka"},{"full_name":"Sagi, Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","last_name":"Sagi","first_name":"Oliver"},{"full_name":"Martins, Frederico","last_name":"Martins","first_name":"Frederico","orcid":"0000-0003-2668-2401","id":"38F80F9A-1CB8-11EA-BC76-B49B3DDC885E"},{"first_name":"Jaime","last_name":"Saez Mollejo","id":"e0390f72-f6e0-11ea-865d-862393336714","full_name":"Saez Mollejo, Jaime"},{"last_name":"Prieto Gonzalez","first_name":"Ivan","orcid":"0000-0002-7370-5357","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","full_name":"Prieto Gonzalez, Ivan"},{"full_name":"Borovkov, Maksim","first_name":"Maksim","last_name":"Borovkov","id":"2ac7a0a2-3562-11eb-9256-fbd18ea55087"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"first_name":"Daniel","last_name":"Chrastina","full_name":"Chrastina, Daniel"},{"first_name":"Giovanni","last_name":"Isella","full_name":"Isella, Giovanni"},{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios"}],"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/quantum-computing-with-holes/"}],"record":[{"id":"9323","status":"public","relation":"research_data"},{"relation":"dissertation_contains","status":"public","id":"10058"}]},"date_updated":"2024-03-28T23:30:27Z","date_created":"2020-12-02T10:50:47Z","volume":20},{"month":"05","publication_identifier":{"issn":["2663-337X"]},"oa":1,"doi":"10.15479/at:ista:9397","supervisor":[{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"file_date_updated":"2022-05-21T22:30:04Z","year":"2021","publication_status":"published","department":[{"_id":"CaHe"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","author":[{"last_name":"Huljev","first_name":"Karla","id":"44C6F6A6-F248-11E8-B48F-1D18A9856A87","full_name":"Huljev, Karla"}],"date_created":"2021-05-17T12:31:30Z","date_updated":"2023-09-07T13:32:32Z","day":"18","article_processing_charge":"No","has_accepted_license":"1","citation":{"ama":"Huljev K. Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation. 2021. doi:10.15479/at:ista:9397","ieee":"K. Huljev, “Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation,” Institute of Science and Technology Austria, 2021.","apa":"Huljev, K. (2021). Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9397","ista":"Huljev K. 2021. Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation. Institute of Science and Technology Austria.","short":"K. Huljev, Coordinated Spatiotemporal Reorganization of Interstitial Fluid Is Required for Axial Mesendoderm Migration in Zebrafish Gastrulation, Institute of Science and Technology Austria, 2021.","mla":"Huljev, Karla. Coordinated Spatiotemporal Reorganization of Interstitial Fluid Is Required for Axial Mesendoderm Migration in Zebrafish Gastrulation. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9397.","chicago":"Huljev, Karla. “Coordinated Spatiotemporal Reorganization of Interstitial Fluid Is Required for Axial Mesendoderm Migration in Zebrafish Gastrulation.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9397."},"page":"101","date_published":"2021-05-18T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Accumulation of interstitial fluid (IF) between embryonic cells is a common phenomenon in vertebrate embryogenesis. Unlike other model systems, where these accumulations coalesce into a large central cavity – the blastocoel, in zebrafish, IF is more uniformly distributed between the deep cells (DC) before the onset of gastrulation. This is likely due to the presence of a large extraembryonic structure – the yolk cell (YC) at the position where the blastocoel typically forms in other model organisms. IF has long been speculated to play a role in tissue morphogenesis during embryogenesis, but direct evidence supporting such function is still sparse. Here we show that the relocalization of IF to the interface between the YC and DC/epiblast is critical for axial mesendoderm (ME) cell protrusion formation and migration along this interface, a key process in embryonic axis formation. We further demonstrate that axial ME cell migration and IF relocalization engage in a positive feedback loop, where axial ME migration triggers IF accumulation ahead of the advancing axial ME tissue by mechanically compressing the overlying epiblast cell layer. Upon compression, locally induced flow relocalizes the IF through the porous epiblast tissue resulting in an IF accumulation ahead of the leading axial ME. This IF accumulation, in turn, promotes cell protrusion formation and migration of the leading axial ME cells, thereby facilitating axial ME extension. Our findings reveal a central role of dynamic IF relocalization in orchestrating germ layer morphogenesis during gastrulation."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9397","status":"public","title":"Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation","ddc":["571"],"oa_version":"Published Version","file":[{"file_id":"9398","relation":"source_file","checksum":"7f98532f5324a0b2f3fa8de2967baa19","date_created":"2021-05-17T12:29:12Z","date_updated":"2022-05-21T22:30:04Z","access_level":"closed","file_name":"KHuljev_Thesis_corrections.docx","embargo_to":"open_access","creator":"khuljev","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":47799741},{"relation":"main_file","file_id":"9401","embargo":"2022-05-20","date_created":"2021-05-18T14:50:28Z","date_updated":"2022-05-21T22:30:04Z","checksum":"bf512f8a1e572a543778fc4b227c01ba","file_name":"new_KHuljev_Thesis_corrections.pdf","access_level":"open_access","file_size":16542131,"content_type":"application/pdf","creator":"khuljev"}]},{"article_number":"2107.12975","type":"preprint","abstract":[{"text":"The potential of Si and SiGe-based devices for the scaling of quantum circuits is tainted by device variability. Each device needs to be tuned to operation conditions. We give a key step towards tackling this variability with an algorithm that, without modification, is capable of tuning a 4-gate Si FinFET, a 5-gate GeSi nanowire and a 7-gate SiGe heterostructure double quantum dot device from scratch. We achieve tuning times of 30, 10, and 92 minutes, respectively. The algorithm also provides insight into the parameter space landscape for each of these devices. These results show that overarching solutions for the tuning of quantum devices are enabled by machine learning.","lang":"eng"}],"status":"public","title":"Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning","publication_status":"submitted","department":[{"_id":"GeKa"}],"_id":"10066","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We acknowledge Ang Li, Erik P. A. M. Bakkers (University of Eindhoven) for the fabrication of the Ge/Si nanowire. This work was supported by the Royal Society, the EPSRC National Quantum Technology Hub in Networked Quantum Information Technology (EP/M013243/1), Quantum Technology Capital (EP/N014995/1), EPSRC Platform Grant\r\n(EP/R029229/1), the European Research Council (Grant agreement 948932), the Swiss Nanoscience Institute, the\r\nNCCR SPIN, the EU H2020 European Microkelvin Platform EMP grant No. 824109, the Scientific Service Units\r\nof IST Austria through resources provided by the nanofabrication facility and, the FWF-P30207 project. This publication was also made possible through support from Templeton World Charity Foundation and John Templeton Foundation. The opinions expressed in this publication are those of the authors and do not necessarily reflect the views of the Templeton Foundations.","date_updated":"2024-03-28T23:30:27Z","date_created":"2021-10-01T12:40:22Z","oa_version":"Preprint","author":[{"full_name":"Severin, B.","last_name":"Severin","first_name":"B."},{"full_name":"Lennon, D. T.","first_name":"D. T.","last_name":"Lennon"},{"full_name":"Camenzind, L. C.","first_name":"L. C.","last_name":"Camenzind"},{"first_name":"F.","last_name":"Vigneau","full_name":"Vigneau, F."},{"last_name":"Fedele","first_name":"F.","full_name":"Fedele, F."},{"first_name":"Daniel","last_name":"Jirovec","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7197-4801","full_name":"Jirovec, Daniel"},{"full_name":"Ballabio, A.","first_name":"A.","last_name":"Ballabio"},{"full_name":"Chrastina, D.","last_name":"Chrastina","first_name":"D."},{"last_name":"Isella","first_name":"G.","full_name":"Isella, G."},{"last_name":"Kruijf","first_name":"M. de","full_name":"Kruijf, M. de"},{"first_name":"M. J.","last_name":"Carballido","full_name":"Carballido, M. J."},{"full_name":"Svab, S.","first_name":"S.","last_name":"Svab"},{"full_name":"Kuhlmann, A. V.","first_name":"A. V.","last_name":"Kuhlmann"},{"full_name":"Braakman, F. R.","first_name":"F. R.","last_name":"Braakman"},{"full_name":"Geyer, S.","first_name":"S.","last_name":"Geyer"},{"full_name":"Froning, F. N. M.","first_name":"F. N. M.","last_name":"Froning"},{"full_name":"Moon, H.","first_name":"H.","last_name":"Moon"},{"full_name":"Osborne, M. A.","last_name":"Osborne","first_name":"M. A."},{"last_name":"Sejdinovic","first_name":"D.","full_name":"Sejdinovic, D."},{"full_name":"Katsaros, Georgios","first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X"},{"full_name":"Zumbühl, D. M.","first_name":"D. M.","last_name":"Zumbühl"},{"full_name":"Briggs, G. A. D.","last_name":"Briggs","first_name":"G. A. D."},{"first_name":"N.","last_name":"Ares","full_name":"Ares, N."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10058"}]},"day":"27","month":"07","article_processing_charge":"No","project":[{"_id":"2641CE5E-B435-11E9-9278-68D0E5697425","grant_number":"P30207","name":"Hole spin orbit qubits in Ge quantum wells","call_identifier":"FWF"}],"publication":"arXiv","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2107.12975","open_access":"1"}],"citation":{"ista":"Severin B, Lennon DT, Camenzind LC, Vigneau F, Fedele F, Jirovec D, Ballabio A, Chrastina D, Isella G, Kruijf M de, Carballido MJ, Svab S, Kuhlmann AV, Braakman FR, Geyer S, Froning FNM, Moon H, Osborne MA, Sejdinovic D, Katsaros G, Zumbühl DM, Briggs GAD, Ares N. Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. arXiv, 2107.12975.","apa":"Severin, B., Lennon, D. T., Camenzind, L. C., Vigneau, F., Fedele, F., Jirovec, D., … Ares, N. (n.d.). Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. arXiv. https://doi.org/10.48550/arXiv.2107.12975","ieee":"B. Severin et al., “Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning,” arXiv. .","ama":"Severin B, Lennon DT, Camenzind LC, et al. Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning. arXiv. doi:10.48550/arXiv.2107.12975","chicago":"Severin, B., D. T. Lennon, L. C. Camenzind, F. Vigneau, F. Fedele, Daniel Jirovec, A. Ballabio, et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum Devices Using Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2107.12975.","mla":"Severin, B., et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum Devices Using Machine Learning.” ArXiv, 2107.12975, doi:10.48550/arXiv.2107.12975.","short":"B. Severin, D.T. Lennon, L.C. Camenzind, F. Vigneau, F. Fedele, D. Jirovec, A. Ballabio, D. Chrastina, G. Isella, M. de Kruijf, M.J. Carballido, S. Svab, A.V. Kuhlmann, F.R. Braakman, S. Geyer, F.N.M. Froning, H. Moon, M.A. Osborne, D. Sejdinovic, G. Katsaros, D.M. Zumbühl, G.A.D. Briggs, N. Ares, ArXiv (n.d.)."},"oa":1,"external_id":{"arxiv":["2107.12975"]},"acknowledged_ssus":[{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2107.12975","date_published":"2021-07-27T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.7554/ELIFE.68274","isi":1,"quality_controlled":"1","project":[{"grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000651761700001"]},"month":"04","publication_identifier":{"eissn":["2050-084X"]},"date_updated":"2024-03-28T23:30:31Z","date_created":"2021-05-30T22:01:23Z","volume":10,"author":[{"last_name":"Bhandari","first_name":"Pradeep","orcid":"0000-0003-0863-4481","id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","full_name":"Bhandari, Pradeep"},{"full_name":"Vandael, David H","first_name":"David H","last_name":"Vandael","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676"},{"full_name":"Fernández-Fernández, Diego","first_name":"Diego","last_name":"Fernández-Fernández"},{"full_name":"Fritzius, Thorsten","last_name":"Fritzius","first_name":"Thorsten"},{"first_name":"David","last_name":"Kleindienst","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","full_name":"Kleindienst, David"},{"full_name":"Önal, Hüseyin C","orcid":"0000-0002-2771-2011","id":"4659D740-F248-11E8-B48F-1D18A9856A87","last_name":"Önal","first_name":"Hüseyin C"},{"full_name":"Montanaro-Punzengruber, Jacqueline-Claire","id":"3786AB44-F248-11E8-B48F-1D18A9856A87","first_name":"Jacqueline-Claire","last_name":"Montanaro-Punzengruber"},{"last_name":"Gassmann","first_name":"Martin","full_name":"Gassmann, Martin"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M"},{"full_name":"Kulik, Akos","first_name":"Akos","last_name":"Kulik"},{"full_name":"Bettler, Bernhard","first_name":"Bernhard","last_name":"Bettler"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3509-1948","first_name":"Peter","last_name":"Koppensteiner","full_name":"Koppensteiner, Peter"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9562"}],"link":[{"relation":"earlier_version","url":"https://doi.org/10.1101/2020.04.16.045112"}]},"publication_status":"published","publisher":"eLife Sciences Publications","department":[{"_id":"RySh"},{"_id":"PeJo"}],"year":"2021","acknowledgement":"We are grateful to Akari Hagiwara and Toshihisa Ohtsuka for CAST antibody, and Masahiko Watanabe for neurexin antibody. We thank David Adams for kindly providing the stable Cav2.3 cell line. Cav2.3 KO mice were kindly provided by Tsutomu Tanabe. This project has received funding from the European Research Council (ERC) and European Commission (EC), under the European Union’s Horizon 2020 research and innovation programme (ERC grant agreement no. 694539 to Ryuichi Shigemoto, no. 692692 to Peter Jonas, and the Marie Skłodowska-Curie grant agreement no. 665385 to Cihan Önal), the Swiss National Science Foundation Grant 31003A-172881 to Bernhard Bettler and Deutsche Forschungsgemeinschaft (For 2143) and BIOSS-2 to Akos Kulik.","file_date_updated":"2021-05-31T09:43:09Z","ec_funded":1,"article_number":"e68274","date_published":"2021-04-29T00:00:00Z","article_type":"original","publication":"eLife","citation":{"ista":"Bhandari P, Vandael DH, Fernández-Fernández D, Fritzius T, Kleindienst D, Önal HC, Montanaro-Punzengruber J-C, Gassmann M, Jonas PM, Kulik A, Bettler B, Shigemoto R, Koppensteiner P. 2021. GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals. eLife. 10, e68274.","apa":"Bhandari, P., Vandael, D. H., Fernández-Fernández, D., Fritzius, T., Kleindienst, D., Önal, H. C., … Koppensteiner, P. (2021). GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals. ELife. eLife Sciences Publications. https://doi.org/10.7554/ELIFE.68274","ieee":"P. Bhandari et al., “GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals,” eLife, vol. 10. eLife Sciences Publications, 2021.","ama":"Bhandari P, Vandael DH, Fernández-Fernández D, et al. GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals. eLife. 2021;10. doi:10.7554/ELIFE.68274","chicago":"Bhandari, Pradeep, David H Vandael, Diego Fernández-Fernández, Thorsten Fritzius, David Kleindienst, Hüseyin C Önal, Jacqueline-Claire Montanaro-Punzengruber, et al. “GABAB Receptor Auxiliary Subunits Modulate Cav2.3-Mediated Release from Medial Habenula Terminals.” ELife. eLife Sciences Publications, 2021. https://doi.org/10.7554/ELIFE.68274.","mla":"Bhandari, Pradeep, et al. “GABAB Receptor Auxiliary Subunits Modulate Cav2.3-Mediated Release from Medial Habenula Terminals.” ELife, vol. 10, e68274, eLife Sciences Publications, 2021, doi:10.7554/ELIFE.68274.","short":"P. Bhandari, D.H. Vandael, D. Fernández-Fernández, T. Fritzius, D. Kleindienst, H.C. Önal, J.-C. Montanaro-Punzengruber, M. Gassmann, P.M. Jonas, A. Kulik, B. Bettler, R. Shigemoto, P. Koppensteiner, ELife 10 (2021)."},"day":"29","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","file":[{"date_created":"2021-05-31T09:43:09Z","date_updated":"2021-05-31T09:43:09Z","checksum":"6ebcb79999f889766f7cd79ee134ad28","success":1,"relation":"main_file","file_id":"9440","content_type":"application/pdf","file_size":8174719,"creator":"cziletti","file_name":"2021_eLife_Bhandari.pdf","access_level":"open_access"}],"status":"public","ddc":["570"],"title":"GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals","intvolume":" 10","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9437","abstract":[{"text":"The synaptic connection from medial habenula (MHb) to interpeduncular nucleus (IPN) is critical for emotion-related behaviors and uniquely expresses R-type Ca2+ channels (Cav2.3) and auxiliary GABAB receptor (GBR) subunits, the K+-channel tetramerization domain-containing proteins (KCTDs). Activation of GBRs facilitates or inhibits transmitter release from MHb terminals depending on the IPN subnucleus, but the role of KCTDs is unknown. We therefore examined the localization and function of Cav2.3, GBRs, and KCTDs in this pathway in mice. We show in heterologous cells that KCTD8 and KCTD12b directly bind to Cav2.3 and that KCTD8 potentiates Cav2.3 currents in the absence of GBRs. In the rostral IPN, KCTD8, KCTD12b, and Cav2.3 co-localize at the presynaptic active zone. Genetic deletion indicated a bidirectional modulation of Cav2.3-mediated release by these KCTDs with a compensatory increase of KCTD8 in the active zone in KCTD12b-deficient mice. The interaction of Cav2.3 with KCTDs therefore scales synaptic strength independent of GBR activation.","lang":"eng"}],"type":"journal_article"},{"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"Left-right asymmetries can be considered a fundamental organizational principle of the vertebrate central nervous system. The hippocampal CA3-CA1 pyramidal cell synaptic connection shows an input-side dependent asymmetry where the hemispheric location of the presynaptic CA3 neuron determines the synaptic properties. Left-input synapses terminating on apical dendrites in stratum radiatum have a higher density of NMDA receptor subunit GluN2B, a lower density of AMPA receptor subunit GluA1 and smaller areas with less often perforated PSDs. On the other hand, left-input synapses terminating on basal dendrites in stratum oriens have lower GluN2B densities than right-input ones. Apical and basal synapses further employ different signaling pathways involved in LTP. SDS-digested freeze-fracture replica labeling can visualize synaptic membrane proteins with high sensitivity and resolution, and has been used to reveal the asymmetry at the electron microscopic level. However, it requires time-consuming manual demarcation of the synaptic surface for quantitative measurements. To facilitate the analysis of replica labeling, I first developed a software named Darea, which utilizes deep-learning to automatize this demarcation. With Darea I characterized the synaptic distribution of NMDA and AMPA receptors as well as the voltage-gated Ca2+ channels in CA1 stratum radiatum and oriens. Second, I explored the role of GluN2B and its carboxy-terminus in the establishment of input-side dependent hippocampal asymmetry. In conditional knock-out mice lacking GluN2B expression in CA1 and GluN2B-2A swap mice, where GluN2B carboxy-terminus was exchanged to that of GluN2A, no significant asymmetries of GluN2B, GluA1 and PSD area were detected. We further discovered a previously unknown functional asymmetry of GluN2A, which was also lost in the swap mouse. These results demonstrate that GluN2B carboxy-terminus plays a critical role in normal formation of input-side dependent asymmetry.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9562","ddc":["570"],"title":"2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning","status":"public","file":[{"relation":"main_file","embargo":"2022-07-01","file_id":"9563","date_created":"2021-06-17T14:03:14Z","date_updated":"2022-07-02T22:30:04Z","checksum":"659df5518db495f679cb1df9e9bd1d94","file_name":"Thesis.pdf","access_level":"open_access","content_type":"application/pdf","file_size":77299142,"creator":"dkleindienst"},{"date_created":"2021-06-17T14:04:30Z","date_updated":"2022-07-02T22:30:04Z","checksum":"3bcf63a2b19e5b6663be051bea332748","file_id":"9564","relation":"source_file","creator":"dkleindienst","content_type":"application/zip","file_size":369804895,"file_name":"Thesis_source.zip","embargo_to":"open_access","access_level":"closed"}],"oa_version":"Published Version","day":"01","article_processing_charge":"No","has_accepted_license":"1","citation":{"ama":"Kleindienst D. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. 2021. doi:10.15479/at:ista:9562","ista":"Kleindienst D. 2021. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. Institute of Science and Technology Austria.","apa":"Kleindienst, D. (2021). 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9562","ieee":"D. Kleindienst, “2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning,” Institute of Science and Technology Austria, 2021.","mla":"Kleindienst, David. 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9562.","short":"D. Kleindienst, 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning, Institute of Science and Technology Austria, 2021.","chicago":"Kleindienst, David. “2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9562."},"page":"124","date_published":"2021-06-01T00:00:00Z","file_date_updated":"2022-07-02T22:30:04Z","year":"2021","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"RySh"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Kleindienst, David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David","last_name":"Kleindienst"}],"related_material":{"record":[{"id":"9756","status":"public","relation":"part_of_dissertation"},{"id":"9437","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"8532"},{"status":"public","relation":"part_of_dissertation","id":"612"}]},"date_updated":"2023-09-11T12:55:53Z","date_created":"2021-06-17T14:10:47Z","month":"06","publication_identifier":{"issn":["2663-337X"]},"oa":1,"doi":"10.15479/at:ista:9562","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"EM-Fac"}],"supervisor":[{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"}],"language":[{"iso":"eng"}]},{"year":"2021","acknowledgement":"This work was supported by the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.) and the Austrian Academy of Sciences (DOC fellowship to D.K.).","publication_status":"published","department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"publisher":"Humana","author":[{"first_name":"Walter","last_name":"Kaufmann","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter"},{"last_name":"Kleindienst","first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","full_name":"Kleindienst, David"},{"last_name":"Harada","first_name":"Harumi","orcid":"0000-0001-7429-7896","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Harada, Harumi"},{"full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9562"}]},"date_updated":"2024-03-28T23:30:31Z","date_created":"2021-07-30T09:34:56Z","volume":169,"place":"New York","ec_funded":1,"quality_controlled":"1","project":[{"grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)","grant_number":"720270","_id":"25CBA828-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-1-0716-1522-5_19","language":[{"iso":"eng"}],"month":"07","publication_identifier":{"eisbn":["9781071615225"],"isbn":["9781071615218"]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9756","status":"public","title":"High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL)","ddc":["573"],"intvolume":" 169","oa_version":"None","type":"book_chapter","alternative_title":["Neuromethods"],"abstract":[{"lang":"eng","text":"High-resolution visualization and quantification of membrane proteins contribute to the understanding of their functions and the roles they play in physiological and pathological conditions. Sodium dodecyl sulfate-digested freeze-fracture replica labeling (SDS-FRL) is a powerful electron microscopy method to study quantitatively the two-dimensional distribution of transmembrane proteins and their tightly associated proteins. During treatment with SDS, intracellular organelles and proteins not anchored to the replica are dissolved, whereas integral membrane proteins captured and stabilized by carbon/platinum deposition remain on the replica. Their intra- and extracellular domains become exposed on the surface of the replica, facilitating the accessibility of antibodies and, therefore, providing higher labeling efficiency than those obtained with other immunoelectron microscopy techniques. In this chapter, we describe the protocols of SDS-FRL adapted for mammalian brain samples, and optimization of the SDS treatment to increase the labeling efficiency for quantification of Cav2.1, the alpha subunit of P/Q-type voltage-dependent calcium channels utilizing deep learning algorithms."}],"publication":" Receptor and Ion Channel Detection in the Brain","citation":{"chicago":"Kaufmann, Walter, David Kleindienst, Harumi Harada, and Ryuichi Shigemoto. “High-Resolution Localization and Quantitation of Membrane Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL).” In Receptor and Ion Channel Detection in the Brain, 169:267–83. Neuromethods. New York: Humana, 2021. https://doi.org/10.1007/978-1-0716-1522-5_19.","short":"W. Kaufmann, D. Kleindienst, H. Harada, R. Shigemoto, in:, Receptor and Ion Channel Detection in the Brain, Humana, New York, 2021, pp. 267–283.","mla":"Kaufmann, Walter, et al. “High-Resolution Localization and Quantitation of Membrane Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL).” Receptor and Ion Channel Detection in the Brain, vol. 169, Humana, 2021, pp. 267–83, doi:10.1007/978-1-0716-1522-5_19.","apa":"Kaufmann, W., Kleindienst, D., Harada, H., & Shigemoto, R. (2021). High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL). In Receptor and Ion Channel Detection in the Brain (Vol. 169, pp. 267–283). New York: Humana. https://doi.org/10.1007/978-1-0716-1522-5_19","ieee":"W. Kaufmann, D. Kleindienst, H. Harada, and R. Shigemoto, “High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL),” in Receptor and Ion Channel Detection in the Brain, vol. 169, New York: Humana, 2021, pp. 267–283.","ista":"Kaufmann W, Kleindienst D, Harada H, Shigemoto R. 2021.High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL). In: Receptor and Ion Channel Detection in the Brain. Neuromethods, vol. 169, 267–283.","ama":"Kaufmann W, Kleindienst D, Harada H, Shigemoto R. High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL). In: Receptor and Ion Channel Detection in the Brain. Vol 169. Neuromethods. New York: Humana; 2021:267-283. doi:10.1007/978-1-0716-1522-5_19"},"page":"267-283","date_published":"2021-07-27T00:00:00Z","keyword":["Freeze-fracture replica: Deep learning","Immunogold labeling","Integral membrane protein","Electron microscopy"],"series_title":"Neuromethods","day":"27","has_accepted_license":"1","article_processing_charge":"No"},{"oa_version":"Published Version","file":[{"checksum":"d1b9db3725aed34dadd81274aeb9426c","date_updated":"2021-12-23T23:30:04Z","date_created":"2020-12-22T20:08:44Z","embargo":"2021-12-22","file_id":"8969","relation":"main_file","creator":"akafshda","file_size":5251507,"content_type":"application/pdf","access_level":"open_access","file_name":"Thesis-pdfa.pdf"},{"file_id":"8970","relation":"source_file","date_updated":"2021-03-04T23:30:04Z","date_created":"2020-12-22T20:08:50Z","checksum":"1661df7b393e6866d2460eba3c905130","file_name":"source.zip","embargo_to":"open_access","access_level":"closed","creator":"akafshda","content_type":"application/zip","file_size":10636756}],"_id":"8934","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Parameterized and algebro-geometric advances in static program analysis","status":"public","ddc":["005"],"abstract":[{"lang":"eng","text":"In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.\r\nWe use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2021-01-01T00:00:00Z","citation":{"mla":"Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934.","short":"A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021.","chicago":"Goharshady, Amir Kafshdar. “Parameterized and Algebro-Geometric Advances in Static Program Analysis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:8934.","ama":"Goharshady AK. Parameterized and algebro-geometric advances in static program analysis. 2021. doi:10.15479/AT:ISTA:8934","ista":"Goharshady AK. 2021. Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria.","ieee":"A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.","apa":"Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934"},"page":"278","day":"01","has_accepted_license":"1","article_processing_charge":"No","author":[{"full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"1386"},{"relation":"part_of_dissertation","status":"public","id":"1437"},{"relation":"part_of_dissertation","status":"public","id":"311"},{"id":"6056","status":"public","relation":"part_of_dissertation"},{"id":"6380","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"639"},{"relation":"part_of_dissertation","status":"public","id":"66"},{"id":"6780","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"6918"},{"relation":"part_of_dissertation","status":"public","id":"7810"},{"relation":"part_of_dissertation","status":"public","id":"6175"},{"id":"6378","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"6490"},{"relation":"part_of_dissertation","status":"public","id":"7014"},{"status":"public","relation":"part_of_dissertation","id":"8089"},{"relation":"part_of_dissertation","status":"public","id":"8728"},{"id":"7158","status":"public","relation":"part_of_dissertation"},{"id":"5977","relation":"part_of_dissertation","status":"public"},{"id":"6009","status":"public","relation":"part_of_dissertation"},{"id":"6340","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"949"}]},"date_created":"2020-12-10T12:17:07Z","date_updated":"2023-09-22T10:03:21Z","acknowledgement":"The research was partially supported by an IBM PhD fellowship, a Facebook PhD fellowship, and DOC fellowship #24956 of the Austrian Academy of Sciences (OeAW).","year":"2021","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2021-12-23T23:30:04Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","doi":"10.15479/AT:ISTA:8934","degree_awarded":"PhD","supervisor":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"language":[{"iso":"eng"}],"oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"project":[{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"month":"01","publication_identifier":{"issn":["2663-337X"]}},{"abstract":[{"lang":"eng","text":"Bacteria-host interactions represent a continuous trade-off between benefit and risk. Thus, the host immune response is faced with a non-trivial problem – accommodate beneficial commensals and remove harmful pathogens. This is especially difficult as molecular patterns, such as lipopolysaccharide or specific surface organelles such as pili, are conserved in both, commensal and pathogenic bacteria. Type 1 pili, tightly regulated by phase variation, are considered an important virulence factor of pathogenic bacteria as they facilitate invasion into host cells. While invasion represents a de facto passive mechanism for pathogens to escape the host immune response, we demonstrate a fundamental role of type 1 pili as active modulators of the innate and adaptive immune response."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"file_name":"ThesisTomasekKathrin.pdf","access_level":"open_access","content_type":"application/pdf","file_size":13266088,"creator":"ktomasek","relation":"main_file","embargo":"2022-11-18","file_id":"10308","date_created":"2021-11-18T15:07:31Z","date_updated":"2022-12-20T23:30:05Z","checksum":"b39c9e0ef18d0484d537a67551effd02"},{"file_size":7539509,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"ktomasek","access_level":"closed","embargo_to":"open_access","file_name":"ThesisTomasekKathrin.docx","checksum":"c0c440ee9e5ef1102a518a4f9f023e7c","date_created":"2021-11-18T15:07:46Z","date_updated":"2022-12-20T23:30:05Z","relation":"source_file","file_id":"10309"}],"status":"public","title":"Pathogenic Escherichia coli hijack the host immune response","ddc":["570"],"_id":"10307","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","article_processing_charge":"No","day":"18","date_published":"2021-11-18T00:00:00Z","page":"73","citation":{"apa":"Tomasek, K. (2021). Pathogenic Escherichia coli hijack the host immune response. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10307","ieee":"K. Tomasek, “Pathogenic Escherichia coli hijack the host immune response,” Institute of Science and Technology Austria, 2021.","ista":"Tomasek K. 2021. Pathogenic Escherichia coli hijack the host immune response. Institute of Science and Technology Austria.","ama":"Tomasek K. Pathogenic Escherichia coli hijack the host immune response. 2021. doi:10.15479/at:ista:10307","chicago":"Tomasek, Kathrin. “Pathogenic Escherichia Coli Hijack the Host Immune Response.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10307.","short":"K. Tomasek, Pathogenic Escherichia Coli Hijack the Host Immune Response, Institute of Science and Technology Austria, 2021.","mla":"Tomasek, Kathrin. Pathogenic Escherichia Coli Hijack the Host Immune Response. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10307."},"file_date_updated":"2022-12-20T23:30:05Z","date_created":"2021-11-18T15:05:06Z","date_updated":"2023-09-07T13:34:38Z","related_material":{"record":[{"id":"10316","status":"public","relation":"part_of_dissertation"}]},"author":[{"full_name":"Tomasek, Kathrin","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3768-877X","first_name":"Kathrin","last_name":"Tomasek"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"MiSi"},{"_id":"CaGu"},{"_id":"GradSch"}],"publication_status":"published","year":"2021","publication_identifier":{"issn":["2663-337X"]},"month":"11","language":[{"iso":"eng"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"supervisor":[{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-4561-241X","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"}],"doi":"10.15479/at:ista:10307","oa":1},{"abstract":[{"lang":"eng","text":"A key attribute of persistent or recurring bacterial infections is the ability of the pathogen to evade the host’s immune response. Many Enterobacteriaceae express type 1 pili, a pre-adapted virulence trait, to invade host epithelial cells and establish persistent infections. However, the molecular mechanisms and strategies by which bacteria actively circumvent the immune response of the host remain poorly understood. Here, we identified CD14, the major co-receptor for lipopolysaccharide detection, on dendritic cells as a previously undescribed binding partner of FimH, the protein located at the tip of the type 1 pilus of Escherichia coli. The FimH amino acids involved in CD14 binding are highly conserved across pathogenic and non-pathogenic strains. Binding of pathogenic bacteria to CD14 lead to reduced dendritic cell migration and blunted expression of co-stimulatory molecules, both rate-limiting factors of T cell activation. While defining an active molecular mechanism of immune evasion by pathogens, the interaction between FimH and CD14 represents a potential target to interfere with persistent and recurrent infections, such as urinary tract infections or Crohn’s disease."}],"ec_funded":1,"type":"preprint","author":[{"id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3768-877X","first_name":"Kathrin","last_name":"Tomasek","full_name":"Tomasek, Kathrin"},{"full_name":"Leithner, Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1073-744X","first_name":"Alexander F","last_name":"Leithner"},{"id":"727b3c7d-4939-11ec-89b3-b9b0750ab74d","last_name":"Glatzová","first_name":"Ivana","full_name":"Glatzová, Ivana"},{"last_name":"Lukesch","first_name":"Michael S.","full_name":"Lukesch, Michael S."},{"full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Michael K","last_name":"Sixt"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"11843"},{"relation":"dissertation_contains","status":"public","id":"10307"}]},"date_updated":"2024-03-28T23:30:35Z","date_created":"2021-11-19T12:24:16Z","oa_version":"Preprint","_id":"10316","acknowledgement":"We thank Ulrich Dobrindt for providing UPEC strain CFT073, Vlad Gavra and Maximilian Götz, Bor Kavčič, Jonna Alanko and Eva Kiermaier for help with experiments and Robert Hauschild, Julian Stopp and Saren Tasciyan for help with data analysis. We thank the IST Austria Scientific Service Units, especially the Bioimaging facility, the Preclinical facility and the Electron microscopy facility for technical support, Jakob Wallner and all members of the Guet and Sixt lab for fruitful discussions and Daria Siekhaus for critically reading the manuscript. This work was supported by grants from the Austrian Research Promotion Agency (FEMtech 868984) to I.G., the European Research Council (CoG 724373) and the Austrian Science Fund (FWF P29911) to M.S.","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2021","title":"Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14","status":"public","publication_status":"submitted","department":[{"_id":"CaGu"},{"_id":"MiSi"}],"publisher":"Cold Spring Harbor Laboratory","month":"10","day":"18","article_processing_charge":"No","doi":"10.1101/2021.10.18.464770","date_published":"2021-10-18T00:00:00Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"publication":"bioRxiv","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/2021.10.18.464770v1"}],"oa":1,"citation":{"ista":"Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. bioRxiv, 10.1101/2021.10.18.464770.","ieee":"K. Tomasek, A. F. Leithner, I. Glatzová, M. S. Lukesch, C. C. Guet, and M. K. Sixt, “Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14,” bioRxiv. Cold Spring Harbor Laboratory.","apa":"Tomasek, K., Leithner, A. F., Glatzová, I., Lukesch, M. S., Guet, C. C., & Sixt, M. K. (n.d.). Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.10.18.464770","ama":"Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. bioRxiv. doi:10.1101/2021.10.18.464770","chicago":"Tomasek, Kathrin, Alexander F Leithner, Ivana Glatzová, Michael S. Lukesch, Calin C Guet, and Michael K Sixt. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.10.18.464770.","mla":"Tomasek, Kathrin, et al. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2021.10.18.464770.","short":"K. Tomasek, A.F. Leithner, I. Glatzová, M.S. Lukesch, C.C. Guet, M.K. Sixt, BioRxiv (n.d.)."},"project":[{"name":"Cellular navigation along spatial gradients","call_identifier":"H2020","grant_number":"724373","_id":"25FE9508-B435-11E9-9278-68D0E5697425"},{"name":"Mechanical adaptation of lamellipodial actin","call_identifier":"FWF","_id":"26018E70-B435-11E9-9278-68D0E5697425","grant_number":"P29911"}]},{"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":2358617,"creator":"dernst","file_name":"2021_Embo_Otvos.pdf","access_level":"open_access","date_created":"2021-02-11T12:28:29Z","date_updated":"2021-02-11T12:28:29Z","checksum":"dc55c900f3b061d6c2790b8813d759a3","success":1,"relation":"main_file","file_id":"9110"}],"intvolume":" 40","title":"Modulation of plant root growth by nitrogen source-defined regulation of polar auxin transport","ddc":["580"],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9010","issue":"3","abstract":[{"lang":"eng","text":"Availability of the essential macronutrient nitrogen in soil plays a critical role in plant growth, development, and impacts agricultural productivity. Plants have evolved different strategies for sensing and responding to heterogeneous nitrogen distribution. Modulation of root system architecture, including primary root growth and branching, is among the most essential plant adaptions to ensure adequate nitrogen acquisition. However, the immediate molecular pathways coordinating the adjustment of root growth in response to distinct nitrogen sources, such as nitrate or ammonium, are poorly understood. Here, we show that growth as manifested by cell division and elongation is synchronized by coordinated auxin flux between two adjacent outer tissue layers of the root. This coordination is achieved by nitrate‐dependent dephosphorylation of the PIN2 auxin efflux carrier at a previously uncharacterized phosphorylation site, leading to subsequent PIN2 lateralization and thereby regulating auxin flow between adjacent tissues. A dynamic computer model based on our experimental data successfully recapitulates experimental observations. Our study provides mechanistic insights broadening our understanding of root growth mechanisms in dynamic environments."}],"type":"journal_article","date_published":"2021-02-01T00:00:00Z","article_type":"original","citation":{"ieee":"K. Ötvös et al., “Modulation of plant root growth by nitrogen source-defined regulation of polar auxin transport,” EMBO Journal, vol. 40, no. 3. Embo Press, 2021.","apa":"Ötvös, K., Marconi, M., Vega, A., O’Brien, J., Johnson, A. J., Abualia, R., … Benková, E. (2021). Modulation of plant root growth by nitrogen source-defined regulation of polar auxin transport. EMBO Journal. Embo Press. https://doi.org/10.15252/embj.2020106862","ista":"Ötvös K, Marconi M, Vega A, O’Brien J, Johnson AJ, Abualia R, Antonielli L, Montesinos López JC, Zhang Y, Tan S, Cuesta C, Artner C, Bouguyon E, Gojon A, Friml J, Gutiérrez RA, Wabnik KT, Benková E. 2021. Modulation of plant root growth by nitrogen source-defined regulation of polar auxin transport. EMBO Journal. 40(3), e106862.","ama":"Ötvös K, Marconi M, Vega A, et al. Modulation of plant root growth by nitrogen source-defined regulation of polar auxin transport. EMBO Journal. 2021;40(3). doi:10.15252/embj.2020106862","chicago":"Ötvös, Krisztina, Marco Marconi, Andrea Vega, Jose O’Brien, Alexander J Johnson, Rashed Abualia, Livio Antonielli, et al. “Modulation of Plant Root Growth by Nitrogen Source-Defined Regulation of Polar Auxin Transport.” EMBO Journal. Embo Press, 2021. https://doi.org/10.15252/embj.2020106862.","short":"K. Ötvös, M. Marconi, A. Vega, J. O’Brien, A.J. Johnson, R. Abualia, L. Antonielli, J.C. Montesinos López, Y. Zhang, S. Tan, C. Cuesta, C. Artner, E. Bouguyon, A. Gojon, J. Friml, R.A. Gutiérrez, K.T. Wabnik, E. Benková, EMBO Journal 40 (2021).","mla":"Ötvös, Krisztina, et al. “Modulation of Plant Root Growth by Nitrogen Source-Defined Regulation of Polar Auxin Transport.” EMBO Journal, vol. 40, no. 3, e106862, Embo Press, 2021, doi:10.15252/embj.2020106862."},"publication":"EMBO Journal","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","scopus_import":"1","volume":40,"date_updated":"2024-03-28T23:30:39Z","date_created":"2021-01-17T23:01:12Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10303"}],"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/a-plants-way-to-its-favorite-food/"}]},"author":[{"first_name":"Krisztina","last_name":"Ötvös","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5503-4983","full_name":"Ötvös, Krisztina"},{"full_name":"Marconi, Marco","first_name":"Marco","last_name":"Marconi"},{"first_name":"Andrea","last_name":"Vega","full_name":"Vega, Andrea"},{"first_name":"Jose","last_name":"O’Brien","full_name":"O’Brien, Jose"},{"full_name":"Johnson, Alexander J","first_name":"Alexander J","last_name":"Johnson","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2739-8843"},{"last_name":"Abualia","first_name":"Rashed","orcid":"0000-0002-9357-9415","id":"4827E134-F248-11E8-B48F-1D18A9856A87","full_name":"Abualia, Rashed"},{"full_name":"Antonielli, Livio","first_name":"Livio","last_name":"Antonielli"},{"full_name":"Montesinos López, Juan C","first_name":"Juan C","last_name":"Montesinos López","id":"310A8E3E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9179-6099"},{"full_name":"Zhang, Yuzhou","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2627-6956","first_name":"Yuzhou","last_name":"Zhang"},{"last_name":"Tan","first_name":"Shutang","orcid":"0000-0002-0471-8285","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","full_name":"Tan, Shutang"},{"orcid":"0000-0003-1923-2410","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","last_name":"Cuesta","first_name":"Candela","full_name":"Cuesta, Candela"},{"id":"45DF286A-F248-11E8-B48F-1D18A9856A87","last_name":"Artner","first_name":"Christina","full_name":"Artner, Christina"},{"last_name":"Bouguyon","first_name":"Eleonore","full_name":"Bouguyon, Eleonore"},{"last_name":"Gojon","first_name":"Alain","full_name":"Gojon, Alain"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří"},{"first_name":"Rodrigo A.","last_name":"Gutiérrez","full_name":"Gutiérrez, Rodrigo A."},{"last_name":"Wabnik","first_name":"Krzysztof T","orcid":"0000-0001-7263-0560","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","full_name":"Wabnik, Krzysztof T"},{"orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva","full_name":"Benková, Eva"}],"publisher":"Embo Press","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"publication_status":"published","pmid":1,"acknowledgement":"We acknowledge Gergely Molnar for critical reading of the manuscript, Alexander Johnson for language editing and Yulija Salanenka for technical assistance. Work in the Benkova laboratory was supported by the Austrian Science Fund (FWF01_I1774S) to KO, RA and EB. Work in the Benkova laboratory was supported by the Austrian Science Fund (FWF01_I1774S) to KO, RA and EB and by the DOC Fellowship Programme of the AustrianAcademy of Sciences (25008) to C.A. Work in the Wabnik laboratory was supported by the Programa de Atraccion de Talento 2017 (Comunidad deMadrid, 2017-T1/BIO-5654 to K.W.), Severo Ochoa Programme for Centres of Excellence in R&D from the Agencia Estatal de Investigacion of Spain (grantSEV-2016-0672 (2017-2021) to K.W. via the CBGP) and Programa Estatal de Generacion del Conocimiento y Fortalecimiento Científico y Tecnologico del Sistema de I+D+I 2019 (PGC2018-093387-A-I00) from MICIU (to K.W.). M.M.was supported by a postdoctoral contract associated to SEV-2016-0672.We acknowledge the Bioimaging Facility in IST-Austria and the Advanced Microscopy Facility of the Vienna Bio Center Core Facilities, member of the Vienna Bio Center Austria, for use of the OMX v43D SIM microscope. AJ was supported by the Austrian Science Fund (FWF): I03630 to J.F","year":"2021","file_date_updated":"2021-02-11T12:28:29Z","article_number":"e106862","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"}],"doi":"10.15252/embj.2020106862","project":[{"_id":"2542D156-B435-11E9-9278-68D0E5697425","grant_number":"I 1774-B16","name":"Hormone cross-talk drives nutrient dependent plant development","call_identifier":"FWF"},{"name":"Hormonal regulation of plant adaptive responses to environmental signals","_id":"2685A872-B435-11E9-9278-68D0E5697425"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630"}],"isi":1,"quality_controlled":"1","external_id":{"pmid":[" 33399250"],"isi":["000604645600001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"issn":["02614189"],"eissn":["14602075"]},"month":"02"},{"scopus_import":"1","day":"06","has_accepted_license":"1","article_processing_charge":"Yes","publication":"EMBO Reports","citation":{"ama":"Vega A, Fredes I, O’Brien J, et al. Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture. EMBO Reports. 2021;22(9). doi:10.15252/embr.202051813","ista":"Vega A, Fredes I, O’Brien J, Shen Z, Ötvös K, Abualia R, Benková E, Briggs SP, Gutiérrez RA. 2021. Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture. EMBO Reports. 22(9), e51813.","apa":"Vega, A., Fredes, I., O’Brien, J., Shen, Z., Ötvös, K., Abualia, R., … Gutiérrez, R. A. (2021). Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture. EMBO Reports. Wiley. https://doi.org/10.15252/embr.202051813","ieee":"A. Vega et al., “Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture,” EMBO Reports, vol. 22, no. 9. Wiley, 2021.","mla":"Vega, Andrea, et al. “Nitrate Triggered Phosphoproteome Changes and a PIN2 Phosphosite Modulating Root System Architecture.” EMBO Reports, vol. 22, no. 9, e51813, Wiley, 2021, doi:10.15252/embr.202051813.","short":"A. Vega, I. Fredes, J. O’Brien, Z. Shen, K. Ötvös, R. Abualia, E. Benková, S.P. Briggs, R.A. Gutiérrez, EMBO Reports 22 (2021).","chicago":"Vega, Andrea, Isabel Fredes, José O’Brien, Zhouxin Shen, Krisztina Ötvös, Rashed Abualia, Eva Benková, Steven P. Briggs, and Rodrigo A. Gutiérrez. “Nitrate Triggered Phosphoproteome Changes and a PIN2 Phosphosite Modulating Root System Architecture.” EMBO Reports. Wiley, 2021. https://doi.org/10.15252/embr.202051813."},"article_type":"original","date_published":"2021-09-06T00:00:00Z","type":"journal_article","abstract":[{"text":"Nitrate commands genome-wide gene expression changes that impact metabolism, physiology, plant growth, and development. In an effort to identify new components involved in nitrate responses in plants, we analyze the Arabidopsis thaliana root phosphoproteome in response to nitrate treatments via liquid chromatography coupled to tandem mass spectrometry. 176 phosphoproteins show significant changes at 5 or 20 min after nitrate treatments. Proteins identified by 5 min include signaling components such as kinases or transcription factors. In contrast, by 20 min, proteins identified were associated with transporter activity or hormone metabolism functions, among others. The phosphorylation profile of NITRATE TRANSPORTER 1.1 (NRT1.1) mutant plants was significantly altered as compared to wild-type plants, confirming its key role in nitrate signaling pathways that involves phosphorylation changes. Integrative bioinformatics analysis highlights auxin transport as an important mechanism modulated by nitrate signaling at the post-translational level. We validated a new phosphorylation site in PIN2 and provide evidence that it functions in primary and lateral root growth responses to nitrate.","lang":"eng"}],"issue":"9","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9913","status":"public","title":"Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture","ddc":["580"],"intvolume":" 22","oa_version":"Published Version","file":[{"file_id":"10090","relation":"main_file","date_updated":"2021-10-05T13:36:42Z","date_created":"2021-10-05T13:36:42Z","success":1,"checksum":"750de03dc3b715c37090126c1548ba13","file_name":"2021_EmboR_Vega.pdf","access_level":"open_access","creator":"cchlebak","file_size":3144854,"content_type":"application/pdf"}],"month":"09","publication_identifier":{"eissn":["1469-3178"],"issn":["1469-221X"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000681754200001"],"pmid":["34357701 "]},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.15252/embr.202051813","language":[{"iso":"eng"}],"article_number":"e51813","file_date_updated":"2021-10-05T13:36:42Z","year":"2021","acknowledgement":"This work was supported by ANID—Millennium Science Initiative Program—ICN17_022, Fondo de Desarrollo de Areas Prioritarias (FONDAP) Center for Genome Regulation (15090007), ANID—Fondo Nacional de Desarrollo Científico y Tecnológico (FONDECYT) 1180759 (to RAG) and 1171631 (to AV). We would like to thank Unidad de Microscopía Avanzada UC (UMA UC).","pmid":1,"publication_status":"published","publisher":"Wiley","department":[{"_id":"EvBe"},{"_id":"GradSch"}],"author":[{"first_name":"Andrea","last_name":"Vega","full_name":"Vega, Andrea"},{"full_name":"Fredes, Isabel","last_name":"Fredes","first_name":"Isabel"},{"full_name":"O’Brien, José","first_name":"José","last_name":"O’Brien"},{"full_name":"Shen, Zhouxin","first_name":"Zhouxin","last_name":"Shen"},{"first_name":"Krisztina","last_name":"Ötvös","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5503-4983","full_name":"Ötvös, Krisztina"},{"full_name":"Abualia, Rashed","first_name":"Rashed","last_name":"Abualia","id":"4827E134-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9357-9415"},{"first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva"},{"full_name":"Briggs, Steven P.","first_name":"Steven P.","last_name":"Briggs"},{"first_name":"Rodrigo A.","last_name":"Gutiérrez","full_name":"Gutiérrez, Rodrigo A."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10303"}]},"date_updated":"2024-03-28T23:30:40Z","date_created":"2021-08-15T22:01:30Z","volume":22},{"publication_identifier":{"issn":["2663-337X"]},"month":"11","language":[{"iso":"eng"}],"supervisor":[{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","first_name":"Eva","last_name":"Benková","full_name":"Benková, Eva"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"degree_awarded":"PhD","doi":"10.15479/at:ista:10303","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file_date_updated":"2022-12-20T23:30:06Z","date_created":"2021-11-18T11:20:59Z","date_updated":"2023-09-19T14:42:45Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9010"},{"id":"9913","status":"public","relation":"part_of_dissertation"},{"id":"47","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Abualia, Rashed","orcid":"0000-0002-9357-9415","id":"4827E134-F248-11E8-B48F-1D18A9856A87","last_name":"Abualia","first_name":"Rashed"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"publication_status":"published","year":"2021","article_processing_charge":"No","has_accepted_license":"1","day":"22","date_published":"2021-11-22T00:00:00Z","page":"139","citation":{"chicago":"Abualia, Rashed. “Role of Hormones in Nitrate Regulated Growth.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10303.","short":"R. Abualia, Role of Hormones in Nitrate Regulated Growth, Institute of Science and Technology Austria, 2021.","mla":"Abualia, Rashed. Role of Hormones in Nitrate Regulated Growth. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10303.","ieee":"R. Abualia, “Role of hormones in nitrate regulated growth,” Institute of Science and Technology Austria, 2021.","apa":"Abualia, R. (2021). Role of hormones in nitrate regulated growth. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10303","ista":"Abualia R. 2021. Role of hormones in nitrate regulated growth. Institute of Science and Technology Austria.","ama":"Abualia R. Role of hormones in nitrate regulated growth. 2021. doi:10.15479/at:ista:10303"},"abstract":[{"text":"Nitrogen is an essential macronutrient determining plant growth, development and affecting agricultural productivity. Root, as a hub that perceives and integrates local and systemic signals on the plant’s external and endogenous nitrogen resources, communicates with other plant organs to consolidate their physiology and development in accordance with actual nitrogen balance. Over the last years, numerous studies demonstrated that these comprehensive developmental adaptations rely on the interaction between pathways controlling nitrogen homeostasis and hormonal networks acting globally in the plant body. However, molecular insights into how the information about the nitrogen status is translated through hormonal pathways into specific developmental output are lacking. In my work, I addressed so far poorly understood mechanisms underlying root-to-shoot communication that lead to a rapid re-adjustment of shoot growth and development after nitrate provision. Applying a combination of molecular, cell, and developmental biology approaches, genetics and grafting experiments as well as hormonal analytics, I identified and characterized an unknown molecular framework orchestrating shoot development with a root nitrate sensory system. ","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","file":[{"access_level":"open_access","file_name":"AbualiaPhDthesisfinalv3.pdf","creator":"rabualia","file_size":28005730,"content_type":"application/pdf","embargo":"2022-11-23","file_id":"10331","relation":"main_file","checksum":"dea38b98aa4da1cea03dcd0f10862818","date_created":"2021-11-22T14:48:21Z","date_updated":"2022-12-20T23:30:06Z"},{"file_size":62841883,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"rabualia","embargo_to":"open_access","file_name":"AbualiaPhDthesisfinalv3.docx","access_level":"closed","date_created":"2021-11-22T14:48:34Z","date_updated":"2022-12-20T23:30:06Z","checksum":"4cd62da5ec5ba4c32e61f0f6d9e61920","relation":"source_file","file_id":"10332"}],"oa_version":"Published Version","status":"public","title":"Role of hormones in nitrate regulated growth","ddc":["580","581"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10303"},{"year":"2021","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"SiHi"}],"publication_status":"published","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"8569"},{"status":"public","relation":"part_of_dissertation","id":"960"}]},"author":[{"id":"38853E16-F248-11E8-B48F-1D18A9856A87","last_name":"Hansen","first_name":"Andi H","full_name":"Hansen, Andi H"}],"date_updated":"2023-09-22T09:58:30Z","date_created":"2021-08-29T12:36:50Z","file_date_updated":"2022-09-03T22:30:04Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"name":"Molecular Mechanisms of Radial Neuronal Migration","_id":"2625A13E-B435-11E9-9278-68D0E5697425","grant_number":"24812"}],"doi":"10.15479/at:ista:9962","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon"}],"publication_identifier":{"issn":["2663-337X"]},"month":"09","_id":"9962","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["570"],"title":"Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration","file":[{"embargo_to":"open_access","file_name":"Thesis_Hansen.docx","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":10629190,"creator":"ahansen","relation":"source_file","file_id":"9971","date_updated":"2022-09-03T22:30:04Z","date_created":"2021-08-30T09:17:39Z","checksum":"66b56f5b988b233dc66a4f4b4fb2cdfe"},{"content_type":"application/pdf","file_size":13457469,"creator":"ahansen","file_name":"Thesis_Hansen_PDFA-1a.pdf","access_level":"open_access","date_updated":"2022-09-03T22:30:04Z","date_created":"2021-08-30T09:29:44Z","checksum":"204fa40321a1c6289b68c473634c4bf3","relation":"main_file","file_id":"9972","embargo":"2022-09-02"}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"The brain is one of the largest and most complex organs and it is composed of billions of neurons that communicate together enabling e.g. consciousness. The cerebral cortex is the largest site of neural integration in the central nervous system. Concerted radial migration of newly born cortical projection neurons, from their birthplace to their final position, is a key step in the assembly of the cerebral cortex. The cellular and molecular mechanisms regulating radial neuronal migration in vivo are however still unclear. Recent evidence suggests that distinct signaling cues act cell-autonomously but differentially at certain steps during the overall migration process. Moreover, functional analysis of genetic mosaics (mutant neurons present in wild-type/heterozygote environment) using the MADM (Mosaic Analysis with Double Markers) analyses in comparison to global knockout also indicate a significant degree of non-cell-autonomous and/or community effects in the control of cortical neuron migration. The interactions of cell-intrinsic (cell-autonomous) and cell-extrinsic (non-cell-autonomous) components are largely unknown. In part of this thesis work we established a MADM-based experimental strategy for the quantitative analysis of cell-autonomous gene function versus non-cell-autonomous and/or community effects. The direct comparison of mutant neurons from the genetic mosaic (cell-autonomous) to mutant neurons in the conditional and/or global knockout (cell-autonomous + non-cell-autonomous) allows to quantitatively analyze non-cell-autonomous effects. Such analysis enable the high-resolution analysis of projection neuron migration dynamics in distinct environments with concomitant isolation of genomic and proteomic profiles. Using these experimental paradigms and in combination with computational modeling we show and characterize the nature of non-cell-autonomous effects to coordinate radial neuron migration. Furthermore, this thesis discusses recent developments in neurodevelopment with focus on neuronal polarization and non-cell-autonomous mechanisms in neuronal migration.","lang":"eng"}],"citation":{"mla":"Hansen, Andi H. Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9962.","short":"A.H. Hansen, Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration, Institute of Science and Technology Austria, 2021.","chicago":"Hansen, Andi H. “Cell-Autonomous Gene Function and Non-Cell-Autonomous Effects in Radial Projection Neuron Migration.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9962.","ama":"Hansen AH. Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. 2021. doi:10.15479/at:ista:9962","ista":"Hansen AH. 2021. Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. Institute of Science and Technology Austria.","ieee":"A. H. Hansen, “Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration,” Institute of Science and Technology Austria, 2021.","apa":"Hansen, A. H. (2021). Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9962"},"page":"182","date_published":"2021-09-02T00:00:00Z","keyword":["Neuronal migration","Non-cell-autonomous","Cell-autonomous","Neurodevelopmental disease"],"has_accepted_license":"1","article_processing_charge":"No","day":"02"},{"publication_status":"published","department":[{"_id":"MaSe"}],"publisher":"Nature Research","year":"2021","acknowledgement":"We thank our collaborators K. Bull, S. Choi, J.-Y. Desaules, W. W. Ho, A. Hudomal, M. Lukin, I. Martin, H. Pichler, N. Regnault, I. Vasić and in particular A. Michailidis and C. Turner, without whom this work would not have been possible. We also benefited from discussions with E. Altman, B. A. Bernevig, A. Chandran, P. Fendley, V. Khemani and L. Motrunich. M.S. was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 850899). D.A.A. was supported by the Swiss National Science Foundation and by the ERC under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 864597). Z.P. acknowledges support by the Leverhulme Trust Research Leadership Award RL-2019-015.","date_created":"2021-05-28T09:03:50Z","date_updated":"2023-10-18T08:20:59Z","volume":17,"author":[{"full_name":"Serbyn, Maksym","first_name":"Maksym","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827"},{"full_name":"Abanin, Dmitry A.","last_name":"Abanin","first_name":"Dmitry A."},{"first_name":"Zlatko","last_name":"Papić","full_name":"Papić, Zlatko"}],"file_date_updated":"2021-12-02T23:30:03Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"oa":1,"external_id":{"arxiv":["2011.09486"],"isi":["000655563800002"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41567-021-01230-2","month":"06","publication_identifier":{"eissn":["1745-2481"]},"status":"public","ddc":["539"],"title":"Quantum many-body scars and weak breaking of ergodicity","intvolume":" 17","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9428","oa_version":"Preprint","file":[{"checksum":"316ed42ea1b42b0f1a3025bb476266fc","date_created":"2021-09-20T09:27:43Z","date_updated":"2021-12-02T23:30:03Z","relation":"main_file","file_id":"10026","embargo":"2021-12-01","file_size":10028836,"content_type":"application/pdf","creator":"patrickd","access_level":"open_access","file_name":"RevisedQMBSreview.pdf"}],"type":"journal_article","abstract":[{"text":"Thermalization is the inevitable fate of many complex quantum systems, whose dynamics allow them to fully explore the vast configuration space regardless of the initial state---the behaviour known as quantum ergodicity. In a quest for experimental realizations of coherent long-time dynamics, efforts have focused on ergodicity-breaking mechanisms, such as integrability and localization. The recent discovery of persistent revivals in quantum simulators based on Rydberg atoms have pointed to the existence of a new type of behaviour where the system rapidly relaxes for most initial conditions, while certain initial states give rise to non-ergodic dynamics. This collective effect has been named ”quantum many-body scarring’by analogy with a related form of weak ergodicity breaking that occurs for a single particle inside a stadium billiard potential. In this Review, we provide a pedagogical introduction to quantum many-body scars and highlight the emerging connections with the semiclassical quantization of many-body systems. We discuss the relation between scars and more general routes towards weak violations of ergodicity due to embedded algebras and non-thermal eigenstates, and highlight possible applications of scars in quantum technology.","lang":"eng"}],"issue":"6","article_type":"review","page":"675–685","publication":"Nature Physics","citation":{"ama":"Serbyn M, Abanin DA, Papić Z. Quantum many-body scars and weak breaking of ergodicity. Nature Physics. 2021;17(6):675–685. doi:10.1038/s41567-021-01230-2","apa":"Serbyn, M., Abanin, D. A., & Papić, Z. (2021). Quantum many-body scars and weak breaking of ergodicity. Nature Physics. Nature Research. https://doi.org/10.1038/s41567-021-01230-2","ieee":"M. Serbyn, D. A. Abanin, and Z. Papić, “Quantum many-body scars and weak breaking of ergodicity,” Nature Physics, vol. 17, no. 6. Nature Research, pp. 675–685, 2021.","ista":"Serbyn M, Abanin DA, Papić Z. 2021. Quantum many-body scars and weak breaking of ergodicity. Nature Physics. 17(6), 675–685.","short":"M. Serbyn, D.A. Abanin, Z. Papić, Nature Physics 17 (2021) 675–685.","mla":"Serbyn, Maksym, et al. “Quantum Many-Body Scars and Weak Breaking of Ergodicity.” Nature Physics, vol. 17, no. 6, Nature Research, 2021, pp. 675–685, doi:10.1038/s41567-021-01230-2.","chicago":"Serbyn, Maksym, Dmitry A. Abanin, and Zlatko Papić. “Quantum Many-Body Scars and Weak Breaking of Ergodicity.” Nature Physics. Nature Research, 2021. https://doi.org/10.1038/s41567-021-01230-2."},"date_published":"2021-06-01T00:00:00Z","day":"01","has_accepted_license":"1","article_processing_charge":"No"},{"date_published":"2021-02-01T00:00:00Z","article_type":"original","publication":"Plant Science","citation":{"ama":"Gelová Z, Gallei MC, Pernisová M, et al. Developmental roles of auxin binding protein 1 in Arabidopsis thaliana. Plant Science. 2021;303. doi:10.1016/j.plantsci.2020.110750","ista":"Gelová Z, Gallei MC, Pernisová M, Brunoud G, Zhang X, Glanc M, Li L, Michalko J, Pavlovicova Z, Verstraeten I, Han H, Hajny J, Hauschild R, Čovanová M, Zwiewka M, Hörmayer L, Fendrych M, Xu T, Vernoux T, Friml J. 2021. Developmental roles of auxin binding protein 1 in Arabidopsis thaliana. Plant Science. 303, 110750.","apa":"Gelová, Z., Gallei, M. C., Pernisová, M., Brunoud, G., Zhang, X., Glanc, M., … Friml, J. (2021). Developmental roles of auxin binding protein 1 in Arabidopsis thaliana. Plant Science. Elsevier. https://doi.org/10.1016/j.plantsci.2020.110750","ieee":"Z. Gelová et al., “Developmental roles of auxin binding protein 1 in Arabidopsis thaliana,” Plant Science, vol. 303. Elsevier, 2021.","mla":"Gelová, Zuzana, et al. “Developmental Roles of Auxin Binding Protein 1 in Arabidopsis Thaliana.” Plant Science, vol. 303, 110750, Elsevier, 2021, doi:10.1016/j.plantsci.2020.110750.","short":"Z. Gelová, M.C. Gallei, M. Pernisová, G. Brunoud, X. Zhang, M. Glanc, L. Li, J. Michalko, Z. Pavlovicova, I. Verstraeten, H. Han, J. Hajny, R. Hauschild, M. Čovanová, M. Zwiewka, L. Hörmayer, M. Fendrych, T. Xu, T. Vernoux, J. Friml, Plant Science 303 (2021).","chicago":"Gelová, Zuzana, Michelle C Gallei, Markéta Pernisová, Géraldine Brunoud, Xixi Zhang, Matous Glanc, Lanxin Li, et al. “Developmental Roles of Auxin Binding Protein 1 in Arabidopsis Thaliana.” Plant Science. Elsevier, 2021. https://doi.org/10.1016/j.plantsci.2020.110750."},"day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","keyword":["Agronomy and Crop Science","Plant Science","Genetics","General Medicine"],"scopus_import":"1","file":[{"success":1,"checksum":"a7f2562bdca62d67dfa88e271b62a629","date_updated":"2021-02-04T07:49:25Z","date_created":"2021-02-04T07:49:25Z","file_id":"9083","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":12563728,"access_level":"open_access","file_name":"2021_PlantScience_Gelova.pdf"}],"oa_version":"Published Version","status":"public","title":"Developmental roles of auxin binding protein 1 in Arabidopsis thaliana","ddc":["580"],"intvolume":" 303","_id":"8931","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"text":"Auxin is a major plant growth regulator, but current models on auxin perception and signaling cannot explain the whole plethora of auxin effects, in particular those associated with rapid responses. A possible candidate for a component of additional auxin perception mechanisms is the AUXIN BINDING PROTEIN 1 (ABP1), whose function in planta remains unclear.\r\nHere we combined expression analysis with gain- and loss-of-function approaches to analyze the role of ABP1 in plant development. ABP1 shows a broad expression largely overlapping with, but not regulated by, transcriptional auxin response activity. Furthermore, ABP1 activity is not essential for the transcriptional auxin signaling. Genetic in planta analysis revealed that abp1 loss-of-function mutants show largely normal development with minor defects in bolting. On the other hand, ABP1 gain-of-function alleles show a broad range of growth and developmental defects, including root and hypocotyl growth and bending, lateral root and leaf development, bolting, as well as response to heat stress. At the cellular level, ABP1 gain-of-function leads to impaired auxin effect on PIN polar distribution and affects BFA-sensitive PIN intracellular aggregation.\r\nThe gain-of-function analysis suggests a broad, but still mechanistically unclear involvement of ABP1 in plant development, possibly masked in abp1 loss-of-function mutants by a functional redundancy.","lang":"eng"}],"type":"journal_article","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.plantsci.2020.110750","isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"},{"_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants"},{"grant_number":"25351","_id":"26B4D67E-B435-11E9-9278-68D0E5697425","name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["33487339"],"isi":["000614154500001"]},"month":"02","publication_identifier":{"issn":["0168-9452"]},"date_created":"2020-12-09T14:48:28Z","date_updated":"2024-03-28T23:30:44Z","volume":303,"author":[{"orcid":"0000-0003-4783-1752","id":"0AE74790-0E0B-11E9-ABC7-1ACFE5697425","last_name":"Gelová","first_name":"Zuzana","full_name":"Gelová, Zuzana"},{"last_name":"Gallei","first_name":"Michelle C","orcid":"0000-0003-1286-7368","id":"35A03822-F248-11E8-B48F-1D18A9856A87","full_name":"Gallei, Michelle C"},{"full_name":"Pernisová, Markéta","first_name":"Markéta","last_name":"Pernisová"},{"full_name":"Brunoud, Géraldine","last_name":"Brunoud","first_name":"Géraldine"},{"full_name":"Zhang, Xixi","orcid":"0000-0001-7048-4627","id":"61A66458-47E9-11EA-85BA-8AEAAF14E49A","last_name":"Zhang","first_name":"Xixi"},{"full_name":"Glanc, Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","orcid":"0000-0003-0619-7783","first_name":"Matous","last_name":"Glanc"},{"full_name":"Li, Lanxin","orcid":"0000-0002-5607-272X","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","first_name":"Lanxin"},{"full_name":"Michalko, Jaroslav","id":"483727CA-F248-11E8-B48F-1D18A9856A87","first_name":"Jaroslav","last_name":"Michalko"},{"last_name":"Pavlovicova","first_name":"Zlata","full_name":"Pavlovicova, Zlata"},{"last_name":"Verstraeten","first_name":"Inge","orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","full_name":"Verstraeten, Inge"},{"last_name":"Han","first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","full_name":"Han, Huibin"},{"full_name":"Hajny, Jakub","last_name":"Hajny","first_name":"Jakub","orcid":"0000-0003-2140-7195","id":"4800CC20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","first_name":"Robert"},{"last_name":"Čovanová","first_name":"Milada","full_name":"Čovanová, Milada"},{"full_name":"Zwiewka, Marta","last_name":"Zwiewka","first_name":"Marta"},{"last_name":"Hörmayer","first_name":"Lukas","orcid":"0000-0001-8295-2926","id":"2EEE7A2A-F248-11E8-B48F-1D18A9856A87","full_name":"Hörmayer, Lukas"},{"full_name":"Fendrych, Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","first_name":"Matyas","last_name":"Fendrych"},{"last_name":"Xu","first_name":"Tongda","full_name":"Xu, Tongda"},{"full_name":"Vernoux, Teva","first_name":"Teva","last_name":"Vernoux"},{"full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"11626","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"10083"}]},"publication_status":"published","publisher":"Elsevier","department":[{"_id":"JiFr"},{"_id":"Bio"}],"year":"2021","acknowledgement":"We would like to acknowledge Bioimaging and Life Science Facilities at IST Austria for continuous support and also the Plant Sciences Core Facility of CEITEC Masaryk University for their support with obtaining a part of the scientific data. We gratefully acknowledge Lindy Abas for help with ABP1::GFP-ABP1 construct design. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program [grant agreement no. 742985] and Austrian Science Fund (FWF) [I 3630-B25] to J.F.; DOC Fellowship of the Austrian Academy of Sciences to L.L.; the European Structural and Investment Funds, Operational Programme Research, Development and Education - Project „MSCAfellow@MUNI“ [CZ.02.2.69/0.0/0.0/17_050/0008496] to M.P.. This project was also supported by the Czech Science Foundation [GA 20-20860Y] to M.Z and MEYS CR [project no.CZ.02.1.01/0.0/0.0/16_019/0000738] to M. Č.","pmid":1,"file_date_updated":"2021-02-04T07:49:25Z","ec_funded":1,"article_number":"110750"},{"day":"01","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","date_published":"2021-06-01T00:00:00Z","publication":"Plant Physiology","citation":{"ieee":"M. Narasimhan et al., “Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking,” Plant Physiology, vol. 186, no. 2. Oxford University Press, pp. 1122–1142, 2021.","apa":"Narasimhan, M., Gallei, M. C., Tan, S., Johnson, A. J., Verstraeten, I., Li, L., … Friml, J. (2021). Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking. Plant Physiology. Oxford University Press. https://doi.org/10.1093/plphys/kiab134","ista":"Narasimhan M, Gallei MC, Tan S, Johnson AJ, Verstraeten I, Li L, Rodriguez Solovey L, Han H, Himschoot E, Wang R, Vanneste S, Sánchez-Simarro J, Aniento F, Adamowski M, Friml J. 2021. Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking. Plant Physiology. 186(2), 1122–1142.","ama":"Narasimhan M, Gallei MC, Tan S, et al. Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking. Plant Physiology. 2021;186(2):1122–1142. doi:10.1093/plphys/kiab134","chicago":"Narasimhan, Madhumitha, Michelle C Gallei, Shutang Tan, Alexander J Johnson, Inge Verstraeten, Lanxin Li, Lesia Rodriguez Solovey, et al. “Systematic Analysis of Specific and Nonspecific Auxin Effects on Endocytosis and Trafficking.” Plant Physiology. Oxford University Press, 2021. https://doi.org/10.1093/plphys/kiab134.","short":"M. Narasimhan, M.C. Gallei, S. Tan, A.J. Johnson, I. Verstraeten, L. Li, L. Rodriguez Solovey, H. Han, E. Himschoot, R. Wang, S. Vanneste, J. Sánchez-Simarro, F. Aniento, M. Adamowski, J. Friml, Plant Physiology 186 (2021) 1122–1142.","mla":"Narasimhan, Madhumitha, et al. “Systematic Analysis of Specific and Nonspecific Auxin Effects on Endocytosis and Trafficking.” Plant Physiology, vol. 186, no. 2, Oxford University Press, 2021, pp. 1122–1142, doi:10.1093/plphys/kiab134."},"article_type":"original","page":"1122–1142","abstract":[{"text":"The phytohormone auxin and its directional transport through tissues are intensively studied. However, a mechanistic understanding of auxin-mediated feedback on endocytosis and polar distribution of PIN auxin transporters remains limited due to contradictory observations and interpretations. Here, we used state-of-the-art methods to reexamine the\r\nauxin effects on PIN endocytic trafficking. We used high auxin concentrations or longer treatments versus lower concentrations and shorter treatments of natural (IAA) and synthetic (NAA) auxins to distinguish between specific and nonspecific effects. Longer treatments of both auxins interfere with Brefeldin A-mediated intracellular PIN2 accumulation and also with general aggregation of endomembrane compartments. NAA treatment decreased the internalization of the endocytic tracer dye, FM4-64; however, NAA treatment also affected the number, distribution, and compartment identity of the early endosome/trans-Golgi network (EE/TGN), rendering the FM4-64 endocytic assays at high NAA concentrations unreliable. To circumvent these nonspecific effects of NAA and IAA affecting the endomembrane system, we opted for alternative approaches visualizing the endocytic events directly at the plasma membrane (PM). Using Total Internal Reflection Fluorescence (TIRF) microscopy, we saw no significant effects of IAA or NAA treatments on the incidence and dynamics of clathrin foci, implying that these treatments do not affect the overall endocytosis rate. However, both NAA and IAA at low concentrations rapidly and specifically promoted endocytosis of photo-converted PIN2 from the PM. These analyses identify a specific effect of NAA and IAA on PIN2 endocytosis, thus contributing to its\r\npolarity maintenance and furthermore illustrate that high auxin levels have nonspecific effects on trafficking and endomembrane compartments. ","lang":"eng"}],"issue":"2","type":"journal_article","file":[{"file_name":"2021_PlantPhysio_Narasimhan.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2289127,"creator":"cziletti","relation":"main_file","file_id":"10273","date_created":"2021-11-11T15:07:51Z","date_updated":"2021-11-11T15:07:51Z","checksum":"532bb9469d3b665907f06df8c383eade","success":1}],"oa_version":"Published Version","_id":"9287","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking","ddc":["580"],"intvolume":" 186","month":"06","publication_identifier":{"issn":["0032-0889"],"eissn":["1532-2548"]},"doi":"10.1093/plphys/kiab134","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["33734402"],"isi":["000671555900031"]},"quality_controlled":"1","isi":1,"project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630"}],"file_date_updated":"2021-11-11T15:07:51Z","ec_funded":1,"author":[{"full_name":"Narasimhan, Madhumitha","last_name":"Narasimhan","first_name":"Madhumitha","orcid":"0000-0002-8600-0671","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gallei","first_name":"Michelle C","orcid":"0000-0003-1286-7368","id":"35A03822-F248-11E8-B48F-1D18A9856A87","full_name":"Gallei, Michelle C"},{"first_name":"Shutang","last_name":"Tan","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","full_name":"Tan, Shutang"},{"orcid":"0000-0002-2739-8843","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","last_name":"Johnson","first_name":"Alexander J","full_name":"Johnson, Alexander J"},{"first_name":"Inge","last_name":"Verstraeten","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge"},{"id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5607-272X","first_name":"Lanxin","last_name":"Li","full_name":"Li, Lanxin"},{"last_name":"Rodriguez Solovey","first_name":"Lesia","orcid":"0000-0002-7244-7237","id":"3922B506-F248-11E8-B48F-1D18A9856A87","full_name":"Rodriguez Solovey, Lesia"},{"full_name":"Han, Huibin","first_name":"Huibin","last_name":"Han","id":"31435098-F248-11E8-B48F-1D18A9856A87"},{"first_name":"E","last_name":"Himschoot","full_name":"Himschoot, E"},{"full_name":"Wang, R","last_name":"Wang","first_name":"R"},{"full_name":"Vanneste, S","first_name":"S","last_name":"Vanneste"},{"full_name":"Sánchez-Simarro, J","first_name":"J","last_name":"Sánchez-Simarro"},{"first_name":"F","last_name":"Aniento","full_name":"Aniento, F"},{"full_name":"Adamowski, Maciek","last_name":"Adamowski","first_name":"Maciek","orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"}],"related_material":{"link":[{"url":"10.1093/plphys/kiab380","relation":"erratum"}],"record":[{"relation":"dissertation_contains","status":"public","id":"11626"},{"id":"10083","status":"public","relation":"dissertation_contains"}]},"date_updated":"2024-03-28T23:30:44Z","date_created":"2021-03-26T12:08:38Z","volume":186,"acknowledgement":"We thank Ivan Kulik for developing the Chip’n’Dale apparatus with Lanxin Li; the IST machine shop and the Bioimaging facility for their excellent support; Matouš Glanc and Matyáš Fendrych for their valuable discussions and help; Barbara Casillas-Perez for her help with statistics. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement No 742985). A.J. is supported by funding from the Austrian Science Fund (FWF): I3630B25 to J.F. ","year":"2021","pmid":1,"publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"JiFr"}]},{"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"},{"name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root","grant_number":"25351","_id":"26B4D67E-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří"}],"doi":"10.15479/at:ista:10083","publication_identifier":{"issn":["2663-337X"]},"month":"10","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2021","date_updated":"2023-10-31T19:30:02Z","date_created":"2021-10-04T13:33:10Z","related_material":{"record":[{"id":"442","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8931"},{"status":"public","relation":"part_of_dissertation","id":"9287"},{"relation":"part_of_dissertation","status":"public","id":"8283"},{"id":"8986","relation":"part_of_dissertation","status":"public"},{"id":"6627","status":"public","relation":"part_of_dissertation"},{"id":"10095","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10015"}]},"author":[{"full_name":"Li, Lanxin","last_name":"Li","first_name":"Lanxin"}],"ec_funded":1,"file_date_updated":"2022-12-20T23:30:03Z","citation":{"ista":"Li L. 2021. Rapid cell growth regulation in Arabidopsis. Institute of Science and Technology Austria.","ieee":"L. Li, “Rapid cell growth regulation in Arabidopsis,” Institute of Science and Technology Austria, 2021.","apa":"Li, L. (2021). Rapid cell growth regulation in Arabidopsis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10083","ama":"Li L. Rapid cell growth regulation in Arabidopsis. 2021. doi:10.15479/at:ista:10083","chicago":"Li, Lanxin. “Rapid Cell Growth Regulation in Arabidopsis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10083.","mla":"Li, Lanxin. Rapid Cell Growth Regulation in Arabidopsis. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10083.","short":"L. Li, Rapid Cell Growth Regulation in Arabidopsis, Institute of Science and Technology Austria, 2021."},"date_published":"2021-10-06T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"06","title":"Rapid cell growth regulation in Arabidopsis","ddc":["575"],"status":"public","_id":"10083","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_created":"2021-10-14T08:00:07Z","date_updated":"2022-12-20T23:30:03Z","checksum":"3b2f55b3b8ae05337a0dcc1cd8595b10","relation":"main_file","embargo":"2022-10-14","file_id":"10138","file_size":8616142,"content_type":"application/pdf","creator":"cchlebak","file_name":"0._IST_Austria_Thesis_Lanxin_Li_1014_pdftron.pdf","access_level":"open_access"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":15058499,"creator":"cchlebak","access_level":"closed","embargo_to":"open_access","file_name":"0._IST_Austria_Thesis_Lanxin_Li_1014.docx","checksum":"f23ed258ca894f6aabf58b0c128bf242","date_updated":"2022-12-20T23:30:03Z","date_created":"2021-10-14T08:00:13Z","relation":"source_file","file_id":"10139"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"Plant motions occur across a wide spectrum of timescales, ranging from seed dispersal through bursting (milliseconds) and stomatal opening (minutes) to long-term adaptation of gross architecture. Relatively fast motions include water-driven growth as exemplified by root cell expansion under abiotic/biotic stresses or during gravitropism. A showcase is a root growth inhibition in 30 seconds triggered by the phytohormone auxin. However, the cellular and molecular mechanisms are still largely unknown. This thesis covers the studies about this topic as follows. By taking advantage of microfluidics combined with live imaging, pharmaceutical tools, and transgenic lines, we examined the kinetics of and causal relationship among various auxininduced rapid cellular changes in root growth, apoplastic pH, cytosolic Ca2+, cortical microtubule (CMT) orientation, and vacuolar morphology. We revealed that CMT reorientation and vacuolar constriction are the consequence of growth itself instead of responding directly to auxin. In contrast, auxin induces apoplast alkalinization to rapidly inhibit root growth in 30 seconds. This auxin-triggered apoplast alkalinization results from rapid H+- influx that is contributed by Ca2+ inward channel CYCLIC NUCLEOTIDE-GATED CHANNEL 14 (CNGC14)-dependent Ca2+ signaling. To dissect which auxin signaling mediates the rapid apoplast alkalinization, we\r\ncombined microfluidics and genetic engineering to verify that TIR1/AFB receptors conduct a non-transcriptional regulation on Ca2+ and H+ -influx. This non-canonical pathway is mostly mediated by the cytosolic portion of TIR1/AFB. On the other hand, we uncovered, using biochemical and phospho-proteomic analysis, that auxin cell surface signaling component TRANSMEMBRANE KINASE 1 (TMK1) plays a negative role during auxin-trigger apoplast\r\nalkalinization and root growth inhibition through directly activating PM H+ -ATPases. Therefore, we discovered that PM H+ -ATPases counteract instead of mediate the auxintriggered rapid H+ -influx, and that TIR1/AFB and TMK1 regulate root growth antagonistically. This opposite effect of TIR1/AFB and TMK1 is consistent during auxin-induced hypocotyl elongation, leading us to explore the relation of two signaling pathways. Assisted with biochemistry and fluorescent imaging, we verified for the first time that TIR1/AFB and TMK1 can interact with each other. The ability of TIR1/AFB binding to membrane lipid provides a basis for the interaction of plasma membrane- and cytosol-localized proteins.\r\nBesides, transgenic analysis combined with genetic engineering and biochemistry showed that vi\r\nthey do function in the same pathway. Particularly, auxin-induced TMK1 increase is TIR1/AFB dependent, suggesting TIR1/AFB regulation on TMK1. Conversely, TMK1 also regulates TIR1/AFB protein levels and thus auxin canonical signaling. To follow the study of rapid growth regulation, we analyzed another rapid growth regulator, signaling peptide RALF1. We showed that RALF1 also triggers a rapid and reversible growth inhibition caused by H + influx, highly resembling but not dependent on auxin. Besides, RALF1 promotes auxin biosynthesis by increasing expression of auxin biosynthesis enzyme YUCCAs and thus induces auxin signaling in ca. 1 hour, contributing to the sustained RALF1-triggered growth inhibition. These studies collectively contribute to understanding rapid regulation on plant cell\r\ngrowth, novel auxin signaling pathway as well as auxin-peptide crosstalk. "}]},{"day":"02","article_processing_charge":"Yes","has_accepted_license":"1","keyword":["primary root","(phospho)proteomics","auxin","(receptor) kinase"],"date_published":"2021-07-02T00:00:00Z","article_type":"original","publication":"Cells","citation":{"ista":"Nikonorova N, Murphy E, Fonseca de Lima C, Zhu S, van de Cotte B, Vu L, Balcerowicz D, Li L, Kong X, De Rop G, Beeckman T, Friml J, Vissenberg K, Morris P, Ding Z, De Smet I. 2021. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 10, 1665.","apa":"Nikonorova, N., Murphy, E., Fonseca de Lima, C., Zhu, S., van de Cotte, B., Vu, L., … De Smet, I. (2021). The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. MDPI. https://doi.org/10.3390/cells10071665","ieee":"N. Nikonorova et al., “The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators,” Cells, vol. 10. MDPI, 2021.","ama":"Nikonorova N, Murphy E, Fonseca de Lima C, et al. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 2021;10. doi:10.3390/cells10071665","chicago":"Nikonorova, N, E Murphy, CF Fonseca de Lima, S Zhu, B van de Cotte, LD Vu, D Balcerowicz, et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells. MDPI, 2021. https://doi.org/10.3390/cells10071665.","mla":"Nikonorova, N., et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells, vol. 10, 1665, MDPI, 2021, doi:10.3390/cells10071665.","short":"N. Nikonorova, E. Murphy, C. Fonseca de Lima, S. Zhu, B. van de Cotte, L. Vu, D. Balcerowicz, L. Li, X. Kong, G. De Rop, T. Beeckman, J. Friml, K. Vissenberg, P. Morris, Z. Ding, I. De Smet, Cells 10 (2021)."},"abstract":[{"text":"Auxin plays a dual role in growth regulation and, depending on the tissue and concentration of the hormone, it can either promote or inhibit division and expansion processes in plants. Recent studies have revealed that, beyond transcriptional reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here, we explored the impact of different concentrations of the synthetic auxin NAA that establish growth-promoting and -repressing conditions on the root tip proteome and phosphoproteome, generating a unique resource. From the phosphoproteome data, we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results, together with previously published studies, suggest that auxin, H+-ATPases, cell wall modifications and cell wall sensing receptor-like kinases are tightly embedded in a pathway regulating cell elongation. Furthermore, our study assigned a novel role to MKK2 as a regulator of primary root growth and a (potential) regulator of auxin biosynthesis and signalling, and suggests the importance of the MKK2\r\nThr31 phosphorylation site for growth regulation in the Arabidopsis root tip.","lang":"eng"}],"alternative_title":["Protein Phosphorylation and Cell Signaling in Plants"],"type":"journal_article","file":[{"file_size":2667848,"content_type":"application/pdf","creator":"cchlebak","access_level":"open_access","file_name":"2021_Cells_Nikonorova.pdf","checksum":"2a9f534b9c2200e72e2cde95afaf4eed","success":1,"date_updated":"2021-09-16T09:07:06Z","date_created":"2021-09-16T09:07:06Z","relation":"main_file","file_id":"10021"}],"oa_version":"Published Version","title":"The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators","status":"public","ddc":["575"],"intvolume":" 10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10015","month":"07","publication_identifier":{"issn":["2073-4409"]},"language":[{"iso":"eng"}],"doi":"10.3390/cells10071665","isi":1,"quality_controlled":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"external_id":{"isi":["000676604700001"],"pmid":["34359847"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2021-09-16T09:07:06Z","ec_funded":1,"article_number":"1665 ","date_created":"2021-09-14T11:36:20Z","date_updated":"2024-03-28T23:30:44Z","volume":10,"author":[{"first_name":"N","last_name":"Nikonorova","full_name":"Nikonorova, N"},{"full_name":"Murphy, E","last_name":"Murphy","first_name":"E"},{"first_name":"CF","last_name":"Fonseca de Lima","full_name":"Fonseca de Lima, CF"},{"full_name":"Zhu, S","first_name":"S","last_name":"Zhu"},{"full_name":"van de Cotte, B","last_name":"van de Cotte","first_name":"B"},{"full_name":"Vu, LD","first_name":"LD","last_name":"Vu"},{"full_name":"Balcerowicz, D","last_name":"Balcerowicz","first_name":"D"},{"id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5607-272X","first_name":"Lanxin","last_name":"Li","full_name":"Li, Lanxin"},{"full_name":"Kong, X","first_name":"X","last_name":"Kong"},{"full_name":"De Rop, G","last_name":"De Rop","first_name":"G"},{"full_name":"Beeckman, T","first_name":"T","last_name":"Beeckman"},{"last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"},{"last_name":"Vissenberg","first_name":"K","full_name":"Vissenberg, K"},{"last_name":"Morris","first_name":"PC","full_name":"Morris, PC"},{"first_name":"Z","last_name":"Ding","full_name":"Ding, Z"},{"last_name":"De Smet","first_name":"I","full_name":"De Smet, I"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10083"}]},"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"MDPI","acknowledgement":"We thank the Nottingham Stock Centre for seeds, Frank Van Breusegem for the phb3 mutant, and Herman Höfte for the the1 mutant. Open Access Funding by the Austrian Science Fund (FWF).","year":"2021","pmid":1},{"citation":{"short":"L. Li, I. Verstraeten, M. Roosjen, K. Takahashi, L. Rodriguez Solovey, J. Merrin, J. Chen, L. Shabala, W. Smet, H. Ren, S. Vanneste, S. Shabala, B. De Rybel, D. Weijers, T. Kinoshita, W.M. Gray, J. Friml, Research Square (n.d.).","mla":"Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H+-Fluxes in Root Growth.” Research Square, 266395, doi:10.21203/rs.3.rs-266395/v3.","chicago":"Li, Lanxin, Inge Verstraeten, Mark Roosjen, Koji Takahashi, Lesia Rodriguez Solovey, Jack Merrin, Jian Chen, et al. “Cell Surface and Intracellular Auxin Signalling for H+-Fluxes in Root Growth.” Research Square, n.d. https://doi.org/10.21203/rs.3.rs-266395/v3.","ama":"Li L, Verstraeten I, Roosjen M, et al. Cell surface and intracellular auxin signalling for H+-fluxes in root growth. Research Square. doi:10.21203/rs.3.rs-266395/v3","ieee":"L. Li et al., “Cell surface and intracellular auxin signalling for H+-fluxes in root growth,” Research Square. .","apa":"Li, L., Verstraeten, I., Roosjen, M., Takahashi, K., Rodriguez Solovey, L., Merrin, J., … Friml, J. (n.d.). Cell surface and intracellular auxin signalling for H+-fluxes in root growth. Research Square. https://doi.org/10.21203/rs.3.rs-266395/v3","ista":"Li L, Verstraeten I, Roosjen M, Takahashi K, Rodriguez Solovey L, Merrin J, Chen J, Shabala L, Smet W, Ren H, Vanneste S, Shabala S, De Rybel B, Weijers D, Kinoshita T, Gray WM, Friml J. Cell surface and intracellular auxin signalling for H+-fluxes in root growth. Research Square, 266395."},"publication":"Research Square","date_published":"2021-09-09T00:00:00Z","article_processing_charge":"No","day":"09","_id":"10095","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Cell surface and intracellular auxin signalling for H+-fluxes in root growth","status":"public","oa_version":"Preprint","type":"preprint","abstract":[{"lang":"eng","text":"Growth regulation tailors plant development to its environment. A showcase is response to gravity, where shoots bend up and roots down1. This paradox is based on opposite effects of the phytohormone auxin, which promotes cell expansion in shoots, while inhibiting it in roots via a yet unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic engineering and phospho-proteomics in Arabidopsis thaliana, we advance our understanding how auxin inhibits root growth. We show that auxin activates two distinct, antagonistically acting signalling pathways that converge on the rapid regulation of the apoplastic pH, a causative growth determinant. Cell surface-based TRANSMEMBRANE KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma membrane H+-ATPases for apoplast acidification, while intracellular canonical auxin signalling promotes net cellular H+-influx, causing apoplast alkalinisation. The simultaneous activation of these two counteracting mechanisms poises the root for a rapid, fine-tuned growth modulation while navigating complex soil environment."}],"main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.21203/rs.3.rs-266395/v3"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"},{"call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630"},{"_id":"26B4D67E-B435-11E9-9278-68D0E5697425","grant_number":"25351","name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root"}],"doi":"10.21203/rs.3.rs-266395/v3","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"Bio"}],"publication_identifier":{"issn":["2693-5015"]},"month":"09","acknowledgement":"We thank Nataliia Gnyliukh and Lukas Hörmayer for technical assistance and Nadine Paris for sharing PM-Cyto seeds. We gratefully acknowledge Life Science, Machine Shop and Bioimaging Facilities of IST Austria. This project has received funding from the European Research Council Advanced Grant (ETAP-742985) and the Austrian Science Fund (FWF) I 3630-B25 to J.F., the National Institutes of Health (GM067203) to W.M.G., the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001.), the Research Foundation-Flanders (FWO; Odysseus II G0D0515N) and a European Research Council Starting Grant (TORPEDO-714055) to W.S. and B.D.R., the VICI grant (865.14.001) from the Netherlands Organization for Scientific Research to M.R and D.W., the Australian Research Council and China National Distinguished Expert Project (WQ20174400441) to S.S., the MEXT/JSPS KAKENHI to K.T. (20K06685) and T.K. (20H05687 and 20H05910), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and the DOC Fellowship of the Austrian Academy of Sciences to L.L., the China Scholarship Council to J.C.","year":"2021","department":[{"_id":"JiFr"},{"_id":"NanoFab"}],"publication_status":"accepted","related_material":{"record":[{"id":"10223","status":"public","relation":"later_version"},{"relation":"dissertation_contains","status":"public","id":"10083"}]},"author":[{"last_name":"Li","first_name":"Lanxin","orcid":"0000-0002-5607-272X","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Lanxin"},{"full_name":"Verstraeten, Inge","first_name":"Inge","last_name":"Verstraeten","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7241-2328"},{"full_name":"Roosjen, Mark","last_name":"Roosjen","first_name":"Mark"},{"first_name":"Koji","last_name":"Takahashi","full_name":"Takahashi, Koji"},{"full_name":"Rodriguez Solovey, Lesia","first_name":"Lesia","last_name":"Rodriguez Solovey","id":"3922B506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7244-7237"},{"orcid":"0000-0001-5145-4609","id":"4515C308-F248-11E8-B48F-1D18A9856A87","last_name":"Merrin","first_name":"Jack","full_name":"Merrin, Jack"},{"last_name":"Chen","first_name":"Jian","full_name":"Chen, Jian"},{"full_name":"Shabala, Lana","first_name":"Lana","last_name":"Shabala"},{"first_name":"Wouter","last_name":"Smet","full_name":"Smet, Wouter"},{"full_name":"Ren, Hong","last_name":"Ren","first_name":"Hong"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"last_name":"Shabala","first_name":"Sergey","full_name":"Shabala, Sergey"},{"full_name":"De Rybel, Bert","first_name":"Bert","last_name":"De Rybel"},{"full_name":"Weijers, Dolf","last_name":"Weijers","first_name":"Dolf"},{"last_name":"Kinoshita","first_name":"Toshinori","full_name":"Kinoshita, Toshinori"},{"last_name":"Gray","first_name":"William M.","full_name":"Gray, William M."},{"full_name":"Friml, Jiří","first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"date_created":"2021-10-06T08:56:22Z","date_updated":"2024-03-28T23:30:44Z","article_number":"266395","ec_funded":1},{"file_date_updated":"2022-12-20T23:30:08Z","ec_funded":1,"date_created":"2021-11-15T17:12:57Z","date_updated":"2023-11-07T08:28:29Z","author":[{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","first_name":"Laura","last_name":"Schmid","full_name":"Schmid, Laura"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9997"},{"status":"public","relation":"part_of_dissertation","id":"2"},{"id":"9402","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Institute of Science and Technology Austria","year":"2021","month":"11","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"language":[{"iso":"eng"}],"doi":"10.15479/at:ista:10293","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"oa":1,"abstract":[{"text":"Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more\r\nthan their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations\r\nare more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"file_name":"submission_new.zip","embargo_to":"open_access","access_level":"closed","creator":"lschmid","file_size":29703124,"content_type":"application/zip","file_id":"10305","relation":"source_file","date_updated":"2022-12-20T23:30:08Z","date_created":"2021-11-18T12:41:46Z","checksum":"86a05b430756ca12ae8107b6e6f3c1e5"},{"file_name":"thesis_new_upload.pdf","access_level":"open_access","creator":"lschmid","file_size":8320985,"content_type":"application/pdf","embargo":"2022-10-18","file_id":"10306","relation":"main_file","date_created":"2021-11-18T12:59:15Z","date_updated":"2022-12-20T23:30:08Z","checksum":"d940af042e94660c6b6a7b4f0b184d47"}],"status":"public","title":"Evolution of cooperation via (in)direct reciprocity under imperfect information","ddc":["519","576"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10293","day":"17","has_accepted_license":"1","article_processing_charge":"No","date_published":"2021-11-17T00:00:00Z","page":"171","citation":{"ama":"Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:10.15479/at:ista:10293","ista":"Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria.","apa":"Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293","ieee":"L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021.","mla":"Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293.","short":"L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021.","chicago":"Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10293."}},{"publication_identifier":{"eissn":["2045-2322"]},"month":"08","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000692406400018"],"pmid":["34465830"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41598-021-96932-1","article_number":"17443","ec_funded":1,"file_date_updated":"2021-09-13T10:31:21Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","pmid":1,"year":"2021","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). L.S. received additional partial support by the Austrian Science Fund (FWF) under Grant Z211-N23 (Wittgenstein Award).","volume":11,"date_updated":"2024-03-28T23:30:45Z","date_created":"2021-09-11T16:22:02Z","related_material":{"record":[{"id":"10293","relation":"dissertation_contains","status":"public"}]},"author":[{"last_name":"Schmid","first_name":"Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","full_name":"Schmid, Laura"},{"last_name":"Shati","first_name":"Pouya","full_name":"Shati, Pouya"},{"last_name":"Hilbe","first_name":"Christian","full_name":"Hilbe, Christian"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"}],"keyword":["Multidisciplinary"],"has_accepted_license":"1","article_processing_charge":"Yes","day":"31","article_type":"original","citation":{"short":"L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).","mla":"Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.","chicago":"Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-96932-1.","ama":"Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 2021;11(1). doi:10.1038/s41598-021-96932-1","apa":"Schmid, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-96932-1","ieee":"L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021.","ista":"Schmid L, Shati P, Hilbe C, Chatterjee K. 2021. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 11(1), 17443."},"publication":"Scientific Reports","date_published":"2021-08-31T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"text":"Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms.","lang":"eng"}],"intvolume":" 11","ddc":["003"],"status":"public","title":"The evolution of indirect reciprocity under action and assessment generosity","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9997","file":[{"file_size":2424943,"content_type":"application/pdf","creator":"cchlebak","access_level":"open_access","file_name":"2021_ScientificReports_Schmid.pdf","checksum":"19df8816cf958b272b85841565c73182","success":1,"date_created":"2021-09-13T10:31:21Z","date_updated":"2021-09-13T10:31:21Z","relation":"main_file","file_id":"10006"}],"oa_version":"Published Version"},{"type":"journal_article","issue":"10","abstract":[{"text":"Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9402","intvolume":" 5","title":"A unified framework of direct and indirect reciprocity","status":"public","ddc":["000"],"file":[{"file_name":"2021_NatureHumanBehaviour_Schmid_accepted.pdf","access_level":"open_access","content_type":"application/pdf","file_size":5232761,"creator":"dernst","relation":"main_file","file_id":"14496","date_updated":"2023-11-07T08:27:23Z","date_created":"2023-11-07T08:27:23Z","checksum":"34f55e173f90dc1dab731063458ac780","success":1}],"oa_version":"Submitted Version","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"13","citation":{"ama":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 2021;5(10):1292–1302. doi:10.1038/s41562-021-01114-8","apa":"Schmid, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature. https://doi.org/10.1038/s41562-021-01114-8","ieee":"L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021.","ista":"Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.","short":"L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302.","mla":"Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:10.1038/s41562-021-01114-8.","chicago":"Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour. Springer Nature, 2021. https://doi.org/10.1038/s41562-021-01114-8."},"publication":"Nature Human Behaviour","page":"1292–1302","article_type":"original","date_published":"2021-05-13T00:00:00Z","ec_funded":1,"file_date_updated":"2023-11-07T08:27:23Z","pmid":1,"year":"2021","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Start Grant 279307: Graph Games (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","publisher":"Springer Nature","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10293"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/the-emergence-of-cooperation/"}]},"author":[{"last_name":"Schmid","first_name":"Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","full_name":"Schmid, Laura"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"volume":5,"date_updated":"2024-03-28T23:30:45Z","date_created":"2021-05-18T16:56:57Z","publication_identifier":{"eissn":["2397-3374"]},"month":"05","oa":1,"external_id":{"isi":["000650304000002"],"pmid":["33986519"]},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","doi":"10.1038/s41562-021-01114-8","language":[{"iso":"eng"}]},{"oa_version":"Published Version","file":[{"file_id":"10150","relation":"main_file","success":1,"checksum":"7e5d08ce46b0451b3102eacd3d00f85f","date_updated":"2021-10-18T10:42:15Z","date_created":"2021-10-18T10:42:15Z","access_level":"open_access","file_name":"elastic-curves-paper.pdf","creator":"chafner","file_size":17064290,"content_type":"application/pdf"},{"creator":"chafner","content_type":"application/pdf","file_size":547156,"access_level":"open_access","file_name":"elastic-curves-supp.pdf","checksum":"0088643478be7c01a703b5b10767348f","date_created":"2021-10-18T10:42:22Z","date_updated":"2021-10-18T10:42:22Z","file_id":"10151","relation":"supplementary_material"}],"_id":"9817","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 40","ddc":["516"],"title":"The design space of plane elastic curves","status":"public","issue":"4","abstract":[{"text":"Elastic bending of initially flat slender elements allows the realization and economic fabrication of intriguing curved shapes. In this work, we derive an intuitive but rigorous geometric characterization of the design space of plane elastic rods with variable stiffness. It enables designers to determine which shapes are physically viable with active bending by visual inspection alone. Building on these insights, we propose a method for efficiently designing the geometry of a flat elastic rod that realizes a target equilibrium curve, which only requires solving a linear program. We implement this method in an interactive computational design tool that gives feedback about the feasibility of a design, and computes the geometry of the structural elements necessary to realize it within an instant. The tool also offers an iterative optimization routine that improves the fabricability of a model while modifying it as little as possible. In addition, we use our geometric characterization to derive an algorithm for analyzing and recovering the stability of elastic curves that would otherwise snap out of their unstable equilibrium shapes by buckling. We show the efficacy of our approach by designing and manufacturing several physical models that are assembled from flat elements.","lang":"eng"}],"type":"journal_article","date_published":"2021-07-19T00:00:00Z","citation":{"short":"C. Hafner, B. Bickel, ACM Transactions on Graphics 40 (2021).","mla":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” ACM Transactions on Graphics, vol. 40, no. 4, 126, Association for Computing Machinery, 2021, doi:10.1145/3450626.3459800.","chicago":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” ACM Transactions on Graphics. Association for Computing Machinery, 2021. https://doi.org/10.1145/3450626.3459800.","ama":"Hafner C, Bickel B. The design space of plane elastic curves. ACM Transactions on Graphics. 2021;40(4). doi:10.1145/3450626.3459800","ieee":"C. Hafner and B. Bickel, “The design space of plane elastic curves,” ACM Transactions on Graphics, vol. 40, no. 4. Association for Computing Machinery, 2021.","apa":"Hafner, C., & Bickel, B. (2021). The design space of plane elastic curves. ACM Transactions on Graphics. Virtual: Association for Computing Machinery. https://doi.org/10.1145/3450626.3459800","ista":"Hafner C, Bickel B. 2021. The design space of plane elastic curves. ACM Transactions on Graphics. 40(4), 126."},"publication":"ACM Transactions on Graphics","article_type":"original","article_processing_charge":"No","has_accepted_license":"1","day":"19","scopus_import":"1","keyword":["Computing methodologies","shape modeling","modeling and simulation","theory of computation","computational geometry","mathematics of computing","mathematical optimization"],"related_material":{"record":[{"id":"12897","status":"public","relation":"dissertation_contains"}],"link":[{"description":"News on IST Website","relation":"press_release","url":"https://ist.ac.at/en/news/designing-with-elastic-structures/"}]},"author":[{"last_name":"Hafner","first_name":"Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","full_name":"Hafner, Christian"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"}],"volume":40,"date_created":"2021-08-08T22:01:26Z","date_updated":"2024-03-28T23:30:47Z","acknowledgement":"We thank the anonymous reviewers for their generous feedback, and Michal Piovarči for his help in producing the supplemental video. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767).\r\n","year":"2021","publisher":"Association for Computing Machinery","department":[{"_id":"BeBi"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2021-10-18T10:42:22Z","article_number":"126","doi":"10.1145/3450626.3459800","conference":{"name":"SIGGRAF: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2021-08-13","start_date":"2021-08-09","location":"Virtual"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000674930900091"]},"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"isi":1,"quality_controlled":"1","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"month":"07"},{"abstract":[{"text":"Plants maintain the capacity to develop new organs e.g. lateral roots post-embryonically throughout their whole life and thereby flexibly adapt to ever-changing environmental conditions. Plant hormones auxin and cytokinin are the main regulators of the lateral root organogenesis. Additionally to their solo activities, the interaction between auxin and\r\ncytokinin plays crucial role in fine-tuning of lateral root development and growth. In particular, cytokinin modulates auxin distribution within the developing lateral root by affecting the endomembrane trafficking of auxin transporter PIN1 and promoting its vacuolar degradation (Marhavý et al., 2011, 2014). This effect is independent of transcription and\r\ntranslation. Therefore, it suggests novel, non-canonical cytokinin activity occuring possibly on the posttranslational level. Impact of cytokinin and other plant hormones on auxin transporters (including PIN1) on the posttranslational level is described in detail in the introduction part of this thesis in a form of a review (Semeradova et al., 2020). To gain insights into the molecular machinery underlying cytokinin effect on the endomembrane trafficking in the plant cell, in particular on the PIN1 degradation, we conducted two large proteomic screens: 1) Identification of cytokinin binding proteins using\r\nchemical proteomics. 2) Monitoring of proteomic and phosphoproteomic changes upon cytokinin treatment. In the first screen, we identified DYNAMIN RELATED PROTEIN 2A (DRP2A). We found that DRP2A plays a role in cytokinin regulated processes during the plant growth and that cytokinin treatment promotes destabilization of DRP2A protein. However, the role of DRP2A in the PIN1 degradation remains to be elucidated. In the second screen, we found VACUOLAR PROTEIN SORTING 9A (VPS9A). VPS9a plays crucial role in plant’s response to cytokin and in cytokinin mediated PIN1 degradation. Altogether, we identified proteins, which bind to cytokinin and proteins that in response to\r\ncytokinin exhibit significantly changed abundance or phosphorylation pattern. By combining information from these two screens, we can pave our way towards understanding of noncanonical cytokinin effects.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"file_name":"Hana_Semeradova_Disertation_Thesis_II_Revised_3.docx","embargo_to":"open_access","access_level":"closed","creator":"cziletti","file_size":28508629,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"10186","relation":"source_file","date_created":"2021-10-27T07:45:37Z","date_updated":"2022-12-20T23:30:05Z","checksum":"ce7108853e6cec6224f17cd6429b51fe"},{"relation":"main_file","file_id":"10187","embargo":"2022-10-28","date_created":"2021-10-27T07:45:57Z","date_updated":"2022-12-20T23:30:05Z","checksum":"0d7afb846e8e31ec794de47bf44e12ef","file_name":"Hana_Semeradova_Disertation_Thesis_II_Revised_3PDFA.pdf","access_level":"open_access","file_size":10623525,"content_type":"application/pdf","creator":"cziletti"}],"title":"Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis","status":"public","ddc":["570"],"_id":"10135","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"13","article_processing_charge":"No","has_accepted_license":"1","date_published":"2021-10-13T00:00:00Z","citation":{"chicago":"Semerádová, Hana. “Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10135.","mla":"Semerádová, Hana. Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10135.","short":"H. Semerádová, Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis, Institute of Science and Technology Austria, 2021.","ista":"Semerádová H. 2021. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria.","ieee":"H. Semerádová, “Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis,” Institute of Science and Technology Austria, 2021.","apa":"Semerádová, H. (2021). Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10135","ama":"Semerádová H. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. 2021. doi:10.15479/at:ista:10135"},"file_date_updated":"2022-12-20T23:30:05Z","date_created":"2021-10-13T13:42:48Z","date_updated":"2024-01-25T10:53:29Z","author":[{"id":"42FE702E-F248-11E8-B48F-1D18A9856A87","first_name":"Hana","last_name":"Semerádová","full_name":"Semerádová, Hana"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9160"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"year":"2021","month":"10","publication_identifier":{"isbn":["978-3-99078-014-5"],"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","first_name":"Eva","last_name":"Benková"}],"language":[{"iso":"eng"}],"doi":"10.15479/at:ista:10135","project":[{"_id":"261821BC-B435-11E9-9278-68D0E5697425","grant_number":"24746","name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis."}],"oa":1},{"_id":"9728","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["532"],"title":"Transition to turbulence and drag reduction in particle-laden pipe flows","oa_version":"Published Version","file":[{"date_created":"2021-07-28T13:32:02Z","date_updated":"2022-07-29T22:30:05Z","checksum":"77436be3563a90435024307b1b5ee7e8","relation":"source_file","file_id":"9744","content_type":"application/x-zip-compressed","file_size":22859658,"creator":"nagrawal","embargo_to":"open_access","file_name":"Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.zip","access_level":"closed"},{"file_name":"Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.pdf","access_level":"open_access","content_type":"application/pdf","file_size":18658048,"creator":"nagrawal","relation":"main_file","file_id":"9745","embargo":"2022-07-28","date_updated":"2022-07-29T22:30:05Z","date_created":"2021-07-28T13:32:05Z","checksum":"72a891d7daba85445c29b868c22575ed"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Most real-world flows are multiphase, yet we know little about them compared to their single-phase counterparts. Multiphase flows are more difficult to investigate as their dynamics occur in large parameter space and involve complex phenomena such as preferential concentration, turbulence modulation, non-Newtonian rheology, etc. Over the last few decades, experiments in particle-laden flows have taken a back seat in favour of ever-improving computational resources. However, computers are still not powerful enough to simulate a real-world fluid with millions of finite-size particles. Experiments are essential not only because they offer a reliable way to investigate real-world multiphase flows but also because they serve to validate numerical studies and steer the research in a relevant direction. In this work, we have experimentally investigated particle-laden flows in pipes, and in particular, examined the effect of particles on the laminar-turbulent transition and the drag scaling in turbulent flows.\r\n\r\nFor particle-laden pipe flows, an earlier study [Matas et al., 2003] reported how the sub-critical (i.e., hysteretic) transition that occurs via localised turbulent structures called puffs is affected by the addition of particles. In this study, in addition to this known transition, we found a super-critical transition to a globally fluctuating state with increasing particle concentration. At the same time, the Newtonian-type transition via puffs is delayed to larger Reynolds numbers. At an even higher concentration, only the globally fluctuating state is found. The dynamics of particle-laden flows are hence determined by two competing instabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle-induced globally fluctuating state at high, and a coexistence state at intermediate concentrations.\r\n\r\nThe effect of particles on turbulent drag is ambiguous, with studies reporting drag reduction, no net change, and even drag increase. The ambiguity arises because, in addition to particle concentration, particle shape, size, and density also affect the net drag. Even similar particles might affect the flow dissimilarly in different Reynolds number and concentration ranges. In the present study, we explored a wide range of both Reynolds number and concentration, using spherical as well as cylindrical particles. We found that the spherical particles do not reduce drag while the cylindrical particles are drag-reducing within a specific Reynolds number interval. The interval strongly depends on the particle concentration and the relative size of the pipe and particles. Within this interval, the magnitude of drag reduction reaches a maximum. These drag reduction maxima appear to fall onto a distinct power-law curve irrespective of the pipe diameter and particle concentration, and this curve can be considered as the maximum drag reduction asymptote for a given fibre shape. Such an asymptote is well known for polymeric flows but had not been identified for particle-laden flows prior to this work."}],"citation":{"ista":"Agrawal N. 2021. Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria.","apa":"Agrawal, N. (2021). Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9728","ieee":"N. Agrawal, “Transition to turbulence and drag reduction in particle-laden pipe flows,” Institute of Science and Technology Austria, 2021.","ama":"Agrawal N. Transition to turbulence and drag reduction in particle-laden pipe flows. 2021. doi:10.15479/at:ista:9728","chicago":"Agrawal, Nishchal. “Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9728.","mla":"Agrawal, Nishchal. Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9728.","short":"N. Agrawal, Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows, Institute of Science and Technology Austria, 2021."},"page":"118","date_published":"2021-07-29T00:00:00Z","keyword":["Drag Reduction","Transition to Turbulence","Multiphase Flows","particle Laden Flows","Complex Flows","Experiments","Fluid Dynamics"],"day":"29","article_processing_charge":"No","has_accepted_license":"1","year":"2021","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"author":[{"id":"469E6004-F248-11E8-B48F-1D18A9856A87","last_name":"Agrawal","first_name":"Nishchal","full_name":"Agrawal, Nishchal"}],"related_material":{"record":[{"id":"6189","status":"public","relation":"part_of_dissertation"}]},"date_created":"2021-07-27T13:40:30Z","date_updated":"2024-02-28T13:14:39Z","file_date_updated":"2022-07-29T22:30:05Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"doi":"10.15479/at:ista:9728","supervisor":[{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"month":"07","publication_identifier":{"issn":["2663-337X"]}},{"page":"4082-4093","citation":{"ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093.","mla":"Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020."},"publication":"Proceedings of the 37th International Conference on Machine Learning","date_published":"2020-01-01T00:00:00Z","series_title":"PMLR","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","status":"public","ddc":["000"],"title":"A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10673","file":[{"relation":"main_file","file_id":"10691","checksum":"c9a4a29161777fc1a89ef451c040e3b1","success":1,"date_created":"2022-01-26T11:08:51Z","date_updated":"2022-01-26T11:08:51Z","access_level":"open_access","file_name":"2020_PMLR_Hasani.pdf","content_type":"application/pdf","file_size":2329798,"creator":"cchlebak"}],"oa_version":"Published Version","alternative_title":["PMLR"],"type":"conference","abstract":[{"lang":"eng","text":"We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level."}],"project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v119/hasani20a.html"}],"language":[{"iso":"eng"}],"conference":{"location":"Virtual","start_date":"2020-07-12","end_date":"2020-07-18","name":"ML: Machine Learning"},"publication_identifier":{"issn":["2640-3498"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_status":"published","acknowledgement":"RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n","year":"2020","date_created":"2022-01-25T15:50:34Z","date_updated":"2022-01-26T11:14:27Z","author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Amini","first_name":"Alexander","full_name":"Amini, Alexander"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","file_date_updated":"2022-01-26T11:08:51Z"},{"scopus_import":"1","publication_identifier":{"isbn":["9781939133021"]},"article_processing_charge":"No","month":"01","day":"01","page":"295-306","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.usenix.org/system/files/conference/atc18/atc18-arbel-raviv.pdf"}],"citation":{"mla":"Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.","short":"M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306.","chicago":"Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, 295–306. USENIX Association, 2020.","ama":"Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.","ista":"Arbel-Raviv M, Brown TA, Morrison A. 2020. Getting to the root of concurrent binary search tree performance. Proceedings of the 2018 USENIX Annual Technical Conference. USENIX: Annual Technical Conference, 295–306.","apa":"Arbel-Raviv, M., Brown, T. A., & Morrison, A. (2020). Getting to the root of concurrent binary search tree performance. In Proceedings of the 2018 USENIX Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX Association.","ieee":"M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical Conference, Boston, MA, United States, 2020, pp. 295–306."},"oa":1,"publication":"Proceedings of the 2018 USENIX Annual Technical Conference","language":[{"iso":"eng"}],"date_published":"2020-01-01T00:00:00Z","conference":{"end_date":"2018-07-13","location":"Boston, MA, United States","start_date":"2018-07-11","name":"USENIX: Annual Technical Conference"},"type":"conference","abstract":[{"text":"Many systems rely on optimistic concurrent search trees for multi-core scalability. In principle, optimistic trees have a simple performance story: searches are read-only and so run in parallel, with writes to shared memory occurring only when modifying the data structure. However, this paper shows that in practice, obtaining the full performance benefits of optimistic search trees is not so simple.\r\n\r\nWe focus on optimistic binary search trees (BSTs) and perform a detailed performance analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both microbenchmarks and an in-memory database system. We find and explain significant unexpected performance differences between BSTs with similar tree structure and search implementations, which we trace to subtle performance-degrading interactions of BSTs with systems software and hardware subsystems. We further derive a prescriptive approach to avoid this performance degradation, as well as algorithmic insights on optimistic BST design. Our work underlines the gap between the theory and practice of multi-core performance, and calls for further research to help bridge this gap.","lang":"eng"}],"department":[{"_id":"DaAl"}],"publisher":"USENIX Association","ddc":["000"],"title":"Getting to the root of concurrent binary search tree performance","publication_status":"published","status":"public","_id":"7272","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","oa_version":"Published Version","date_updated":"2021-01-11T15:25:48Z","date_created":"2020-01-14T07:27:08Z","author":[{"last_name":"Arbel-Raviv","first_name":"Maya","full_name":"Arbel-Raviv, Maya"},{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","last_name":"Brown","full_name":"Brown, Trevor A"},{"last_name":"Morrison","first_name":"Adam","full_name":"Morrison, Adam"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7346","ddc":["000"],"title":"The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game","status":"public","intvolume":" 153","oa_version":"Preprint","file":[{"date_created":"2020-03-23T09:14:06Z","date_updated":"2020-07-14T12:47:56Z","checksum":"9a91916ac2c21ab42458fcda39ef0b8d","file_id":"7608","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":630752,"file_name":"2019_LIPIcS_Schmid.pdf","access_level":"open_access"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to \"one-shot games\"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature. "}],"publication":"Proceedings of the 23rd International Conference on Principles of Distributed Systems","citation":{"chicago":"Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.","short":"L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.","ieee":"L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd International Conference on Principles of Distributed Systems, Neuchâtel, Switzerland, 2020, vol. 153.","apa":"Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21","ista":"Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.","ama":"Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21"},"date_published":"2020-02-10T00:00:00Z","scopus_import":"1","day":"10","article_processing_charge":"No","has_accepted_license":"1","year":"2020","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"author":[{"full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","last_name":"Schmid","first_name":"Laura"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_updated":"2023-02-23T13:05:49Z","date_created":"2020-01-21T16:00:26Z","volume":153,"article_number":"21","file_date_updated":"2020-07-14T12:47:56Z","external_id":{"arxiv":["1906.00110"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"conference":{"start_date":"2019-12-17","location":"Neuchâtel, Switzerland","end_date":"2019-12-19","name":"OPODIS: International Conference on Principles of Distributed Systems"},"doi":"10.4230/LIPIcs.OPODIS.2019.21","language":[{"iso":"eng"}],"month":"02"},{"oa_version":"Published Version","file":[{"checksum":"b9a691d658d075c6369d3304d17fb818","date_created":"2020-01-21T11:21:04Z","date_updated":"2020-07-14T12:47:56Z","file_id":"7349","relation":"main_file","creator":"bkragl","file_size":617206,"content_type":"application/pdf","access_level":"open_access","file_name":"main.pdf"}],"ddc":["000"],"status":"public","title":"Monitoring event frequencies","intvolume":" 152","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7348","abstract":[{"lang":"eng","text":"The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. "}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2020-01-15T00:00:00Z","publication":"28th EACSL Annual Conference on Computer Science Logic","citation":{"ama":"Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20","ieee":"T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152.","apa":"Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20","ista":"Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.","short":"T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20."},"day":"15","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"date_created":"2020-01-21T11:22:21Z","date_updated":"2021-01-12T08:13:12Z","volume":152,"author":[{"full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","first_name":"Thomas"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Kragl, Bernhard","last_name":"Kragl","first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"year":"2020","file_date_updated":"2020-07-14T12:47:56Z","article_number":"20","language":[{"iso":"eng"}],"conference":{"name":"CSL: Computer Science Logic","location":"Barcelona, Spain","start_date":"2020-01-13","end_date":"2020-01-16"},"doi":"10.4230/LIPIcs.CSL.2020.20","quality_controlled":"1","project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1910.06097"]},"oa":1,"month":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771320"]}},{"doi":"10.1007/s11786-020-00461-5","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"month":"03","publication_identifier":{"eissn":["1661-8289"],"issn":["1661-8270"]},"author":[{"last_name":"Choudhary","first_name":"Aruni","full_name":"Choudhary, Aruni"},{"full_name":"Kachanovich, Siargey","first_name":"Siargey","last_name":"Kachanovich"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"date_updated":"2021-01-12T08:14:13Z","date_created":"2020-03-05T13:30:18Z","volume":14,"year":"2020","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"file_date_updated":"2020-11-20T10:18:02Z","ec_funded":1,"date_published":"2020-03-01T00:00:00Z","publication":"Mathematics in Computer Science","citation":{"chicago":"Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science. Springer Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5.","mla":"Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5.","short":"A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176.","ista":"Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176.","apa":"Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5","ieee":"A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” Mathematics in Computer Science, vol. 14. Springer Nature, pp. 141–176, 2020.","ama":"Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5"},"article_type":"original","page":"141-176","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","file":[{"date_updated":"2020-11-20T10:18:02Z","date_created":"2020-11-20T10:18:02Z","success":1,"checksum":"1d145f3ab50ccee735983cb89236e609","file_id":"8783","relation":"main_file","creator":"dernst","file_size":872275,"content_type":"application/pdf","file_name":"2020_MathCompScie_Choudhary.pdf","access_level":"open_access"}],"oa_version":"Published Version","_id":"7567","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Coxeter triangulations have good quality","ddc":["510"],"status":"public","intvolume":" 14","abstract":[{"text":"Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space.","lang":"eng"}],"type":"journal_article"},{"type":"journal_article","issue":"1","abstract":[{"text":"The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7594","intvolume":" 2","status":"public","ddc":["530"],"title":"How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-23T10:18:38Z","checksum":"1be551fd5f5583635076017d7391ffdc","relation":"main_file","file_id":"7610","content_type":"application/pdf","file_size":1436735,"creator":"dernst","file_name":"2020_PhysRevResearch_Gotfryd.pdf","access_level":"open_access"}],"article_processing_charge":"No","has_accepted_license":"1","day":"20","citation":{"ama":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2020;2(1). doi:10.1103/PhysRevResearch.2.013353","ieee":"D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,” Physical Review Research, vol. 2, no. 1. American Physical Society, 2020.","apa":"Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., & Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.2.013353","ista":"Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2(1), 013353.","short":"D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical Review Research 2 (2020).","mla":"Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353.","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles, and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/PhysRevResearch.2.013353."},"publication":"Physical Review Research","article_type":"original","date_published":"2020-03-20T00:00:00Z","article_number":"013353","ec_funded":1,"file_date_updated":"2020-07-14T12:48:00Z","year":"2020","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"publication_status":"published","author":[{"first_name":"Dorota","last_name":"Gotfryd","full_name":"Gotfryd, Dorota"},{"full_name":"Paerschke, Ekaterina","first_name":"Ekaterina","last_name":"Paerschke","id":"8275014E-6063-11E9-9B7F-6338E6697425","orcid":"0000-0003-0853-8182"},{"full_name":"Chaloupka, Jiri","last_name":"Chaloupka","first_name":"Jiri"},{"full_name":"Oles, Andrzej M.","first_name":"Andrzej M.","last_name":"Oles"},{"full_name":"Wohlfeld, Krzysztof","last_name":"Wohlfeld","first_name":"Krzysztof"}],"volume":2,"date_created":"2020-03-20T15:21:10Z","date_updated":"2021-01-12T08:14:23Z","month":"03","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"quality_controlled":"1","doi":"10.1103/PhysRevResearch.2.013353","language":[{"iso":"eng"}]},{"date_published":"2020-02-01T00:00:00Z","citation":{"chicago":"Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.","mla":"Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.","short":"D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16.","ista":"Alistarh D-A, Fedorov A, Koval N. 2020. In search of the fastest concurrent union-find algorithm. 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 15:1-15:16.","ieee":"D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.","apa":"Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15","ama":"Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15"},"publication":"23rd International Conference on Principles of Distributed Systems","page":"15:1-15:16","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","file":[{"file_name":"2019_LIPIcs_Alistarh.pdf","access_level":"open_access","content_type":"application/pdf","file_size":13074131,"creator":"dernst","relation":"main_file","file_id":"7609","date_updated":"2020-07-14T12:48:01Z","date_created":"2020-03-23T09:22:48Z","checksum":"d66f07ecb609d9f02433e39f80a447e9"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7605","intvolume":" 153","status":"public","title":"In search of the fastest concurrent union-find algorithm","ddc":["000"],"abstract":[{"lang":"eng","text":"Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and analyze the performance of several concurrent Union-Find algorithms and optimization strategies across a wide range of platforms (Intel, AMD, and ARM) and workloads (social, random, and road networks, as well as integrations into more complex algorithms). We first observe that, due to the limited computational cost, the number of induced cache misses is the critical determining factor for the performance of existing algorithms. We introduce new techniques to reduce this cost by storing node priorities implicitly and by using plain reads and writes in a way that does not affect the correctness of the algorithms. Finally, we show that Union-Find implementations are an interesting application for Transactional Memory (TM): one of the fastest algorithm variants we discovered is a sequential one that uses coarse-grained locking with the lock elision optimization to reduce synchronization cost and increase scalability. "}],"type":"conference","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.OPODIS.2019.15","conference":{"end_date":"2019-12-19","location":"Neuchatal, Switzerland","start_date":"2019-12-17","name":"OPODIS: International Conference on Principles of Distributed Systems"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1911.06347"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["18688969"],"isbn":["9783959771337"]},"month":"02","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Fedorov","first_name":"Alexander","full_name":"Fedorov, Alexander"},{"full_name":"Koval, Nikita","first_name":"Nikita","last_name":"Koval","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87"}],"volume":153,"date_created":"2020-03-22T23:00:46Z","date_updated":"2023-02-23T13:12:12Z","year":"2020","department":[{"_id":"DaAl"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","file_date_updated":"2020-07-14T12:48:01Z","license":"https://creativecommons.org/licenses/by/3.0/"},{"page":"22","publication":"bioRxiv","main_file_link":[{"url":"https://doi.org/10.1101/791137","open_access":"1"}],"oa":1,"citation":{"chicago":"Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen, Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv. Cold Spring Harbor Laboratory, 2020. https://doi.org/10.1101/791137.","short":"Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K. Liao, BioRxiv (2020).","mla":"Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, Cold Spring Harbor Laboratory, 2020, doi:10.1101/791137.","apa":"Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/791137","ieee":"Z. Wei et al., “Plasmodesmata-like intercellular connections by plant remorin in animal cells,” bioRxiv. Cold Spring Harbor Laboratory, 2020.","ista":"Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv, 10.1101/791137.","ama":"Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137"},"language":[{"iso":"eng"}],"date_published":"2020-02-19T00:00:00Z","doi":"10.1101/791137","day":"19","month":"02","article_processing_charge":"No","publication_status":"published","status":"public","title":"Plasmodesmata-like intercellular connections by plant remorin in animal cells","publisher":"Cold Spring Harbor Laboratory","department":[{"_id":"JiFr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7601","year":"2020","date_created":"2020-03-21T16:34:42Z","date_updated":"2021-01-12T08:14:26Z","oa_version":"Preprint","author":[{"full_name":"Wei, Zhuang","first_name":"Zhuang","last_name":"Wei"},{"first_name":"Shutang","last_name":"Tan","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","full_name":"Tan, Shutang"},{"full_name":"Liu, Tao","first_name":"Tao","last_name":"Liu"},{"full_name":"Wu, Yuan","last_name":"Wu","first_name":"Yuan"},{"full_name":"Lei, Ji-Gang","first_name":"Ji-Gang","last_name":"Lei"},{"full_name":"Chen, ZhengJun","first_name":"ZhengJun","last_name":"Chen"},{"full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Xue","first_name":"Hong-Wei","full_name":"Xue, Hong-Wei"},{"last_name":"Liao","first_name":"Kan","full_name":"Liao, Kan"}],"type":"preprint","abstract":[{"lang":"eng","text":"Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals."}]},{"day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"date_published":"2020-02-01T00:00:00Z","publication":"Journal of The Royal Society Interface","citation":{"ama":"Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 2020;17(163). doi:10.1098/rsif.2019.0721","ista":"Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. 2020. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 17(163), 20190721.","ieee":"J. Larsson, A. M. Westram, S. Bengmark, T. Lundh, and R. K. Butlin, “A developmentally descriptive method for quantifying shape in gastropod shells,” Journal of The Royal Society Interface, vol. 17, no. 163. The Royal Society, 2020.","apa":"Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., & Butlin, R. K. (2020). A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2019.0721","mla":"Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface, vol. 17, no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721.","short":"J. Larsson, A.M. Westram, S. Bengmark, T. Lundh, R.K. Butlin, Journal of The Royal Society Interface 17 (2020).","chicago":"Larsson, J., Anja M Westram, S. Bengmark, T. Lundh, and R. K. Butlin. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface. The Royal Society, 2020. https://doi.org/10.1098/rsif.2019.0721."},"article_type":"original","abstract":[{"lang":"eng","text":"The growth of snail shells can be described by simple mathematical rules. Variation in a few parameters can explain much of the diversity of shell shapes seen in nature. However, empirical studies of gastropod shell shape variation typically use geometric morphometric approaches, which do not capture this growth pattern. We have developed a way to infer a set of developmentally descriptive shape parameters based on three-dimensional logarithmic helicospiral growth and using landmarks from two-dimensional shell images as input. We demonstrate the utility of this approach, and compare it to the geometric morphometric approach, using a large set of Littorina saxatilis shells in which locally adapted populations differ in shape. Our method can be modified easily to make it applicable to a wide range of shell forms, which would allow for investigations of the similarities and differences between and within many different species of gastropods."}],"issue":"163","type":"journal_article","oa_version":"Published Version","file":[{"file_name":"2020_JournRoyalSociety_Larsson.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1556190,"creator":"dernst","relation":"main_file","file_id":"7660","date_updated":"2020-07-14T12:48:01Z","date_created":"2020-04-14T12:31:16Z","checksum":"4eb102304402f5c56432516b84df86d6"}],"_id":"7651","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A developmentally descriptive method for quantifying shape in gastropod shells","ddc":["570"],"status":"public","intvolume":" 17","month":"02","publication_identifier":{"eissn":["1742-5662"],"issn":["1742-5689"]},"doi":"10.1098/rsif.2019.0721","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","file_date_updated":"2020-07-14T12:48:01Z","article_number":"20190721","author":[{"full_name":"Larsson, J.","last_name":"Larsson","first_name":"J."},{"orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","first_name":"Anja M","full_name":"Westram, Anja M"},{"full_name":"Bengmark, S.","first_name":"S.","last_name":"Bengmark"},{"last_name":"Lundh","first_name":"T.","full_name":"Lundh, T."},{"last_name":"Butlin","first_name":"R. K.","full_name":"Butlin, R. K."}],"date_created":"2020-04-08T15:19:17Z","date_updated":"2021-01-12T08:14:41Z","volume":17,"year":"2020","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"The Royal Society"},{"month":"07","quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"oa":1,"external_id":{"arxiv":["2009.06043"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2020-08-07","location":"Salerno, Italy","start_date":"2020-08-03","name":"PODC: Symposium on Principles of Distributed Computing"},"doi":"10.1145/3382734.3405751","file_date_updated":"2020-10-08T08:17:36Z","ec_funded":1,"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","year":"2020","date_created":"2020-05-06T09:02:14Z","date_updated":"2021-01-12T08:15:37Z","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur","orcid":"0000-0002-5646-9524"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","first_name":"Peter","last_name":"Davies","full_name":"Davies, Peter"},{"last_name":"Parter","first_name":"Merav","full_name":"Parter, Merav"}],"day":"01","has_accepted_license":"1","article_processing_charge":"No","page":"309-318","publication":"Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing","citation":{"chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751.","short":"A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.","mla":"Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318.","apa":"Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405751","ista":"Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.","ama":"Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751"},"date_published":"2020-07-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space.\r\nWe also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds."}],"status":"public","ddc":["000"],"title":"Simple, deterministic, constant-round coloring in the congested clique","_id":"7803","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"file_id":"8624","relation":"main_file","date_created":"2020-10-08T08:17:36Z","date_updated":"2020-10-08T08:17:36Z","success":1,"checksum":"46fe4fc58a64eb04068115573f631d4c","file_name":"ColoringArxiv.pdf","access_level":"open_access","creator":"pdavies","content_type":"application/pdf","file_size":520051}]},{"year":"2020","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"SIAM","author":[{"full_name":"Filakovský, Marek","first_name":"Marek","last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"},{"id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y","last_name":"Zhechev","full_name":"Zhechev, Stephan Y"}],"date_created":"2020-05-10T22:00:48Z","date_updated":"2021-01-12T08:15:38Z","volume":"2020-January","month":"01","publication_identifier":{"isbn":["9781611975994"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611975994.47"}],"quality_controlled":"1","project":[{"grant_number":"P31312","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF"}],"conference":{"start_date":"2020-01-05","location":"Salt Lake City, UT, United States","end_date":"2020-01-08","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611975994.47","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.\r\nOur result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4."}],"_id":"7806","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Embeddability of simplicial complexes is undecidable","status":"public","oa_version":"Published Version","scopus_import":1,"day":"01","article_processing_charge":"No","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"apa":"Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47","ieee":"M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785.","ista":"Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.","ama":"Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47","chicago":"Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47.","short":"M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.","mla":"Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47."},"page":"767-785","date_published":"2020-01-01T00:00:00Z"},{"day":"08","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-05-08T00:00:00Z","article_type":"original","publication":"Frontiers in Education","citation":{"ieee":"R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity through Open-Source platforms in education and science,” Frontiers in Education, vol. 5. Frontiers Media, 2020.","apa":"Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048","ista":"Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 5, 48.","ama":"Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048","chicago":"Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.","short":"R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020).","mla":"Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education, vol. 5, 48, Frontiers Media, 2020, doi:10.3389/feduc.2020.00048."},"abstract":[{"lang":"eng","text":"Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org."}],"type":"journal_article","oa_version":"Published Version","file":[{"date_created":"2020-05-11T11:34:08Z","date_updated":"2020-07-14T12:48:03Z","checksum":"a24ec24e38d843341ae620ec76c53688","relation":"main_file","file_id":"7818","content_type":"application/pdf","file_size":1402146,"creator":"dernst","file_name":"2020_FrontiersEduc_Beattie.pdf","access_level":"open_access"}],"ddc":["570"],"title":"SCOPES: Sparking curiosity through Open-Source platforms in education and science","status":"public","intvolume":" 5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7814","month":"05","publication_identifier":{"issn":["2504-284X"]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"doi":"10.3389/feduc.2020.00048","quality_controlled":"1","project":[{"grant_number":"M02416","_id":"264E56E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex"},{"_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-07-14T12:48:03Z","ec_funded":1,"article_number":"48","date_updated":"2021-01-12T08:15:42Z","date_created":"2020-05-11T08:18:48Z","volume":5,"author":[{"last_name":"Beattie","first_name":"Robert J","orcid":"0000-0002-8483-8753","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","full_name":"Beattie, Robert J"},{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pauler","full_name":"Pauler, Florian"}],"publication_status":"published","publisher":"Frontiers Media","department":[{"_id":"SiHi"}],"year":"2020"},{"file_date_updated":"2020-11-25T08:59:59Z","volume":6,"date_created":"2020-05-17T22:00:45Z","date_updated":"2021-01-12T08:15:47Z","author":[{"full_name":"Fellner, Klemens","last_name":"Fellner","first_name":"Klemens"},{"id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5645-4333","first_name":"Michael","last_name":"Kniely","full_name":"Kniely, Michael"}],"publisher":"Springer Nature","department":[{"_id":"JuFi"}],"publication_status":"published","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). The second author has been supported by the International Research Training Group IGDK 1754 “Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian Science Fund (FWF) under grant number [W 1244-N18].","year":"2020","publication_identifier":{"issn":["22969020"],"eissn":["22969039"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1007/s41808-020-00068-8","project":[{"name":"FWF Open Access Fund","call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"abstract":[{"lang":"eng","text":"In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation."}],"type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2020-11-25T08:59:59Z","date_created":"2020-11-25T08:59:59Z","success":1,"checksum":"6bc6832caacddceee1471291e93dcf1d","file_id":"8802","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":8408694,"file_name":"2020_JourEllipticParabEquat_Fellner.pdf","access_level":"open_access"}],"intvolume":" 6","title":"Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model","status":"public","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7866","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2020-12-01T00:00:00Z","page":"529-598","article_type":"original","citation":{"chicago":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations. Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8.","mla":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations, vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8.","short":"K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020) 529–598.","ista":"Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 6, 529–598.","apa":"Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. Springer Nature. https://doi.org/10.1007/s41808-020-00068-8","ieee":"K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature, pp. 529–598, 2020.","ama":"Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8"},"publication":"Journal of Elliptic and Parabolic Equations"},{"year":"2020","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"publication_status":"published","author":[{"last_name":"Mistakidis","first_name":"S. I.","full_name":"Mistakidis, S. I."},{"last_name":"Volosniev","first_name":"Artem","orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","full_name":"Volosniev, Artem"},{"full_name":"Schmelcher, P.","first_name":"P.","last_name":"Schmelcher"}],"volume":2,"date_created":"2020-06-03T11:30:10Z","date_updated":"2023-02-23T13:20:16Z","article_number":"023154 ","ec_funded":1,"file_date_updated":"2020-07-14T12:48:05Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1103/physrevresearch.2.023154","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2643-1564"]},"month":"05","_id":"7919","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2","status":"public","title":"Induced correlations between impurities in a one-dimensional quenched Bose gas","ddc":["530"],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_PhysRevResearch_Mistakidis.pdf","file_size":1741098,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7926","checksum":"e1c362fe094d6b246b3cd4a49722e78b","date_created":"2020-06-04T13:51:59Z","date_updated":"2020-07-14T12:48:05Z"}],"type":"journal_article","abstract":[{"text":"We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations.","lang":"eng"}],"citation":{"mla":"Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American Physical Society, 2020, doi:10.1103/physrevresearch.2.023154.","short":"S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2 (2020).","chicago":"Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154.","ama":"Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2. doi:10.1103/physrevresearch.2.023154","ista":"Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2, 023154.","apa":"Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154","ieee":"S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between impurities in a one-dimensional quenched Bose gas,” Physical Review Research, vol. 2. American Physical Society, 2020."},"publication":"Physical Review Research","article_type":"original","date_published":"2020-05-11T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"11"},{"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between \"grid peeling\" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase.","lang":"eng"}],"intvolume":" 164","status":"public","ddc":["510"],"title":"Homotopic curve shortening and the affine curve-shortening flow","_id":"7991","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_size":575896,"content_type":"application/pdf","creator":"dernst","file_name":"2020_LIPIcsSoCG_Avvakumov.pdf","access_level":"open_access","date_created":"2020-06-23T11:13:49Z","date_updated":"2020-07-14T12:48:06Z","checksum":"6872df6549142f709fb6354a1b2f2c06","relation":"main_file","file_id":"8007"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"ama":"Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12","ista":"Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.","apa":"Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12","ieee":"S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening flow,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","mla":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.","short":"S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.12."},"publication":"36th International Symposium on Computational Geometry","date_published":"2020-06-01T00:00:00Z","article_number":"12:1 - 12:15","file_date_updated":"2020-07-14T12:48:06Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2020","volume":164,"date_created":"2020-06-22T09:14:19Z","date_updated":"2021-01-12T08:16:23Z","author":[{"first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey"},{"full_name":"Nivasch, Gabriel","first_name":"Gabriel","last_name":"Nivasch"}],"publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"month":"06","project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory"}],"quality_controlled":"1","external_id":{"arxiv":["1909.00263"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2020.12","conference":{"start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26","name":"SoCG: Symposium on Computational Geometry"}},{"publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"month":"06","doi":"10.4230/LIPIcs.SoCG.2020.61","conference":{"end_date":"2020-06-26","start_date":"2020-06-22","location":"Zürich, Switzerland","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1908.01677"]},"quality_controlled":"1","file_date_updated":"2020-07-14T12:48:06Z","article_number":"61:1-61:13","author":[{"last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","full_name":"Patakova, Zuzana"}],"volume":164,"date_updated":"2021-01-12T08:16:22Z","date_created":"2020-06-22T09:14:18Z","year":"2020","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2020-06-01T00:00:00Z","citation":{"chicago":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61.","short":"Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.","ieee":"Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","apa":"Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61","ista":"Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 61:1-61:13.","ama":"Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61"},"publication":"36th International Symposium on Computational Geometry","abstract":[{"text":"We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"checksum":"d0996ca5f6eb32ce955ce782b4f2afbe","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-23T06:56:23Z","relation":"main_file","file_id":"8005","content_type":"application/pdf","file_size":645421,"creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcsSoCG_Patakova_61.pdf"}],"_id":"7989","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 164","ddc":["510"],"title":"Bounding radon number via Betti numbers","status":"public"},{"oa_version":"Published Version","file":[{"file_size":750318,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcsSoCG_Patakova.pdf","checksum":"ce1c9194139a664fb59d1efdfc88eaae","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-23T06:45:52Z","relation":"main_file","file_id":"8004"}],"_id":"7992","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["510"],"title":"Barycentric cuts through a convex body","intvolume":" 164","abstract":[{"text":"Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2020-06-01T00:00:00Z","publication":"36th International Symposium on Computational Geometry","citation":{"mla":"Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.","short":"Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62.","ama":"Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62","ista":"Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.","ieee":"Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","apa":"Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62"},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"author":[{"full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","last_name":"Patakova","first_name":"Zuzana"},{"orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","first_name":"Martin","full_name":"Tancer, Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli"}],"date_updated":"2021-01-12T08:16:23Z","date_created":"2020-06-22T09:14:20Z","volume":164,"year":"2020","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","article_number":"62:1 - 62:16","conference":{"start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.4230/LIPIcs.SoCG.2020.62","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2003.13536"]},"oa":1,"quality_controlled":"1","month":"06","publication_identifier":{"issn":["18688969"],"isbn":["9783959771436"]}},{"publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"month":"06","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1804.09317"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2020.9","conference":{"start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26","name":"SoCG: Symposium on Computational Geometry"},"article_number":"9:1 - 9:14","ec_funded":1,"file_date_updated":"2020-07-14T12:48:06Z","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2020","volume":164,"date_created":"2020-06-22T09:14:21Z","date_updated":"2023-02-23T13:22:12Z","author":[{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2401-8670","first_name":"Alan M","last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M"},{"first_name":"Julien","last_name":"Bensmail","full_name":"Bensmail, Julien"},{"last_name":"Bruce Richter","first_name":"R.","full_name":"Bruce Richter, R."}],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"short":"A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.","chicago":"Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.","ama":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9","apa":"Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9","ieee":"A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","ista":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14."},"publication":"36th International Symposium on Computational Geometry","date_published":"2020-06-01T00:00:00Z","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible."}],"intvolume":" 164","status":"public","title":"Extending drawings of graphs to arrangements of pseudolines","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7994","file":[{"file_size":592661,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcsSoCG_Arroyo.pdf","checksum":"93571b76cf97d5b7c8aabaeaa694dd7e","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-23T11:06:23Z","relation":"main_file","file_id":"8006"}],"oa_version":"Published Version"},{"type":"journal_article","abstract":[{"text":"Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.","lang":"eng"}],"issue":"2","_id":"8011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Stabilizing two-dimensional quantum scars by deformation and synchronization","status":"public","ddc":["530"],"intvolume":" 2","file":[{"date_updated":"2020-07-14T12:48:08Z","date_created":"2020-06-29T14:41:27Z","checksum":"e6959dc8220f14a008d1933858795e6d","file_id":"8050","relation":"main_file","creator":"dernst","file_size":2066011,"content_type":"application/pdf","file_name":"2020_PhysicalReviewResearch_Michailidis.pdf","access_level":"open_access"}],"oa_version":"Published Version","day":"22","article_processing_charge":"No","has_accepted_license":"1","publication":"Physical Review Research","citation":{"ama":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2020;2(2). doi:10.1103/physrevresearch.2.022065","ieee":"A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing two-dimensional quantum scars by deformation and synchronization,” Physical Review Research, vol. 2, no. 2. American Physical Society, 2020.","apa":"Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065","ista":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2(2), 022065.","short":"A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review Research 2 (2020).","mla":"Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research, vol. 2, no. 2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065.","chicago":"Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065."},"article_type":"original","date_published":"2020-06-22T00:00:00Z","article_number":"022065","file_date_updated":"2020-07-14T12:48:08Z","ec_funded":1,"year":"2020","publication_status":"published","department":[{"_id":"MaSe"}],"publisher":"American Physical Society","author":[{"id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","last_name":"Michailidis","first_name":"Alexios","full_name":"Michailidis, Alexios"},{"full_name":"Turner, C. J.","last_name":"Turner","first_name":"C. J."},{"full_name":"Papić, Z.","first_name":"Z.","last_name":"Papić"},{"full_name":"Abanin, D. A.","last_name":"Abanin","first_name":"D. A."},{"full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym","last_name":"Serbyn"}],"date_created":"2020-06-23T12:00:19Z","date_updated":"2021-01-12T08:16:30Z","volume":2,"month":"06","publication_identifier":{"issn":["2643-1564"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899"}],"doi":"10.1103/physrevresearch.2.022065","language":[{"iso":"eng"}]},{"article_processing_charge":"No","day":"01","month":"04","language":[{"iso":"eng"}],"date_published":"2020-04-01T00:00:00Z","tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"citation":{"ista":"Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv, 2004.00642.","apa":"Anciukevicius, T., Lampert, C., & Henderson, P. M. (n.d.). Object-centric image generation with factored depths, locations, and appearances. arXiv.","ieee":"T. Anciukevicius, C. Lampert, and P. M. Henderson, “Object-centric image generation with factored depths, locations, and appearances,” arXiv. .","ama":"Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv.","chicago":"Anciukevicius, Titas, Christoph Lampert, and Paul M Henderson. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, n.d.","mla":"Anciukevicius, Titas, et al. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, 2004.00642.","short":"T. Anciukevicius, C. Lampert, P.M. Henderson, ArXiv (n.d.)."},"external_id":{"arxiv":["2004.00642"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.00642"}],"publication":"arXiv","license":"https://creativecommons.org/licenses/by-sa/4.0/","abstract":[{"lang":"eng","text":"We present a generative model of images that explicitly reasons over the set\r\nof objects they show. Our model learns a structured latent representation that\r\nseparates objects from each other and from the background; unlike prior works,\r\nit explicitly represents the 2D position and depth of each object, as well as\r\nan embedding of its segmentation mask and appearance. The model can be trained\r\nfrom images alone in a purely unsupervised fashion without the need for object\r\nmasks or depth information. Moreover, it always generates complete objects,\r\neven though a significant fraction of training images contain occlusions.\r\nFinally, we show that our model can infer decompositions of novel images into\r\ntheir constituent objects, including accurate prediction of depth ordering and\r\nsegmentation of occluded parts."}],"type":"preprint","article_number":"2004.00642","oa_version":"Preprint","date_updated":"2021-01-12T08:16:44Z","date_created":"2020-06-29T23:55:23Z","author":[{"full_name":"Anciukevicius, Titas","first_name":"Titas","last_name":"Anciukevicius"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"first_name":"Paul M","last_name":"Henderson","id":"13C09E74-18D9-11E9-8878-32CFE5697425","orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M"}],"department":[{"_id":"ChLa"}],"status":"public","title":"Object-centric image generation with factored depths, locations, and appearances","ddc":["004"],"publication_status":"submitted","year":"2020","_id":"8063","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"chicago":"Hobisch, Mathias A. , Eléonore Mourad, Wolfgang J. Fischer, Christian Prehal, Samuel Eyley, Anthony Childress, Armin Zankel, et al. “High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites,” n.d.","mla":"Hobisch, Mathias A., et al. High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites.","short":"M.A. Hobisch, E. Mourad, W.J. Fischer, C. Prehal, S. Eyley, A. Childress, A. Zankel, A. Mautner, S. Breitenbach, A.M. Rao, W. Thielemans, S.A. Freunberger, R. Eckhart, W. Bauer, S. Spirk, (n.d.).","ista":"Hobisch MA, Mourad E, Fischer WJ, Prehal C, Eyley S, Childress A, Zankel A, Mautner A, Breitenbach S, Rao AM, Thielemans W, Freunberger SA, Eckhart R, Bauer W, Spirk S. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.","apa":"Hobisch, M. A., Mourad, E., Fischer, W. J., Prehal, C., Eyley, S., Childress, A., … Spirk, S. (n.d.). High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.","ieee":"M. A. Hobisch et al., “High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.” .","ama":"Hobisch MA, Mourad E, Fischer WJ, et al. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2020-07-13T00:00:00Z","day":"13","month":"07","article_processing_charge":"No","has_accepted_license":"1","title":"High specific capacitance supercapacitors from hierarchically organized all-cellulose composites","ddc":["540"],"status":"public","publication_status":"submitted","department":[{"_id":"StFr"}],"_id":"8081","acknowledgement":"The authors M.A.H., S.S., R.E., and W.B. acknowledge the industrial partners Sappi Gratkorn, Zellstoff Pöls and Mondi Frantschach, the Austrian Research Promotion Agency (FFG), COMET, BMVIT, BMWFJ, the Province of Styria and Carinthia for their financial support of the K-project Flippr²-Process Integration. E.M. and S.A.F. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No 636069). W. T. and S. E. thank FWO (G.0C60.13N) and the European Union’s European Fund for Regional Development and Flanders Innovation & Entrepreneurship (Accelerate3 project, Interreg Vlaanderen-Nederland program) for financial support. W. T. also thanks the Provincie West-Vlaanderen (Belgium) for his Provincial Chair in Advanced Materials. S. B. thanks the European Regional Development Fund (EFRE) and the province of Upper Austria for financial support through the program IWB 2014-2020 (project BioCarb-K). AMR gratefully acknowledges funding support through the SC EPSCoR/IDeAProgram under Award #18-SR03, and the NASA EPSCoR Program under Award #NNH17ZHA002C. Icons in Scheme 1 were provided by Good Ware, monkik, photo3idea_studio, and OCHA from www.flaticon.com.","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-07-02T20:24:42Z","date_updated":"2022-06-17T08:39:49Z","file":[{"checksum":"6970d621984c03ebc2eee71adfe706dd","date_updated":"2020-07-14T12:48:09Z","date_created":"2020-07-02T20:21:59Z","relation":"main_file","file_id":"8082","file_size":1129852,"content_type":"application/pdf","creator":"sfreunbe","access_level":"open_access","file_name":"AM.pdf"},{"content_type":"application/pdf","file_size":945565,"creator":"cziletti","access_level":"open_access","file_name":"Supporting_Information.pdf","checksum":"cd74c7bd47d6e7163d54d67f074dcc36","date_updated":"2020-07-14T12:48:09Z","date_created":"2020-07-08T12:14:04Z","relation":"supplementary_material","file_id":"8102"}],"oa_version":"Submitted Version","author":[{"last_name":"Hobisch","first_name":"Mathias A. ","full_name":"Hobisch, Mathias A. "},{"full_name":"Mourad, Eléonore ","last_name":"Mourad","first_name":"Eléonore "},{"last_name":"Fischer","first_name":"Wolfgang J. ","full_name":"Fischer, Wolfgang J. "},{"full_name":"Prehal, Christian ","last_name":"Prehal","first_name":"Christian "},{"first_name":"Samuel ","last_name":"Eyley","full_name":"Eyley, Samuel "},{"full_name":"Childress, Anthony ","first_name":"Anthony ","last_name":"Childress"},{"full_name":"Zankel, Armin ","last_name":"Zankel","first_name":"Armin "},{"first_name":"Andreas ","last_name":"Mautner","full_name":"Mautner, Andreas "},{"full_name":"Breitenbach, Stefan ","last_name":"Breitenbach","first_name":"Stefan "},{"full_name":"Rao, Apparao M. ","first_name":"Apparao M. ","last_name":"Rao"},{"first_name":"Wim ","last_name":"Thielemans","full_name":"Thielemans, Wim "},{"first_name":"Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander"},{"first_name":"Rene ","last_name":"Eckhart","full_name":"Eckhart, Rene "},{"full_name":"Bauer, Wolfgang ","first_name":"Wolfgang ","last_name":"Bauer"},{"full_name":"Spirk, Stefan ","first_name":"Stefan ","last_name":"Spirk"}],"type":"preprint","file_date_updated":"2020-07-14T12:48:09Z","abstract":[{"text":"Here, we employ micro- and nanosized cellulose particles, namely paper fines and cellulose\r\nnanocrystals, to induce hierarchical organization over a wide length scale. After processing\r\nthem into carbonaceous materials, we demonstrate that these hierarchically organized materials\r\noutperform the best materials for supercapacitors operating with organic electrolytes reported\r\nin literature in terms of specific energy/power (Ragone plot) while showing hardly any capacity\r\nfade over 4,000 cycles. The highly porous materials feature a specific surface area as high as\r\n2500 m2ˑg-1 and exhibit pore sizes in the range of 0.5 to 200 nm as proven by scanning electron\r\nmicroscopy and N2 physisorption. The carbonaceous materials have been further investigated\r\nby X-ray photoelectron spectroscopy and RAMAN spectroscopy. Since paper fines are an\r\nunderutilized side stream in any paper production process, they are a cheap and highly available\r\nfeedstock to prepare carbonaceous materials with outstanding performance in electrochemical\r\napplications. ","lang":"eng"}]},{"publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"EDP Sciences","year":"2020","date_updated":"2021-01-12T08:16:55Z","date_created":"2020-07-12T16:20:33Z","volume":230,"author":[{"first_name":"Fabrizio","last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425","orcid":"0000-0003-2623-5249","full_name":"Lombardi, Fabrizio"},{"last_name":"Wang","first_name":"Jilin W.J.L.","full_name":"Wang, Jilin W.J.L."},{"full_name":"Zhang, Xiyun","last_name":"Zhang","first_name":"Xiyun"},{"last_name":"Ivanov","first_name":"Plamen Ch","full_name":"Ivanov, Plamen Ch"}],"article_number":"00005","file_date_updated":"2020-07-22T06:17:11Z","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1051/epjconf/202023000005","month":"03","publication_identifier":{"issn":["2100-014X"]},"status":"public","title":"Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality","ddc":["530"],"intvolume":" 230","_id":"8105","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_name":"2020_EPJWebConf_Lombardi.pdf","access_level":"open_access","file_size":2197543,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"8144","date_created":"2020-07-22T06:17:11Z","date_updated":"2020-07-22T06:17:11Z","success":1}],"type":"journal_article","abstract":[{"text":"Physical and biological systems often exhibit intermittent dynamics with bursts or avalanches (active states) characterized by power-law size and duration distributions. These emergent features are typical of systems at the critical point of continuous phase transitions, and have led to the hypothesis that such systems may self-organize at criticality, i.e. without any fine tuning of parameters. Since the introduction of the Bak-Tang-Wiesenfeld (BTW) model, the paradigm of self-organized criticality (SOC) has been very fruitful for the analysis of emergent collective behaviors in a number of systems, including the brain. Although considerable effort has been devoted in identifying and modeling scaling features of burst and avalanche statistics, dynamical aspects related to the temporal organization of bursts remain often poorly understood or controversial. Of crucial importance to understand the mechanisms responsible for emergent behaviors is the relationship between active and quiet periods, and the nature of the correlations. Here we investigate the dynamics of active (θ-bursts) and quiet states (δ-bursts) in brain activity during the sleep-wake cycle. We show the duality of power-law (θ, active phase) and exponential-like (δ, quiescent phase) duration distributions, typical of SOC, jointly emerge with power-law temporal correlations and anti-correlated coupling between active and quiet states. Importantly, we demonstrate that such temporal organization shares important similarities with earthquake dynamics, and propose that specific power-law correlations and coupling between active and quiet states are distinctive characteristics of a class of systems with self-organization at criticality.","lang":"eng"}],"article_type":"original","publication":"EPJ Web of Conferences","citation":{"chicago":"Lombardi, Fabrizio, Jilin W.J.L. Wang, Xiyun Zhang, and Plamen Ch Ivanov. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences. EDP Sciences, 2020. https://doi.org/10.1051/epjconf/202023000005.","mla":"Lombardi, Fabrizio, et al. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences, vol. 230, 00005, EDP Sciences, 2020, doi:10.1051/epjconf/202023000005.","short":"F. Lombardi, J.W.J.L. Wang, X. Zhang, P.C. Ivanov, EPJ Web of Conferences 230 (2020).","ista":"Lombardi F, Wang JWJL, Zhang X, Ivanov PC. 2020. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 230, 00005.","ieee":"F. Lombardi, J. W. J. L. Wang, X. Zhang, and P. C. Ivanov, “Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality,” EPJ Web of Conferences, vol. 230. EDP Sciences, 2020.","apa":"Lombardi, F., Wang, J. W. J. L., Zhang, X., & Ivanov, P. C. (2020). Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. EDP Sciences. https://doi.org/10.1051/epjconf/202023000005","ama":"Lombardi F, Wang JWJL, Zhang X, Ivanov PC. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 2020;230. doi:10.1051/epjconf/202023000005"},"date_published":"2020-03-11T00:00:00Z","day":"11","article_processing_charge":"No","has_accepted_license":"1"},{"abstract":[{"text":"Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics.","lang":"eng"}],"type":"conference","alternative_title":["Abel Symposia"],"file":[{"access_level":"open_access","file_name":"2020-B-01-PoissonExperimentalSurvey.pdf","creator":"dernst","content_type":"application/pdf","file_size":2207071,"file_id":"8628","relation":"main_file","success":1,"checksum":"7b5e0de10675d787a2ddb2091370b8d8","date_updated":"2020-10-08T08:56:14Z","date_created":"2020-10-08T08:56:14Z"}],"oa_version":"Submitted Version","_id":"8135","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"status":"public","title":"Radius functions on Poisson–Delaunay mosaics and related complexes experimentally","intvolume":" 15","day":"22","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-06-22T00:00:00Z","publication":"Topological Data Analysis","citation":{"chicago":"Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In Topological Data Analysis, 15:181–218. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-43408-3_8.","mla":"Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” Topological Data Analysis, vol. 15, Springer Nature, 2020, pp. 181–218, doi:10.1007/978-3-030-43408-3_8.","short":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218.","ista":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.","ieee":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in Topological Data Analysis, 2020, vol. 15, pp. 181–218.","apa":"Edelsbrunner, H., Nikitenko, A., Ölsböck, K., & Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In Topological Data Analysis (Vol. 15, pp. 181–218). Springer Nature. https://doi.org/10.1007/978-3-030-43408-3_8","ama":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: Topological Data Analysis. Vol 15. Springer Nature; 2020:181-218. doi:10.1007/978-3-030-43408-3_8"},"page":"181-218","file_date_updated":"2020-10-08T08:56:14Z","ec_funded":1,"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","first_name":"Anton","full_name":"Nikitenko, Anton"},{"full_name":"Ölsböck, Katharina","last_name":"Ölsböck","first_name":"Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Synak, Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Synak"}],"date_updated":"2021-01-12T08:17:06Z","date_created":"2020-07-19T22:00:59Z","volume":15,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","year":"2020","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"month":"06","publication_identifier":{"isbn":["9783030434076"],"eissn":["21978549"],"issn":["21932808"]},"doi":"10.1007/978-3-030-43408-3_8","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}]},{"page":"233-246","citation":{"apa":"Kainrath, S., & Janovjak, H. L. (2020). Design and application of light-regulated receptor tyrosine kinases. In D. Niopek (Ed.), Photoswitching Proteins (Vol. 2173, pp. 233–246). Springer Nature. https://doi.org/10.1007/978-1-0716-0755-8_16","ieee":"S. Kainrath and H. L. Janovjak, “Design and application of light-regulated receptor tyrosine kinases,” in Photoswitching Proteins, vol. 2173, D. Niopek, Ed. Springer Nature, 2020, pp. 233–246.","ista":"Kainrath S, Janovjak HL. 2020.Design and application of light-regulated receptor tyrosine kinases. In: Photoswitching Proteins. Methods in Molecular Biology, vol. 2173, 233–246.","ama":"Kainrath S, Janovjak HL. Design and application of light-regulated receptor tyrosine kinases. In: Niopek D, ed. Photoswitching Proteins. Vol 2173. MIMB. Springer Nature; 2020:233-246. doi:10.1007/978-1-0716-0755-8_16","chicago":"Kainrath, Stephanie, and Harald L Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” In Photoswitching Proteins, edited by Dominik Niopek, 2173:233–46. MIMB. Springer Nature, 2020. https://doi.org/10.1007/978-1-0716-0755-8_16.","short":"S. Kainrath, H.L. Janovjak, in:, D. Niopek (Ed.), Photoswitching Proteins, Springer Nature, 2020, pp. 233–246.","mla":"Kainrath, Stephanie, and Harald L. Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” Photoswitching Proteins, edited by Dominik Niopek, vol. 2173, Springer Nature, 2020, pp. 233–46, doi:10.1007/978-1-0716-0755-8_16."},"publication":"Photoswitching Proteins","language":[{"iso":"eng"}],"doi":"10.1007/978-1-0716-0755-8_16","date_published":"2020-07-11T00:00:00Z","series_title":"MIMB","scopus_import":"1","article_processing_charge":"No","publication_identifier":{"eisbn":["9781071607558"],"eissn":["19406029"]},"day":"11","month":"07","publisher":"Springer Nature","intvolume":" 2173","editor":[{"full_name":"Niopek, Dominik","last_name":"Niopek","first_name":"Dominik"}],"department":[{"_id":"CaGu"}],"publication_status":"published","title":"Design and application of light-regulated receptor tyrosine kinases","status":"public","_id":"8173","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","volume":2173,"oa_version":"None","date_updated":"2021-01-12T08:17:17Z","date_created":"2020-07-26T22:01:03Z","author":[{"id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","last_name":"Kainrath","first_name":"Stephanie","full_name":"Kainrath, Stephanie"},{"first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L"}],"alternative_title":["Methods in Molecular Biology"],"type":"book_chapter","abstract":[{"lang":"eng","text":"Understanding how the activity of membrane receptors and cellular signaling pathways shapes cell behavior is of fundamental interest in basic and applied research. Reengineering receptors to react to light instead of their cognate ligands allows for generating defined signaling inputs with high spatial and temporal precision and facilitates the dissection of complex signaling networks. Here, we describe fundamental considerations in the design of light-regulated receptor tyrosine kinases (Opto-RTKs) and appropriate control experiments. We also introduce methods for transient receptor expression in HEK293 cells, quantitative assessment of signaling activity in reporter gene assays, semiquantitative assessment of (in)activation time courses through Western blot (WB) analysis, and easy to implement light stimulation hardware."}]},{"tmp":{"name":"The 3-Clause BSD License","legal_code_url":"https://opensource.org/licenses/BSD-3-Clause","short":"3-Clause BSD"},"citation":{"chicago":"Hauschild, Robert. “Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8181.","mla":"Hauschild, Robert. Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions. IST Austria, 2020, doi:10.15479/AT:ISTA:8181.","short":"R. Hauschild, (2020).","ista":"Hauschild R. 2020. Amplified centrosomes in dendritic cells promote immune cell effector functions, IST Austria, 10.15479/AT:ISTA:8181.","apa":"Hauschild, R. (2020). Amplified centrosomes in dendritic cells promote immune cell effector functions. IST Austria. https://doi.org/10.15479/AT:ISTA:8181","ieee":"R. Hauschild, “Amplified centrosomes in dendritic cells promote immune cell effector functions.” IST Austria, 2020.","ama":"Hauschild R. Amplified centrosomes in dendritic cells promote immune cell effector functions. 2020. doi:10.15479/AT:ISTA:8181"},"oa":1,"doi":"10.15479/AT:ISTA:8181","date_published":"2020-08-24T00:00:00Z","has_accepted_license":"1","month":"08","day":"24","_id":"8181","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","publisher":"IST Austria","department":[{"_id":"Bio"}],"title":"Amplified centrosomes in dendritic cells promote immune cell effector functions","status":"public","author":[{"orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","first_name":"Robert","full_name":"Hauschild, Robert"}],"file":[{"success":1,"checksum":"878c60885ce30afb59a884dd5eef451c","date_created":"2020-08-24T15:43:49Z","date_updated":"2020-08-24T15:43:49Z","file_id":"8290","relation":"main_file","creator":"rhauschild","file_size":6577,"content_type":"text/plain","access_level":"open_access","file_name":"centriolesDistance.m"},{"creator":"rhauschild","content_type":"text/plain","file_size":2680,"file_name":"goTracking.m","access_level":"open_access","date_created":"2020-08-24T15:43:52Z","date_updated":"2020-08-24T15:43:52Z","success":1,"checksum":"5a93ac7be2b66b28e4bd8b113ee6aade","file_id":"8291","relation":"main_file"}],"date_updated":"2021-01-11T15:29:08Z","date_created":"2020-07-28T16:24:37Z","type":"software","file_date_updated":"2020-08-24T15:43:52Z","license":"https://opensource.org/licenses/BSD-3-Clause"},{"has_accepted_license":"1","month":"09","day":"10","oa":1,"tmp":{"name":"The 3-Clause BSD License","legal_code_url":"https://opensource.org/licenses/BSD-3-Clause","short":"3-Clause BSD"},"citation":{"ama":"Hauschild R. RGtracker. 2020. doi:10.15479/AT:ISTA:8294","ista":"Hauschild R. 2020. RGtracker, IST Austria, 10.15479/AT:ISTA:8294.","ieee":"R. Hauschild, “RGtracker.” IST Austria, 2020.","apa":"Hauschild, R. (2020). RGtracker. IST Austria. https://doi.org/10.15479/AT:ISTA:8294","mla":"Hauschild, Robert. RGtracker. IST Austria, 2020, doi:10.15479/AT:ISTA:8294.","short":"R. Hauschild, (2020).","chicago":"Hauschild, Robert. “RGtracker.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8294."},"doi":"10.15479/AT:ISTA:8294","date_published":"2020-09-10T00:00:00Z","type":"software","abstract":[{"lang":"eng","text":"Automated root growth analysis and tracking of root tips. "}],"file_date_updated":"2020-09-08T14:26:33Z","_id":"8294","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"Bio"}],"publisher":"IST Austria","title":"RGtracker","status":"public","ddc":["570"],"author":[{"full_name":"Hauschild, Robert","first_name":"Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522"}],"file":[{"content_type":"text/plain","file_size":882,"creator":"rhauschild","file_name":"readme.txt","access_level":"open_access","date_created":"2020-09-08T14:26:31Z","date_updated":"2020-09-08T14:26:31Z","checksum":"108352149987ac6f066e4925bd56e35e","success":1,"relation":"main_file","file_id":"8346"},{"creator":"rhauschild","file_size":246121,"content_type":"application/octet-stream","file_name":"RGtracker.mlappinstall","access_level":"open_access","date_created":"2020-09-08T14:26:33Z","date_updated":"2020-09-08T14:26:33Z","success":1,"checksum":"ffd6c643b28e0cc7c6d0060a18a7e8ea","file_id":"8347","relation":"main_file"}],"date_created":"2020-08-25T12:52:48Z","date_updated":"2021-01-12T08:17:56Z"},{"publication":"Advances in Cryptology – CRYPTO 2020","citation":{"ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","apa":"Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: Advances in Cryptology – CRYPTO 2020. Vol 12171. Springer Nature; 2020:732-762. doi:10.1007/978-3-030-56880-1_26","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-56880-1_26.","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:10.1007/978-3-030-56880-1_26.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762."},"page":"732-762","date_published":"2020-08-10T00:00:00Z","scopus_import":"1","day":"10","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8322","title":"Reverse firewalls for actively secure MPCs","status":"public","intvolume":" 12171","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001).","lang":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2019/1317","open_access":"1"}],"oa":1,"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"conference":{"end_date":"2020-08-21","start_date":"2020-08-17","location":"Santa Barbara, CA, United States","name":"CRYPTO: Annual International Cryptology Conference"},"doi":"10.1007/978-3-030-56880-1_26","language":[{"iso":"eng"}],"month":"08","publication_identifier":{"issn":["03029743"],"isbn":["9783030568795"],"eissn":["16113349"]},"year":"2020","acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark.","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","author":[{"full_name":"Chakraborty, Suvradip","first_name":"Suvradip","last_name":"Chakraborty","id":"B9CD0494-D033-11E9-B219-A439E6697425"},{"full_name":"Dziembowski, Stefan","first_name":"Stefan","last_name":"Dziembowski"},{"full_name":"Nielsen, Jesper Buus","last_name":"Nielsen","first_name":"Jesper Buus"}],"date_updated":"2021-01-12T08:18:08Z","date_created":"2020-08-30T22:01:12Z","volume":12171,"ec_funded":1},{"article_processing_charge":"No","day":"15","scopus_import":"1","date_published":"2020-05-15T00:00:00Z","page":"623-651","citation":{"mla":"Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:10.1007/978-3-030-45374-9_21.","short":"N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651.","chicago":"Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45374-9_21.","ama":"Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. Vol 12110. Springer Nature; 2020:623-651. doi:10.1007/978-3-030-45374-9_21","ista":"Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.","ieee":"N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651.","apa":"Genise, N., Micciancio, D., Peikert, C., & Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21"},"publication":"23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography","abstract":[{"text":"Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","intvolume":" 12110","status":"public","title":"Improved discrete Gaussian and subgaussian analysis for lattice cryptography","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8339","publication_identifier":{"eissn":["16113349"],"isbn":["9783030453732"],"issn":["03029743"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-45374-9_21","conference":{"name":"PKC: Public-Key Cryptography","start_date":"2020-05-04","location":"Edinburgh, United Kingdom","end_date":"2020-05-07"},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"quality_controlled":"1","main_file_link":[{"url":"https://eprint.iacr.org/2020/337","open_access":"1"}],"oa":1,"ec_funded":1,"volume":12110,"date_created":"2020-09-06T22:01:13Z","date_updated":"2023-02-23T13:31:06Z","author":[{"full_name":"Genise, Nicholas","last_name":"Genise","first_name":"Nicholas"},{"last_name":"Micciancio","first_name":"Daniele","full_name":"Micciancio, Daniele"},{"full_name":"Peikert, Chris","last_name":"Peikert","first_name":"Chris"},{"full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","last_name":"Walter","first_name":"Michael"}],"publisher":"Springer Nature","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2020"},{"_id":"8572","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","status":"public","intvolume":" 74","oa_version":"Published Version","type":"conference","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"publication":"EPiC Series in Computing","citation":{"ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.","ieee":"M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2","chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48."},"page":"16-48","date_published":"2020-09-25T00:00:00Z","day":"25","article_processing_charge":"No","year":"2020","acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"EasyChair","author":[{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"last_name":"Bak","first_name":"Stanley","full_name":"Bak, Stanley"},{"first_name":"Zongnan","last_name":"Bao","full_name":"Bao, Zongnan"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"full_name":"Kochdumper, Niklas","first_name":"Niklas","last_name":"Kochdumper"},{"first_name":"Yangge","last_name":"Li","full_name":"Li, Yangge"},{"full_name":"Mitra, Sayan","first_name":"Sayan","last_name":"Mitra"},{"last_name":"Ray","first_name":"Rajarshi","full_name":"Ray, Rajarshi"},{"orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian"},{"first_name":"Stefan","last_name":"Schupp","full_name":"Schupp, Stefan"},{"last_name":"Wetzlinger","first_name":"Mark","full_name":"Wetzlinger, Mark"}],"date_created":"2020-09-26T14:49:43Z","date_updated":"2021-01-12T08:20:06Z","volume":74,"ec_funded":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"quality_controlled":"1","project":[{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"conference":{"start_date":"2020-07-12","end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"doi":"10.29007/7dt2","language":[{"iso":"eng"}],"month":"09"},{"oa":1,"main_file_link":[{"url":"https://easychair.org/publications/download/nrdD","open_access":"1"}],"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","doi":"10.29007/zkf6","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2020-07-12","start_date":"2020-07-12"},"language":[{"iso":"eng"}],"month":"09","acknowledgement":"Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411.","year":"2020","publisher":"EasyChair","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"first_name":"Luca","last_name":"Geretti","full_name":"Geretti, Luca"},{"first_name":"Julien","last_name":"Alexandre Dit Sandretto","full_name":"Alexandre Dit Sandretto, Julien"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"full_name":"Benet, Luis","first_name":"Luis","last_name":"Benet"},{"first_name":"Alexandre","last_name":"Chapoutot","full_name":"Chapoutot, Alexandre"},{"full_name":"Chen, Xin","first_name":"Xin","last_name":"Chen"},{"full_name":"Collins, Pieter","first_name":"Pieter","last_name":"Collins"},{"last_name":"Forets","first_name":"Marcelo","full_name":"Forets, Marcelo"},{"first_name":"Daniel","last_name":"Freire","full_name":"Freire, Daniel"},{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"first_name":"Niklas","last_name":"Kochdumper","full_name":"Kochdumper, Niklas"},{"full_name":"Sanders, David","last_name":"Sanders","first_name":"David"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian"}],"volume":74,"date_updated":"2021-01-12T08:20:06Z","date_created":"2020-09-26T14:41:29Z","ec_funded":1,"citation":{"short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6.","chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6","apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6","ieee":"L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.","ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75."},"publication":"EPiC Series in Computing","page":"49-75","date_published":"2020-09-25T00:00:00Z","article_processing_charge":"No","day":"25","_id":"8571","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 74","status":"public","title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","oa_version":"Published Version","type":"conference","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}]},{"file_date_updated":"2020-10-05T14:04:25Z","article_number":"23","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"volume":171,"date_updated":"2021-01-12T08:20:15Z","date_created":"2020-10-04T22:01:36Z","year":"2020","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771603"],"issn":["18688969"]},"month":"08","doi":"10.4230/LIPIcs.CONCUR.2020.23","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2020-09-01","location":"Virtual","end_date":"2020-09-04"},"language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2007.08917"]},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"file":[{"access_level":"open_access","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","creator":"dernst","content_type":"application/pdf","file_size":601231,"file_id":"8610","relation":"main_file","success":1,"checksum":"5039752f644c4b72b9361d21a5e31baf","date_created":"2020-10-05T14:04:25Z","date_updated":"2020-10-05T14:04:25Z"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8600","intvolume":" 171","status":"public","ddc":["000"],"title":"Multi-dimensional long-run average problems for vector addition systems with states","article_processing_charge":"No","has_accepted_license":"1","day":"06","scopus_import":"1","date_published":"2020-08-06T00:00:00Z","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.23","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"publication":"31st International Conference on Concurrency Theory"},{"day":"06","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-08-06T00:00:00Z","publication":"31st International Conference on Concurrency Theory","citation":{"chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2.","mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” 31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.","apa":"Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2"},"abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_LIPIcsCONCUR_Avni.pdf","content_type":"application/pdf","file_size":868510,"creator":"dernst","relation":"main_file","file_id":"8611","checksum":"8f33b098e73724e0ac817f764d8e1a2d","success":1,"date_updated":"2020-10-05T14:13:19Z","date_created":"2020-10-05T14:13:19Z"}],"_id":"8599","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"A survey of bidding games on graphs","status":"public","intvolume":" 171","month":"08","publication_identifier":{"issn":["18688969"],"isbn":["9783959771603"]},"conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Virtual","start_date":"2020-09-01","end_date":"2020-09-04"},"doi":"10.4230/LIPIcs.CONCUR.2020.2","language":[{"iso":"eng"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"file_date_updated":"2020-10-05T14:13:19Z","article_number":"2","author":[{"full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T08:20:13Z","date_created":"2020-10-04T22:01:36Z","volume":171,"year":"2020","acknowledgement":"We would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}]},{"ec_funded":1,"file_date_updated":"2021-03-11T12:33:35Z","author":[{"full_name":"Aksenov, Vitaly","first_name":"Vitaly","last_name":"Aksenov"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Drozdova","first_name":"Alexandra","full_name":"Drozdova, Alexandra"},{"full_name":"Mohtashami, Amirkeivan","first_name":"Amirkeivan","last_name":"Mohtashami"}],"volume":179,"date_created":"2020-11-05T15:26:17Z","date_updated":"2023-02-23T13:41:40Z","acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML.","year":"2020","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771689"],"issn":["1868-8969"]},"month":"08","doi":"10.4230/LIPIcs.DISC.2020.3","conference":{"name":"DISC: Symposium on Distributed Computing","end_date":"2020-10-16","location":"Freiburg, Germany","start_date":"2020-10-12"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2008.01009"]},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"quality_controlled":"1","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"}],"type":"conference","file":[{"relation":"main_file","file_id":"9237","date_created":"2021-03-11T12:33:35Z","date_updated":"2021-03-11T12:33:35Z","checksum":"a626a9c47df52b6f6d97edd910dae4ba","success":1,"file_name":"2020_LIPIcs_Aksenov.pdf","access_level":"open_access","file_size":740358,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8725","intvolume":" 179","title":"The splay-list: A distribution-adaptive concurrent skip-list","status":"public","ddc":["000"],"has_accepted_license":"1","article_processing_charge":"No","day":"03","series_title":"LIPIcs","date_published":"2020-08-03T00:00:00Z","citation":{"chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.","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.","mla":"Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” 34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in 34th International Symposium on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.","apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In 34th International Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.3","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.","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: 34th International Symposium on Distributed Computing. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:10.4230/LIPIcs.DISC.2020.3"},"publication":"34th International Symposium on Distributed Computing","page":"3:1-3:18"},{"publication_identifier":{"issn":["2410-3896"]},"month":"08","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2009.11773"]},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"quality_controlled":"1","doi":"10.3390/condmat5030053","language":[{"iso":"eng"}],"article_number":"53","ec_funded":1,"file_date_updated":"2020-11-06T07:24:40Z","year":"2020","department":[{"_id":"MiLe"}],"publisher":"MDPI","publication_status":"published","author":[{"first_name":"Dorota","last_name":"Gotfryd","full_name":"Gotfryd, Dorota"},{"full_name":"Paerschke, Ekaterina","first_name":"Ekaterina","last_name":"Paerschke","id":"8275014E-6063-11E9-9B7F-6338E6697425","orcid":"0000-0003-0853-8182"},{"last_name":"Wohlfeld","first_name":"Krzysztof","full_name":"Wohlfeld, Krzysztof"},{"full_name":"Oleś, Andrzej M.","last_name":"Oleś","first_name":"Andrzej M."}],"volume":5,"date_created":"2020-11-06T07:21:00Z","date_updated":"2021-01-12T08:20:46Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"26","citation":{"chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” Condensed Matter. MDPI, 2020. https://doi.org/10.3390/condmat5030053.","short":"D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).","mla":"Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” Condensed Matter, vol. 5, no. 3, 53, MDPI, 2020, doi:10.3390/condmat5030053.","apa":"Gotfryd, D., Paerschke, E., Wohlfeld, K., & Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. MDPI. https://doi.org/10.3390/condmat5030053","ieee":"D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” Condensed Matter, vol. 5, no. 3. MDPI, 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.","ama":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 2020;5(3). doi:10.3390/condmat5030053"},"publication":"Condensed Matter","article_type":"original","date_published":"2020-08-26T00:00:00Z","type":"journal_article","issue":"3","abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8726","intvolume":" 5","ddc":["530"],"title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","status":"public","oa_version":"Published Version","file":[{"success":1,"checksum":"a57a698ff99a11b6665bafd1bac7afbc","date_created":"2020-11-06T07:24:40Z","date_updated":"2020-11-06T07:24:40Z","file_id":"8727","relation":"main_file","creator":"dernst","file_size":768336,"content_type":"application/pdf","access_level":"open_access","file_name":"2020_CondensedMatter_Gotfryd.pdf"}]},{"language":[{"iso":"eng"}],"conference":{"name":" FMCAD: Formal Methods in Computer-Aided Design","location":"Online Conference","start_date":"2020-09-21","end_date":"2020-09-24"},"doi":"10.34727/2020/isbn.978-3-85448-042-6_21","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"09","publication_identifier":{"eissn":["2708-7824"],"isbn":["9783854480426"]},"date_updated":"2021-02-09T09:39:59Z","date_created":"2021-01-24T23:01:10Z","author":[{"full_name":"Alamdari, Par Alizadeh","first_name":"Par Alizadeh","last_name":"Alamdari"},{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Lukina, Anna","first_name":"Anna","last_name":"Lukina","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"}],"publication_status":"published","publisher":"TU Wien Academic Press","department":[{"_id":"ToHe"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","year":"2020","file_date_updated":"2021-02-09T09:39:02Z","date_published":"2020-09-21T00:00:00Z","page":"138-147","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","citation":{"chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21.","mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.","ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.","apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21","ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21"},"day":"21","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"file_name":"2020_FMCAD_Alamdari.pdf","access_level":"open_access","file_size":990999,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"9109","date_created":"2021-02-09T09:39:02Z","date_updated":"2021-02-09T09:39:02Z","checksum":"d616d549a0ade78606b16f8a9540820f","success":1}],"title":"Formal methods with a touch of magic","status":"public","ddc":["000"],"_id":"9040","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training.","lang":"eng"}],"type":"conference"},{"publisher":"Springer Nature","department":[{"_id":"SyCr"}],"editor":[{"full_name":"Starr, C","first_name":"C","last_name":"Starr"}],"status":"public","title":"Parasites and Pathogens","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9096","year":"2020","oa_version":"None","date_updated":"2021-02-05T12:19:21Z","date_created":"2021-02-05T12:15:18Z","author":[{"first_name":"Paul","last_name":"Schmid-Hempel","full_name":"Schmid-Hempel, Paul"},{"first_name":"Sylvia M","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M"}],"place":"Cham","type":"book_chapter","quality_controlled":"1","citation":{"chicago":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” In Encyclopedia of Social Insects, edited by C Starr. Cham: Springer Nature, 2020. https://doi.org/10.1007/978-3-319-90306-4_94-1.","short":"P. Schmid-Hempel, S. Cremer, in:, C. Starr (Ed.), Encyclopedia of Social Insects, Springer Nature, Cham, 2020.","mla":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” Encyclopedia of Social Insects, edited by C Starr, Springer Nature, 2020, doi:10.1007/978-3-319-90306-4_94-1.","ieee":"P. Schmid-Hempel and S. Cremer, “Parasites and Pathogens,” in Encyclopedia of Social Insects, C. Starr, Ed. Cham: Springer Nature, 2020.","apa":"Schmid-Hempel, P., & Cremer, S. (2020). Parasites and Pathogens. In C. Starr (Ed.), Encyclopedia of Social Insects. Cham: Springer Nature. https://doi.org/10.1007/978-3-319-90306-4_94-1","ista":"Schmid-Hempel P, Cremer S. 2020.Parasites and Pathogens. In: Encyclopedia of Social Insects. .","ama":"Schmid-Hempel P, Cremer S. Parasites and Pathogens. In: Starr C, ed. Encyclopedia of Social Insects. Cham: Springer Nature; 2020. doi:10.1007/978-3-319-90306-4_94-1"},"publication":"Encyclopedia of Social Insects","language":[{"iso":"eng"}],"date_published":"2020-02-22T00:00:00Z","doi":"10.1007/978-3-319-90306-4_94-1","article_processing_charge":"No","publication_identifier":{"isbn":["9783319903064"]},"day":"22","month":"02"},{"publication":"eLS","citation":{"ista":"Westram AM, Faria R, Butlin R, Johannesson K. 2020.Inversions and Evolution. In: eLS. .","apa":"Westram, A. M., Faria, R., Butlin, R., & Johannesson, K. (2020). Inversions and Evolution. In eLS. Wiley. https://doi.org/10.1002/9780470015902.a0029007","ieee":"A. M. Westram, R. Faria, R. Butlin, and K. Johannesson, “Inversions and Evolution,” in eLS, Wiley, 2020.","ama":"Westram AM, Faria R, Butlin R, Johannesson K. Inversions and Evolution. In: ELS. Wiley; 2020. doi:10.1002/9780470015902.a0029007","chicago":"Westram, Anja M, Rui Faria, Roger Butlin, and Kerstin Johannesson. “Inversions and Evolution.” In ELS. Wiley, 2020. https://doi.org/10.1002/9780470015902.a0029007.","mla":"Westram, Anja M., et al. “Inversions and Evolution.” ELS, Wiley, 2020, doi:10.1002/9780470015902.a0029007.","short":"A.M. Westram, R. Faria, R. Butlin, K. Johannesson, in:, ELS, Wiley, 2020."},"quality_controlled":"1","date_published":"2020-05-16T00:00:00Z","doi":"10.1002/9780470015902.a0029007","language":[{"iso":"eng"}],"month":"05","day":"16","article_processing_charge":"No","publication_identifier":{"isbn":["9780470016176","9780470015902"]},"year":"2020","_id":"9123","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Inversions and Evolution","publication_status":"published","status":"public","publisher":"Wiley","department":[{"_id":"NiBa"}],"author":[{"full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"},{"first_name":"Roger","last_name":"Butlin","full_name":"Butlin, Roger"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"}],"date_updated":"2021-02-15T13:18:16Z","date_created":"2021-02-15T12:39:04Z","oa_version":"None","type":"book_chapter","abstract":[{"lang":"eng","text":"Inversions are chromosomal rearrangements where the order of genes is reversed. Inversions originate by mutation and can be under positive, negative or balancing selection. Selective effects result from potential disruptive effects on meiosis, gene disruption at inversion breakpoints and, importantly, the effects of inversions as modifiers of recombination rate: Recombination is strongly reduced in individuals heterozygous for an inversion, allowing for alleles at different loci to be inherited as a ‘block’. This may lead to a selective advantage whenever it is favourable to keep certain combinations of alleles associated, for example under local adaptation with gene flow. Inversions can cover a considerable part of a chromosome and contain numerous loci under different selection pressures, so that the resulting overall effects may be complex. Empirical data from various systems show that inversions may have a prominent role in local adaptation, speciation, parallel evolution, the maintenance of polymorphism and sex chromosome evolution."}]},{"ec_funded":1,"file_date_updated":"2021-03-22T08:56:37Z","acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","year":"2020","department":[{"_id":"HeEd"}],"publisher":"De Gruyter","publication_status":"published","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"}],"volume":4,"date_updated":"2021-03-22T09:01:50Z","date_created":"2021-03-16T08:55:19Z","publication_identifier":{"issn":["2353-3390"]},"month":"11","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"quality_controlled":"1","doi":"10.1515/mathm-2020-0106","language":[{"iso":"eng"}],"type":"journal_article","issue":"1","abstract":[{"text":"Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9249","intvolume":" 4","title":"Digital objects in rhombic dodecahedron grid","status":"public","ddc":["510"],"file":[{"date_updated":"2021-03-22T08:56:37Z","date_created":"2021-03-22T08:56:37Z","checksum":"4a1043fa0548a725d464017fe2483ce0","success":1,"relation":"main_file","file_id":"9272","content_type":"application/pdf","file_size":3668725,"creator":"dernst","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","access_level":"open_access"}],"oa_version":"Published Version","article_processing_charge":"No","has_accepted_license":"1","day":"17","citation":{"ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158.","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106."},"publication":"Mathematical Morphology - Theory and Applications","page":"143-158","article_type":"original","date_published":"2020-11-17T00:00:00Z"},{"type":"conference","abstract":[{"text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ .","lang":"eng"}],"intvolume":" 12590","status":"public","title":"Crossings between non-homotopic edges","_id":"9299","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","series_title":"LNCS","scopus_import":"1","article_processing_charge":"No","day":"20","page":"359-371","citation":{"short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28.","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28","apa":"Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28","ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371.","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371."},"publication":"28th International Symposium on Graph Drawing and Network Visualization","date_published":"2020-09-20T00:00:00Z","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2020","acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","volume":12590,"date_updated":"2021-04-06T11:32:32Z","date_created":"2021-03-28T22:01:44Z","author":[{"full_name":"Pach, János","first_name":"János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4"},{"full_name":"Tardos, Gábor","last_name":"Tardos","first_name":"Gábor"},{"full_name":"Tóth, Géza","first_name":"Géza","last_name":"Tóth"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030687656"],"eissn":["1611-3349"]},"month":"09","project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"oa":1,"external_id":{"arxiv":["2006.14908"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-68766-3_28","conference":{"name":"GD: Graph Drawing and Network Visualization","end_date":"2020-09-18","start_date":"2020-09-16","location":"Virtual, Online"}},{"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","external_id":{"arxiv":["2004.14340"]},"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06"},"publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"month":"12","publisher":"Curran Associates","department":[{"_id":"DaAl"},{"_id":"ToHe"}],"publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","year":"2020","volume":33,"date_updated":"2023-02-23T14:03:06Z","date_created":"2021-07-04T22:01:26Z","author":[{"full_name":"Singh, Sidak Pal","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","first_name":"Sidak Pal","last_name":"Singh"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"ec_funded":1,"page":"18098-18109","citation":{"apa":"Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109.","chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.","short":"S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109."},"publication":"Advances in Neural Information Processing Systems","date_published":"2020-12-06T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"06","intvolume":" 33","status":"public","title":"WoodFisher: Efficient second-order approximation for neural network compression","_id":"9632","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","type":"conference","abstract":[{"lang":"eng","text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher."}]},{"issue":"2","abstract":[{"lang":"eng","text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context."}],"type":"journal_article","oa_version":"Published Version","file":[{"file_size":1449234,"content_type":"application/pdf","creator":"asandaue","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","access_level":"open_access","date_created":"2021-08-11T11:55:11Z","date_updated":"2021-08-11T11:55:11Z","checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","success":1,"relation":"main_file","file_id":"9882"}],"intvolume":" 11","title":"Topological data analysis in information space","ddc":["510","000"],"status":"public","_id":"9630","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"Yes","has_accepted_license":"1","day":"14","scopus_import":"1","date_published":"2020-12-14T00:00:00Z","page":"162-182","article_type":"original","citation":{"ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. Journal of Computational Geometry. 2020;11(2):162-182. doi:10.20382/jocg.v11i2a7","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” Journal of Computational Geometry, vol. 11, no. 2. Carleton University, pp. 162–182, 2020.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2020). Topological data analysis in information space. Journal of Computational Geometry. Carleton University. https://doi.org/10.20382/jocg.v11i2a7","ista":"Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” Journal of Computational Geometry, vol. 11, no. 2, Carleton University, 2020, pp. 162–82, doi:10.20382/jocg.v11i2a7.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” Journal of Computational Geometry. Carleton University, 2020. https://doi.org/10.20382/jocg.v11i2a7."},"publication":"Journal of Computational Geometry","file_date_updated":"2021-08-11T11:55:11Z","volume":11,"date_updated":"2021-08-11T12:26:34Z","date_created":"2021-07-04T22:01:26Z","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"HeEd"}],"publisher":"Carleton University","publication_status":"published","year":"2020","acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","publication_identifier":{"eissn":["1920180X"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.20382/jocg.v11i2a7","project":[{"name":"Discretization in Geometry and Dynamics","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","grant_number":"I4887"}],"quality_controlled":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"}},{"month":"12","publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2020-12-06","location":"Vancouver, Canada","end_date":"2020-12-12","name":"NeurIPS: Conference on Neural Information Processing Systems"},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html"}],"external_id":{"arxiv":["2002.11505"]},"ec_funded":1,"date_created":"2021-07-04T22:01:26Z","date_updated":"2023-02-23T14:03:03Z","volume":33,"author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Korhonen, Janne","first_name":"Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"}],"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Curran Associates","year":"2020","acknowledgement":"We thank Marco Mondelli for discussions related to LDPC decoding, and Giorgi Nadiradze for discussions on analysis of relaxed schedulers. This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","day":"06","article_processing_charge":"No","scopus_import":"1","date_published":"2020-12-06T00:00:00Z","page":"22361-22372","publication":"Advances in Neural Information Processing Systems","citation":{"chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing Systems, 33:22361–72. Curran Associates, 2020.","mla":"Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.","short":"V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.","ista":"Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 22361–22372.","ieee":"V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.","apa":"Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling. In Advances in Neural Information Processing Systems (Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.","ama":"Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed scheduling. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:22361-22372."},"abstract":[{"lang":"eng","text":"The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been considerable effort invested into developing efficient parallel variants of classic machine learning algorithms. However, despite the wealth of knowledge on parallelization, some classic machine learning algorithms often prove hard to parallelize efficiently while maintaining convergence. In this paper, we focus on efficient parallel algorithms for the key machine learning task of inference on graphical models, in particular on the fundamental belief propagation algorithm. We address the challenge of efficiently parallelizing this classic paradigm by showing how to leverage scalable relaxed schedulers in this context. We present an extensive empirical study, showing that our approach outperforms previous parallel belief propagation implementations both in terms of scalability and in terms of wall-clock convergence time, on a range of practical applications."}],"type":"conference","oa_version":"Published Version","title":"Scalable belief propagation via relaxed scheduling","status":"public","intvolume":" 33","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9631"},{"abstract":[{"lang":"eng","text":"Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete."}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","file":[{"checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","success":1,"date_updated":"2020-09-21T13:57:34Z","date_created":"2020-09-21T13:57:34Z","relation":"main_file","file_id":"8550","file_size":491374,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcs_Chatterjee.pdf"}],"intvolume":" 170","ddc":["000"],"status":"public","title":"Simplified game of life: Algorithms and complexity","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8533","has_accepted_license":"1","article_processing_charge":"No","day":"18","scopus_import":"1","date_published":"2020-08-18T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22","ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22"},"publication":"45th International Symposium on Mathematical Foundations of Computer Science","ec_funded":1,"file_date_updated":"2020-09-21T13:57:34Z","article_number":"22:1-22:13","volume":170,"date_created":"2020-09-20T22:01:36Z","date_updated":"2021-01-12T08:19:55Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2020","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2020.22","conference":{"location":"Prague, Czech Republic","start_date":"2020-08-24","end_date":"2020-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","external_id":{"arxiv":["2007.02894"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1},{"date_published":"2020-08-18T00:00:00Z","citation":{"ama":"Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51","ieee":"I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.","apa":"Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51","ista":"Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.","short":"I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.","chicago":"Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51."},"publication":"45th International Symposium on Mathematical Foundations of Computer Science","has_accepted_license":"1","article_processing_charge":"No","day":"18","scopus_import":"1","oa_version":"Published Version","file":[{"file_name":"2020_LIPIcsMFCS_Jecker.pdf","access_level":"open_access","file_size":597977,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"8552","date_updated":"2020-09-21T14:17:08Z","date_created":"2020-09-21T14:17:08Z","checksum":"2dc9e2fad6becd4563aef3e27a473f70","success":1}],"intvolume":" 170","ddc":["000"],"title":"Unary prime languages","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8534","abstract":[{"lang":"eng","text":"A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs."}],"alternative_title":["LIPIcs"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2020.51","conference":{"name":"MFCS: Symposium on Mathematical Foundations of Computer Science","end_date":"2020-08-28","location":"Prague, Czech Republic","start_date":"2020-08-24"},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"month":"08","volume":170,"date_updated":"2021-01-12T08:19:56Z","date_created":"2020-09-20T22:01:36Z","author":[{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"full_name":"Mazzocchi, Nicolas","last_name":"Mazzocchi","first_name":"Nicolas"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2020","acknowledgement":"Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS.","ec_funded":1,"file_date_updated":"2020-09-21T14:17:08Z","article_number":"51:1-51:12"},{"day":"09","article_processing_charge":"No","scopus_import":"1","date_published":"2020-09-09T00:00:00Z","article_type":"original","publication":"European Journal of Mathematics","citation":{"short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020).","mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal of Mathematics, Springer Nature, 2020, doi:10.1007/s40879-020-00426-9.","chicago":"Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” European Journal of Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s40879-020-00426-9.","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European Journal of Mathematics. 2020. doi:10.1007/s40879-020-00426-9","ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” European Journal of Mathematics. Springer Nature, 2020.","apa":"Akopyan, A., Schwartz, R., & Tabachnikov, S. (2020). Billiards in ellipses revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics."},"abstract":[{"text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","status":"public","title":"Billiards in ellipses revisited","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"8538","month":"09","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"language":[{"iso":"eng"}],"doi":"10.1007/s40879-020-00426-9","quality_controlled":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2001.02934"}],"oa":1,"external_id":{"arxiv":["2001.02934"]},"ec_funded":1,"date_updated":"2021-12-02T15:10:17Z","date_created":"2020-09-20T22:01:38Z","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"first_name":"Richard","last_name":"Schwartz","full_name":"Schwartz, Richard"},{"last_name":"Tabachnikov","first_name":"Serge","full_name":"Tabachnikov, Serge"}],"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","acknowledgement":" This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191.","year":"2020"},{"publisher":"Cold Spring Harbor Laboratory","department":[{"_id":"SiHi"}],"publication_status":"submitted","title":"Reduction of neuronal activity mediated by blood-vessel regression in the brain","status":"public","_id":"8616","year":"2020","acknowledgement":"The project was initiated in the Jan lab at UCSF. We thank Lily Jan and Yuh-Nung Jan’s generous support. We thank Liqun Luo’s lab for providing MADM-7 mice and Rolf A Brekken for VEGF-antibodies. Drs. Yuanquan Song (UPenn), Zhaozhu Hu (JHU), Ji Hu (ShanghaiTech), Yang Xiang (U. Mass), Hao Wang (Zhejiang U.) and Ruikang Wang (U. Washington) for critical input, colleagues at Children’s Research Institute, Departments of Neuroscience, Neurology and Neurotherapeutics, Pediatrics from UT Southwestern, and colleagues from the Jan lab for discussion. Dr. Bridget Samuels, Sean Morrison (UT Southwestern), and Nannan Lu (Zhejiang U.) for critical reading. We acknowledge the assistance of the CIBR Imaging core. We also thank UT Southwestern Live Cell Imaging Facility, a Shared Resource of the Harold C. Simmons Cancer Center, supported in part by an NCI Cancer Center Support Grant, P30 CA142543K. This work is supported by CIBR funds and the American Heart Association AWRP Summer 2016 Innovative Research Grant (17IRG33410377) to W-P.G.; National Natural Science Foundation of China (No.81370031) to Z.Z.;National Key Research and Development Program of China (2016YFE0125400)to F.H.;National Natural Science Foundations of China (No. 81473202) to Y.L.; National Natural Science Foundation of China (No.31600839) and Shenzhen Science and Technology Research Program (JCYJ20170818163320865) to B.P.; National Natural Science Foundation of China (No. 31800864) and Westlake University start-up funds to J-M. J. NIH R01NS088627 to W.L.J.; NIH: R01 AG020670 and RF1AG054111 to H.Z.; R01 NS088555 to A.M.S., and European Research Council No.725780 to S.H.;W-P.G. was a recipient of Bugher-American Heart Association Dan Adams Thinking Outside the Box Award.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_created":"2020-10-06T08:58:59Z","date_updated":"2021-01-12T08:20:19Z","author":[{"first_name":"Xiaofei","last_name":"Gao","full_name":"Gao, Xiaofei"},{"full_name":"Li, Jun-Liszt","last_name":"Li","first_name":"Jun-Liszt"},{"first_name":"Xingjun","last_name":"Chen","full_name":"Chen, Xingjun"},{"first_name":"Bo","last_name":"Ci","full_name":"Ci, Bo"},{"full_name":"Chen, Fei","last_name":"Chen","first_name":"Fei"},{"last_name":"Lu","first_name":"Nannan","full_name":"Lu, Nannan"},{"full_name":"Shen, Bo","first_name":"Bo","last_name":"Shen"},{"full_name":"Zheng, Lijun","last_name":"Zheng","first_name":"Lijun"},{"full_name":"Jia, Jie-Min","first_name":"Jie-Min","last_name":"Jia"},{"full_name":"Yi, Yating","last_name":"Yi","first_name":"Yating"},{"full_name":"Zhang, Shiwen","last_name":"Zhang","first_name":"Shiwen"},{"last_name":"Shi","first_name":"Ying-Chao","full_name":"Shi, Ying-Chao"},{"full_name":"Shi, Kaibin","first_name":"Kaibin","last_name":"Shi"},{"first_name":"Nicholas E","last_name":"Propson","full_name":"Propson, Nicholas E"},{"full_name":"Huang, Yubin","first_name":"Yubin","last_name":"Huang"},{"last_name":"Poinsatte","first_name":"Katherine","full_name":"Poinsatte, Katherine"},{"full_name":"Zhang, Zhaohuan","first_name":"Zhaohuan","last_name":"Zhang"},{"first_name":"Yuanlei","last_name":"Yue","full_name":"Yue, Yuanlei"},{"full_name":"Bosco, Dale B","last_name":"Bosco","first_name":"Dale B"},{"last_name":"Lu","first_name":"Ying-mei","full_name":"Lu, Ying-mei"},{"full_name":"Yang, Shi-bing","first_name":"Shi-bing","last_name":"Yang"},{"full_name":"Adams, Ralf H.","first_name":"Ralf H.","last_name":"Adams"},{"full_name":"Lindner, Volkhard","first_name":"Volkhard","last_name":"Lindner"},{"full_name":"Huang, Fen","first_name":"Fen","last_name":"Huang"},{"full_name":"Wu, Long-Jun","last_name":"Wu","first_name":"Long-Jun"},{"full_name":"Zheng, Hui","first_name":"Hui","last_name":"Zheng"},{"full_name":"Han, Feng","last_name":"Han","first_name":"Feng"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer"},{"last_name":"Stowe","first_name":"Ann M.","full_name":"Stowe, Ann M."},{"first_name":"Bo","last_name":"Peng","full_name":"Peng, Bo"},{"full_name":"Margeta, Marta","last_name":"Margeta","first_name":"Marta"},{"last_name":"Wang","first_name":"Xiaoqun","full_name":"Wang, Xiaoqun"},{"first_name":"Qiang","last_name":"Liu","full_name":"Liu, Qiang"},{"full_name":"Körbelin, Jakob","last_name":"Körbelin","first_name":"Jakob"},{"full_name":"Trepel, Martin","first_name":"Martin","last_name":"Trepel"},{"first_name":"Hui","last_name":"Lu","full_name":"Lu, Hui"},{"last_name":"Zhou","first_name":"Bo O.","full_name":"Zhou, Bo O."},{"last_name":"Zhao","first_name":"Hu","full_name":"Zhao, Hu"},{"last_name":"Su","first_name":"Wenzhi","full_name":"Su, Wenzhi"},{"full_name":"Bachoo, Robert M.","first_name":"Robert M.","last_name":"Bachoo"},{"first_name":"Woo-ping","last_name":"Ge","full_name":"Ge, Woo-ping"}],"type":"preprint","ec_funded":1,"abstract":[{"lang":"eng","text":"The brain vasculature supplies neurons with glucose and oxygen, but little is known about how vascular plasticity contributes to brain function. Using longitudinal in vivo imaging, we reported that a substantial proportion of blood vessels in the adult brain sporadically occluded and regressed. Their regression proceeded through sequential stages of blood-flow occlusion, endothelial cell collapse, relocation or loss of pericytes, and retraction of glial endfeet. Regressing vessels were found to be widespread in mouse, monkey and human brains. Both brief occlusions of the middle cerebral artery and lipopolysaccharide-mediated inflammation induced an increase of vessel regression. Blockage of leukocyte adhesion to endothelial cells alleviated LPS-induced vessel regression. We further revealed that blood vessel regression caused a reduction of neuronal activity due to a dysfunction in mitochondrial metabolism and glutamate production. Our results elucidate the mechanism of vessel regression and its role in neuronal function in the adult brain."}],"project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.1101/2020.09.15.262782","open_access":"1"}],"oa":1,"citation":{"chicago":"Gao, Xiaofei, Jun-Liszt Li, Xingjun Chen, Bo Ci, Fei Chen, Nannan Lu, Bo Shen, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression in the Brain.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.09.15.262782.","short":"X. Gao, J.-L. Li, X. Chen, B. Ci, F. Chen, N. Lu, B. Shen, L. Zheng, J.-M. Jia, Y. Yi, S. Zhang, Y.-C. Shi, K. Shi, N.E. Propson, Y. Huang, K. Poinsatte, Z. Zhang, Y. Yue, D.B. Bosco, Y. Lu, S. Yang, R.H. Adams, V. Lindner, F. Huang, L.-J. Wu, H. Zheng, F. Han, S. Hippenmeyer, A.M. Stowe, B. Peng, M. Margeta, X. Wang, Q. Liu, J. Körbelin, M. Trepel, H. Lu, B.O. Zhou, H. Zhao, W. Su, R.M. Bachoo, W. Ge, BioRxiv (n.d.).","mla":"Gao, Xiaofei, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression in the Brain.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.09.15.262782.","apa":"Gao, X., Li, J.-L., Chen, X., Ci, B., Chen, F., Lu, N., … Ge, W. (n.d.). Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.09.15.262782","ieee":"X. Gao et al., “Reduction of neuronal activity mediated by blood-vessel regression in the brain,” bioRxiv. Cold Spring Harbor Laboratory.","ista":"Gao X, Li J-L, Chen X, Ci B, Chen F, Lu N, Shen B, Zheng L, Jia J-M, Yi Y, Zhang S, Shi Y-C, Shi K, Propson NE, Huang Y, Poinsatte K, Zhang Z, Yue Y, Bosco DB, Lu Y, Yang S, Adams RH, Lindner V, Huang F, Wu L-J, Zheng H, Han F, Hippenmeyer S, Stowe AM, Peng B, Margeta M, Wang X, Liu Q, Körbelin J, Trepel M, Lu H, Zhou BO, Zhao H, Su W, Bachoo RM, Ge W. Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv, 10.1101/2020.09.15.262782.","ama":"Gao X, Li J-L, Chen X, et al. Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv. doi:10.1101/2020.09.15.262782"},"publication":"bioRxiv","language":[{"iso":"eng"}],"doi":"10.1101/2020.09.15.262782","date_published":"2020-09-15T00:00:00Z","article_processing_charge":"No","day":"15","month":"09"},{"date_created":"2020-10-23T09:08:28Z","date_updated":"2020-10-23T09:34:40Z","file":[{"access_level":"open_access","file_name":"2020_OANA_Mayer.pdf","creator":"dernst","file_size":2298363,"content_type":"application/pdf","file_id":"8696","relation":"main_file","success":1,"checksum":"8eba912bb4b20b4f82f8010f2110461a","date_updated":"2020-10-23T09:29:45Z","date_created":"2020-10-23T09:29:45Z"}],"oa_version":"Published Version","author":[{"first_name":"Katja","last_name":"Mayer","full_name":"Mayer, Katja"},{"full_name":"Rieck, Katharina","last_name":"Rieck","first_name":"Katharina"},{"full_name":"Reichmann, Stefan","last_name":"Reichmann","first_name":"Stefan"},{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski","full_name":"Danowski, Patrick"},{"full_name":"Graschopf, Anton","last_name":"Graschopf","first_name":"Anton"},{"full_name":"König, Thomas","first_name":"Thomas","last_name":"König"},{"full_name":"Kraker, Peter","first_name":"Peter","last_name":"Kraker"},{"last_name":"Lehner","first_name":"Patrick","full_name":"Lehner, Patrick"},{"full_name":"Reckling, Falk","last_name":"Reckling","first_name":"Falk"},{"last_name":"Ross-Hellauer","first_name":"Tony","full_name":"Ross-Hellauer, Tony"},{"last_name":"Spichtinger","first_name":"Daniel","full_name":"Spichtinger, Daniel"},{"full_name":"Tzatzanis, Michalis","last_name":"Tzatzanis","first_name":"Michalis"},{"last_name":"Schürz","first_name":"Stefanie","full_name":"Schürz, Stefanie"}],"status":"public","title":"Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria","ddc":["020"],"publication_status":"published","publisher":"OANA","department":[{"_id":"E-Lib"}],"_id":"8695","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","file_date_updated":"2020-10-23T09:29:45Z","abstract":[{"text":"A look at international activities on Open Science reveals a broad spectrum from individual institutional policies to national action plans. The present Recommendations for a National Open Science Strategy in Austria are based on these international initiatives and present practical considerations for their coordinated implementation with regard to strategic developments in research, technology and innovation (RTI) in Austria until 2030. They are addressed to all relevant actors in the RTI system, in particular to Research Performing Organisations, Research Funding Organisations, Research Policy, memory institutions such as Libraries and Researchers. The recommendation paper was developed from 2018 to 2020 by the OANA working group \"Open Science Strategy\" and published for the first time in spring 2020 for a public consultation. The now available final version of the recommendation document, which contains feedback and comments from the consultation, is intended to provide an impetus for further discussion and implementation of Open Science in Austria and serves as a contribution and basis for a potential national Open Science Strategy in Austria. The document builds on the diverse expertise of the authors (academia, administration, library and archive, information technology, science policy, funding system, etc.) and reflects their personal experiences and opinions.","lang":"eng"},{"text":"Der Blick auf internationale Aktivitäten zu Open Science zeigt ein breites Spektrum von einzelnen institutionellen Policies bis hin zu nationalen Aktionsplänen. Die vorliegenden Empfehlungen für eine nationale Open Science Strategie in Österreich orientieren sich an diesen internationalen Initiativen und stellen praktische Überlegungen für ihre koordinierte Implementierung im Hinblick auf strategische Entwicklungen in Forschung, Technologie und Innovation (FTI) bis 2030 in Österreich dar. Dabei richten sie sich an alle relevanten Akteur*innen im FTI System, im Besonderen an Forschungsstätten, Forschungsförderer, Forschungspolitik, Gedächtnisinstitutionen wie Bibliotheken und Wissenschafter*innen. Das Empfehlungspapier wurde von 2018 bis 2020 von der OANA-Arbeitsgruppe \"Open Science Strategie\" entwickelt und im Frühling 2020 das erste Mal für eine öffentliche Konsultation veröffentlicht. Die nun vorliegende finale Version des Empfehlungsdokuments, die Feedback und Kommentare aus der Konsultation enthält, soll ein Anstoß für die weitere Diskussion und Umsetzung von Open Science in Österreich sein und als Beitrag und Grundlage einer potentiellen nationalen Open Science Strategie in Österreich dienen. Das Dokument baut auf der vielfältigen Expertise der Autor*innen auf (Wissenschaft, Administration, Bibliothek und Archiv, Informationstechnologie, Wissenschaftspolitik, Förderwesen etc.) und spiegelt deren persönliche Erfahrungen und Meinung wider.","lang":"ger"}],"type":"working_paper","language":[{"iso":"ger"}],"date_published":"2020-10-21T00:00:00Z","doi":"10.5281/ZENODO.4109242","page":"36","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"citation":{"short":"K. Mayer, K. Rieck, S. Reichmann, P. Danowski, A. Graschopf, T. König, P. Kraker, P. Lehner, F. Reckling, T. Ross-Hellauer, D. Spichtinger, M. Tzatzanis, S. Schürz, Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 2020.","mla":"Mayer, Katja, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020, doi:10.5281/ZENODO.4109242.","chicago":"Mayer, Katja, Katharina Rieck, Stefan Reichmann, Patrick Danowski, Anton Graschopf, Thomas König, Peter Kraker, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020. https://doi.org/10.5281/ZENODO.4109242.","ama":"Mayer K, Rieck K, Reichmann S, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA; 2020. doi:10.5281/ZENODO.4109242","apa":"Mayer, K., Rieck, K., Reichmann, S., Danowski, P., Graschopf, A., König, T., … Schürz, S. (2020). Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA. https://doi.org/10.5281/ZENODO.4109242","ieee":"K. Mayer et al., Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020.","ista":"Mayer K, Rieck K, Reichmann S, Danowski P, Graschopf A, König T, Kraker P, Lehner P, Reckling F, Ross-Hellauer T, Spichtinger D, Tzatzanis M, Schürz S. 2020. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 36p."},"month":"10","day":"21","has_accepted_license":"1","article_processing_charge":"No"},{"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","citation":{"short":"P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding, T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 278–284.","mla":"Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 278–84, doi:10.31263/voebm.v73i2.3941.","chicago":"Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. https://doi.org/10.31263/voebm.v73i2.3941.","ama":"Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(2):278-284. doi:10.31263/voebm.v73i2.3941","apa":"Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding, S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i2.3941","ieee":"P. Danowski et al., “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 278–284, 2020.","ista":"Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T, Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(2), 278–284."},"article_type":"original","page":"278-284","date_published":"2020-07-14T00:00:00Z","scopus_import":"1","day":"14","has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8706","status":"public","ddc":["020"],"title":"„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B","intvolume":" 73","oa_version":"Published Version","file":[{"file_size":960317,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2020_VOEB_Danowski.pdf","checksum":"37443c34d91d5bdbeb38c78b14792537","success":1,"date_created":"2020-10-27T16:27:25Z","date_updated":"2020-10-27T16:27:25Z","relation":"main_file","file_id":"8714"}],"type":"journal_article","abstract":[{"lang":"eng","text":"As part of the Austrian Transition to Open Access (AT2OA) project, subproject TP1-B is working on designing a monitoring solution for the output of Open Access publications in Austria. This report on a potential Open Access monitoring approach in Austria is one of the results of these efforts and can serve as a basis for discussion on an international level."},{"lang":"ger","text":"Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler Ebene dienen."}],"issue":"2","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.31263/voebm.v73i2.3941","language":[{"iso":"ger"}],"month":"07","publication_identifier":{"eissn":["10222588"]},"year":"2020","publication_status":"published","department":[{"_id":"E-Lib"}],"publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","author":[{"full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski"},{"last_name":"Ferus","first_name":"Andreas","full_name":"Ferus, Andreas"},{"first_name":"Anna-Laetitia","last_name":"Hikl","full_name":"Hikl, Anna-Laetitia"},{"first_name":"Gerda","last_name":"McNeill","full_name":"McNeill, Gerda"},{"full_name":"Miniberger, Clemens","first_name":"Clemens","last_name":"Miniberger"},{"first_name":"Steve","last_name":"Reding","full_name":"Reding, Steve"},{"full_name":"Zarka, Tobias","last_name":"Zarka","first_name":"Tobias"},{"last_name":"Zojer","first_name":"Michael","full_name":"Zojer, Michael"}],"date_updated":"2021-01-12T08:20:40Z","date_created":"2020-10-25T23:01:19Z","volume":73,"file_date_updated":"2020-10-27T16:27:25Z"},{"citation":{"chicago":"Laukoter, Susanne, Nicole Amberg, Florian Pauler, and Simon Hippenmeyer. “Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols. Elsevier, 2020. https://doi.org/10.1016/j.xpro.2020.100215.","short":"S. Laukoter, N. Amberg, F. Pauler, S. Hippenmeyer, STAR Protocols 1 (2020).","mla":"Laukoter, Susanne, et al. “Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols, vol. 1, no. 3, 100215, Elsevier, 2020, doi:10.1016/j.xpro.2020.100215.","apa":"Laukoter, S., Amberg, N., Pauler, F., & Hippenmeyer, S. (2020). Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. Elsevier. https://doi.org/10.1016/j.xpro.2020.100215","ieee":"S. Laukoter, N. Amberg, F. Pauler, and S. Hippenmeyer, “Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy,” STAR Protocols, vol. 1, no. 3. Elsevier, 2020.","ista":"Laukoter S, Amberg N, Pauler F, Hippenmeyer S. 2020. Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. 1(3), 100215.","ama":"Laukoter S, Amberg N, Pauler F, Hippenmeyer S. Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. 2020;1(3). doi:10.1016/j.xpro.2020.100215"},"publication":"STAR Protocols","article_type":"original","date_published":"2020-12-18T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"18","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8978","intvolume":" 1","ddc":["570"],"status":"public","title":"Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy","file":[{"file_size":4031449,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_STARProtocols_Laukoter.pdf","checksum":"f1e9a433e9cb0f41f7b6df6b76db1f6e","success":1,"date_created":"2021-01-07T15:57:27Z","date_updated":"2021-01-07T15:57:27Z","relation":"main_file","file_id":"8996"}],"oa_version":"Published Version","type":"journal_article","issue":"3","abstract":[{"text":"Mosaic analysis with double markers (MADM) technology enables concomitant fluorescent cell labeling and induction of uniparental chromosome disomy (UPD) with single-cell resolution. In UPD, imprinted genes are either overexpressed 2-fold or are not expressed. Here, the MADM platform is utilized to probe imprinting phenotypes at the transcriptional level. This protocol highlights major steps for the generation and isolation of projection neurons and astrocytes with MADM-induced UPD from mouse cerebral cortex for downstream single-cell and low-input sample RNA-sequencing experiments.\r\n\r\nFor complete details on the use and execution of this protocol, please refer to Laukoter et al. (2020b).","lang":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"pmid":["33377108"]},"project":[{"grant_number":"T0101031","_id":"268F8446-B435-11E9-9278-68D0E5697425","name":"Role of Eed in neural stem cell lineage progression","call_identifier":"FWF"},{"name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F07805","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"LS13-002","_id":"25D92700-B435-11E9-9278-68D0E5697425","name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain"},{"name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7","_id":"25D61E48-B435-11E9-9278-68D0E5697425","grant_number":"618444"},{"grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"quality_controlled":"1","doi":"10.1016/j.xpro.2020.100215","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"publication_identifier":{"issn":["2666-1667"]},"month":"12","pmid":1,"year":"2020","acknowledgement":"This research was supported by the Scientific Service Units (SSU) at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical Facilities (PCF). N.A received support from the FWF Firnberg-Programm (T 1031). This work was also supported by IST Austria institutional funds; FWF SFB F78 to S.H.; NÖ Forschung und Bildung n[f+b] life science call grant (C13-002) to S.H.; the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 618444 to S.H.; and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro) to S.H.","department":[{"_id":"SiHi"}],"publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Laukoter, Susanne","last_name":"Laukoter","first_name":"Susanne","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Amberg, Nicole","orcid":"0000-0002-3183-8207","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","last_name":"Amberg","first_name":"Nicole"},{"first_name":"Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","full_name":"Pauler, Florian"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer"}],"volume":1,"date_updated":"2021-01-12T08:21:36Z","date_created":"2020-12-30T10:17:07Z","article_number":"100215","ec_funded":1,"file_date_updated":"2021-01-07T15:57:27Z"},{"date_published":"2020-12-14T00:00:00Z","page":"1556-1563","publication":"Proceedings of the 59th IEEE Conference on Decision and Control","citation":{"ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.","ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042","mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042."},"day":"14","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","title":"Lagrangian reachtubes: The next generation","status":"public","intvolume":" 2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9103","abstract":[{"lang":"eng","text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*."}],"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2020-12-18","location":"Jeju Islang, Korea (South)","start_date":"2020-12-14","name":"CDC: Conference on Decision and Control"},"doi":"10.1109/CDC42340.2020.9304042","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"main_file_link":[{"url":"https://arxiv.org/abs/2012.07458","open_access":"1"}],"external_id":{"arxiv":["2012.07458"]},"oa":1,"month":"12","publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"date_updated":"2021-02-09T09:20:58Z","date_created":"2021-02-07T23:01:14Z","volume":2020,"author":[{"full_name":"Gruenbacher, Sophie","last_name":"Gruenbacher","first_name":"Sophie"},{"full_name":"Cyranka, Jacek","last_name":"Cyranka","first_name":"Jacek"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Islam, Md Ariful","first_name":"Md Ariful","last_name":"Islam"},{"full_name":"Smolka, Scott A.","last_name":"Smolka","first_name":"Scott A."},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"IEEE","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","year":"2020"},{"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"BeBi"}],"year":"2020","acknowledgement":"The FlexMaps Pavilion has been awarded First Prize at the “Competition and Exhibition of innovative lightweight structures” organized by the IASS Working Group 21 within the FORM and FORCE, joint international conference of IASS Symposium 2019 and Structural Membranes 2019 (Barcelona, 7-11 October 2019) with the following motivation: “for its structural innovation of bending-twisting system, connection constructability and exquisite craftmanship”[20]. The authors would like to acknowledge the Visual Computing Lab Staff of ISTI - CNR, in particular Thomas Alderighi, Marco Callieri, Paolo Pingi; Antonio Rizzo of IPCF - CNR; and the Administrative Staff of ISTI - CNR. This research was partially funded by the EU H2020 Programme EVOCATION: Advanced Visual and Geometric Computing for 3D Capture, Display, and Fabrication (grant no. 813170).","date_created":"2021-02-28T23:01:25Z","date_updated":"2021-03-03T09:43:14Z","volume":2,"author":[{"last_name":"Laccone","first_name":"Francesco","full_name":"Laccone, Francesco"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"last_name":"Perez Rodriguez","first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"first_name":"Federico","last_name":"Ponchio","full_name":"Ponchio, Federico"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"}],"article_number":"1505","quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/s42452-020-03305-w","month":"09","publication_identifier":{"eissn":["25233971"]},"title":"A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion","status":"public","intvolume":" 2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9208","oa_version":"None","type":"journal_article","abstract":[{"text":"Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype.","lang":"eng"}],"issue":"9","article_type":"original","publication":"SN Applied Sciences","citation":{"ieee":"F. Laccone et al., “A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion,” SN Applied Sciences, vol. 2, no. 9. Springer Nature, 2020.","apa":"Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., & Cignoni, P. (2020). A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. Springer Nature. https://doi.org/10.1007/s42452-020-03305-w","ista":"Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2020. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2(9), 1505.","ama":"Laccone F, Malomo L, Perez Rodriguez J, et al. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2020;2(9). doi:10.1007/s42452-020-03305-w","chicago":"Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences. Springer Nature, 2020. https://doi.org/10.1007/s42452-020-03305-w.","short":"F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, SN Applied Sciences 2 (2020).","mla":"Laccone, Francesco, et al. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences, vol. 2, no. 9, 1505, Springer Nature, 2020, doi:10.1007/s42452-020-03305-w."},"date_published":"2020-09-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"author":[{"first_name":"Quynh","last_name":"Nguyen","full_name":"Nguyen, Quynh"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco"}],"date_created":"2021-03-03T12:06:02Z","date_updated":"2022-01-04T09:24:41Z","volume":33,"acknowledgement":"The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1.","year":"2020","publication_status":"published","publisher":"Curran Associates","department":[{"_id":"MaMo"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2002.07867","open_access":"1"}],"external_id":{"arxiv":["2002.07867"]},"quality_controlled":"1","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"month":"07","oa_version":"Preprint","_id":"9221","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","status":"public","intvolume":" 33","abstract":[{"text":"Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n","lang":"eng"}],"type":"conference","date_published":"2020-07-07T00:00:00Z","publication":"34th Conference on Neural Information Processing Systems","citation":{"ista":"Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972.","apa":"Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Curran Associates.","ieee":"Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.","ama":"Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11961–11972.","chicago":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Curran Associates, 2020.","mla":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11961–11972.","short":"Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 11961–11972."},"page":"11961–11972","day":"07","article_processing_charge":"No"},{"file_date_updated":"2021-05-25T09:51:36Z","author":[{"last_name":"Kurtz","first_name":"Mark","full_name":"Kurtz, Mark"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"first_name":"Alexander","last_name":"Matveev","full_name":"Matveev, Alexander"},{"first_name":"John","last_name":"Carr","full_name":"Carr, John"},{"first_name":"Michael","last_name":"Goin","full_name":"Goin, Michael"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"full_name":"Moore, Sage","last_name":"Moore","first_name":"Sage"},{"full_name":"Nell, Bill","first_name":"Bill","last_name":"Nell"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"}],"volume":119,"date_created":"2021-05-23T22:01:45Z","date_updated":"2023-02-23T13:57:24Z","year":"2020","department":[{"_id":"DaAl"}],"publication_identifier":{"issn":["2640-3498"]},"month":"07","conference":{"start_date":"2020-07-12","location":"Online","end_date":"2020-07-18","name":"ICML: International Conference on Machine Learning"},"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. "}],"type":"conference","file":[{"content_type":"application/pdf","file_size":741899,"creator":"kschuh","file_name":"2020_PMLR_Kurtz.pdf","access_level":"open_access","date_created":"2021-05-25T09:51:36Z","date_updated":"2021-05-25T09:51:36Z","checksum":"2aaaa7d7226e49161311d91627cf783b","success":1,"relation":"main_file","file_id":"9421"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"9415","intvolume":" 119","ddc":["000"],"status":"public","title":"Inducing and exploiting activation sparsity for fast neural network inference","article_processing_charge":"No","has_accepted_license":"1","day":"12","scopus_import":"1","date_published":"2020-07-12T00:00:00Z","citation":{"ama":"Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.","ista":"Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.","ieee":"M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, ICML 2020, Online, 2020, vol. 119, pp. 5533–5543.","apa":"Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online.","mla":"Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43.","short":"M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.","chicago":"Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020."},"publication":"37th International Conference on Machine Learning, ICML 2020","page":"5533-5543"},{"file_date_updated":"2022-01-26T07:35:17Z","date_updated":"2023-04-03T07:33:40Z","date_created":"2022-01-25T15:50:00Z","author":[{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"}],"publication_status":"published","publisher":"ICLR","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"year":"2020","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","month":"03","language":[{"iso":"eng"}],"conference":{"start_date":"2020-04-26","location":"Virtual ; Addis Ababa, Ethiopia","end_date":"2020-05-01","name":"ICLR: International Conference on Learning Representations"},"quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Bke61krFvS"}],"abstract":[{"lang":"eng","text":"The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity."}],"type":"conference","file":[{"content_type":"application/pdf","file_size":249431,"creator":"mlechner","file_name":"iclr_2020.pdf","access_level":"open_access","date_updated":"2022-01-26T07:35:17Z","date_created":"2022-01-26T07:35:17Z","checksum":"ea13d42dd4541ddb239b6a75821fd6c9","success":1,"relation":"main_file","file_id":"10677"}],"oa_version":"Published Version","title":"Learning representations for binary-classification without backpropagation","status":"public","ddc":["000"],"_id":"10672","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-03-11T00:00:00Z","publication":"8th International Conference on Learning Representations","citation":{"apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020."}},{"page":"3106–3117","citation":{"ista":"Henderson PM, Lampert C. 2020. Unsupervised object-centric video generation and decomposition in 3D. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 3106–3117.","apa":"Henderson, P. M., & Lampert, C. (2020). Unsupervised object-centric video generation and decomposition in 3D. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 3106–3117). Vancouver, Canada: Curran Associates.","ieee":"P. M. Henderson and C. Lampert, “Unsupervised object-centric video generation and decomposition in 3D,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 3106–3117.","ama":"Henderson PM, Lampert C. Unsupervised object-centric video generation and decomposition in 3D. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:3106–3117.","chicago":"Henderson, Paul M, and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” In 34th Conference on Neural Information Processing Systems, 33:3106–3117. Curran Associates, 2020.","mla":"Henderson, Paul M., and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 3106–3117.","short":"P.M. Henderson, C. Lampert, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 3106–3117."},"publication":"34th Conference on Neural Information Processing Systems","date_published":"2020-07-07T00:00:00Z","article_processing_charge":"No","day":"07","intvolume":" 33","title":"Unsupervised object-centric video generation and decomposition in 3D","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8188","oa_version":"Preprint","type":"conference","abstract":[{"text":"A natural approach to generative modeling of videos is to represent them as a composition of moving objects. Recent works model a set of 2D sprites over a slowly-varying background, but without considering the underlying 3D scene that\r\ngives rise to them. We instead propose to model a video as the view seen while moving through a scene with multiple 3D objects and a 3D background. Our model is trained from monocular videos without any supervision, yet learns to\r\ngenerate coherent 3D scenes containing several moving objects. We conduct detailed experiments on two datasets, going beyond the visual complexity supported by state-of-the-art generative approaches. We evaluate our method on\r\ndepth-prediction and 3D object detection---tasks which cannot be addressed by those earlier works---and show it out-performs them even on 2D instance segmentation and tracking.","lang":"eng"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.06705"}],"external_id":{"arxiv":["2007.06705"]},"oa":1,"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2020-12-06","location":"Vancouver, Canada","end_date":"2020-12-12"},"publication_identifier":{"isbn":["9781713829546"]},"month":"07","department":[{"_id":"ChLa"}],"publisher":"Curran Associates","publication_status":"published","acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST Austria through resources\r\nprovided by Scientific Computing (SciComp). PH is employed part-time by Blackford Analysis, but\r\nthey did not support this project in any way.","year":"2020","volume":33,"date_updated":"2023-04-25T09:49:58Z","date_created":"2020-07-31T16:59:19Z","author":[{"full_name":"Henderson, Paul M","orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425","last_name":"Henderson","first_name":"Paul M"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}]},{"citation":{"ista":"Schlögl A, Kiss J, Elefante S eds. 2020. Austrian High-Performance-Computing meeting (AHPC2020), Klosterneuburg, Austria: IST Austria, 72p.","ieee":"A. Schlögl, J. Kiss, and S. Elefante, Eds., Austrian High-Performance-Computing meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020.","apa":"Schlögl, A., Kiss, J., & Elefante, S. (Eds.). (2020). Austrian High-Performance-Computing meeting (AHPC2020). Presented at the AHPC: Austrian High-Performance-Computing Meeting, Klosterneuburg, Austria: IST Austria. https://doi.org/10.15479/AT:ISTA:7474","ama":"Schlögl A, Kiss J, Elefante S, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria; 2020. doi:10.15479/AT:ISTA:7474","chicago":"Schlögl, Alois, Janos Kiss, and Stefano Elefante, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:7474.","mla":"Schlögl, Alois, et al., editors. Austrian High-Performance-Computing Meeting (AHPC2020). IST Austria, 2020, doi:10.15479/AT:ISTA:7474.","short":"A. Schlögl, J. Kiss, S. Elefante, eds., Austrian High-Performance-Computing Meeting (AHPC2020), IST Austria, Klosterneuburg, Austria, 2020."},"page":"72","date_published":"2020-02-19T00:00:00Z","day":"19","article_processing_charge":"No","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7474","status":"public","title":"Austrian High-Performance-Computing meeting (AHPC2020)","ddc":["000"],"oa_version":"Published Version","file":[{"creator":"schloegl","content_type":"application/pdf","file_size":90899507,"file_name":"BOOKLET_AHPC2020.final.pdf","access_level":"open_access","date_created":"2020-02-19T06:53:38Z","date_updated":"2020-07-14T12:47:59Z","checksum":"49798edb9e57bbd6be18362d1d7b18a9","file_id":"7504","relation":"main_file"}],"type":"book_editor","abstract":[{"lang":"eng","text":"This booklet is a collection of abstracts presented at the AHPC conference."}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","conference":{"end_date":"2020-02-21","start_date":"2020-02-19","location":"Klosterneuburg, Austria","name":"AHPC: Austrian High-Performance-Computing Meeting"},"doi":"10.15479/AT:ISTA:7474","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"isbn":["978-3-99078-004-6"]},"year":"2020","publication_status":"published","publisher":"IST Austria","editor":[{"full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","first_name":"Alois"},{"id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87","last_name":"Kiss","first_name":"Janos","full_name":"Kiss, Janos"},{"id":"490F40CE-F248-11E8-B48F-1D18A9856A87","last_name":"Elefante","first_name":"Stefano","full_name":"Elefante, Stefano"}],"department":[{"_id":"ScienComp"}],"date_created":"2020-02-11T07:59:04Z","date_updated":"2023-05-16T07:48:28Z","place":"Klosterneuburg, Austria","file_date_updated":"2020-07-14T12:47:59Z"},{"scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"17","citation":{"short":"M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.","chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5.","ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97. doi:10.1007/978-3-030-45237-7_5","ieee":"M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dublin, Ireland, 2020, vol. 12079, pp. 79–97.","apa":"Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5","ista":"Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to quantize your neural network? International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97."},"publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","page":"79-97","date_published":"2020-04-17T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades."}],"_id":"7808","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12079","status":"public","title":"How many bits does it take to quantize your neural network?","ddc":["000"],"oa_version":"Published Version","file":[{"checksum":"f19905a42891fe5ce93d69143fa3f6fb","date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-26T12:48:15Z","relation":"main_file","file_id":"7893","content_type":"application/pdf","file_size":2744030,"creator":"dernst","access_level":"open_access","file_name":"2020_TACAS_Giacobbe.pdf"}],"publication_identifier":{"eissn":["16113349"],"isbn":["9783030452360"],"issn":["03029743"]},"month":"04","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","doi":"10.1007/978-3-030-45237-7_5","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2020-04-25","location":"Dublin, Ireland","end_date":"2020-04-30"},"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:03Z","year":"2020","publisher":"Springer Nature","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Giacobbe, Mirco","last_name":"Giacobbe","first_name":"Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"}],"volume":12079,"date_created":"2020-05-10T22:00:49Z","date_updated":"2023-06-23T07:01:11Z"},{"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation 𝒯. This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary. "}],"status":"public","ddc":["510"],"title":"The topological correctness of PL-approximations of isomanifolds","intvolume":" 164","_id":"7952","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","file_size":1009739,"creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcsSoCG_Boissonnat.pdf","checksum":"38cbfa4f5d484d267a35d44d210df044","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-17T10:13:34Z","relation":"main_file","file_id":"7969"}],"oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"36th International Symposium on Computational Geometry","citation":{"short":"J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” 36th International Symposium on Computational Geometry, vol. 164, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.20.","chicago":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.20.","ama":"Boissonnat J-D, Wintraecken M. The topological correctness of PL-approximations of isomanifolds. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.20","apa":"Boissonnat, J.-D., & Wintraecken, M. (2020). The topological correctness of PL-approximations of isomanifolds. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.20","ieee":"J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL-approximations of isomanifolds,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","ista":"Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations of isomanifolds. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18."},"date_published":"2020-06-01T00:00:00Z","article_number":"20:1-20:18","file_date_updated":"2020-07-14T12:48:06Z","ec_funded":1,"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"year":"2020","date_updated":"2023-08-02T06:49:16Z","date_created":"2020-06-09T07:24:11Z","volume":164,"author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"9649"}]},"month":"06","publication_identifier":{"isbn":["978-3-95977-143-6"],"issn":["1868-8969"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"conference":{"end_date":"2020-06-26","start_date":"2020-06-22","location":"Zürich, Switzerland","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.4230/LIPIcs.SoCG.2020.20"},{"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation on P is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge, removes a non-extreme point of degree 3, or adds a point in P ⧵ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The goal of this paper is to investigate the structure of this graph, with emphasis on its connectivity. For sets P of n points in general position, we show that the bistellar flip graph is (n-3)-connected, thereby answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov, Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results (see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph can be covered by graphs of polytopes of dimension n-3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations are regular iff the trivial subdivision has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction)."}],"intvolume":" 164","title":"Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)","ddc":["510"],"status":"public","_id":"7990","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":793187,"creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcsSoCG_Wagner.pdf","checksum":"3f6925be5f3dcdb3b14cab92f410edf7","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-23T06:37:27Z","relation":"main_file","file_id":"8003"}],"scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"short":"U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.","chicago":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.67.","ama":"Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.67","ieee":"U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips),” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","apa":"Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67","ista":"Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16."},"publication":"36th International Symposium on Computational Geometry","date_published":"2020-06-01T00:00:00Z","article_number":"67:1 - 67:16","file_date_updated":"2020-07-14T12:48:06Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2020","volume":164,"date_updated":"2023-08-04T08:51:07Z","date_created":"2020-06-22T09:14:19Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"12129"}]},"author":[{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"month":"06","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2003.13557"]},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2020.67","conference":{"end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"}},{"article_processing_charge":"No","day":"01","scopus_import":1,"date_published":"2020-01-01T00:00:00Z","page":"2823-2841","citation":{"chicago":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:2823–41. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.172.","short":"U. Wagner, E. Welzl, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 2823–2841.","mla":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.","ieee":"U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part I: Edge flips),” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 2823–2841.","apa":"Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.172","ista":"Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 2823–2841.","ama":"Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:2823-2841. doi:10.1137/1.9781611975994.172"},"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","abstract":[{"text":"In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—provided the resulting quadrilateral is convex—adding the other diagonal is called an edge flip. The (edge) flip graph has all triangulations as vertices, and a pair of triangulations is adjacent if they can be obtained from each other by an edge flip. The goal of this paper is to contribute to a better understanding of the flip graph, with an emphasis on its connectivity.\r\nFor sets in general position, it is known that every triangulation allows at least edge flips (a tight bound) which gives the minimum degree of any flip graph for n points. We show that for every point set P in general position, the flip graph is at least -vertex connected. Somewhat more strongly, we show that the vertex connectivity equals the minimum degree occurring in the flip graph, i.e. the minimum number of flippable edges in any triangulation of P, provided P is large enough. Finally, we exhibit some of the geometry of the flip graph by showing that the flip graph can be covered by 1-skeletons of polytopes of dimension (products of associahedra).\r\nA corresponding result ((n – 3)-vertex connectedness) can be shown for the bistellar flip graph of partial triangulations, i.e. the set of all triangulations of subsets of P which contain all extreme points of P. This will be treated separately in a second part.","lang":"eng"}],"type":"conference","oa_version":"Submitted Version","title":"Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7807","publication_identifier":{"isbn":["9781611975994"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1137/1.9781611975994.172","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Salt Lake City, UT, United States","start_date":"2020-01-05","end_date":"2020-01-08"},"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1137/1.9781611975994.172","open_access":"1"}],"external_id":{"arxiv":["2003.13557"]},"oa":1,"volume":"2020-January","date_updated":"2023-08-04T08:51:07Z","date_created":"2020-05-10T22:00:48Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"12129"}]},"author":[{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"publisher":"SIAM","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2020"}]