[{"_id":"9249","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","ddc":["510"],"date_updated":"2021-03-22T09:01:50Z","file_date_updated":"2021-03-22T08:56:37Z","department":[{"_id":"HeEd"}],"oa_version":"Published Version","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"}],"intvolume":" 4","month":"11","language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":3668725,"date_updated":"2021-03-22T08:56:37Z","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","date_created":"2021-03-22T08:56:37Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"9272","checksum":"4a1043fa0548a725d464017fe2483ce0"}],"publication_status":"published","publication_identifier":{"issn":["2353-3390"]},"ec_funded":1,"issue":"1","volume":4,"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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","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","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.","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.","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.","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."},"title":"Digital objects in rhombic dodecahedron grid","article_processing_charge":"No","author":[{"last_name":"Biswas","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin"},{"first_name":"Rita","full_name":"Zrour, Rita","last_name":"Zrour"},{"last_name":"Andres","full_name":"Andres, Eric","first_name":"Eric"}],"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. ","oa":1,"quality_controlled":"1","publisher":"De Gruyter","publication":"Mathematical Morphology - Theory and Applications","day":"17","year":"2020","has_accepted_license":"1","date_created":"2021-03-16T08:55:19Z","date_published":"2020-11-17T00:00:00Z","doi":"10.1515/mathm-2020-0106","page":"143-158"},{"_id":"9299","series_title":"LNCS","conference":{"start_date":"2020-09-16","location":"Virtual, Online","end_date":"2020-09-18","name":"GD: Graph Drawing and Network Visualization"},"type":"conference","status":"public","date_updated":"2021-04-06T11:32:32Z","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","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⟶∞ ."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"scopus_import":"1","intvolume":" 12590","month":"09","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030687656"]},"language":[{"iso":"eng"}],"volume":12590,"project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"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.","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.","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.","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","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.","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","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2006.14908"]},"article_processing_charge":"No","author":[{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach","full_name":"Pach, János"},{"last_name":"Tardos","full_name":"Tardos, Gábor","first_name":"Gábor"},{"last_name":"Tóth","full_name":"Tóth, Géza","first_name":"Géza"}],"title":"Crossings between non-homotopic edges","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.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","year":"2020","publication":"28th International Symposium on Graph Drawing and Network Visualization","day":"20","page":"359-371","date_created":"2021-03-28T22:01:44Z","doi":"10.1007/978-3-030-68766-3_28","date_published":"2020-09-20T00:00:00Z"},{"date_published":"2020-12-06T00:00:00Z","date_created":"2021-07-04T22:01:26Z","page":"18098-18109","day":"06","publication":"Advances in Neural Information Processing Systems","year":"2020","publisher":"Curran Associates","quality_controlled":"1","oa":1,"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.","title":"WoodFisher: Efficient second-order approximation for neural network compression","author":[{"last_name":"Singh","full_name":"Singh, Sidak Pal","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","first_name":"Sidak Pal"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"article_processing_charge":"No","external_id":{"arxiv":["2004.14340"]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"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.","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.","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.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109.","chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.","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."},"project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"volume":33,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"publication_status":"published","month":"12","intvolume":" 33","scopus_import":"1","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html","open_access":"1"}],"oa_version":"Published Version","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"}],"department":[{"_id":"DaAl"},{"_id":"ToHe"}],"date_updated":"2023-02-23T14:03:06Z","status":"public","type":"conference","conference":{"end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06","name":"NeurIPS: Conference on Neural Information Processing Systems"},"_id":"9632"},{"citation":{"ista":"Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.","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.","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","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","short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","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.","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."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"Yes","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"title":"Topological data analysis in information space","project":[{"name":"Discretization in Geometry and Dynamics","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"}],"year":"2020","has_accepted_license":"1","publication":"Journal of Computational Geometry","day":"14","page":"162-182","date_created":"2021-07-04T22:01:26Z","date_published":"2020-12-14T00:00:00Z","doi":"10.20382/jocg.v11i2a7","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).","oa":1,"publisher":"Carleton University","quality_controlled":"1","date_updated":"2021-08-11T12:26:34Z","ddc":["510","000"],"department":[{"_id":"HeEd"}],"file_date_updated":"2021-08-11T11:55:11Z","_id":"9630","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"eissn":["1920180X"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","file_id":"9882","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","date_created":"2021-08-11T11:55:11Z","file_size":1449234,"date_updated":"2021-08-11T11:55:11Z","creator":"asandaue"}],"license":"https://creativecommons.org/licenses/by/3.0/","issue":"2","volume":11,"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."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 11","month":"12"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been considerable effort invested into developing efficient parallel variants of classic machine learning algorithms. However, despite the wealth of knowledge on parallelization, some classic machine learning algorithms often prove hard to parallelize efficiently while maintaining convergence. In this paper, we focus on efficient parallel algorithms for the key machine learning task of inference on graphical models, in particular on the fundamental belief propagation algorithm. We address the challenge of efficiently parallelizing this classic paradigm by showing how to leverage scalable relaxed schedulers in this context. We present an extensive empirical study, showing that our approach outperforms previous parallel belief propagation implementations both in terms of scalability and in terms of wall-clock convergence time, on a range of practical applications."}],"intvolume":" 33","month":"12","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781713829546"],"issn":["10495258"]},"ec_funded":1,"volume":33,"_id":"9631","status":"public","conference":{"location":"Vancouver, Canada","end_date":"2020-12-12","start_date":"2020-12-06","name":"NeurIPS: Conference on Neural Information Processing Systems"},"type":"conference","date_updated":"2023-02-23T14:03:03Z","department":[{"_id":"DaAl"}],"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).","oa":1,"publisher":"Curran Associates","quality_controlled":"1","publication":"Advances in Neural Information Processing Systems","day":"06","year":"2020","date_created":"2021-07-04T22:01:26Z","date_published":"2020-12-06T00:00:00Z","page":"22361-22372","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"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.","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.","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.","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.","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.","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."},"title":"Scalable belief propagation via relaxed scheduling","article_processing_charge":"No","external_id":{"arxiv":["2002.11505"]},"author":[{"first_name":"Vitaly","last_name":"Aksenov","full_name":"Aksenov, Vitaly"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","full_name":"Korhonen, Janne"}]},{"external_id":{"arxiv":["2007.02894"]},"article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub","last_name":"Svoboda"}],"title":"Simplified game of life: Algorithms and complexity","citation":{"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.","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.","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.","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.","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","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"22:1-22:13","date_created":"2020-09-20T22:01:36Z","date_published":"2020-08-18T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2020.22","year":"2020","has_accepted_license":"1","publication":"45th International Symposium on Mathematical Foundations of Computer Science","day":"18","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","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.","file_date_updated":"2020-09-21T13:57:34Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:19:55Z","ddc":["000"],"conference":{"name":"MFCS: Symposium on Mathematical Foundations of Computer Science","end_date":"2020-08-28","location":"Prague, Czech Republic","start_date":"2020-08-24"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public","_id":"8533","ec_funded":1,"volume":170,"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_LIPIcs_Chatterjee.pdf","date_created":"2020-09-21T13:57:34Z","file_size":491374,"date_updated":"2020-09-21T13:57:34Z","creator":"dernst","success":1,"checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","file_id":"8550","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 170","month":"08","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"}],"oa_version":"Published Version"},{"date_published":"2020-08-18T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2020.51","date_created":"2020-09-20T22:01:36Z","has_accepted_license":"1","year":"2020","day":"18","publication":"45th International Symposium on Mathematical Foundations of Computer Science","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"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.","author":[{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"full_name":"Mazzocchi, Nicolas","last_name":"Mazzocchi","first_name":"Nicolas"}],"article_processing_charge":"No","title":"Unary prime languages","citation":{"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.","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.","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.","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","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"article_number":"51:1-51:12","volume":170,"ec_funded":1,"publication_identifier":{"isbn":["9783959771597"],"issn":["18688969"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"2dc9e2fad6becd4563aef3e27a473f70","file_id":"8552","file_size":597977,"date_updated":"2020-09-21T14:17:08Z","creator":"dernst","file_name":"2020_LIPIcsMFCS_Jecker.pdf","date_created":"2020-09-21T14:17:08Z"}],"language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"scopus_import":"1","month":"08","intvolume":" 170","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-09-21T14:17:08Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:19:56Z","ddc":["000"],"type":"conference","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"conference":{"start_date":"2020-08-24","location":"Prague, Czech Republic","end_date":"2020-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"status":"public","_id":"8534"},{"oa":1,"publisher":"Springer Nature","quality_controlled":"1","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.","date_created":"2020-09-20T22:01:38Z","date_published":"2020-09-09T00:00:00Z","doi":"10.1007/s40879-020-00426-9","publication":"European Journal of Mathematics","day":"09","year":"2020","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"title":"Billiards in ellipses revisited","external_id":{"arxiv":["2001.02934"]},"article_processing_charge":"No","author":[{"last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schwartz, Richard","last_name":"Schwartz","first_name":"Richard"},{"full_name":"Tabachnikov, Serge","last_name":"Tabachnikov","first_name":"Serge"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” European Journal of Mathematics. Springer Nature, 2020.","short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020).","apa":"Akopyan, A., Schwartz, R., & Tabachnikov, S. (2020). Billiards in ellipses revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European Journal of Mathematics. 2020. doi: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.","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics.","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."},"month":"09","main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.","lang":"eng"}],"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"status":"public","article_type":"original","type":"journal_article","_id":"8538","department":[{"_id":"HeEd"}],"date_updated":"2021-12-02T15:10:17Z"},{"date_created":"2020-10-06T08:58:59Z","ec_funded":1,"doi":"10.1101/2020.09.15.262782","date_published":"2020-09-15T00:00:00Z","year":"2020","publication_status":"submitted","publication":"bioRxiv","language":[{"iso":"eng"}],"day":"15","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.09.15.262782"}],"oa":1,"publisher":"Cold Spring Harbor Laboratory","month":"09","abstract":[{"lang":"eng","text":"The brain vasculature supplies neurons with glucose and oxygen, but little is known about how vascular plasticity contributes to brain function. Using longitudinal in vivo imaging, we reported that a substantial proportion of blood vessels in the adult brain sporadically occluded and regressed. Their regression proceeded through sequential stages of blood-flow occlusion, endothelial cell collapse, relocation or loss of pericytes, and retraction of glial endfeet. Regressing vessels were found to be widespread in mouse, monkey and human brains. Both brief occlusions of the middle cerebral artery and lipopolysaccharide-mediated inflammation induced an increase of vessel regression. Blockage of leukocyte adhesion to endothelial cells alleviated LPS-induced vessel regression. We further revealed that blood vessel regression caused a reduction of neuronal activity due to a dysfunction in mitochondrial metabolism and glutamate production. Our results elucidate the mechanism of vessel regression and its role in neuronal function in the adult brain."}],"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.","oa_version":"Preprint","article_processing_charge":"No","author":[{"full_name":"Gao, Xiaofei","last_name":"Gao","first_name":"Xiaofei"},{"full_name":"Li, Jun-Liszt","last_name":"Li","first_name":"Jun-Liszt"},{"full_name":"Chen, Xingjun","last_name":"Chen","first_name":"Xingjun"},{"last_name":"Ci","full_name":"Ci, Bo","first_name":"Bo"},{"full_name":"Chen, Fei","last_name":"Chen","first_name":"Fei"},{"first_name":"Nannan","full_name":"Lu, Nannan","last_name":"Lu"},{"last_name":"Shen","full_name":"Shen, Bo","first_name":"Bo"},{"last_name":"Zheng","full_name":"Zheng, Lijun","first_name":"Lijun"},{"last_name":"Jia","full_name":"Jia, Jie-Min","first_name":"Jie-Min"},{"last_name":"Yi","full_name":"Yi, Yating","first_name":"Yating"},{"first_name":"Shiwen","last_name":"Zhang","full_name":"Zhang, Shiwen"},{"first_name":"Ying-Chao","last_name":"Shi","full_name":"Shi, Ying-Chao"},{"full_name":"Shi, Kaibin","last_name":"Shi","first_name":"Kaibin"},{"first_name":"Nicholas E","last_name":"Propson","full_name":"Propson, Nicholas E"},{"first_name":"Yubin","last_name":"Huang","full_name":"Huang, Yubin"},{"last_name":"Poinsatte","full_name":"Poinsatte, Katherine","first_name":"Katherine"},{"first_name":"Zhaohuan","full_name":"Zhang, Zhaohuan","last_name":"Zhang"},{"full_name":"Yue, Yuanlei","last_name":"Yue","first_name":"Yuanlei"},{"first_name":"Dale B","full_name":"Bosco, Dale B","last_name":"Bosco"},{"first_name":"Ying-mei","last_name":"Lu","full_name":"Lu, Ying-mei"},{"first_name":"Shi-bing","last_name":"Yang","full_name":"Yang, Shi-bing"},{"first_name":"Ralf H.","full_name":"Adams, Ralf H.","last_name":"Adams"},{"first_name":"Volkhard","full_name":"Lindner, Volkhard","last_name":"Lindner"},{"full_name":"Huang, Fen","last_name":"Huang","first_name":"Fen"},{"first_name":"Long-Jun","last_name":"Wu","full_name":"Wu, Long-Jun"},{"first_name":"Hui","last_name":"Zheng","full_name":"Zheng, Hui"},{"first_name":"Feng","last_name":"Han","full_name":"Han, Feng"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"},{"last_name":"Stowe","full_name":"Stowe, Ann M.","first_name":"Ann M."},{"full_name":"Peng, Bo","last_name":"Peng","first_name":"Bo"},{"full_name":"Margeta, Marta","last_name":"Margeta","first_name":"Marta"},{"full_name":"Wang, Xiaoqun","last_name":"Wang","first_name":"Xiaoqun"},{"first_name":"Qiang","last_name":"Liu","full_name":"Liu, Qiang"},{"first_name":"Jakob","full_name":"Körbelin, Jakob","last_name":"Körbelin"},{"full_name":"Trepel, Martin","last_name":"Trepel","first_name":"Martin"},{"last_name":"Lu","full_name":"Lu, Hui","first_name":"Hui"},{"first_name":"Bo O.","full_name":"Zhou, Bo O.","last_name":"Zhou"},{"first_name":"Hu","last_name":"Zhao","full_name":"Zhao, Hu"},{"first_name":"Wenzhi","full_name":"Su, Wenzhi","last_name":"Su"},{"full_name":"Bachoo, Robert M.","last_name":"Bachoo","first_name":"Robert M."},{"full_name":"Ge, Woo-ping","last_name":"Ge","first_name":"Woo-ping"}],"department":[{"_id":"SiHi"}],"title":"Reduction of neuronal activity mediated by blood-vessel regression in the brain","date_updated":"2021-01-12T08:20:19Z","citation":{"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.","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.).","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","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","project":[{"call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780"}],"status":"public","_id":"8616"},{"month":"10","publisher":"OANA","oa":1,"oa_version":"Published Version","abstract":[{"lang":"eng","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":"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."}],"doi":"10.5281/ZENODO.4109242","date_published":"2020-10-21T00:00:00Z","date_created":"2020-10-23T09:08:28Z","page":"36","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8696","checksum":"8eba912bb4b20b4f82f8010f2110461a","file_size":2298363,"date_updated":"2020-10-23T09:29:45Z","creator":"dernst","file_name":"2020_OANA_Mayer.pdf","date_created":"2020-10-23T09:29:45Z"}],"day":"21","language":[{"iso":"ger"}],"has_accepted_license":"1","publication_status":"published","year":"2020","status":"public","type":"working_paper","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"8695","file_date_updated":"2020-10-23T09:29:45Z","title":"Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria","department":[{"_id":"E-Lib"}],"author":[{"last_name":"Mayer","full_name":"Mayer, Katja","first_name":"Katja"},{"last_name":"Rieck","full_name":"Rieck, Katharina","first_name":"Katharina"},{"full_name":"Reichmann, Stefan","last_name":"Reichmann","first_name":"Stefan"},{"full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","last_name":"Danowski","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anton","full_name":"Graschopf, Anton","last_name":"Graschopf"},{"first_name":"Thomas","full_name":"König, Thomas","last_name":"König"},{"last_name":"Kraker","full_name":"Kraker, Peter","first_name":"Peter"},{"full_name":"Lehner, Patrick","last_name":"Lehner","first_name":"Patrick"},{"full_name":"Reckling, Falk","last_name":"Reckling","first_name":"Falk"},{"last_name":"Ross-Hellauer","full_name":"Ross-Hellauer, Tony","first_name":"Tony"},{"first_name":"Daniel","last_name":"Spichtinger","full_name":"Spichtinger, Daniel"},{"first_name":"Michalis","last_name":"Tzatzanis","full_name":"Tzatzanis, Michalis"},{"first_name":"Stefanie","full_name":"Schürz, Stefanie","last_name":"Schürz"}],"article_processing_charge":"No","ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","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.","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.","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.","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","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"},"date_updated":"2020-10-23T09:34:40Z"}]