[{"article_processing_charge":"No","has_accepted_license":"1","abstract":[{"text":"This booklet is a collection of abstracts presented at the AHPC conference.","lang":"eng"}],"page":"72","file":[{"file_id":"7504","content_type":"application/pdf","file_name":"BOOKLET_AHPC2020.final.pdf","date_created":"2020-02-19T06:53:38Z","access_level":"open_access","relation":"main_file","file_size":90899507,"creator":"schloegl","checksum":"49798edb9e57bbd6be18362d1d7b18a9","date_updated":"2020-07-14T12:47:59Z"}],"oa_version":"Published Version","quality_controlled":"1","publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Austrian High-Performance-Computing meeting (AHPC2020)","date_created":"2020-02-11T07:59:04Z","oa":1,"ddc":["000"],"day":"19","date_updated":"2023-05-16T07:48:28Z","year":"2020","place":"Klosterneuburg, Austria","month":"02","date_published":"2020-02-19T00:00:00Z","_id":"7474","department":[{"_id":"ScienComp"}],"conference":{"end_date":"2020-02-21","location":"Klosterneuburg, Austria","start_date":"2020-02-19","name":"AHPC: Austrian High-Performance-Computing Meeting"},"publication_status":"published","status":"public","editor":[{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois"},{"last_name":"Kiss","first_name":"Janos","id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87","full_name":"Kiss, Janos"},{"last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano","full_name":"Elefante, Stefano"}],"type":"book_editor","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)"},"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","ista":"Schlögl A, Kiss J, Elefante S eds. 2020. Austrian High-Performance-Computing meeting (AHPC2020), Klosterneuburg, Austria: IST Austria, 72p.","chicago":"Schlögl, Alois, Janos Kiss, and Stefano Elefante, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:7474.","mla":"Schlögl, Alois, et al., editors. Austrian High-Performance-Computing Meeting (AHPC2020). IST Austria, 2020, doi:10.15479/AT:ISTA:7474.","ieee":"A. Schlögl, J. Kiss, and S. Elefante, Eds., Austrian High-Performance-Computing meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020.","apa":"Schlögl, A., Kiss, J., & Elefante, S. (Eds.). (2020). Austrian High-Performance-Computing meeting (AHPC2020). Presented at the AHPC: Austrian High-Performance-Computing Meeting, Klosterneuburg, Austria: IST Austria. https://doi.org/10.15479/AT:ISTA:7474","short":"A. Schlögl, J. Kiss, S. Elefante, eds., Austrian High-Performance-Computing Meeting (AHPC2020), IST Austria, Klosterneuburg, Austria, 2020."},"file_date_updated":"2020-07-14T12:47:59Z","publication_identifier":{"isbn":["978-3-99078-004-6"]},"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:7474"},{"scopus_import":1,"article_processing_charge":"No","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"has_accepted_license":"1","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"}],"file":[{"file_name":"2020_TACAS_Giacobbe.pdf","date_created":"2020-05-26T12:48:15Z","file_id":"7893","content_type":"application/pdf","date_updated":"2020-07-14T12:48:03Z","checksum":"f19905a42891fe5ce93d69143fa3f6fb","creator":"dernst","file_size":2744030,"access_level":"open_access","relation":"main_file"}],"page":"79-97","oa_version":"Published Version","quality_controlled":"1","title":"How many bits does it take to quantize your neural network?","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","ddc":["000"],"oa":1,"date_created":"2020-05-10T22:00:49Z","date_updated":"2023-06-23T07:01:11Z","year":"2020","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"day":"17","department":[{"_id":"ToHe"}],"_id":"7808","alternative_title":["LNCS"],"date_published":"2020-04-17T00:00:00Z","month":"04","citation":{"short":"M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.","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","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.","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.","chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5.","ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97. doi:10.1007/978-3-030-45237-7_5","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."},"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)"},"publication_status":"published","conference":{"end_date":"2020-04-30","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Dublin, Ireland","start_date":"2020-04-25"},"volume":12079,"type":"conference","status":"public","language":[{"iso":"eng"}],"intvolume":" 12079","publication_identifier":{"issn":["03029743"],"isbn":["9783030452360"],"eissn":["16113349"]},"publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":"10.1007/978-3-030-45237-7_5","file_date_updated":"2020-07-14T12:48:03Z","author":[{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"}]},{"_id":"7952","department":[{"_id":"HeEd"}],"month":"06","date_published":"2020-06-01T00:00:00Z","alternative_title":["LIPIcs"],"article_number":"20:1-20:18","year":"2020","date_updated":"2023-08-02T06:49:16Z","day":"01","related_material":{"record":[{"relation":"later_version","id":"9649","status":"public"}]},"doi":"10.4230/LIPIcs.SoCG.2020.20","publication":"36th International Symposium on Computational Geometry","publication_identifier":{"isbn":["978-3-95977-143-6"],"issn":["1868-8969"]},"language":[{"iso":"eng"}],"intvolume":" 164","author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"file_date_updated":"2020-07-14T12:48:06Z","citation":{"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.","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","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.","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.","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.","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","short":"J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"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)"},"status":"public","volume":164,"type":"conference","conference":{"end_date":"2020-06-26","name":"SoCG: Symposium on Computational Geometry","location":"Zürich, Switzerland","start_date":"2020-06-22"},"publication_status":"published","has_accepted_license":"1","file":[{"file_name":"2020_LIPIcsSoCG_Boissonnat.pdf","date_created":"2020-06-17T10:13:34Z","content_type":"application/pdf","file_id":"7969","creator":"dernst","checksum":"38cbfa4f5d484d267a35d44d210df044","date_updated":"2020-07-14T12:48:06Z","relation":"main_file","access_level":"open_access","file_size":1009739}],"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"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"article_processing_charge":"No","scopus_import":"1","oa":1,"ddc":["510"],"ec_funded":1,"date_created":"2020-06-09T07:24:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"The topological correctness of PL-approximations of isomanifolds","oa_version":"Published Version","quality_controlled":"1"},{"citation":{"ama":"Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.67","ista":"Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16.","mla":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.","chicago":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.67.","ieee":"U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips),” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","apa":"Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67","short":"U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"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)"},"status":"public","type":"conference","volume":164,"publication_status":"published","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26"},"doi":"10.4230/LIPIcs.SoCG.2020.67","publication":"36th International Symposium on Computational Geometry","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"intvolume":" 164","language":[{"iso":"eng"}],"author":[{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"file_date_updated":"2020-07-14T12:48:06Z","year":"2020","date_updated":"2023-08-04T08:51:07Z","day":"01","related_material":{"record":[{"status":"public","relation":"later_version","id":"12129"}]},"_id":"7990","department":[{"_id":"UlWa"}],"month":"06","date_published":"2020-06-01T00:00:00Z","alternative_title":["LIPIcs"],"article_number":"67:1 - 67:16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)","quality_controlled":"1","oa_version":"Published Version","oa":1,"ddc":["510"],"date_created":"2020-06-22T09:14:19Z","external_id":{"arxiv":["2003.13557"]},"scopus_import":1,"abstract":[{"text":"Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation on P is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge, removes a non-extreme point of degree 3, or adds a point in P ⧵ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The goal of this paper is to investigate the structure of this graph, with emphasis on its connectivity. For sets P of n points in general position, we show that the bistellar flip graph is (n-3)-connected, thereby answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov, Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results (see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph can be covered by graphs of polytopes of dimension n-3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations are regular iff the trivial subdivision has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction).","lang":"eng"}],"has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:48:06Z","creator":"dernst","checksum":"3f6925be5f3dcdb3b14cab92f410edf7","file_size":793187,"relation":"main_file","access_level":"open_access","date_created":"2020-06-23T06:37:27Z","file_name":"2020_LIPIcsSoCG_Wagner.pdf","content_type":"application/pdf","file_id":"8003"}],"article_processing_charge":"No"},{"author":[{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781611975994"]},"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","doi":"10.1137/1.9781611975994.172","publication_status":"published","conference":{"end_date":"2020-01-08","location":"Salt Lake City, UT, United States","start_date":"2020-01-05","name":"SODA: Symposium on Discrete Algorithms"},"volume":"2020-January","type":"conference","status":"public","citation":{"mla":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.","chicago":"Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:2823–41. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.172.","ama":"Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:2823-2841. doi:10.1137/1.9781611975994.172","ista":"Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 2823–2841.","short":"U. Wagner, E. Welzl, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 2823–2841.","apa":"Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.172","ieee":"U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part I: Edge flips),” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 2823–2841."},"date_published":"2020-01-01T00:00:00Z","month":"01","department":[{"_id":"UlWa"}],"_id":"7807","related_material":{"record":[{"relation":"later_version","id":"12129","status":"public"}]},"day":"01","date_updated":"2023-08-04T08:51:07Z","year":"2020","date_created":"2020-05-10T22:00:48Z","oa":1,"quality_controlled":"1","oa_version":"Submitted Version","title":"Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)","publisher":"SIAM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.1137/1.9781611975994.172","open_access":"1"}],"article_processing_charge":"No","page":"2823-2841","abstract":[{"text":"In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—provided the resulting quadrilateral is convex—adding the other diagonal is called an edge flip. The (edge) flip graph has all triangulations as vertices, and a pair of triangulations is adjacent if they can be obtained from each other by an edge flip. The goal of this paper is to contribute to a better understanding of the flip graph, with an emphasis on its connectivity.\r\nFor sets in general position, it is known that every triangulation allows at least edge flips (a tight bound) which gives the minimum degree of any flip graph for n points. We show that for every point set P in general position, the flip graph is at least -vertex connected. Somewhat more strongly, we show that the vertex connectivity equals the minimum degree occurring in the flip graph, i.e. the minimum number of flippable edges in any triangulation of P, provided P is large enough. Finally, we exhibit some of the geometry of the flip graph by showing that the flip graph can be covered by 1-skeletons of polytopes of dimension (products of associahedra).\r\nA corresponding result ((n – 3)-vertex connectedness) can be shown for the bistellar flip graph of partial triangulations, i.e. the set of all triangulations of subsets of P which contain all extreme points of P. This will be treated separately in a second part.","lang":"eng"}],"scopus_import":1,"external_id":{"arxiv":["2003.13557"]}},{"type":"research_data_reference","title":"How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Dryad","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.5061/dryad.r4xgxd29n","open_access":"1"}],"citation":{"ista":"Simon A, Fraisse C, El Ayari T, Liautard-Haag C, Strelkov P, Welch J, Bierne N. 2020. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels, Dryad, 10.5061/DRYAD.R4XGXD29N.","ama":"Simon A, Fraisse C, El Ayari T, et al. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. 2020. doi:10.5061/DRYAD.R4XGXD29N","mla":"Simon, Alexis, et al. How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels. Dryad, 2020, doi:10.5061/DRYAD.R4XGXD29N.","chicago":"Simon, Alexis, Christelle Fraisse, Tahani El Ayari, Cathy Liautard-Haag, Petr Strelkov, John Welch, and Nicolas Bierne. “How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels.” Dryad, 2020. https://doi.org/10.5061/DRYAD.R4XGXD29N.","ieee":"A. Simon et al., “How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels.” Dryad, 2020.","apa":"Simon, A., Fraisse, C., El Ayari, T., Liautard-Haag, C., Strelkov, P., Welch, J., & Bierne, N. (2020). How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. Dryad. https://doi.org/10.5061/DRYAD.R4XGXD29N","short":"A. Simon, C. Fraisse, T. El Ayari, C. Liautard-Haag, P. Strelkov, J. Welch, N. Bierne, (2020)."},"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"date_created":"2023-05-23T16:48:27Z","author":[{"full_name":"Simon, Alexis","first_name":"Alexis","last_name":"Simon"},{"orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle","last_name":"Fraisse","first_name":"Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tahani","last_name":"El Ayari","full_name":"El Ayari, Tahani"},{"first_name":"Cathy","last_name":"Liautard-Haag","full_name":"Liautard-Haag, Cathy"},{"full_name":"Strelkov, Petr","last_name":"Strelkov","first_name":"Petr"},{"last_name":"Welch","first_name":"John","full_name":"Welch, John"},{"full_name":"Bierne, Nicolas","first_name":"Nicolas","last_name":"Bierne"}],"doi":"10.5061/DRYAD.R4XGXD29N","ddc":["570"],"oa":1,"day":"22","license":"https://creativecommons.org/publicdomain/zero/1.0/","related_material":{"record":[{"status":"public","id":"8708","relation":"used_in_publication"}]},"year":"2020","date_updated":"2023-08-04T11:04:11Z","date_published":"2020-09-22T00:00:00Z","month":"09","abstract":[{"lang":"eng","text":"The Mytilus complex of marine mussel species forms a mosaic of hybrid zones, found across temperate regions of the globe. This allows us to study \"replicated\" instances of secondary contact between closely-related species. Previous work on this complex has shown that local introgression is both widespread and highly heterogeneous, and has identified SNPs that are outliers of differentiation between lineages. Here, we developed an ancestry-informative panel of such SNPs. We then compared their frequencies in newly-sampled populations, including samples from within the hybrid zones, and parental populations at different distances from the contact. Results show that close to the hybrid zones, some outlier loci are near to fixation for the heterospecific allele, suggesting enhanced local introgression, or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses, treating local parental populations as the reference, reveal a globally high concordance among loci, albeit with a few signals of asymmetric introgression. Enhanced local introgression at specific loci is consistent with the early transfer of adaptive variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having escaped one barrier, however, these variants can be trapped or delayed at the next barrier, confining the introgression locally. These results shed light on the decay of species barriers during phases of contact."}],"article_processing_charge":"No","department":[{"_id":"NiBa"}],"_id":"13073"},{"date_created":"2023-05-23T16:30:20Z","author":[{"first_name":"Stephanie","last_name":"Arnoux","full_name":"Arnoux, Stephanie"},{"orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle","last_name":"Fraisse","first_name":"Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christopher","last_name":"Sauvage","full_name":"Sauvage, Christopher"}],"doi":"10.5061/DRYAD.Q2BVQ83HD","ddc":["570"],"oa":1,"title":"VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Dryad","status":"public","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.5061/dryad.q2bvq83hd","open_access":"1"}],"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"citation":{"ieee":"S. Arnoux, C. Fraisse, and C. Sauvage, “VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species.” Dryad, 2020.","short":"S. Arnoux, C. Fraisse, C. Sauvage, (2020).","apa":"Arnoux, S., Fraisse, C., & Sauvage, C. (2020). VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. Dryad. https://doi.org/10.5061/DRYAD.Q2BVQ83HD","ista":"Arnoux S, Fraisse C, Sauvage C. 2020. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species, Dryad, 10.5061/DRYAD.Q2BVQ83HD.","ama":"Arnoux S, Fraisse C, Sauvage C. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. 2020. doi:10.5061/DRYAD.Q2BVQ83HD","mla":"Arnoux, Stephanie, et al. VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species. Dryad, 2020, doi:10.5061/DRYAD.Q2BVQ83HD.","chicago":"Arnoux, Stephanie, Christelle Fraisse, and Christopher Sauvage. “VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species.” Dryad, 2020. https://doi.org/10.5061/DRYAD.Q2BVQ83HD."},"date_published":"2020-10-19T00:00:00Z","month":"10","abstract":[{"lang":"eng","text":"Domestication is a human-induced selection process that imprints the genomes of domesticated populations over a short evolutionary time scale, and that occurs in a given demographic context. Reconstructing historical gene flow, effective population size changes and their timing is therefore of fundamental interest to understand how plant demography and human selection jointly shape genomic divergence during domestication. Yet, the comparison under a single statistical framework of independent domestication histories across different crop species has been little evaluated so far. Thus, it is unclear whether domestication leads to convergent demographic changes that similarly affect crop genomes. To address this question, we used existing and new transcriptome data on three crop species of Solanaceae (eggplant, pepper and tomato), together with their close wild relatives. We fitted twelve demographic models of increasing complexity on the unfolded joint allele frequency spectrum for each wild/crop pair, and we found evidence for both shared and species-specific demographic processes between species. A convergent history of domestication with gene-flow was inferred for all three species, along with evidence of strong reduction in the effective population size during the cultivation stage of tomato and pepper. The absence of any reduction in size of the crop in eggplant stands out from the classical view of the domestication process; as does the existence of a “protracted period” of management before cultivation. Our results also suggest divergent management strategies of modern cultivars among species as their current demography substantially differs. Finally, the timing of domestication is species-specific and supported by the few historical records available."}],"article_processing_charge":"No","department":[{"_id":"NiBa"}],"_id":"13065","day":"19","related_material":{"link":[{"url":"https://github.com/starnoux/arnoux_et_al_2019","relation":"software"}],"record":[{"relation":"used_in_publication","id":"8928","status":"public"}]},"year":"2020","date_updated":"2023-08-04T11:19:26Z"},{"related_material":{"record":[{"status":"public","id":"9047","relation":"later_version"}]},"day":"01","date_updated":"2023-08-07T13:36:24Z","year":"2020","article_number":"401-406","date_published":"2020-06-01T00:00:00Z","month":"06","department":[{"_id":"MaMo"}],"_id":"8536","publication_status":"published","conference":{"name":"ISIT: Internation Symposium on Information Theory","start_date":"2020-06-21","location":"Los Angeles, CA, United States","end_date":"2020-06-26"},"type":"conference","volume":"2020-June","status":"public","citation":{"short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.","apa":"Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2020–June). Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141","ieee":"M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in IEEE International Symposium on Information Theory - Proceedings, Los Angeles, CA, United States, 2020, vol. 2020–June.","chicago":"Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In IEEE International Symposium on Information Theory - Proceedings, Vol. 2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141.","mla":"Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory - Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141.","ama":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: IEEE International Symposium on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141","ista":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory - Proceedings. ISIT: Internation Symposium on Information Theory vol. 2020–June, 401–406."},"author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Cioffi, John","first_name":"John","last_name":"Cioffi"},{"last_name":"Goldsmith","first_name":"Andrea","full_name":"Goldsmith, Andrea"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781728164328"],"issn":["21578095"]},"publication":"IEEE International Symposium on Information Theory - Proceedings","acknowledgement":"M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei.","doi":"10.1109/ISIT44484.2020.9174141","scopus_import":"1","external_id":{"arxiv":["1909.04892"]},"article_processing_charge":"No","abstract":[{"text":"This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.","lang":"eng"}],"oa_version":"Preprint","quality_controlled":"1","title":"Simplified successive cancellation decoding of polar codes has sublinear latency","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","main_file_link":[{"url":"https://arxiv.org/abs/1909.04892","open_access":"1"}],"date_created":"2020-09-20T22:01:37Z","oa":1},{"date_published":"2020-12-01T00:00:00Z","month":"12","department":[{"_id":"UlWa"}],"isi":1,"_id":"9308","day":"01","related_material":{"record":[{"relation":"earlier_version","id":"8183","status":"public"},{"relation":"later_version","id":"10220","status":"public"}]},"year":"2020","date_updated":"2023-08-14T11:43:54Z","author":[{"full_name":"Avvakumov, Sergey","last_name":"Avvakumov","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"},{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","last_name":"Mabillard","full_name":"Mabillard, Isaac"},{"full_name":"Skopenkov, A. B.","first_name":"A. B.","last_name":"Skopenkov"}],"publication":"Russian Mathematical Surveys","doi":"10.1070/RM9943","acknowledgement":"This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169)","language":[{"iso":"eng"}],"intvolume":" 75","publication_identifier":{"issn":["0036-0279"]},"volume":75,"type":"journal_article","status":"public","publication_status":"published","citation":{"mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.","chicago":"Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.","ama":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943","ista":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.","apa":"Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943","short":"S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158.","ieee":"S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020."},"page":"1156-1158","article_processing_charge":"No","scopus_import":"1","external_id":{"arxiv":["1511.03501"],"isi":["000625983100001"]},"date_created":"2021-04-04T22:01:22Z","article_type":"original","oa":1,"title":"Eliminating higher-multiplicity intersections, III. Codimension 2","publisher":"IOP Publishing","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","quality_controlled":"1","issue":"6","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}]},{"file_date_updated":"2020-07-14T12:47:28Z","author":[{"full_name":"Carlen, Eric A.","first_name":"Eric A.","last_name":"Carlen"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338"}],"publication":"Journal of Statistical Physics","doi":"10.1007/s10955-019-02434-w","language":[{"iso":"eng"}],"intvolume":" 178","publication_identifier":{"issn":["00224715"],"eissn":["15729613"]},"volume":178,"type":"journal_article","status":"public","publication_status":"published","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)"},"citation":{"ista":"Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378.","ama":"Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. 2020;178(2):319-378. doi:10.1007/s10955-019-02434-w","mla":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w.","chicago":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities in Dissipative Quantum Systems.” Journal of Statistical Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w.","ieee":"E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems,” Journal of Statistical Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.","apa":"Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w","short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378."},"date_published":"2020-01-01T00:00:00Z","month":"01","department":[{"_id":"JaMa"}],"isi":1,"_id":"6358","day":"01","related_material":{"link":[{"url":"https://doi.org/10.1007/s10955-020-02671-4","relation":"erratum"}]},"year":"2020","date_updated":"2023-08-17T13:49:40Z","date_created":"2019-04-30T07:34:18Z","ec_funded":1,"ddc":["500"],"article_type":"original","oa":1,"title":"Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer Nature","quality_controlled":"1","oa_version":"Published Version","issue":"2","file":[{"content_type":"application/pdf","file_id":"7209","file_name":"2019_JourStatistPhysics_Carlen.pdf","date_created":"2019-12-23T12:03:09Z","date_updated":"2020-07-14T12:47:28Z","creator":"dernst","checksum":"7b04befbdc0d4982c0ee945d25d19872","file_size":905538,"access_level":"open_access","relation":"main_file"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates."}],"page":"319-378","article_processing_charge":"Yes (via OA deal)","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"_id":"260482E2-B435-11E9-9278-68D0E5697425","grant_number":" F06504","call_identifier":"FWF","name":"Taming Complexity in Partial Di erential Systems"}],"scopus_import":"1","external_id":{"arxiv":["1811.04572"],"isi":["000498933300001"]}}]