[{"article_processing_charge":"No","has_accepted_license":"1","day":"17","date_published":"2020-11-17T00:00:00Z","citation":{"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.","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.","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","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.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158.","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."},"publication":"Mathematical Morphology - Theory and Applications","page":"143-158","article_type":"original","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"}],"type":"journal_article","file":[{"file_id":"9272","relation":"main_file","success":1,"checksum":"4a1043fa0548a725d464017fe2483ce0","date_created":"2021-03-22T08:56:37Z","date_updated":"2021-03-22T08:56:37Z","access_level":"open_access","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","creator":"dernst","content_type":"application/pdf","file_size":3668725}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9249","intvolume":" 4","status":"public","title":"Digital objects in rhombic dodecahedron grid","ddc":["510"],"publication_identifier":{"issn":["2353-3390"]},"month":"11","doi":"10.1515/mathm-2020-0106","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"},"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"quality_controlled":"1","ec_funded":1,"file_date_updated":"2021-03-22T08:56:37Z","author":[{"full_name":"Biswas, Ranita","last_name":"Biswas","first_name":"Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"full_name":"Zrour, Rita","first_name":"Rita","last_name":"Zrour"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"}],"volume":4,"date_created":"2021-03-16T08:55:19Z","date_updated":"2021-03-22T09:01:50Z","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","publisher":"De Gruyter","department":[{"_id":"HeEd"}],"publication_status":"published"},{"publication_identifier":{"isbn":["9783030687656"],"eissn":["1611-3349"],"issn":["0302-9743"]},"month":"09","main_file_link":[{"url":"https://arxiv.org/abs/2006.14908","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2006.14908"]},"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}],"quality_controlled":"1","doi":"10.1007/978-3-030-68766-3_28","conference":{"name":"GD: Graph Drawing and Network Visualization","start_date":"2020-09-16","location":"Virtual, Online","end_date":"2020-09-18"},"language":[{"iso":"eng"}],"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.","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"publication_status":"published","author":[{"full_name":"Pach, János","last_name":"Pach","first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4"},{"full_name":"Tardos, Gábor","last_name":"Tardos","first_name":"Gábor"},{"full_name":"Tóth, Géza","last_name":"Tóth","first_name":"Géza"}],"volume":12590,"date_created":"2021-03-28T22:01:44Z","date_updated":"2021-04-06T11:32:32Z","scopus_import":"1","series_title":"LNCS","article_processing_charge":"No","day":"20","citation":{"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.","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.","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.","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"},"publication":"28th International Symposium on Graph Drawing and Network Visualization","page":"359-371","date_published":"2020-09-20T00: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"}],"_id":"9299","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12590","title":"Crossings between non-homotopic edges","status":"public","oa_version":"Preprint"},{"date_updated":"2023-02-23T14:03:06Z","date_created":"2021-07-04T22:01:26Z","volume":33,"author":[{"last_name":"Singh","first_name":"Sidak Pal","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","full_name":"Singh, Sidak Pal"},{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"publication_status":"published","department":[{"_id":"DaAl"},{"_id":"ToHe"}],"publisher":"Curran Associates","year":"2020","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.","ec_funded":1,"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":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html","open_access":"1"}],"external_id":{"arxiv":["2004.14340"]},"oa":1,"month":"12","publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"oa_version":"Published Version","title":"WoodFisher: Efficient second-order approximation for neural network compression","status":"public","intvolume":" 33","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9632","abstract":[{"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.","lang":"eng"}],"type":"conference","date_published":"2020-12-06T00:00:00Z","page":"18098-18109","publication":"Advances in Neural Information Processing Systems","citation":{"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.","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.","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.","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.","short":"S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 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."},"day":"06","article_processing_charge":"No","scopus_import":"1"},{"license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2021-08-11T11:55:11Z","date_created":"2021-07-04T22:01:26Z","date_updated":"2021-08-11T12:26:34Z","volume":11,"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","full_name":"Virk, Ziga"},{"last_name":"Wagner","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"publication_status":"published","publisher":"Carleton University","department":[{"_id":"HeEd"}],"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).","year":"2020","month":"12","publication_identifier":{"eissn":["1920180X"]},"language":[{"iso":"eng"}],"doi":"10.20382/jocg.v11i2a7","quality_controlled":"1","project":[{"name":"Discretization in Geometry and Dynamics","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"}],"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,"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."}],"issue":"2","type":"journal_article","oa_version":"Published Version","file":[{"checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","success":1,"date_updated":"2021-08-11T11:55:11Z","date_created":"2021-08-11T11:55:11Z","relation":"main_file","file_id":"9882","content_type":"application/pdf","file_size":1449234,"creator":"asandaue","access_level":"open_access","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf"}],"title":"Topological data analysis in information space","ddc":["510","000"],"status":"public","intvolume":" 11","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9630","day":"14","article_processing_charge":"Yes","has_accepted_license":"1","scopus_import":"1","date_published":"2020-12-14T00:00:00Z","article_type":"original","page":"162-182","publication":"Journal of Computational Geometry","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","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","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.","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."}},{"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":{"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.","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.","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.","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.","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.","short":"V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.","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."},"abstract":[{"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.","lang":"eng"}],"type":"conference","oa_version":"Published Version","status":"public","title":"Scalable belief propagation via relaxed scheduling","intvolume":" 33","_id":"9631","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"12","publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"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"},"quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"oa":1,"external_id":{"arxiv":["2002.11505"]},"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html"}],"ec_funded":1,"date_created":"2021-07-04T22:01:26Z","date_updated":"2023-02-23T14:03:03Z","volume":33,"author":[{"full_name":"Aksenov, Vitaly","first_name":"Vitaly","last_name":"Aksenov"},{"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)."},{"month":"08","publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"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.02894"]},"quality_controlled":"1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"MFCS: Symposium on Mathematical Foundations of Computer Science","end_date":"2020-08-28","start_date":"2020-08-24","location":"Prague, Czech Republic"},"doi":"10.4230/LIPIcs.MFCS.2020.22","language":[{"iso":"eng"}],"article_number":"22:1-22:13","file_date_updated":"2020-09-21T13:57:34Z","ec_funded":1,"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_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","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"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","last_name":"Svoboda","full_name":"Svoboda, Jakub"}],"date_created":"2020-09-20T22:01:36Z","date_updated":"2021-01-12T08:19:55Z","volume":170,"scopus_import":"1","day":"18","has_accepted_license":"1","article_processing_charge":"No","publication":"45th International Symposium on Mathematical Foundations of Computer Science","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"},"date_published":"2020-08-18T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"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.","lang":"eng"}],"_id":"8533","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Simplified game of life: Algorithms and complexity","ddc":["000"],"intvolume":" 170","file":[{"relation":"main_file","file_id":"8550","date_created":"2020-09-21T13:57:34Z","date_updated":"2020-09-21T13:57:34Z","checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","success":1,"file_name":"2020_LIPIcs_Chatterjee.pdf","access_level":"open_access","content_type":"application/pdf","file_size":491374,"creator":"dernst"}],"oa_version":"Published Version"},{"publication_identifier":{"isbn":["9783959771597"],"issn":["18688969"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2020.51","conference":{"name":"MFCS: Symposium on Mathematical Foundations of Computer Science","location":"Prague, Czech Republic","start_date":"2020-08-24","end_date":"2020-08-28"},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"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"},"ec_funded":1,"file_date_updated":"2020-09-21T14:17:08Z","article_number":"51:1-51:12","volume":170,"date_created":"2020-09-20T22:01:36Z","date_updated":"2021-01-12T08:19:56Z","author":[{"full_name":"Jecker, Ismael R","first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"},{"full_name":"Mazzocchi, Nicolas","first_name":"Nicolas","last_name":"Mazzocchi"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","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.","year":"2020","has_accepted_license":"1","article_processing_charge":"No","day":"18","scopus_import":"1","date_published":"2020-08-18T00:00:00Z","citation":{"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.","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.","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","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.","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.","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"},"publication":"45th International Symposium on Mathematical Foundations of Computer Science","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","oa_version":"Published Version","file":[{"date_updated":"2020-09-21T14:17:08Z","date_created":"2020-09-21T14:17:08Z","success":1,"checksum":"2dc9e2fad6becd4563aef3e27a473f70","file_id":"8552","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":597977,"file_name":"2020_LIPIcsMFCS_Jecker.pdf","access_level":"open_access"}],"intvolume":" 170","title":"Unary prime languages","ddc":["000"],"status":"public","_id":"8534","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa_version":"Preprint","title":"Billiards in ellipses revisited","status":"public","_id":"8538","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"lang":"eng","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."}],"type":"journal_article","date_published":"2020-09-09T00:00:00Z","article_type":"original","publication":"European Journal of Mathematics","citation":{"ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics.","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","ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” European Journal of Mathematics. Springer Nature, 2020.","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European Journal of Mathematics. 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.","mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal of Mathematics, Springer Nature, 2020, doi:10.1007/s40879-020-00426-9.","short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020)."},"day":"09","article_processing_charge":"No","scopus_import":"1","date_updated":"2021-12-02T15:10:17Z","date_created":"2020-09-20T22:01:38Z","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy"},{"full_name":"Schwartz, Richard","last_name":"Schwartz","first_name":"Richard"},{"first_name":"Serge","last_name":"Tabachnikov","full_name":"Tabachnikov, Serge"}],"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"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","ec_funded":1,"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"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2001.02934"}],"external_id":{"arxiv":["2001.02934"]},"month":"09","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]}},{"status":"public","publication_status":"submitted","title":"Reduction of neuronal activity mediated by blood-vessel regression in the brain","department":[{"_id":"SiHi"}],"publisher":"Cold Spring Harbor Laboratory","year":"2020","_id":"8616","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","date_updated":"2021-01-12T08:20:19Z","date_created":"2020-10-06T08:58:59Z","oa_version":"Preprint","author":[{"first_name":"Xiaofei","last_name":"Gao","full_name":"Gao, Xiaofei"},{"last_name":"Li","first_name":"Jun-Liszt","full_name":"Li, 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","first_name":"Fei","last_name":"Chen"},{"full_name":"Lu, Nannan","last_name":"Lu","first_name":"Nannan"},{"last_name":"Shen","first_name":"Bo","full_name":"Shen, Bo"},{"last_name":"Zheng","first_name":"Lijun","full_name":"Zheng, Lijun"},{"full_name":"Jia, Jie-Min","last_name":"Jia","first_name":"Jie-Min"},{"full_name":"Yi, Yating","first_name":"Yating","last_name":"Yi"},{"full_name":"Zhang, Shiwen","first_name":"Shiwen","last_name":"Zhang"},{"full_name":"Shi, Ying-Chao","last_name":"Shi","first_name":"Ying-Chao"},{"last_name":"Shi","first_name":"Kaibin","full_name":"Shi, Kaibin"},{"full_name":"Propson, Nicholas E","first_name":"Nicholas E","last_name":"Propson"},{"full_name":"Huang, Yubin","last_name":"Huang","first_name":"Yubin"},{"full_name":"Poinsatte, Katherine","first_name":"Katherine","last_name":"Poinsatte"},{"full_name":"Zhang, Zhaohuan","last_name":"Zhang","first_name":"Zhaohuan"},{"full_name":"Yue, Yuanlei","last_name":"Yue","first_name":"Yuanlei"},{"last_name":"Bosco","first_name":"Dale B","full_name":"Bosco, 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"},{"last_name":"Lindner","first_name":"Volkhard","full_name":"Lindner, Volkhard"},{"full_name":"Huang, Fen","first_name":"Fen","last_name":"Huang"},{"full_name":"Wu, Long-Jun","first_name":"Long-Jun","last_name":"Wu"},{"full_name":"Zheng, Hui","first_name":"Hui","last_name":"Zheng"},{"first_name":"Feng","last_name":"Han","full_name":"Han, Feng"},{"first_name":"Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"},{"first_name":"Ann M.","last_name":"Stowe","full_name":"Stowe, Ann M."},{"first_name":"Bo","last_name":"Peng","full_name":"Peng, Bo"},{"last_name":"Margeta","first_name":"Marta","full_name":"Margeta, Marta"},{"full_name":"Wang, Xiaoqun","last_name":"Wang","first_name":"Xiaoqun"},{"full_name":"Liu, Qiang","last_name":"Liu","first_name":"Qiang"},{"last_name":"Körbelin","first_name":"Jakob","full_name":"Körbelin, Jakob"},{"full_name":"Trepel, Martin","first_name":"Martin","last_name":"Trepel"},{"first_name":"Hui","last_name":"Lu","full_name":"Lu, Hui"},{"first_name":"Bo O.","last_name":"Zhou","full_name":"Zhou, Bo O."},{"last_name":"Zhao","first_name":"Hu","full_name":"Zhao, Hu"},{"full_name":"Su, Wenzhi","first_name":"Wenzhi","last_name":"Su"},{"last_name":"Bachoo","first_name":"Robert M.","full_name":"Bachoo, Robert M."},{"full_name":"Ge, Woo-ping","last_name":"Ge","first_name":"Woo-ping"}],"type":"preprint","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"project":[{"call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780"}],"publication":"bioRxiv","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.09.15.262782"}],"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.","ieee":"X. Gao et al., “Reduction of neuronal activity mediated by blood-vessel regression in the brain,” bioRxiv. Cold Spring Harbor Laboratory.","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","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"},"oa":1,"language":[{"iso":"eng"}],"date_published":"2020-09-15T00:00:00Z","doi":"10.1101/2020.09.15.262782","month":"09","day":"15","article_processing_charge":"No"},{"month":"10","day":"21","article_processing_charge":"No","has_accepted_license":"1","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"},"citation":{"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.","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.","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.","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","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.","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"},"oa":1,"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"},{"lang":"ger","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."}],"file_date_updated":"2020-10-23T09:29:45Z","type":"working_paper","date_updated":"2020-10-23T09:34:40Z","date_created":"2020-10-23T09:08:28Z","file":[{"date_created":"2020-10-23T09:29:45Z","date_updated":"2020-10-23T09:29:45Z","success":1,"checksum":"8eba912bb4b20b4f82f8010f2110461a","file_id":"8696","relation":"main_file","creator":"dernst","file_size":2298363,"content_type":"application/pdf","file_name":"2020_OANA_Mayer.pdf","access_level":"open_access"}],"oa_version":"Published Version","author":[{"last_name":"Mayer","first_name":"Katja","full_name":"Mayer, Katja"},{"first_name":"Katharina","last_name":"Rieck","full_name":"Rieck, Katharina"},{"full_name":"Reichmann, Stefan","last_name":"Reichmann","first_name":"Stefan"},{"first_name":"Patrick","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick"},{"full_name":"Graschopf, Anton","last_name":"Graschopf","first_name":"Anton"},{"first_name":"Thomas","last_name":"König","full_name":"König, Thomas"},{"first_name":"Peter","last_name":"Kraker","full_name":"Kraker, Peter"},{"full_name":"Lehner, Patrick","first_name":"Patrick","last_name":"Lehner"},{"last_name":"Reckling","first_name":"Falk","full_name":"Reckling, Falk"},{"first_name":"Tony","last_name":"Ross-Hellauer","full_name":"Ross-Hellauer, Tony"},{"full_name":"Spichtinger, Daniel","first_name":"Daniel","last_name":"Spichtinger"},{"last_name":"Tzatzanis","first_name":"Michalis","full_name":"Tzatzanis, Michalis"},{"first_name":"Stefanie","last_name":"Schürz","full_name":"Schürz, Stefanie"}],"ddc":["020"],"title":"Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria","status":"public","publication_status":"published","publisher":"OANA","department":[{"_id":"E-Lib"}],"_id":"8695","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.31263/voebm.v73i2.3941","language":[{"iso":"ger"}],"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","publication_identifier":{"eissn":["10222588"]},"month":"07","author":[{"full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ferus, Andreas","first_name":"Andreas","last_name":"Ferus"},{"first_name":"Anna-Laetitia","last_name":"Hikl","full_name":"Hikl, Anna-Laetitia"},{"full_name":"McNeill, Gerda","first_name":"Gerda","last_name":"McNeill"},{"full_name":"Miniberger, Clemens","first_name":"Clemens","last_name":"Miniberger"},{"full_name":"Reding, Steve","first_name":"Steve","last_name":"Reding"},{"first_name":"Tobias","last_name":"Zarka","full_name":"Zarka, Tobias"},{"first_name":"Michael","last_name":"Zojer","full_name":"Zojer, Michael"}],"volume":73,"date_created":"2020-10-25T23:01:19Z","date_updated":"2021-01-12T08:20:40Z","year":"2020","publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","department":[{"_id":"E-Lib"}],"publication_status":"published","file_date_updated":"2020-10-27T16:27:25Z","date_published":"2020-07-14T00:00:00Z","citation":{"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","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.","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.","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","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.","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.","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."},"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","page":"278-284","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"14","scopus_import":"1","file":[{"date_updated":"2020-10-27T16:27:25Z","date_created":"2020-10-27T16:27:25Z","success":1,"checksum":"37443c34d91d5bdbeb38c78b14792537","file_id":"8714","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":960317,"file_name":"2020_VOEB_Danowski.pdf","access_level":"open_access"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8706","intvolume":" 73","title":"„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B","ddc":["020"],"status":"public","issue":"2","abstract":[{"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":"eng"},{"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."}],"type":"journal_article"},{"doi":"10.1016/j.xpro.2020.100215","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"language":[{"iso":"eng"}],"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,"external_id":{"pmid":["33377108"]},"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Role of Eed in neural stem cell lineage progression","_id":"268F8446-B435-11E9-9278-68D0E5697425","grant_number":"T0101031"},{"_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E","grant_number":"F07805","name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression"},{"name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain","grant_number":"LS13-002","_id":"25D92700-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7","grant_number":"618444","_id":"25D61E48-B435-11E9-9278-68D0E5697425"},{"grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"month":"12","publication_identifier":{"issn":["2666-1667"]},"author":[{"id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","last_name":"Laukoter","first_name":"Susanne","full_name":"Laukoter, Susanne"},{"first_name":"Nicole","last_name":"Amberg","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3183-8207","full_name":"Amberg, Nicole"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pauler","full_name":"Pauler, Florian"},{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2020-12-30T10:17:07Z","date_updated":"2021-01-12T08:21:36Z","volume":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.","pmid":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"SiHi"}],"file_date_updated":"2021-01-07T15:57:27Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_number":"100215","date_published":"2020-12-18T00:00:00Z","publication":"STAR Protocols","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.","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.","short":"S. Laukoter, N. Amberg, F. Pauler, S. Hippenmeyer, STAR Protocols 1 (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.","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.","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"},"article_type":"original","day":"18","has_accepted_license":"1","article_processing_charge":"No","oa_version":"Published Version","file":[{"file_name":"2020_STARProtocols_Laukoter.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":4031449,"file_id":"8996","relation":"main_file","date_updated":"2021-01-07T15:57:27Z","date_created":"2021-01-07T15:57:27Z","success":1,"checksum":"f1e9a433e9cb0f41f7b6df6b76db1f6e"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8978","ddc":["570"],"title":"Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy","status":"public","intvolume":" 1","abstract":[{"lang":"eng","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)."}],"issue":"3","type":"journal_article"},{"day":"14","article_processing_charge":"No","scopus_import":"1","date_published":"2020-12-14T00:00:00Z","page":"1556-1563","publication":"Proceedings of the 59th IEEE Conference on Decision and Control","citation":{"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.","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.","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","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"},"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","oa_version":"Preprint","status":"public","title":"Lagrangian reachtubes: The next generation","intvolume":" 2020","_id":"9103","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"language":[{"iso":"eng"}],"conference":{"location":"Jeju Islang, Korea (South)","start_date":"2020-12-14","end_date":"2020-12-18","name":"CDC: Conference on Decision and Control"},"doi":"10.1109/CDC42340.2020.9304042","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa":1,"external_id":{"arxiv":["2012.07458"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.07458"}],"date_created":"2021-02-07T23:01:14Z","date_updated":"2021-02-09T09:20:58Z","volume":2020,"author":[{"full_name":"Gruenbacher, Sophie","first_name":"Sophie","last_name":"Gruenbacher"},{"last_name":"Cyranka","first_name":"Jacek","full_name":"Cyranka, Jacek"},{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"full_name":"Islam, Md Ariful","last_name":"Islam","first_name":"Md Ariful"},{"last_name":"Smolka","first_name":"Scott A.","full_name":"Smolka, Scott A."},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}],"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"},{"month":"07","quality_controlled":"1","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"main_file_link":[{"url":"https://arxiv.org/abs/2002.07867","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2002.07867"]},"language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12","start_date":"2020-12-06","location":"Vancouver, Canada"},"publication_status":"published","publisher":"Curran Associates","department":[{"_id":"MaMo"}],"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","date_updated":"2022-01-04T09:24:41Z","date_created":"2021-03-03T12:06:02Z","volume":33,"author":[{"last_name":"Nguyen","first_name":"Quynh","full_name":"Nguyen, Quynh"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"}],"day":"07","article_processing_charge":"No","page":"11961–11972","publication":"34th Conference on Neural Information Processing Systems","citation":{"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.","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.","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.","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.","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."},"date_published":"2020-07-07T00:00:00Z","type":"conference","abstract":[{"lang":"eng","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"}],"title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","status":"public","intvolume":" 33","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9221","oa_version":"Preprint"},{"language":[{"iso":"eng"}],"conference":{"end_date":"2020-07-18","location":"Online","start_date":"2020-07-12","name":"ICML: International Conference on Machine Learning"},"quality_controlled":"1","oa":1,"month":"07","publication_identifier":{"issn":["2640-3498"]},"date_updated":"2023-02-23T13:57:24Z","date_created":"2021-05-23T22:01:45Z","volume":119,"author":[{"first_name":"Mark","last_name":"Kurtz","full_name":"Kurtz, Mark"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"full_name":"Gelashvili, Rati","first_name":"Rati","last_name":"Gelashvili"},{"full_name":"Matveev, Alexander","last_name":"Matveev","first_name":"Alexander"},{"last_name":"Carr","first_name":"John","full_name":"Carr, John"},{"last_name":"Goin","first_name":"Michael","full_name":"Goin, Michael"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"first_name":"Sage","last_name":"Moore","full_name":"Moore, Sage"},{"full_name":"Nell, Bill","first_name":"Bill","last_name":"Nell"},{"last_name":"Shavit","first_name":"Nir","full_name":"Shavit, Nir"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"department":[{"_id":"DaAl"}],"year":"2020","file_date_updated":"2021-05-25T09:51:36Z","date_published":"2020-07-12T00:00:00Z","page":"5533-5543","publication":"37th International Conference on Machine Learning, ICML 2020","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.","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.","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.","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.","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.","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."},"day":"12","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"creator":"kschuh","file_size":741899,"content_type":"application/pdf","access_level":"open_access","file_name":"2020_PMLR_Kurtz.pdf","success":1,"checksum":"2aaaa7d7226e49161311d91627cf783b","date_updated":"2021-05-25T09:51:36Z","date_created":"2021-05-25T09:51:36Z","file_id":"9421","relation":"main_file"}],"ddc":["000"],"status":"public","title":"Inducing and exploiting activation sparsity for fast neural network inference","intvolume":" 119","_id":"9415","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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"},{"month":"03","language":[{"iso":"eng"}],"conference":{"end_date":"2020-05-01","start_date":"2020-04-26","location":"Virtual ; Addis Ababa, Ethiopia","name":"ICLR: International Conference on Learning Representations"},"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"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"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","file_date_updated":"2022-01-26T07:35:17Z","date_updated":"2023-04-03T07:33:40Z","date_created":"2022-01-25T15:50:00Z","author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"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","day":"11","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2020-03-11T00:00:00Z","publication":"8th International Conference on Learning Representations","citation":{"ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020.","apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.","mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.","short":"M. Lechner, 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."},"abstract":[{"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.","lang":"eng"}],"type":"conference","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"iclr_2020.pdf","file_size":249431,"content_type":"application/pdf","creator":"mlechner","relation":"main_file","file_id":"10677","checksum":"ea13d42dd4541ddb239b6a75821fd6c9","success":1,"date_updated":"2022-01-26T07:35:17Z","date_created":"2022-01-26T07:35:17Z"}],"ddc":["000"],"title":"Learning representations for binary-classification without backpropagation","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10672"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8188","status":"public","title":"Unsupervised object-centric video generation and decomposition in 3D","intvolume":" 33","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"}],"publication":"34th Conference on Neural Information Processing Systems","citation":{"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.","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."},"page":"3106–3117","date_published":"2020-07-07T00:00:00Z","day":"07","article_processing_charge":"No","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","publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"Curran Associates","author":[{"full_name":"Henderson, Paul M","last_name":"Henderson","first_name":"Paul M","orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"date_created":"2020-07-31T16:59:19Z","date_updated":"2023-04-25T09:49:58Z","volume":33,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.06705"}],"external_id":{"arxiv":["2007.06705"]},"quality_controlled":"1","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12","start_date":"2020-12-06","location":"Vancouver, Canada"},"acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"month":"07","publication_identifier":{"isbn":["9781713829546"]}},{"article_processing_charge":"No","has_accepted_license":"1","day":"19","date_published":"2020-02-19T00:00:00Z","page":"72","citation":{"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","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","ieee":"A. Schlögl, J. Kiss, and S. Elefante, Eds., Austrian High-Performance-Computing meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020.","ista":"Schlögl A, Kiss J, Elefante S eds. 2020. Austrian High-Performance-Computing meeting (AHPC2020), Klosterneuburg, Austria: IST Austria, 72p.","short":"A. Schlögl, J. Kiss, S. Elefante, eds., Austrian High-Performance-Computing Meeting (AHPC2020), IST Austria, Klosterneuburg, Austria, 2020.","mla":"Schlögl, Alois, et al., editors. Austrian High-Performance-Computing Meeting (AHPC2020). 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."},"abstract":[{"text":"This booklet is a collection of abstracts presented at the AHPC conference.","lang":"eng"}],"type":"book_editor","file":[{"file_id":"7504","relation":"main_file","date_created":"2020-02-19T06:53:38Z","date_updated":"2020-07-14T12:47:59Z","checksum":"49798edb9e57bbd6be18362d1d7b18a9","file_name":"BOOKLET_AHPC2020.final.pdf","access_level":"open_access","creator":"schloegl","content_type":"application/pdf","file_size":90899507}],"oa_version":"Published Version","status":"public","title":"Austrian High-Performance-Computing meeting (AHPC2020)","ddc":["000"],"_id":"7474","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["978-3-99078-004-6"]},"month":"02","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:7474","conference":{"name":"AHPC: Austrian High-Performance-Computing Meeting","end_date":"2020-02-21","start_date":"2020-02-19","location":"Klosterneuburg, Austria"},"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,"file_date_updated":"2020-07-14T12:47:59Z","place":"Klosterneuburg, Austria","date_updated":"2023-05-16T07:48:28Z","date_created":"2020-02-11T07:59:04Z","publisher":"IST Austria","editor":[{"orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","first_name":"Alois","full_name":"Schlögl, Alois"},{"last_name":"Kiss","first_name":"Janos","id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87","full_name":"Kiss, Janos"},{"id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano","last_name":"Elefante","full_name":"Elefante, Stefano"}],"department":[{"_id":"ScienComp"}],"publication_status":"published","year":"2020"},{"scopus_import":1,"day":"17","has_accepted_license":"1","article_processing_charge":"No","publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","citation":{"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.","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."},"page":"79-97","date_published":"2020-04-17T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"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.","lang":"eng"}],"_id":"7808","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"How many bits does it take to quantize your neural network?","status":"public","ddc":["000"],"intvolume":" 12079","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_TACAS_Giacobbe.pdf","creator":"dernst","file_size":2744030,"content_type":"application/pdf","file_id":"7893","relation":"main_file","checksum":"f19905a42891fe5ce93d69143fa3f6fb","date_created":"2020-05-26T12:48:15Z","date_updated":"2020-07-14T12:48:03Z"}],"month":"04","publication_identifier":{"isbn":["9783030452360"],"eissn":["16113349"],"issn":["03029743"]},"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","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Dublin, Ireland","start_date":"2020-04-25","end_date":"2020-04-30"},"doi":"10.1007/978-3-030-45237-7_5","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:03Z","year":"2020","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","author":[{"first_name":"Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"11362"}]},"date_updated":"2023-06-23T07:01:11Z","date_created":"2020-05-10T22:00:49Z","volume":12079},{"month":"06","publication_identifier":{"isbn":["978-3-95977-143-6"],"issn":["1868-8969"]},"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","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","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"file_date_updated":"2020-07-14T12:48:06Z","ec_funded":1,"article_number":"20:1-20:18","author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"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"}]},"date_updated":"2023-08-02T06:49:16Z","date_created":"2020-06-09T07:24:11Z","volume":164,"year":"2020","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-06-01T00:00:00Z","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."},"abstract":[{"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. ","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"file_size":1009739,"content_type":"application/pdf","creator":"dernst","file_name":"2020_LIPIcsSoCG_Boissonnat.pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:06Z","date_created":"2020-06-17T10:13:34Z","checksum":"38cbfa4f5d484d267a35d44d210df044","relation":"main_file","file_id":"7969"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7952","title":"The topological correctness of PL-approximations of isomanifolds","ddc":["510"],"status":"public","intvolume":" 164"}]