[{"author":[{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"orcid":"0000-0002-7472-2220","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","oa":1,"_id":"6628","year":"2019","abstract":[{"text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space.","lang":"eng"}],"publication":"The 31st Canadian Conference in Computational Geometry","date_updated":"2021-01-12T08:08:16Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"publication_status":"published","status":"public","ec_funded":1,"page":"275-279","day":"01","department":[{"_id":"HeEd"}],"citation":{"chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada."},"file_date_updated":"2020-07-14T12:47:34Z","month":"08","ddc":["004"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2019-08-01T00:00:00Z","conference":{"name":"CCCG: Canadian Conference in Computational Geometry","start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10"},"scopus_import":1,"date_created":"2019-07-12T08:34:57Z","oa_version":"Submitted Version","file":[{"date_created":"2019-07-12T08:32:46Z","file_id":"6629","content_type":"application/pdf","checksum":"ceabd152cfa55170d57763f9c6c60a53","access_level":"open_access","date_updated":"2020-07-14T12:47:34Z","creator":"mwintrae","relation":"main_file","file_size":321176,"file_name":"IntrinsicExtrinsicCCCG2019.pdf"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1"},{"page":"114-120","status":"public","publication_status":"published","date_updated":"2023-08-29T06:33:14Z","publication":"Current Opinion in Cell Biology","publication_identifier":{"issn":["0955-0674"]},"doi":"10.1016/j.ceb.2019.05.007","year":"2019","abstract":[{"text":"The spatiotemporal organization of cell divisions constitutes an integral part in the development of multicellular organisms, and mis-regulation of cell divisions can lead to severe developmental defects. Cell divisions have an important morphogenetic function in development by regulating growth and shape acquisition of developing tissues, and, conversely, tissue morphogenesis is known to affect both the rate and orientation of cell divisions. Moreover, cell divisions are associated with an extensive reorganization of the cytoskeleton and adhesion apparatus in the dividing cells that in turn can affect large-scale tissue rheological properties. Thus, the interplay between cell divisions and tissue morphogenesis plays a key role in embryo and tissue morphogenesis.","lang":"eng"}],"_id":"6631","author":[{"id":"33280250-F248-11E8-B48F-1D18A9856A87","first_name":"Benoit G","full_name":"Godard, Benoit G","last_name":"Godard"},{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"title":"Cell division and tissue mechanics","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","article_processing_charge":"No","volume":60,"isi":1,"intvolume":" 60","publisher":"Elsevier","scopus_import":"1","oa_version":"None","date_created":"2019-07-14T21:59:17Z","external_id":{"isi":["000486545800016"]},"date_published":"2019-10-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"10","department":[{"_id":"CaHe"}],"day":"01","citation":{"ista":"Godard BG, Heisenberg C-PJ. 2019. Cell division and tissue mechanics. Current Opinion in Cell Biology. 60, 114–120.","ama":"Godard BG, Heisenberg C-PJ. Cell division and tissue mechanics. Current Opinion in Cell Biology. 2019;60:114-120. doi:10.1016/j.ceb.2019.05.007","short":"B.G. Godard, C.-P.J. Heisenberg, Current Opinion in Cell Biology 60 (2019) 114–120.","ieee":"B. G. Godard and C.-P. J. Heisenberg, “Cell division and tissue mechanics,” Current Opinion in Cell Biology, vol. 60. Elsevier, pp. 114–120, 2019.","apa":"Godard, B. G., & Heisenberg, C.-P. J. (2019). Cell division and tissue mechanics. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2019.05.007","mla":"Godard, Benoit G., and Carl-Philipp J. Heisenberg. “Cell Division and Tissue Mechanics.” Current Opinion in Cell Biology, vol. 60, Elsevier, 2019, pp. 114–20, doi:10.1016/j.ceb.2019.05.007.","chicago":"Godard, Benoit G, and Carl-Philipp J Heisenberg. “Cell Division and Tissue Mechanics.” Current Opinion in Cell Biology. Elsevier, 2019. https://doi.org/10.1016/j.ceb.2019.05.007."}},{"oa_version":"Preprint","citation":{"ieee":"V. Karle, N. Defenu, and T. Enss, “Coupled superfluidity of binary Bose mixtures in two dimensions,” Physical Review A, vol. 99, no. 6. American Physical Society, 2019.","apa":"Karle, V., Defenu, N., & Enss, T. (2019). Coupled superfluidity of binary Bose mixtures in two dimensions. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.99.063627","ista":"Karle V, Defenu N, Enss T. 2019. Coupled superfluidity of binary Bose mixtures in two dimensions. Physical Review A. 99(6), 063627.","short":"V. Karle, N. Defenu, T. Enss, Physical Review A 99 (2019).","ama":"Karle V, Defenu N, Enss T. Coupled superfluidity of binary Bose mixtures in two dimensions. Physical Review A. 2019;99(6). doi:10.1103/PhysRevA.99.063627","mla":"Karle, Volker, et al. “Coupled Superfluidity of Binary Bose Mixtures in Two Dimensions.” Physical Review A, vol. 99, no. 6, 063627, American Physical Society, 2019, doi:10.1103/PhysRevA.99.063627.","chicago":"Karle, Volker, Nicolò Defenu, and Tilman Enss. “Coupled Superfluidity of Binary Bose Mixtures in Two Dimensions.” Physical Review A. American Physical Society, 2019. https://doi.org/10.1103/PhysRevA.99.063627."},"day":"28","month":"06","article_processing_charge":"No","volume":99,"arxiv":1,"abstract":[{"lang":"eng","text":"We consider a two-component Bose gas in two dimensions at a low temperature with short-range repulsive interaction. In the coexistence phase where both components are superfluid, interspecies interactions induce a nondissipative drag between the two superfluid flows (Andreev-Bashkin effect). We show that this behavior leads to a modification of the usual Berezinskii-Kosterlitz-Thouless (BKT) transition in two dimensions. We extend the renormalization of the superfluid densities at finite temperature using the renormalization-group approach and find that the vortices of one component have a large influence on the superfluid properties of the other, mediated by the nondissipative drag. The extended BKT flow equations indicate that the occurrence of the vortex unbinding transition in one of the components can induce the breakdown of superfluidity also in the other, leading to a locking phenomenon for the critical temperatures of the two gases."}],"issue":"6","doi":"10.1103/PhysRevA.99.063627","title":"Coupled superfluidity of binary Bose mixtures in two dimensions","author":[{"first_name":"Volker","full_name":"Karle, Volker","last_name":"Karle"},{"first_name":"Nicolò","full_name":"Defenu, Nicolò","last_name":"Defenu"},{"full_name":"Enss, Tilman","last_name":"Enss","first_name":"Tilman"}],"_id":"6632","status":"public","publication_status":"published","publication_identifier":{"issn":["24699926"],"eissn":["24699934"]},"external_id":{"arxiv":["1903.06759"],"isi":["000473133600007"]},"date_published":"2019-06-28T00:00:00Z","date_created":"2019-07-14T21:59:17Z","scopus_import":"1","department":[{"_id":"MiLe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"American Physical Society","intvolume":" 99","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.06759"}],"year":"2019","oa":1,"article_number":"063627","publication":"Physical Review A","date_updated":"2024-02-28T13:12:34Z"},{"ec_funded":1,"status":"public","publication_status":"published","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"doi":"10.12775/TMNA.2019.008","abstract":[{"text":"In this paper we prove several new results around Gromov's waist theorem. We give a simple proof of Vaaler's theorem on sections of the unit cube using the Borsuk-Ulam-Crofton technique, consider waists of real and complex projective spaces, flat tori, convex bodies in Euclidean space; and establish waist-type results in terms of the Hausdorff measure.","lang":"eng"}],"issue":"2","_id":"6634","title":"Lower and upper bounds for the waists of different spaces","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"first_name":"Alfredo","last_name":"Hubard","full_name":"Hubard, Alfredo"},{"full_name":"Karasev, Roman","last_name":"Karasev","first_name":"Roman"}],"volume":53,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","month":"06","citation":{"ista":"Akopyan A, Hubard A, Karasev R. 2019. Lower and upper bounds for the waists of different spaces. Topological Methods in Nonlinear Analysis. 53(2), 457–490.","short":"A. Akopyan, A. Hubard, R. Karasev, Topological Methods in Nonlinear Analysis 53 (2019) 457–490.","ama":"Akopyan A, Hubard A, Karasev R. Lower and upper bounds for the waists of different spaces. Topological Methods in Nonlinear Analysis. 2019;53(2):457-490. doi:10.12775/TMNA.2019.008","apa":"Akopyan, A., Hubard, A., & Karasev, R. (2019). Lower and upper bounds for the waists of different spaces. Topological Methods in Nonlinear Analysis. Akademicka Platforma Czasopism. https://doi.org/10.12775/TMNA.2019.008","ieee":"A. Akopyan, A. Hubard, and R. Karasev, “Lower and upper bounds for the waists of different spaces,” Topological Methods in Nonlinear Analysis, vol. 53, no. 2. Akademicka Platforma Czasopism, pp. 457–490, 2019.","chicago":"Akopyan, Arseniy, Alfredo Hubard, and Roman Karasev. “Lower and Upper Bounds for the Waists of Different Spaces.” Topological Methods in Nonlinear Analysis. Akademicka Platforma Czasopism, 2019. https://doi.org/10.12775/TMNA.2019.008.","mla":"Akopyan, Arseniy, et al. “Lower and Upper Bounds for the Waists of Different Spaces.” Topological Methods in Nonlinear Analysis, vol. 53, no. 2, Akademicka Platforma Czasopism, 2019, pp. 457–90, doi:10.12775/TMNA.2019.008."},"day":"01","page":"457-490","date_updated":"2023-08-29T06:32:48Z","publication":"Topological Methods in Nonlinear Analysis","year":"2019","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"publisher":"Akademicka Platforma Czasopism","intvolume":" 53","main_file_link":[{"url":"https://arxiv.org/abs/1612.06926","open_access":"1"}],"date_created":"2019-07-14T21:59:19Z","scopus_import":"1","date_published":"2019-06-01T00:00:00Z","external_id":{"isi":["000472541600004"],"arxiv":["1612.06926"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"HeEd"}]},{"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","volume":73,"file":[{"file_id":"6643","date_created":"2019-07-16T06:08:31Z","file_name":"2019_Evolution_TrubenovaBarbora.pdf","relation":"main_file","creator":"apreinsp","file_size":815416,"date_updated":"2020-07-14T12:47:34Z","access_level":"open_access","checksum":"9831ca65def2d62498c7b08338b6d237","content_type":"application/pdf"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","oa_version":"Published Version","day":"01","citation":{"apa":"Trubenova, B., Krejca, M., Lehre, P. K., & Kötzing, T. (2019). Surfing on the seascape: Adaptation in a changing environment. Evolution. Wiley. https://doi.org/10.1111/evo.13784","ieee":"B. Trubenova, M. Krejca, P. K. Lehre, and T. Kötzing, “Surfing on the seascape: Adaptation in a changing environment,” Evolution, vol. 73, no. 7. Wiley, pp. 1356–1374, 2019.","ista":"Trubenova B, Krejca M, Lehre PK, Kötzing T. 2019. Surfing on the seascape: Adaptation in a changing environment. Evolution. 73(7), 1356–1374.","short":"B. Trubenova, M. Krejca, P.K. Lehre, T. Kötzing, Evolution 73 (2019) 1356–1374.","ama":"Trubenova B, Krejca M, Lehre PK, Kötzing T. Surfing on the seascape: Adaptation in a changing environment. Evolution. 2019;73(7):1356-1374. doi:10.1111/evo.13784","mla":"Trubenova, Barbora, et al. “Surfing on the Seascape: Adaptation in a Changing Environment.” Evolution, vol. 73, no. 7, Wiley, 2019, pp. 1356–74, doi:10.1111/evo.13784.","chicago":"Trubenova, Barbora, Martin Krejca, Per Kristian Lehre, and Timo Kötzing. “Surfing on the Seascape: Adaptation in a Changing Environment.” Evolution. Wiley, 2019. https://doi.org/10.1111/evo.13784."},"file_date_updated":"2020-07-14T12:47:34Z","month":"07","ddc":["576"],"publication_status":"published","status":"public","acknowledgement":"The authors would like to thank to Tiago Paixao and Nick Barton for useful comments and advice.","ec_funded":1,"project":[{"call_identifier":"H2020","name":"Rate of Adaptation in Changing Environment","grant_number":"704172","_id":"25AEDD42-B435-11E9-9278-68D0E5697425"},{"name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091"}],"issue":"7","abstract":[{"text":"The environment changes constantly at various time scales and, in order to survive, species need to keep adapting. Whether these species succeed in avoiding extinction is a major evolutionary question. Using a multilocus evolutionary model of a mutation‐limited population adapting under strong selection, we investigate the effects of the frequency of environmental fluctuations on adaptation. Our results rely on an “adaptive‐walk” approximation and use mathematical methods from evolutionary computation theory to investigate the interplay between fluctuation frequency, the similarity of environments, and the number of loci contributing to adaptation. First, we assume a linear additive fitness function, but later generalize our results to include several types of epistasis. We show that frequent environmental changes prevent populations from reaching a fitness peak, but they may also prevent the large fitness loss that occurs after a single environmental change. Thus, the population can survive, although not thrive, in a wide range of conditions. Furthermore, we show that in a frequently changing environment, the similarity of threats that a population faces affects the level of adaptation that it is able to achieve. We check and supplement our analytical results with simulations.","lang":"eng"}],"doi":"10.1111/evo.13784","author":[{"full_name":"Trubenova, Barbora","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora","orcid":"0000-0002-6873-2967"},{"last_name":"Krejca","full_name":"Krejca, Martin ","first_name":"Martin "},{"first_name":"Per Kristian","last_name":"Lehre","full_name":"Lehre, Per Kristian"},{"first_name":"Timo","last_name":"Kötzing","full_name":"Kötzing, Timo"}],"title":"Surfing on the seascape: Adaptation in a changing environment","_id":"6637","isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 73","publisher":"Wiley","external_id":{"isi":["000474031600001"]},"date_published":"2019-07-01T00:00:00Z","scopus_import":"1","date_created":"2019-07-14T21:59:20Z","department":[{"_id":"NiBa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_type":"original","page":"1356-1374","publication":"Evolution","date_updated":"2023-08-29T06:31:14Z","year":"2019","oa":1},{"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1901.09955","open_access":"1"}],"intvolume":" 342","publisher":"Elsevier","scopus_import":"1","date_created":"2019-07-14T21:59:20Z","external_id":{"arxiv":["1901.09955"],"isi":["000486358100025"]},"date_published":"2019-11-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"UlWa"}],"page":"3201-3207","date_updated":"2023-08-29T06:31:41Z","publication":"Discrete Mathematics","year":"2019","oa":1,"volume":342,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","month":"11","day":"01","citation":{"ista":"Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics. 342(11), 3201–3207.","ama":"Silva A, Arroyo Guevara AM, Richter B, Lee O. Graphs with at most one crossing. Discrete Mathematics. 2019;342(11):3201-3207. doi:10.1016/j.disc.2019.06.031","short":"A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342 (2019) 3201–3207.","apa":"Silva, A., Arroyo Guevara, A. M., Richter, B., & Lee, O. (2019). Graphs with at most one crossing. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2019.06.031","ieee":"A. Silva, A. M. Arroyo Guevara, B. Richter, and O. Lee, “Graphs with at most one crossing,” Discrete Mathematics, vol. 342, no. 11. Elsevier, pp. 3201–3207, 2019.","chicago":"Silva, André , Alan M Arroyo Guevara, Bruce Richter, and Orlando Lee. “Graphs with at Most One Crossing.” Discrete Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.disc.2019.06.031.","mla":"Silva, André, et al. “Graphs with at Most One Crossing.” Discrete Mathematics, vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi:10.1016/j.disc.2019.06.031."},"ec_funded":1,"status":"public","publication_status":"published","project":[{"name":"Reglas de Conectividad funcional en el hipocampo","_id":"26366136-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"publication_identifier":{"issn":["0012-365X"]},"doi":"10.1016/j.disc.2019.06.031","issue":"11","abstract":[{"lang":"eng","text":"The crossing number of a graph G is the least number of crossings over all possible drawings of G. We present a structural characterization of graphs with crossing number one."}],"_id":"6638","author":[{"first_name":"André ","last_name":"Silva","full_name":"Silva, André "},{"orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara"},{"first_name":"Bruce","last_name":"Richter","full_name":"Richter, Bruce"},{"first_name":"Orlando","last_name":"Lee","full_name":"Lee, Orlando"}],"title":"Graphs with at most one crossing"},{"publisher":"AIP Publishing","intvolume":" 2107","main_file_link":[{"url":"https://arxiv.org/abs/1902.07983","open_access":"1"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChWo"}],"date_created":"2019-07-15T10:07:09Z","scopus_import":"1","date_published":"2019-05-21T00:00:00Z","external_id":{"isi":["000479303100002"],"arxiv":["1902.07983"]},"date_updated":"2024-02-28T13:01:28Z","publication":"AIP Conference Proceedings","article_number":"020002","oa":1,"year":"2019","arxiv":1,"article_processing_charge":"No","volume":2107,"month":"05","citation":{"chicago":"Dostalík, Mark, Vít Pruša, and Tomas Skrivan. “On Diffusive Variants of Some Classical Viscoelastic Rate-Type Models.” In AIP Conference Proceedings, Vol. 2107. AIP Publishing, 2019. https://doi.org/10.1063/1.5109493.","mla":"Dostalík, Mark, et al. “On Diffusive Variants of Some Classical Viscoelastic Rate-Type Models.” AIP Conference Proceedings, vol. 2107, 020002, AIP Publishing, 2019, doi:10.1063/1.5109493.","ama":"Dostalík M, Pruša V, Skrivan T. On diffusive variants of some classical viscoelastic rate-type models. In: AIP Conference Proceedings. Vol 2107. AIP Publishing; 2019. doi:10.1063/1.5109493","short":"M. Dostalík, V. Pruša, T. Skrivan, in:, AIP Conference Proceedings, AIP Publishing, 2019.","ista":"Dostalík M, Pruša V, Skrivan T. 2019. On diffusive variants of some classical viscoelastic rate-type models. AIP Conference Proceedings. 8th International Conference on Novel Trends in Rheology vol. 2107, 020002.","apa":"Dostalík, M., Pruša, V., & Skrivan, T. (2019). On diffusive variants of some classical viscoelastic rate-type models. In AIP Conference Proceedings (Vol. 2107). Zlin, Czech Republic: AIP Publishing. https://doi.org/10.1063/1.5109493","ieee":"M. Dostalík, V. Pruša, and T. Skrivan, “On diffusive variants of some classical viscoelastic rate-type models,” in AIP Conference Proceedings, Zlin, Czech Republic, 2019, vol. 2107."},"day":"21","oa_version":"Preprint","conference":{"end_date":"2019-07-31","location":"Zlin, Czech Republic","start_date":"2019-07-30","name":"8th International Conference on Novel Trends in Rheology"},"publication_status":"published","status":"public","_id":"6642","title":"On diffusive variants of some classical viscoelastic rate-type models","author":[{"full_name":"Dostalík, Mark","last_name":"Dostalík","first_name":"Mark"},{"first_name":"Vít","full_name":"Pruša, Vít","last_name":"Pruša"},{"last_name":"Skrivan","full_name":"Skrivan, Tomas","first_name":"Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1063/1.5109493","abstract":[{"text":"We present a thermodynamically based approach to the design of models for viscoelastic fluids with stress diffusion effect. In particular, we show how to add a stress diffusion term to some standard viscoelastic rate-type models (Giesekus, FENE-P, Johnson–Segalman, Phan-Thien–Tanner and Bautista–Manero–Puig) so that the resulting models with the added stress diffusion term are thermodynamically consistent in the sense that they obey the first and the second law of thermodynamics. We point out the potential applications of the provided thermodynamical background in the study of flows of fluids described by the proposed models.","lang":"eng"}]},{"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","publisher":"Optica Publishing Group","date_published":"2019-05-01T00:00:00Z","conference":{"location":"San Jose, CA, United States","start_date":"2019-05-05","end_date":"2019-05-10","name":"CLEO: Conference on Lasers and Electro-Optics"},"scopus_import":"1","oa_version":"None","date_created":"2019-07-17T09:40:44Z","day":"01","department":[{"_id":"MiLe"}],"citation":{"mla":"Khatoniar, Mandeep, et al. “Room Temperature Control of Valley Coherence in Bilayer WS2 Exciton Polaritons.” CLEO: Applications and Technology, paper JTu2A.52, Optica Publishing Group, 2019, doi:10.1364/cleo_at.2019.jtu2a.52.","chicago":"Khatoniar, Mandeep, Nicholas Yama, Areg Ghazaryan, Sriram Guddala, Pouyan Ghaemi, and Vinod Menon. “Room Temperature Control of Valley Coherence in Bilayer WS2 Exciton Polaritons.” In CLEO: Applications and Technology. Optica Publishing Group, 2019. https://doi.org/10.1364/cleo_at.2019.jtu2a.52.","short":"M. Khatoniar, N. Yama, A. Ghazaryan, S. Guddala, P. Ghaemi, V. Menon, in:, CLEO: Applications and Technology, Optica Publishing Group, 2019.","ista":"Khatoniar M, Yama N, Ghazaryan A, Guddala S, Ghaemi P, Menon V. 2019. Room temperature control of valley coherence in bilayer WS2 exciton polaritons. CLEO: Applications and Technology. CLEO: Conference on Lasers and Electro-Optics, paper JTu2A.52.","ama":"Khatoniar M, Yama N, Ghazaryan A, Guddala S, Ghaemi P, Menon V. Room temperature control of valley coherence in bilayer WS2 exciton polaritons. In: CLEO: Applications and Technology. Optica Publishing Group; 2019. doi:10.1364/cleo_at.2019.jtu2a.52","apa":"Khatoniar, M., Yama, N., Ghazaryan, A., Guddala, S., Ghaemi, P., & Menon, V. (2019). Room temperature control of valley coherence in bilayer WS2 exciton polaritons. In CLEO: Applications and Technology. San Jose, CA, United States: Optica Publishing Group. https://doi.org/10.1364/cleo_at.2019.jtu2a.52","ieee":"M. Khatoniar, N. Yama, A. Ghazaryan, S. Guddala, P. Ghaemi, and V. Menon, “Room temperature control of valley coherence in bilayer WS2 exciton polaritons,” in CLEO: Applications and Technology, San Jose, CA, United States, 2019."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","publication_status":"published","status":"public","article_number":"paper JTu2A.52","publication_identifier":{"isbn":["9781943580576"]},"publication":"CLEO: Applications and Technology","date_updated":"2023-10-17T12:14:29Z","year":"2019","abstract":[{"text":"We demonstrate robust retention of valley coherence and its control via polariton pseudospin precession through the optical TE-TM splitting in bilayer WS2 microcavity exciton polaritons at room temperature.","lang":"eng"}],"doi":"10.1364/cleo_at.2019.jtu2a.52","author":[{"last_name":"Khatoniar","full_name":"Khatoniar, Mandeep","first_name":"Mandeep"},{"last_name":"Yama","full_name":"Yama, Nicholas","first_name":"Nicholas"},{"first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543"},{"full_name":"Guddala, Sriram","last_name":"Guddala","first_name":"Sriram"},{"full_name":"Ghaemi, Pouyan","last_name":"Ghaemi","first_name":"Pouyan"},{"first_name":"Vinod","full_name":"Menon, Vinod","last_name":"Menon"}],"title":"Room temperature control of valley coherence in bilayer WS2 exciton polaritons","_id":"6646"},{"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771047"]},"project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF"}],"publication_status":"published","status":"public","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"full_name":"Gärtner, Bernd","last_name":"Gärtner","first_name":"Bernd"},{"full_name":"Kupavskii, Andrey","last_name":"Kupavskii","first_name":"Andrey"},{"first_name":"Pavel","full_name":"Valtr, Pavel","last_name":"Valtr"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"title":"The crossing Tverberg theorem","_id":"6647","abstract":[{"lang":"eng","text":"The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X of at least (d+1)(r-1)+1 points in R^d, one can find a partition X=X_1 cup ... cup X_r of X, such that the convex hulls of the X_i, i=1,...,r, all share a common point. In this paper, we prove a strengthening of this theorem that guarantees a partition which, in addition to the above, has the property that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections. Possible generalizations and algorithmic aspects are also discussed. As a concrete application, we show that any n points in the plane in general position span floor[n/3] vertex-disjoint triangles that are pairwise crossing, meaning that their boundaries have pairwise nonempty intersections; this number is clearly best possible. A previous result of Alvarez-Rebollar et al. guarantees floor[n/6] pairwise crossing triangles. Our result generalizes to a result about simplices in R^d,d >=2."}],"doi":"10.4230/LIPICS.SOCG.2019.38","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"file":[{"file_name":"2019_LIPICS_Fulek.pdf","relation":"main_file","creator":"dernst","file_size":559837,"date_updated":"2020-07-14T12:47:35Z","access_level":"open_access","checksum":"d6d017f8b41291b94d102294fa96ae9c","content_type":"application/pdf","file_id":"6667","date_created":"2019-07-24T06:54:52Z"}],"has_accepted_license":"1","volume":129,"day":"01","citation":{"ieee":"R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.","apa":"Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., & Wagner, U. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.38","ama":"Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:38:1-38:13. doi:10.4230/LIPICS.SOCG.2019.38","ista":"Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.","short":"R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.","chicago":"Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.” In 35th International Symposium on Computational Geometry, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.38.","mla":"Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38."},"file_date_updated":"2020-07-14T12:47:35Z","month":"06","ddc":["000","510"],"conference":{"location":"Portland, OR, United States","start_date":"2019-06-18","end_date":"2019-06-21","name":"SoCG 2019: Symposium on Computational Geometry"},"oa_version":"Published Version","publication":"35th International Symposium on Computational Geometry","date_updated":"2023-12-13T12:03:35Z","related_material":{"record":[{"id":"13974","status":"public","relation":"later_version"}]},"page":"38:1-38:13","oa":1,"year":"2019","alternative_title":["LIPIcs"],"intvolume":" 129","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2019-06-01T00:00:00Z","external_id":{"arxiv":["1812.04911"]},"scopus_import":1,"date_created":"2019-07-17T10:35:04Z"},{"page":"31:1-31:14","publication":"35th International Symposium on Computational Geometry","date_updated":"2021-01-12T08:08:23Z","alternative_title":["LIPIcs"],"year":"2019","oa":1,"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":" 129","date_published":"2019-06-01T00:00:00Z","external_id":{"arxiv":["1903.08510"]},"date_created":"2019-07-17T10:36:09Z","scopus_import":1,"department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","publication_identifier":{"isbn":["9783959771047"]},"project":[{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"abstract":[{"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\r\nneeded 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.","lang":"eng"}],"doi":"10.4230/LIPICS.SOCG.2019.31","title":"Topological data analysis in information space","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Virk","full_name":"Virk, Ziga","first_name":"Ziga"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","full_name":"Wagner, Hubert","last_name":"Wagner"}],"_id":"6648","has_accepted_license":"1","volume":129,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_id":"6666","date_created":"2019-07-24T06:40:01Z","file_name":"2019_LIPICS_Edelsbrunner.pdf","relation":"main_file","creator":"dernst","file_size":1355179,"access_level":"open_access","content_type":"application/pdf","checksum":"8ec8720730d4c789bf7b06540f1c29f4","date_updated":"2020-07-14T12:47:35Z"}],"arxiv":1,"oa_version":"Published Version","conference":{"name":"SoCG 2019: Symposium on Computational Geometry","start_date":"2019-06-18","location":"Portland, OR, United States","end_date":"2019-06-21"},"citation":{"ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31."},"day":"01","ddc":["510"],"file_date_updated":"2020-07-14T12:47:35Z","month":"06"},{"file":[{"file_id":"6651","date_created":"2019-07-19T06:18:53Z","access_level":"open_access","checksum":"b4562af94672b44d2a501046427412af","content_type":"application/pdf","date_updated":"2020-07-14T12:47:35Z","file_name":"2019_ACM_Alderighi_AuthorVersion.pdf","relation":"main_file","file_size":74316182,"creator":"dernst"}],"has_accepted_license":"1","article_processing_charge":"No","volume":38,"citation":{"mla":"Alderighi, Thomas, et al. “Volume-Aware Design of Composite Molds.” ACM Transactions on Graphics, vol. 38, no. 4, 110, ACM, 2019, doi:10.1145/3306346.3322981.","chicago":"Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Bernd Bickel, Paolo Cignoni, and Nico Pietroni. “Volume-Aware Design of Composite Molds.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3306346.3322981.","short":"T. Alderighi, L. Malomo, D. Giorgi, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 38 (2019).","ista":"Alderighi T, Malomo L, Giorgi D, Bickel B, Cignoni P, Pietroni N. 2019. Volume-aware design of composite molds. ACM Transactions on Graphics. 38(4), 110.","ama":"Alderighi T, Malomo L, Giorgi D, Bickel B, Cignoni P, Pietroni N. Volume-aware design of composite molds. ACM Transactions on Graphics. 2019;38(4). doi:10.1145/3306346.3322981","apa":"Alderighi, T., Malomo, L., Giorgi, D., Bickel, B., Cignoni, P., & Pietroni, N. (2019). Volume-aware design of composite molds. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3306346.3322981","ieee":"T. Alderighi, L. Malomo, D. Giorgi, B. Bickel, P. Cignoni, and N. Pietroni, “Volume-aware design of composite molds,” ACM Transactions on Graphics, vol. 38, no. 4. ACM, 2019."},"day":"01","month":"07","ddc":["000"],"file_date_updated":"2020-07-14T12:47:35Z","oa_version":"Submitted Version","publication_identifier":{"issn":["0730-0301"]},"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","ec_funded":1,"title":"Volume-aware design of composite molds","author":[{"last_name":"Alderighi","full_name":"Alderighi, Thomas","first_name":"Thomas"},{"first_name":"Luigi","last_name":"Malomo","full_name":"Malomo, Luigi"},{"full_name":"Giorgi, Daniela","last_name":"Giorgi","first_name":"Daniela"},{"orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cignoni","full_name":"Cignoni, Paolo","first_name":"Paolo"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"}],"_id":"6650","abstract":[{"text":"We propose a novel technique for the automatic design of molds to cast highly complex shapes. The technique generates composite, two-piece molds. Each mold piece is made up of a hard plastic shell and a flexible silicone part. Thanks to the thin, soft, and smartly shaped silicone part, which is kept in place by a hard plastic shell, we can cast objects of unprecedented complexity. An innovative algorithm based on a volumetric analysis defines the layout of the internal cuts in the silicone mold part. Our approach can robustly handle thin protruding features and intertwined topologies that have caused previous methods to fail. We compare our results with state of the art techniques, and we demonstrate the casting of shapes with extremely complex geometry.","lang":"eng"}],"issue":"4","doi":"10.1145/3306346.3322981","publisher":"ACM","intvolume":" 38","isi":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","department":[{"_id":"BeBi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000475740600084"]},"date_published":"2019-07-01T00:00:00Z","date_created":"2019-07-19T06:18:15Z","scopus_import":"1","publication":"ACM Transactions on Graphics","date_updated":"2023-08-29T06:35:52Z","related_material":{"link":[{"relation":"supplementary_material","description":"YouTube Video","url":"https://youtu.be/SO349S8-x_w"}]},"article_number":"110","oa":1,"year":"2019"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"E-Lib"}],"date_created":"2019-07-21T21:59:15Z","scopus_import":"1","date_published":"2019-05-17T00:00:00Z","publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","intvolume":" 72","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"oa":1,"year":"2019","date_updated":"2023-10-17T11:33:58Z","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","page":"59-65","article_type":"original","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5686"}]},"month":"05","file_date_updated":"2020-07-14T12:47:35Z","ddc":["020"],"citation":{"mla":"Danowski, Patrick. “An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare, vol. 72, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2019, pp. 59–65, doi:10.31263/voebm.v72i1.2276.","chicago":"Danowski, Patrick. “An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.” Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2019. https://doi.org/10.31263/voebm.v72i1.2276.","short":"P. Danowski, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 72 (2019) 59–65.","ista":"Danowski P. 2019. An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 72(1), 59–65.","ama":"Danowski P. An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2019;72(1):59-65. doi:10.31263/voebm.v72i1.2276","apa":"Danowski, P. (2019). An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors. Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v72i1.2276","ieee":"P. Danowski, “An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 72, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 59–65, 2019."},"day":"17","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","checksum":"c0d2695d6d0d34e62ba06fb3f0ebaaed","access_level":"open_access","date_updated":"2020-07-14T12:47:35Z","creator":"apreinsp","file_size":468558,"relation":"main_file","file_name":"2019_MitteilungenDerVOEB_Danowski.pdf","date_created":"2019-07-22T08:45:03Z","file_id":"6661"}],"article_processing_charge":"No","volume":72,"has_accepted_license":"1","_id":"6657","title":"An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors","author":[{"first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409"}],"doi":"10.31263/voebm.v72i1.2276","abstract":[{"text":"In this article a model is described how Open Access definitions can be formed on the basis of objective criteria. The common Open Access definitions such as \"gold\" and \"green\" are not exactly defined. This becomes a problem as soon as one begins to measure Open Access, for example if the development of the Open Access share should be monitored. This was discussed in the working group on Open Access Monitoring of the AT2OA project and the present model was developed, which is based on 5 critics with 4 characteristics: location, licence, version, embargo and conditions of the Open Access publication are taken into account. In the meantime, the model has also been tested in practice using R scripts, and the initial results are quite promising.","lang":"eng"}],"issue":"1","publication_identifier":{"eissn":["1022-2588"]},"publication_status":"published","status":"public"},{"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by-nc/4.0/","month":"07","ddc":["576"],"file_date_updated":"2020-07-14T12:47:35Z","day":"01","citation":{"ista":"Raices J, Otto P, Vibranovski M. 2019. Haploid selection drives new gene male germline expression. Genome Research. 29(7), 1115–1122.","ama":"Raices J, Otto P, Vibranovski M. Haploid selection drives new gene male germline expression. Genome Research. 2019;29(7):1115-1122. doi:10.1101/gr.238824.118","short":"J. Raices, P. Otto, M. Vibranovski, Genome Research 29 (2019) 1115–1122.","ieee":"J. Raices, P. Otto, and M. Vibranovski, “Haploid selection drives new gene male germline expression,” Genome Research, vol. 29, no. 7. CSH Press, pp. 1115–1122, 2019.","apa":"Raices, J., Otto, P., & Vibranovski, M. (2019). Haploid selection drives new gene male germline expression. Genome Research. CSH Press. https://doi.org/10.1101/gr.238824.118","chicago":"Raices, Julia, Paulo Otto, and Maria Vibranovski. “Haploid Selection Drives New Gene Male Germline Expression.” Genome Research. CSH Press, 2019. https://doi.org/10.1101/gr.238824.118.","mla":"Raices, Julia, et al. “Haploid Selection Drives New Gene Male Germline Expression.” Genome Research, vol. 29, no. 7, CSH Press, 2019, pp. 1115–22, doi:10.1101/gr.238824.118."},"volume":29,"article_processing_charge":"No","has_accepted_license":"1","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"file":[{"file_name":"2019_GenomeResearch_Raices.pdf","relation":"main_file","creator":"apreinsp","file_size":2319022,"date_updated":"2020-07-14T12:47:35Z","access_level":"open_access","content_type":"application/pdf","checksum":"4636f03a6750f90b88bf2bc3eb9d71ae","file_id":"6670","date_created":"2019-07-24T08:05:56Z"}],"doi":"10.1101/gr.238824.118","issue":"7","abstract":[{"lang":"eng","text":"New genes are a major source of novelties, and a disproportionate amount of them are known to show testis expression in later phases of male gametogenesis in different groups such as mammals and plants. Here, we propose that this enhanced expression is a consequence of haploid selection during the latter stages of male gametogenesis. Because emerging adaptive mutations will be fixed faster if their phenotypes are expressed by haploid rather than diploid genotypes, new genes with advantageous functions arising during this unique stage of development have a better chance to become fixed. To test this hypothesis, expression levels of genes of differing evolutionary age were examined at various stages of Drosophila spermatogenesis. We found, consistent with a model based on haploid selection, that new Drosophila genes are both expressed in later haploid phases of spermatogenesis and harbor a significant enrichment of adaptive mutations. Additionally, the observed overexpression of new genes in the latter phases of spermatogenesis was limited to the autosomes. Because all male cells exhibit hemizygous expression for X-linked genes (and therefore effectively haploid), there is no expectation that selection acting on late spermatogenesis will have a different effect on X-linked genes in comparison to initial diploid phases. Together, our proposed hypothesis and the analyzed data suggest that natural selection in haploid cells elucidates several aspects of the origin of new genes by explaining the general prevalence of their testis expression, and a parsimonious solution for new alleles to avoid being lost by genetic drift or pseudogenization. "}],"_id":"6658","author":[{"last_name":"Raices","full_name":"Raices, Julia","first_name":"Julia","id":"3EE67F22-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Otto","full_name":"Otto, Paulo","first_name":"Paulo"},{"last_name":"Vibranovski","full_name":"Vibranovski, Maria","first_name":"Maria"}],"title":"Haploid selection drives new gene male germline expression","publication_status":"published","status":"public","scopus_import":"1","date_created":"2019-07-21T21:59:15Z","external_id":{"isi":["000473730600007"]},"date_published":"2019-07-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"BeVi"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"intvolume":" 29","publisher":"CSH Press","year":"2019","oa":1,"page":"1115-1122","date_updated":"2023-08-29T06:35:05Z","publication":"Genome Research"},{"date_updated":"2021-01-12T08:08:26Z","publication":"Bulletin of the Chemical Society of Japan","article_type":"original","page":"995-1000","oa":1,"year":"2019","intvolume":" 92","publisher":"Bulletin of the Chemical Society of Japan","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RySh"}],"scopus_import":"1","date_created":"2019-07-21T21:59:16Z","date_published":"2019-05-15T00:00:00Z","project":[{"_id":"25CA28EA-B435-11E9-9278-68D0E5697425","grant_number":"694539","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020"}],"publication_identifier":{"issn":["00092673"]},"ec_funded":1,"acknowledgement":"his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation.","publication_status":"published","status":"public","_id":"6659","author":[{"last_name":"Zenmyo","full_name":"Zenmyo, Naoki","first_name":"Naoki"},{"first_name":"Hiroki","full_name":"Tokumaru, Hiroki","last_name":"Tokumaru"},{"first_name":"Shohei","last_name":"Uchinomiya","full_name":"Uchinomiya, Shohei"},{"first_name":"Hirokazu","last_name":"Fuchida","full_name":"Fuchida, Hirokazu"},{"first_name":"Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87","last_name":"Tabata","full_name":"Tabata, Shigekazu"},{"last_name":"Hamachi","full_name":"Hamachi, Itaru","first_name":"Itaru"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Akio","full_name":"Ojida, Akio","last_name":"Ojida"}],"title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","doi":"10.1246/bcsj.20190034","issue":"5","abstract":[{"text":"Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research.","lang":"eng"}],"file":[{"file_name":"2019_BCSJ_Zenmyo.pdf","creator":"dernst","relation":"main_file","file_size":2464903,"success":1,"date_updated":"2020-10-02T08:49:58Z","access_level":"open_access","content_type":"application/pdf","checksum":"186de511d6e0ca93f5d981e2443eb8cd","file_id":"8594","date_created":"2020-10-02T08:49:58Z"}],"volume":92,"article_processing_charge":"No","has_accepted_license":"1","month":"05","ddc":["570"],"file_date_updated":"2020-10-02T08:49:58Z","day":"15","citation":{"mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.","chicago":"Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034.","apa":"Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034","ieee":"N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.","short":"N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.","ama":"Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000."},"oa_version":"Published Version"},{"day":"04","citation":{"mla":"Sumin, Denis, et al. “Geometry-Aware Scattering Compensation for 3D Printing.” ACM Transactions on Graphics, vol. 38, no. 4, 111, ACM, 2019, doi:10.1145/3306346.3322992.","chicago":"Sumin, Denis, Tim Weyrich, Tobias Rittig, Vahid Babaei, Thomas Nindel, Alexander Wilkie, Piotr Didyk, Bernd Bickel, Jaroslav Křivánek, and Karol Myszkowski. “Geometry-Aware Scattering Compensation for 3D Printing.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3306346.3322992.","ista":"Sumin D, Weyrich T, Rittig T, Babaei V, Nindel T, Wilkie A, Didyk P, Bickel B, Křivánek J, Myszkowski K. 2019. Geometry-aware scattering compensation for 3D printing. ACM Transactions on Graphics. 38(4), 111.","short":"D. Sumin, T. Weyrich, T. Rittig, V. Babaei, T. Nindel, A. Wilkie, P. Didyk, B. Bickel, J. Křivánek, K. Myszkowski, ACM Transactions on Graphics 38 (2019).","ama":"Sumin D, Weyrich T, Rittig T, et al. Geometry-aware scattering compensation for 3D printing. ACM Transactions on Graphics. 2019;38(4). doi:10.1145/3306346.3322992","ieee":"D. Sumin et al., “Geometry-aware scattering compensation for 3D printing,” ACM Transactions on Graphics, vol. 38, no. 4. ACM, 2019.","apa":"Sumin, D., Weyrich, T., Rittig, T., Babaei, V., Nindel, T., Wilkie, A., … Myszkowski, K. (2019). Geometry-aware scattering compensation for 3D printing. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3306346.3322992"},"ddc":["000"],"file_date_updated":"2020-07-14T12:47:36Z","month":"07","oa_version":"Submitted Version","file":[{"file_name":"2019_ACM_Sumin_AuthorVersion.pdf","creator":"dernst","relation":"main_file","file_size":10109800,"date_updated":"2020-07-14T12:47:36Z","access_level":"open_access","checksum":"43c2019d6b48ed9c56e31686c4c2d1f5","content_type":"application/pdf","file_id":"6669","date_created":"2019-07-24T07:36:08Z"},{"date_updated":"2020-07-14T12:47:36Z","access_level":"open_access","content_type":"application/zip","checksum":"f80f365a04e35855fa467ea7ab26b16c","file_name":"sumin19geometry-aware-suppl.zip","creator":"dernst","relation":"supplementary_material","file_size":11051245,"file_id":"6938","date_created":"2019-10-11T06:51:07Z"}],"has_accepted_license":"1","article_processing_charge":"No","volume":38,"author":[{"first_name":"Denis","last_name":"Sumin","full_name":"Sumin, Denis"},{"last_name":"Weyrich","full_name":"Weyrich, Tim","first_name":"Tim"},{"first_name":"Tobias","full_name":"Rittig, Tobias","last_name":"Rittig"},{"first_name":"Vahid","full_name":"Babaei, Vahid","last_name":"Babaei"},{"full_name":"Nindel, Thomas","last_name":"Nindel","first_name":"Thomas"},{"first_name":"Alexander","last_name":"Wilkie","full_name":"Wilkie, Alexander"},{"first_name":"Piotr","last_name":"Didyk","full_name":"Didyk, Piotr"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","last_name":"Bickel"},{"first_name":"Jaroslav","full_name":"Křivánek, Jaroslav","last_name":"Křivánek"},{"first_name":"Karol","last_name":"Myszkowski","full_name":"Myszkowski, Karol"}],"title":"Geometry-aware scattering compensation for 3D printing","_id":"6660","issue":"4","abstract":[{"lang":"eng","text":"Commercially available full-color 3D printing allows for detailed control of material deposition in a volume, but an exact reproduction of a target surface appearance is hampered by the strong subsurface scattering that causes nontrivial volumetric cross-talk at the print surface. Previous work showed how an iterative optimization scheme based on accumulating absorptive materials at the surface can be used to find a volumetric distribution of print materials that closely approximates a given target appearance.\r\n\r\nIn this work, we first revisit the assumption that pushing the absorptive materials to the surface results in minimal volumetric cross-talk. We design a full-fledged optimization on a small domain for this task and confirm this previously reported heuristic. Then, we extend the above approach that is critically limited to color reproduction on planar surfaces, to arbitrary 3D shapes. Our method enables high-fidelity color texture reproduction on 3D prints by effectively compensating for internal light scattering within arbitrarily shaped objects. In addition, we propose a content-aware gamut mapping that significantly improves color reproduction for the pathological case of thin geometric features. Using a wide range of sample objects with complex textures and geometries, we demonstrate color reproduction whose fidelity is superior to state-of-the-art drivers for color 3D printers."}],"doi":"10.1145/3306346.3322992","publication_identifier":{"issn":["0730-0301"]},"project":[{"grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Distributed 3D Object Design"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"publication_status":"published","status":"public","ec_funded":1,"department":[{"_id":"BeBi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000475740600085"]},"date_published":"2019-07-04T00:00:00Z","scopus_import":"1","date_created":"2019-07-22T07:22:28Z","intvolume":" 38","publisher":"ACM","isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","oa":1,"year":"2019","publication":"ACM Transactions on Graphics","date_updated":"2023-08-29T06:40:49Z","article_number":"111"},{"publication":"Journal of Applied and Computational Topology","date_updated":"2023-08-22T12:37:47Z","article_type":"original","page":"29–58","oa":1,"year":"2019","intvolume":" 3","publisher":"Springer Nature","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2019-06-01T00:00:00Z","date_created":"2019-07-24T08:37:29Z","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication_status":"published","status":"public","ec_funded":1,"author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"title":"The reach, metric distortion, geodesic convexity and the variation of tangent spaces","_id":"6671","issue":"1-2","abstract":[{"lang":"eng","text":"In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points."}],"doi":"10.1007/s41468-019-00029-8","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"creator":"dernst","file_size":2215157,"relation":"main_file","file_name":"2019_JournAppliedComputTopol_Boissonnat.pdf","date_updated":"2020-07-14T12:47:36Z","content_type":"application/pdf","checksum":"a5b244db9f751221409cf09c97ee0935","access_level":"open_access","date_created":"2019-07-31T08:09:56Z","file_id":"6741"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","volume":3,"day":"01","citation":{"ieee":"J.-D. Boissonnat, A. Lieutier, and M. Wintraecken, “The reach, metric distortion, geodesic convexity and the variation of tangent spaces,” Journal of Applied and Computational Topology, vol. 3, no. 1–2. Springer Nature, pp. 29–58, 2019.","apa":"Boissonnat, J.-D., Lieutier, A., & Wintraecken, M. (2019). The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-019-00029-8","short":"J.-D. Boissonnat, A. Lieutier, M. Wintraecken, Journal of Applied and Computational Topology 3 (2019) 29–58.","ama":"Boissonnat J-D, Lieutier A, Wintraecken M. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 2019;3(1-2):29–58. doi:10.1007/s41468-019-00029-8","ista":"Boissonnat J-D, Lieutier A, Wintraecken M. 2019. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 3(1–2), 29–58.","mla":"Boissonnat, Jean-Daniel, et al. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology, vol. 3, no. 1–2, Springer Nature, 2019, pp. 29–58, doi:10.1007/s41468-019-00029-8.","chicago":"Boissonnat, Jean-Daniel, André Lieutier, and Mathijs Wintraecken. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology. Springer Nature, 2019. https://doi.org/10.1007/s41468-019-00029-8."},"ddc":["000"],"file_date_updated":"2020-07-14T12:47:36Z","month":"06","oa_version":"Published Version"},{"publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"isbn":["9781450361842"]},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"abstract":[{"text":"Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant of such algorithms usually specifies a fixed (but sometimes random) order in which the tasks should be performed, a standard approach to parallelizing such algorithms is to relax this constraint to allow for out-of-order parallel execution. This is the case for parallel implementations of Dijkstra's single-source shortest-paths (SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software frameworks parallelize incremental computation in this way, it is still not well understood whether this relaxed ordering approach can still provide any complexity guarantees. In this paper, we address this problem, and analyze the efficiency guarantees provided by a range of incremental algorithms when parallelized via relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation and sorting by insertion, schedulers with a maximum relaxation factor of k in terms of the maximum priority inversion allowed will introduce a maximum amount of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed. For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax is the maximum distance between two nodes, and wmin is the minimum such distance. In practical settings where n >> k, this suggests that the overheads of relaxation will be outweighed by the improved scalability of the relaxed scheduler. On the negative side, we provide lower bounds showing that certain algorithms will inherently incur a non-trivial amount of wasted work due to scheduler relaxation, even for relatively benign relaxed schedulers.","lang":"eng"}],"doi":"10.1145/3323165.3323201","title":"Efficiency guarantees for parallel incremental algorithms under relaxed schedulers","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731"},{"first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval","full_name":"Koval, Nikita"}],"_id":"6673","article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","conference":{"start_date":"2019-06-22","location":"Phoenix, AZ, United States","end_date":"2019-06-24","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"citation":{"chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201.","mla":"Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.","ama":"Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201","short":"D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.","ista":"Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 145–154.","apa":"Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3323165.3323201","ieee":"D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154."},"day":"01","month":"06","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10429"}]},"page":"145-154","publication":"31st ACM Symposium on Parallelism in Algorithms and Architectures","date_updated":"2023-09-07T13:31:39Z","year":"2019","oa":1,"isi":1,"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"ACM Press","main_file_link":[{"url":"https://arxiv.org/abs/2003.09363","open_access":"1"}],"external_id":{"isi":["000507618500018"],"arxiv":["2003.09363"]},"date_published":"2019-06-01T00:00:00Z","date_created":"2019-07-24T08:59:36Z","scopus_import":"1","department":[{"_id":"DaAl"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"page":"986-996","related_material":{"record":[{"id":"14364","status":"public","relation":"later_version"}]},"date_updated":"2023-12-13T12:28:28Z","publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","year":"2019","oa":1,"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","isi":1,"publisher":"ACM Press","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1811.01421"}],"date_created":"2019-07-24T09:13:05Z","scopus_import":"1","date_published":"2019-06-01T00:00:00Z","external_id":{"isi":["000523199100089"],"arxiv":["1811.01421"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"DaAl"}],"status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450367059"]},"doi":"10.1145/3313276.3316407","abstract":[{"text":"It is impossible to deterministically solve wait-free consensus in an asynchronous system. The classic proof uses a valency argument, which constructs an infinite execution by repeatedly extending a finite execution. We introduce extension-based proofs, a class of impossibility proofs that are modelled as an interaction between a prover and a protocol and that include valency arguments.\r\n\r\nUsing proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We show that this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.","lang":"eng"}],"_id":"6676","title":"Why extension-based proofs fail","author":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"first_name":"Faith","last_name":"Ellen","full_name":"Ellen, Faith"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"},{"first_name":"Leqi","full_name":"Zhu, Leqi","last_name":"Zhu"}],"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","conference":{"name":"STOC: Symposium on Theory of Computing","location":"Phoenix, AZ, United States","start_date":"2019-06-23","end_date":"2019-06-26"},"month":"06","citation":{"apa":"Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2019). Why extension-based proofs fail. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 986–996). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3313276.3316407","ieee":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.","ama":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Why extension-based proofs fail. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ACM Press; 2019:986-996. doi:10.1145/3313276.3316407","ista":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2019. Why extension-based proofs fail. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 986–996.","short":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–996.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 986–96. ACM Press, 2019. https://doi.org/10.1145/3313276.3316407.","mla":"Alistarh, Dan-Adrian, et al. “Why Extension-Based Proofs Fail.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–96, doi:10.1145/3313276.3316407."},"day":"01"},{"status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"isbn":["9781450367059"]},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"abstract":[{"lang":"eng","text":"The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s transcript. Constructing hash functions for which this transformation is sound is a central and long-standing open question in cryptography.\r\n\r\nWe show that solving the END−OF−METERED−LINE problem is no easier than breaking the soundness of the Fiat-Shamir transformation when applied to the sumcheck protocol. In particular, if the transformed protocol is sound, then any hard problem in #P gives rise to a hard distribution in the class CLS, which is contained in PPAD. Our result opens up the possibility of sampling moderately-sized games for which it is hard to find a Nash equilibrium, by reducing the inversion of appropriately chosen one-way functions to #SAT.\r\n\r\nOur main technical contribution is a stateful incrementally verifiable procedure that, given a SAT instance over n variables, counts the number of satisfying assignments. This is accomplished via an exponential sequence of small steps, each computable in time poly(n). Incremental verifiability means that each intermediate state includes a sumcheck-based proof of its correctness, and the proof can be updated and verified in time poly(n)."}],"doi":"10.1145/3313276.3316400","title":"Finding a Nash equilibrium is no easier than breaking Fiat-Shamir","author":[{"full_name":"Choudhuri, Arka Rai","last_name":"Choudhuri","first_name":"Arka Rai"},{"first_name":"Pavel","last_name":"Hubáček","full_name":"Hubáček, Pavel"},{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"full_name":"Rosen, Alon","last_name":"Rosen","first_name":"Alon"},{"first_name":"Guy N.","full_name":"Rothblum, Guy N.","last_name":"Rothblum"}],"_id":"6677","article_processing_charge":"No","oa_version":"Preprint","conference":{"end_date":"2019-06-26","location":"Phoenix, AZ, United States","start_date":"2019-06-23","name":"STOC: Symposium on Theory of Computing"},"citation":{"ista":"Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. STOC: Symposium on Theory of Computing, 1103–1114.","ama":"Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. ACM Press; 2019:1103-1114. doi:10.1145/3313276.3316400","short":"A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, ACM Press, 2019, pp. 1103–1114.","ieee":"A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.","apa":"Choudhuri, A. R., Hubáček, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen, A., & Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3313276.3316400","mla":"Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.","chicago":"Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z Pietrzak, Alon Rosen, and Guy N. Rothblum. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 1103–14. ACM Press, 2019. https://doi.org/10.1145/3313276.3316400."},"day":"01","month":"06","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"7896"}]},"page":"1103-1114","publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019","date_updated":"2023-09-07T13:15:55Z","year":"2019","oa":1,"isi":1,"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"ACM Press","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/549"}],"external_id":{"isi":["000523199100100"]},"date_published":"2019-06-01T00:00:00Z","date_created":"2019-07-24T09:20:53Z","scopus_import":"1","department":[{"_id":"KrPi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","volume":73,"file":[{"file_id":"6881","date_created":"2019-09-17T10:56:27Z","file_name":"2019_Evolution_Sachdeva.pdf","creator":"kschuh","file_size":937573,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"772ce7035965153959b946a1033de1ca","date_updated":"2020-07-14T12:47:37Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","day":"01","citation":{"chicago":"Sachdeva, Himani. “Effect of Partial Selfing and Polygenic Selection on Establishment in a New Habitat.” Evolution. Wiley, 2019. https://doi.org/10.1111/evo.13812.","mla":"Sachdeva, Himani. “Effect of Partial Selfing and Polygenic Selection on Establishment in a New Habitat.” Evolution, vol. 73, no. 9, Wiley, 2019, pp. 1729–45, doi:10.1111/evo.13812.","apa":"Sachdeva, H. (2019). Effect of partial selfing and polygenic selection on establishment in a new habitat. Evolution. Wiley. https://doi.org/10.1111/evo.13812","ieee":"H. Sachdeva, “Effect of partial selfing and polygenic selection on establishment in a new habitat,” Evolution, vol. 73, no. 9. Wiley, pp. 1729–1745, 2019.","ama":"Sachdeva H. Effect of partial selfing and polygenic selection on establishment in a new habitat. Evolution. 2019;73(9):1729-1745. doi:10.1111/evo.13812","short":"H. Sachdeva, Evolution 73 (2019) 1729–1745.","ista":"Sachdeva H. 2019. Effect of partial selfing and polygenic selection on establishment in a new habitat. Evolution. 73(9), 1729–1745."},"ddc":["576"],"month":"09","file_date_updated":"2020-07-14T12:47:37Z","publication_status":"published","status":"public","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"issue":"9","abstract":[{"lang":"eng","text":"This paper analyzes how partial selfing in a large source population influences its ability to colonize a new habitat via the introduction of a few founder individuals. Founders experience inbreeding depression due to partially recessive deleterious alleles as well as maladaptation to the new environment due to selection on a large number of additive loci. I first introduce a simplified version of the Inbreeding History Model (Kelly, 2007) in order to characterize mutation‐selection balance in a large, partially selfing source population under selection involving multiple non‐identical loci. I then use individual‐based simulations to study the eco‐evolutionary dynamics of founders establishing in the new habitat under a model of hard selection. The study explores how selfing rate shapes establishment probabilities of founders via effects on both inbreeding depression and adaptability to the new environment, and also distinguishes the effects of selfing on the initial fitness of founders from its effects on the long‐term adaptive response of the populations they found. A high rate of (but not complete) selfing is found to aid establishment over a wide range of parameters, even in the absence of mate limitation. The sensitivity of the results to assumptions about the nature of polygenic selection are discussed."}],"doi":"10.1111/evo.13812","author":[{"first_name":"Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87","last_name":"Sachdeva","full_name":"Sachdeva, Himani"}],"title":"Effect of partial selfing and polygenic selection on establishment in a new habitat","_id":"6680","isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":" 73","publisher":"Wiley","external_id":{"isi":["000481300600001"]},"date_published":"2019-09-01T00:00:00Z","scopus_import":"1","date_created":"2019-07-25T09:08:28Z","department":[{"_id":"NiBa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"id":"9802","status":"public","relation":"research_data"}]},"page":"1729-1745","publication":"Evolution","date_updated":"2023-08-29T06:43:58Z","year":"2019","oa":1}]