[{"publication":"Biomolecules","doi":"10.3390/biom9060222","ec_funded":1,"oa_version":"Published Version","isi":1,"volume":9,"pmid":1,"ddc":["580"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-07-07T21:59:21Z","day":"07","status":"public","external_id":{"isi":["000475301500018"],"pmid":["31181636"]},"year":"2019","date_published":"2019-06-07T00:00:00Z","month":"06","intvolume":" 9","article_number":"222","date_updated":"2023-08-28T12:30:24Z","oa":1,"acknowledged_ssus":[{"_id":"Bio"}],"issue":"6","project":[{"grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"}],"publication_status":"published","citation":{"ieee":"M. Glanc, M. Fendrych, and J. Friml, “PIN2 polarity establishment in arabidopsis in the absence of an intact cytoskeleton,” Biomolecules, vol. 9, no. 6. MDPI, 2019.","short":"M. Glanc, M. Fendrych, J. Friml, Biomolecules 9 (2019).","ista":"Glanc M, Fendrych M, Friml J. 2019. PIN2 polarity establishment in arabidopsis in the absence of an intact cytoskeleton. Biomolecules. 9(6), 222.","ama":"Glanc M, Fendrych M, Friml J. PIN2 polarity establishment in arabidopsis in the absence of an intact cytoskeleton. Biomolecules. 2019;9(6). doi:10.3390/biom9060222","chicago":"Glanc, Matous, Matyas Fendrych, and Jiří Friml. “PIN2 Polarity Establishment in Arabidopsis in the Absence of an Intact Cytoskeleton.” Biomolecules. MDPI, 2019. https://doi.org/10.3390/biom9060222.","apa":"Glanc, M., Fendrych, M., & Friml, J. (2019). PIN2 polarity establishment in arabidopsis in the absence of an intact cytoskeleton. Biomolecules. MDPI. https://doi.org/10.3390/biom9060222","mla":"Glanc, Matous, et al. “PIN2 Polarity Establishment in Arabidopsis in the Absence of an Intact Cytoskeleton.” Biomolecules, vol. 9, no. 6, 222, MDPI, 2019, doi:10.3390/biom9060222."},"scopus_import":"1","abstract":[{"text":"Cell polarity is crucial for the coordinated development of all multicellular organisms. In plants, this is exemplified by the PIN-FORMED (PIN) efflux carriers of the phytohormone auxin: The polar subcellular localization of the PINs is instructive to the directional intercellular auxin transport, and thus to a plethora of auxin-regulated growth and developmental processes. Despite its importance, the regulation of PIN polar subcellular localization remains poorly understood. Here, we have employed advanced live-cell imaging techniques to study the roles of microtubules and actin microfilaments in the establishment of apical polar localization of PIN2 in the epidermis of the Arabidopsis root meristem. We report that apical PIN2 polarity requires neither intact actin microfilaments nor microtubules, suggesting that the primary spatial cue for polar PIN distribution is likely independent of cytoskeleton-guided endomembrane trafficking.","lang":"eng"}],"type":"journal_article","file_date_updated":"2020-07-14T12:47:34Z","_id":"6611","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publisher":"MDPI","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"PIN2 polarity establishment in arabidopsis in the absence of an intact cytoskeleton","author":[{"last_name":"Glanc","orcid":"0000-0003-0619-7783","first_name":"Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","full_name":"Glanc, Matous"},{"first_name":"Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","last_name":"Fendrych","full_name":"Fendrych, Matyas"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"file":[{"file_name":"biomolecules-2019-Matous.pdf","date_created":"2019-07-08T15:46:32Z","date_updated":"2020-07-14T12:47:34Z","file_size":1066773,"creator":"kschuh","content_type":"application/pdf","file_id":"6625","relation":"main_file","access_level":"open_access","checksum":"1ce1bd36038fe5381057a1bcc6760083"}]},{"publication":"Archive for Rational Mechanics and Analysis","doi":"10.1007/s00205-019-01400-w","oa_version":"Published Version","isi":1,"volume":234,"date_created":"2019-07-07T21:59:23Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["500"],"day":"01","status":"public","external_id":{"isi":["000482386000006"],"arxiv":["1807.00834"]},"page":"635–726","year":"2019","date_published":"2019-11-01T00:00:00Z","month":"11","intvolume":" 234","date_updated":"2023-08-28T12:31:21Z","oa":1,"issue":"2","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication_status":"published","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"citation":{"apa":"Fischer, J. L. (2019). The choice of representative volumes in the approximation of effective properties of random materials. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-019-01400-w","mla":"Fischer, Julian L. “The Choice of Representative Volumes in the Approximation of Effective Properties of Random Materials.” Archive for Rational Mechanics and Analysis, vol. 234, no. 2, Springer, 2019, pp. 635–726, doi:10.1007/s00205-019-01400-w.","ieee":"J. L. Fischer, “The choice of representative volumes in the approximation of effective properties of random materials,” Archive for Rational Mechanics and Analysis, vol. 234, no. 2. Springer, pp. 635–726, 2019.","short":"J.L. Fischer, Archive for Rational Mechanics and Analysis 234 (2019) 635–726.","ista":"Fischer JL. 2019. The choice of representative volumes in the approximation of effective properties of random materials. Archive for Rational Mechanics and Analysis. 234(2), 635–726.","ama":"Fischer JL. The choice of representative volumes in the approximation of effective properties of random materials. Archive for Rational Mechanics and Analysis. 2019;234(2):635–726. doi:10.1007/s00205-019-01400-w","chicago":"Fischer, Julian L. “The Choice of Representative Volumes in the Approximation of Effective Properties of Random Materials.” Archive for Rational Mechanics and Analysis. Springer, 2019. https://doi.org/10.1007/s00205-019-01400-w."},"arxiv":1,"abstract":[{"text":"The effective large-scale properties of materials with random heterogeneities on a small scale are typically determined by the method of representative volumes: a sample of the random material is chosen—the representative volume—and its effective properties are computed by the cell formula. Intuitively, for a fixed sample size it should be possible to increase the accuracy of the method by choosing a material sample which captures the statistical properties of the material particularly well; for example, for a composite material consisting of two constituents, one would select a representative volume in which the volume fraction of the constituents matches closely with their volume fraction in the overall material. Inspired by similar attempts in materials science, Le Bris, Legoll and Minvielle have designed a selection approach for representative volumes which performs remarkably well in numerical examples of linear materials with moderate contrast. In the present work, we provide a rigorous analysis of this selection approach for representative volumes in the context of stochastic homogenization of linear elliptic equations. In particular, we prove that the method essentially never performs worse than a random selection of the material sample and may perform much better if the selection criterion for the material samples is chosen suitably.","lang":"eng"}],"scopus_import":"1","type":"journal_article","file_date_updated":"2020-07-14T12:47:34Z","_id":"6617","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"JuFi"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"Springer","title":"The choice of representative volumes in the approximation of effective properties of random materials","author":[{"full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","orcid":"0000-0002-0479-558X","last_name":"Fischer"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_name":"Springer_2019_Fischer.pdf","date_created":"2019-07-08T15:56:47Z","date_updated":"2020-07-14T12:47:34Z","content_type":"application/pdf","file_id":"6626","file_size":1377659,"creator":"kschuh","relation":"main_file","checksum":"4cff75fa6addb0770991ad9c474ab404","access_level":"open_access"}]},{"title":"On a certain non-split cubic surface","author":[{"full_name":"De La Bretèche, Régis","first_name":"Régis","last_name":"De La Bretèche"},{"id":"44DDECBC-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin N","last_name":"Destagnol","full_name":"Destagnol, Kevin N"},{"full_name":"Liu, Jianya","first_name":"Jianya","last_name":"Liu"},{"full_name":"Wu, Jie","last_name":"Wu","first_name":"Jie"},{"first_name":"Yongqiang","last_name":"Zhao","full_name":"Zhao, Yongqiang"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"TiBr"}],"_id":"6620","quality_controlled":"1","citation":{"apa":"De La Bretèche, R., Destagnol, K. N., Liu, J., Wu, J., & Zhao, Y. (2019). On a certain non-split cubic surface. Science China Mathematics. Springer. https://doi.org/10.1007/s11425-018-9543-8","mla":"De La Bretèche, Régis, et al. “On a Certain Non-Split Cubic Surface.” Science China Mathematics, vol. 62, no. 12, Springer, 2019, pp. 2435–2446, doi:10.1007/s11425-018-9543-8.","ama":"De La Bretèche R, Destagnol KN, Liu J, Wu J, Zhao Y. On a certain non-split cubic surface. Science China Mathematics. 2019;62(12):2435–2446. doi:10.1007/s11425-018-9543-8","ista":"De La Bretèche R, Destagnol KN, Liu J, Wu J, Zhao Y. 2019. On a certain non-split cubic surface. Science China Mathematics. 62(12), 2435–2446.","ieee":"R. De La Bretèche, K. N. Destagnol, J. Liu, J. Wu, and Y. Zhao, “On a certain non-split cubic surface,” Science China Mathematics, vol. 62, no. 12. Springer, pp. 2435–2446, 2019.","short":"R. De La Bretèche, K.N. Destagnol, J. Liu, J. Wu, Y. Zhao, Science China Mathematics 62 (2019) 2435–2446.","chicago":"De La Bretèche, Régis, Kevin N Destagnol, Jianya Liu, Jie Wu, and Yongqiang Zhao. “On a Certain Non-Split Cubic Surface.” Science China Mathematics. Springer, 2019. https://doi.org/10.1007/s11425-018-9543-8."},"publication_identifier":{"issn":["16747283"]},"scopus_import":"1","arxiv":1,"abstract":[{"lang":"eng","text":"This paper establishes an asymptotic formula with a power-saving error term for the number of rational points of bounded height on the singular cubic surface of ℙ3ℚ given by the following equation 𝑥0(𝑥21+𝑥22)−𝑥33=0 in agreement with the Manin-Peyre conjectures.\r\n"}],"type":"journal_article","publication_status":"published","date_updated":"2023-08-28T12:32:20Z","oa":1,"issue":"12","date_published":"2019-12-01T00:00:00Z","month":"12","intvolume":" 62","year":"2019","external_id":{"isi":["000509102200001"],"arxiv":["1709.09476"]},"page":"2435–2446","date_created":"2019-07-07T21:59:25Z","day":"01","status":"public","volume":62,"oa_version":"Preprint","isi":1,"publication":"Science China Mathematics","main_file_link":[{"url":"https://arxiv.org/abs/1709.09476","open_access":"1"}],"doi":"10.1007/s11425-018-9543-8"},{"isi":1,"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1905555116","open_access":"1"}],"doi":"10.1073/pnas.1905555116","publication":"Proceedings of the National Academy of Sciences of the United States of America","date_created":"2019-07-07T21:59:25Z","status":"public","day":"25","pmid":1,"volume":116,"year":"2019","page":"12607-12608","external_id":{"pmid":["31213531"],"isi":["000472719100010"]},"date_updated":"2023-10-17T12:44:15Z","issue":"26","oa":1,"month":"06","intvolume":" 116","date_published":"2019-06-25T00:00:00Z","publication_status":"published","_id":"6621","quality_controlled":"1","citation":{"apa":"Wright, A. E., Darolti, I., Bloch, N. I., Oostra, V., Sandkam, B. A., Buechel, S. D., … Mank, J. E. (2019). On the power to detect rare recombination events. Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1905555116","mla":"Wright, Alison E., et al. “On the Power to Detect Rare Recombination Events.” Proceedings of the National Academy of Sciences of the United States of America, vol. 116, no. 26, Proceedings of the National Academy of Sciences, 2019, pp. 12607–08, doi:10.1073/pnas.1905555116.","ama":"Wright AE, Darolti I, Bloch NI, et al. On the power to detect rare recombination events. Proceedings of the National Academy of Sciences of the United States of America. 2019;116(26):12607-12608. doi:10.1073/pnas.1905555116","short":"A.E. Wright, I. Darolti, N.I. Bloch, V. Oostra, B.A. Sandkam, S.D. Buechel, N. Kolm, F. Breden, B. Vicoso, J.E. Mank, Proceedings of the National Academy of Sciences of the United States of America 116 (2019) 12607–12608.","ista":"Wright AE, Darolti I, Bloch NI, Oostra V, Sandkam BA, Buechel SD, Kolm N, Breden F, Vicoso B, Mank JE. 2019. On the power to detect rare recombination events. Proceedings of the National Academy of Sciences of the United States of America. 116(26), 12607–12608.","ieee":"A. E. Wright et al., “On the power to detect rare recombination events,” Proceedings of the National Academy of Sciences of the United States of America, vol. 116, no. 26. Proceedings of the National Academy of Sciences, pp. 12607–12608, 2019.","chicago":"Wright, Alison E., Iulia Darolti, Natasha I. Bloch, Vicencio Oostra, Benjamin A. Sandkam, Séverine D. Buechel, Niclas Kolm, Felix Breden, Beatriz Vicoso, and Judith E. Mank. “On the Power to Detect Rare Recombination Events.” Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1905555116."},"type":"journal_article","scopus_import":"1","abstract":[{"text":"We read with great interest the recent work in PNAS by Bergero et al. (1) describing differences in male and female recombination patterns on the guppy (Poecilia reticulata) sex chromosome. We fully agree that recombination in males is largely confined to the ends of the sex chromosome. Bergero et al. interpret these results to suggest that our previous findings of population-level variation in the degree of sex chromosome differentiation in this species (2) are incorrect. However, we suggest that their results are entirely consistent with our previous report, and that their interpretation presents a false controversy.","lang":"eng"}],"language":[{"iso":"eng"}],"article_type":"letter_note","article_processing_charge":"No","department":[{"_id":"BeVi"}],"title":"On the power to detect rare recombination events","author":[{"full_name":"Wright, Alison E.","last_name":"Wright","first_name":"Alison E."},{"first_name":"Iulia","last_name":"Darolti","full_name":"Darolti, Iulia"},{"last_name":"Bloch","first_name":"Natasha I.","full_name":"Bloch, Natasha I."},{"last_name":"Oostra","first_name":"Vicencio","full_name":"Oostra, Vicencio"},{"last_name":"Sandkam","first_name":"Benjamin A.","full_name":"Sandkam, Benjamin A."},{"last_name":"Buechel","first_name":"Séverine D.","full_name":"Buechel, Séverine D."},{"full_name":"Kolm, Niclas","first_name":"Niclas","last_name":"Kolm"},{"last_name":"Breden","first_name":"Felix","full_name":"Breden, Felix"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","orcid":"0000-0002-4579-8306","last_name":"Vicoso","full_name":"Vicoso, Beatriz"},{"full_name":"Mank, Judith E.","last_name":"Mank","first_name":"Judith E."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Proceedings of the National Academy of Sciences"},{"external_id":{"isi":["000477041100221"],"pmid":["31284661"]},"year":"2019","month":"07","intvolume":" 20","date_published":"2019-07-07T00:00:00Z","article_number":"3337","date_updated":"2025-05-07T11:12:33Z","issue":"13","oa":1,"doi":"10.3390/ijms20133337","publication":"International Journal of Molecular Sciences","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10083"}]},"isi":1,"ec_funded":1,"oa_version":"Published Version","pmid":1,"volume":20,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["580"],"date_created":"2019-07-11T12:00:32Z","status":"public","day":"07","article_processing_charge":"Yes","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"MDPI","file":[{"relation":"main_file","access_level":"open_access","checksum":"dd9d1cbb933a72ceb666c9667890ac51","file_size":3330291,"creator":"dernst","file_id":"6645","content_type":"application/pdf","date_created":"2019-07-17T06:17:15Z","date_updated":"2020-07-14T12:47:34Z","file_name":"2019_JournalMolecularScience_Adamowski.pdf"}],"title":"Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling","author":[{"last_name":"Adamowski","orcid":"0000-0001-6463-5257","first_name":"Maciek","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","full_name":"Adamowski, Maciek"},{"full_name":"Li, Lanxin","first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","orcid":"0000-0002-5607-272X"},{"full_name":"Friml, Jiří","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication_status":"published","publication_identifier":{"eissn":["1422-0067"]},"citation":{"mla":"Adamowski, Maciek, et al. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” International Journal of Molecular Sciences, vol. 20, no. 13, 3337, MDPI, 2019, doi:10.3390/ijms20133337.","apa":"Adamowski, M., Li, L., & Friml, J. (2019). Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms20133337","chicago":"Adamowski, Maciek, Lanxin Li, and Jiří Friml. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” International Journal of Molecular Sciences. MDPI, 2019. https://doi.org/10.3390/ijms20133337.","ama":"Adamowski M, Li L, Friml J. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 2019;20(13). doi:10.3390/ijms20133337","ieee":"M. Adamowski, L. Li, and J. Friml, “Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling,” International Journal of Molecular Sciences, vol. 20, no. 13. MDPI, 2019.","ista":"Adamowski M, Li L, Friml J. 2019. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 20(13), 3337.","short":"M. Adamowski, L. Li, J. Friml, International Journal of Molecular Sciences 20 (2019)."},"file_date_updated":"2020-07-14T12:47:34Z","type":"journal_article","abstract":[{"text":"Cortical microtubule arrays in elongating epidermal cells in both the root and stem of plants have the propensity of dynamic reorientations that are correlated with the activation or inhibition of growth. Factors regulating plant growth, among them the hormone auxin, have been recognized as regulators of microtubule array orientations. Some previous work in the field has aimed at elucidating the causal relationship between cell growth, the signaling of auxin or other growth-regulating factors, and microtubule array reorientations, with various conclusions. Here, we revisit this problem of causality with a comprehensive set of experiments in Arabidopsis thaliana, using the now available pharmacological and genetic tools. We use isolated, auxin-depleted hypocotyls, an experimental system allowing for full control of both growth and auxin signaling. We demonstrate that reorientation of microtubules is not directly triggered by an auxin signal during growth activation. Instead, reorientation is triggered by the activation of the growth process itself and is auxin-independent in its nature. We discuss these findings in the context of previous relevant work, including that on the mechanical regulation of microtubule array orientation.","lang":"eng"}],"scopus_import":"1","_id":"6627","quality_controlled":"1"},{"page":"275-279","conference":{"location":"Edmonton, Canada","name":"CCCG: Canadian Conference in Computational Geometry","start_date":"2019-08-08","end_date":"2019-08-10"},"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"year":"2019","month":"08","has_accepted_license":"1","date_published":"2019-08-01T00:00:00Z","date_updated":"2021-01-12T08:08:16Z","file":[{"relation":"main_file","checksum":"ceabd152cfa55170d57763f9c6c60a53","access_level":"open_access","file_id":"6629","content_type":"application/pdf","creator":"mwintrae","file_size":321176,"date_created":"2019-07-12T08:32:46Z","date_updated":"2020-07-14T12:47:34Z","file_name":"IntrinsicExtrinsicCCCG2019.pdf"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Gert","last_name":"Vegter","full_name":"Vegter, Gert"},{"full_name":"Wintraecken, Mathijs","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"publication_status":"published","publication":"The 31st Canadian Conference in Computational Geometry","oa_version":"Submitted Version","ec_funded":1,"citation":{"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.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 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.","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.","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.","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.","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."},"type":"conference","file_date_updated":"2020-07-14T12:47:34Z","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"}],"scopus_import":1,"_id":"6628","date_created":"2019-07-12T08:34:57Z","ddc":["004"],"status":"public","quality_controlled":"1","day":"01"},{"article_number":"063627","date_published":"2019-06-28T00:00:00Z","intvolume":" 99","month":"06","oa":1,"issue":"6","date_updated":"2024-02-28T13:12:34Z","external_id":{"arxiv":["1903.06759"],"isi":["000473133600007"]},"year":"2019","volume":99,"day":"28","status":"public","date_created":"2019-07-14T21:59:17Z","publication":"Physical Review A","doi":"10.1103/PhysRevA.99.063627","main_file_link":[{"url":"https://arxiv.org/abs/1903.06759","open_access":"1"}],"oa_version":"Preprint","isi":1,"publisher":"American Physical Society","author":[{"full_name":"Karle, Volker","first_name":"Volker","last_name":"Karle"},{"full_name":"Defenu, Nicolò","first_name":"Nicolò","last_name":"Defenu"},{"first_name":"Tilman","last_name":"Enss","full_name":"Enss, Tilman"}],"title":"Coupled superfluidity of binary Bose mixtures in two dimensions","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"arxiv":1,"scopus_import":"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."}],"type":"journal_article","publication_identifier":{"issn":["24699926"],"eissn":["24699934"]},"citation":{"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).","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.","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","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.","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","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."},"quality_controlled":"1","_id":"6632","publication_status":"published"},{"intvolume":" 53","month":"06","date_published":"2019-06-01T00:00:00Z","date_updated":"2023-08-29T06:32:48Z","issue":"2","oa":1,"external_id":{"isi":["000472541600004"],"arxiv":["1612.06926"]},"page":"457-490","year":"2019","volume":53,"date_created":"2019-07-14T21:59:19Z","day":"01","status":"public","doi":"10.12775/TMNA.2019.008","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.06926"}],"publication":"Topological Methods in Nonlinear Analysis","isi":1,"ec_funded":1,"oa_version":"Preprint","publisher":"Akademicka Platforma Czasopism","title":"Lower and upper bounds for the waists of different spaces","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Akopyan, Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hubard, Alfredo","first_name":"Alfredo","last_name":"Hubard"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"citation":{"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.","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.","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","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.","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"},"type":"journal_article","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"}],"arxiv":1,"scopus_import":"1","_id":"6634","quality_controlled":"1","project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"publication_status":"published"},{"quality_controlled":"1","_id":"6637","file_date_updated":"2020-07-14T12:47:34Z","type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","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."}],"citation":{"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.","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.","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","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.","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","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."},"publication_status":"published","project":[{"grant_number":"704172","call_identifier":"H2020","name":"Rate of Adaptation in Changing Environment","_id":"25AEDD42-B435-11E9-9278-68D0E5697425"},{"_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","grant_number":"618091","call_identifier":"FP7"}],"file":[{"date_created":"2019-07-16T06:08:31Z","date_updated":"2020-07-14T12:47:34Z","file_name":"2019_Evolution_TrubenovaBarbora.pdf","access_level":"open_access","checksum":"9831ca65def2d62498c7b08338b6d237","relation":"main_file","file_id":"6643","content_type":"application/pdf","creator":"apreinsp","file_size":815416}],"title":"Surfing on the seascape: Adaptation in a changing environment","author":[{"first_name":"Barbora","id":"42302D54-F248-11E8-B48F-1D18A9856A87","last_name":"Trubenova","orcid":"0000-0002-6873-2967","full_name":"Trubenova, Barbora"},{"last_name":"Krejca","first_name":"Martin ","full_name":"Krejca, Martin "},{"last_name":"Lehre","first_name":"Per Kristian","full_name":"Lehre, Per Kristian"},{"full_name":"Kötzing, Timo","first_name":"Timo","last_name":"Kötzing"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Wiley","has_accepted_license":"1","article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"article_processing_charge":"Yes (via OA deal)","status":"public","day":"01","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_created":"2019-07-14T21:59:20Z","ddc":["576"],"volume":73,"isi":1,"oa_version":"Published Version","ec_funded":1,"doi":"10.1111/evo.13784","publication":"Evolution","issue":"7","oa":1,"date_updated":"2023-08-29T06:31:14Z","acknowledgement":"The authors would like to thank to Tiago Paixao and Nick Barton for useful comments and advice.","month":"07","intvolume":" 73","date_published":"2019-07-01T00:00:00Z","year":"2019","page":"1356-1374","external_id":{"isi":["000474031600001"]}},{"author":[{"first_name":"André ","last_name":"Silva","full_name":"Silva, André "},{"orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M"},{"full_name":"Richter, Bruce","last_name":"Richter","first_name":"Bruce"},{"full_name":"Lee, Orlando","first_name":"Orlando","last_name":"Lee"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Graphs with at most one crossing","publisher":"Elsevier","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"UlWa"}],"_id":"6638","quality_controlled":"1","publication_identifier":{"issn":["0012-365X"]},"citation":{"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.","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","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.","ista":"Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics. 342(11), 3201–3207.","short":"A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342 (2019) 3201–3207.","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.","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"},"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","arxiv":1,"type":"journal_article","project":[{"_id":"26366136-B435-11E9-9278-68D0E5697425","name":"Reglas de Conectividad funcional en el hipocampo"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","date_updated":"2023-08-29T06:31:41Z","oa":1,"issue":"11","date_published":"2019-11-01T00:00:00Z","month":"11","intvolume":" 342","year":"2019","external_id":{"arxiv":["1901.09955"],"isi":["000486358100025"]},"page":"3201-3207","date_created":"2019-07-14T21:59:20Z","status":"public","day":"01","volume":342,"ec_funded":1,"oa_version":"Preprint","isi":1,"publication":"Discrete Mathematics","doi":"10.1016/j.disc.2019.06.031","main_file_link":[{"url":"https://arxiv.org/abs/1901.09955","open_access":"1"}]},{"date_updated":"2024-02-28T13:01:28Z","oa":1,"date_published":"2019-05-21T00:00:00Z","intvolume":" 2107","month":"05","article_number":"020002","year":"2019","external_id":{"isi":["000479303100002"],"arxiv":["1902.07983"]},"conference":{"start_date":"2019-07-30","end_date":"2019-07-31","name":"8th International Conference on Novel Trends in Rheology","location":"Zlin, Czech Republic"},"date_created":"2019-07-15T10:07:09Z","status":"public","day":"21","volume":2107,"oa_version":"Preprint","isi":1,"publication":"AIP Conference Proceedings","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.07983"}],"doi":"10.1063/1.5109493","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"On diffusive variants of some classical viscoelastic rate-type models","author":[{"full_name":"Dostalík, Mark","first_name":"Mark","last_name":"Dostalík"},{"full_name":"Pruša, Vít","first_name":"Vít","last_name":"Pruša"},{"last_name":"Skrivan","first_name":"Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87","full_name":"Skrivan, Tomas"}],"publisher":"AIP Publishing","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"ChWo"}],"_id":"6642","quality_controlled":"1","citation":{"short":"M. Dostalík, V. Pruša, T. Skrivan, in:, AIP Conference Proceedings, AIP Publishing, 2019.","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.","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.","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","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.","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","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."},"abstract":[{"lang":"eng","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."}],"scopus_import":"1","arxiv":1,"type":"conference","publication_status":"published"},{"alternative_title":["LIPIcs"],"date_published":"2019-06-01T00:00:00Z","month":"06","intvolume":" 129","oa":1,"date_updated":"2023-12-13T12:03:35Z","conference":{"start_date":"2019-06-18","end_date":"2019-06-21","name":"SoCG 2019: Symposium on Computational Geometry","location":"Portland, OR, United States"},"page":"38:1-38:13","external_id":{"arxiv":["1812.04911"]},"year":"2019","volume":129,"day":"01","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000","510"],"date_created":"2019-07-17T10:35:04Z","publication":"35th International Symposium on Computational Geometry","doi":"10.4230/LIPICS.SOCG.2019.38","oa_version":"Published Version","related_material":{"record":[{"relation":"later_version","status":"public","id":"13974"}]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The crossing Tverberg theorem","author":[{"full_name":"Fulek, Radoslav","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","last_name":"Fulek"},{"full_name":"Gärtner, Bernd","last_name":"Gärtner","first_name":"Bernd"},{"full_name":"Kupavskii, Andrey","last_name":"Kupavskii","first_name":"Andrey"},{"full_name":"Valtr, Pavel","first_name":"Pavel","last_name":"Valtr"},{"full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"file":[{"date_created":"2019-07-24T06:54:52Z","date_updated":"2020-07-14T12:47:35Z","file_name":"2019_LIPICS_Fulek.pdf","checksum":"d6d017f8b41291b94d102294fa96ae9c","relation":"main_file","access_level":"open_access","creator":"dernst","file_size":559837,"content_type":"application/pdf","file_id":"6667"}],"department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"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."}],"arxiv":1,"scopus_import":1,"type":"conference","file_date_updated":"2020-07-14T12:47:35Z","publication_identifier":{"isbn":["9783959771047"],"issn":["1868-8969"]},"citation":{"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.","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.","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.","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.","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","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.","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"},"quality_controlled":"1","_id":"6647","publication_status":"published","project":[{"grant_number":"M02281","call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs"}]},{"publication_status":"published","project":[{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"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"}],"scopus_import":1,"arxiv":1,"type":"conference","file_date_updated":"2020-07-14T12:47:35Z","citation":{"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.","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","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.","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.","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.","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.","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"},"publication_identifier":{"isbn":["9783959771047"]},"quality_controlled":"1","_id":"6648","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","title":"Topological data analysis in information space","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"full_name":"Virk, Ziga","first_name":"Ziga","last_name":"Virk"},{"last_name":"Wagner","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"file":[{"relation":"main_file","access_level":"open_access","checksum":"8ec8720730d4c789bf7b06540f1c29f4","content_type":"application/pdf","file_id":"6666","file_size":1355179,"creator":"dernst","date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-24T06:40:01Z","file_name":"2019_LIPICS_Edelsbrunner.pdf"}],"publication":"35th International Symposium on Computational Geometry","doi":"10.4230/LIPICS.SOCG.2019.31","oa_version":"Published Version","volume":129,"status":"public","day":"01","date_created":"2019-07-17T10:36:09Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["510"],"conference":{"location":"Portland, OR, United States","name":"SoCG 2019: Symposium on Computational Geometry","end_date":"2019-06-21","start_date":"2019-06-18"},"external_id":{"arxiv":["1903.08510"]},"page":"31:1-31:14","year":"2019","date_published":"2019-06-01T00:00:00Z","alternative_title":["LIPIcs"],"intvolume":" 129","month":"06","oa":1,"date_updated":"2021-01-12T08:08:23Z"},{"publisher":"ACM","has_accepted_license":"1","title":"Volume-aware design of composite molds","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Alderighi, Thomas","last_name":"Alderighi","first_name":"Thomas"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"full_name":"Giorgi, Daniela","last_name":"Giorgi","first_name":"Daniela"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"},{"last_name":"Pietroni","first_name":"Nico","full_name":"Pietroni, Nico"}],"file":[{"creator":"dernst","file_size":74316182,"content_type":"application/pdf","file_id":"6651","access_level":"open_access","checksum":"b4562af94672b44d2a501046427412af","relation":"main_file","file_name":"2019_ACM_Alderighi_AuthorVersion.pdf","date_created":"2019-07-19T06:18:53Z","date_updated":"2020-07-14T12:47:35Z"}],"department":[{"_id":"BeBi"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"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"}],"scopus_import":"1","type":"journal_article","file_date_updated":"2020-07-14T12:47:35Z","citation":{"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","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.","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.","short":"T. Alderighi, L. Malomo, D. Giorgi, B. Bickel, P. Cignoni, N. Pietroni, ACM Transactions on Graphics 38 (2019).","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.","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","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."},"publication_identifier":{"issn":["0730-0301"]},"quality_controlled":"1","_id":"6650","publication_status":"published","project":[{"grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"article_number":"110","date_published":"2019-07-01T00:00:00Z","intvolume":" 38","month":"07","oa":1,"issue":"4","date_updated":"2023-08-29T06:35:52Z","external_id":{"isi":["000475740600084"]},"year":"2019","volume":38,"status":"public","day":"01","ddc":["000"],"date_created":"2019-07-19T06:18:15Z","publication":"ACM Transactions on Graphics","doi":"10.1145/3306346.3322981","ec_funded":1,"oa_version":"Submitted Version","isi":1,"related_material":{"link":[{"description":"YouTube Video","url":"https://youtu.be/SO349S8-x_w","relation":"supplementary_material"}]}},{"quality_controlled":"1","_id":"6657","file_date_updated":"2020-07-14T12:47:35Z","type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","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."}],"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.","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","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.","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","short":"P. Danowski, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 72 (2019) 59–65.","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.","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."},"publication_identifier":{"eissn":["1022-2588"]},"publication_status":"published","file":[{"date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-22T08:45:03Z","file_name":"2019_MitteilungenDerVOEB_Danowski.pdf","access_level":"open_access","checksum":"c0d2695d6d0d34e62ba06fb3f0ebaaed","relation":"main_file","file_id":"6661","content_type":"application/pdf","creator":"apreinsp","file_size":468558}],"title":"An Austrian proposal for the classification of Open Access Tuples (COAT) - distinguish different open access types beyond colors","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Danowski, Patrick","last_name":"Danowski","orcid":"0000-0002-6026-4409","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","has_accepted_license":"1","article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"E-Lib"}],"article_processing_charge":"No","status":"public","day":"17","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-07-21T21:59:15Z","ddc":["020"],"volume":72,"oa_version":"Published Version","related_material":{"record":[{"id":"5686","relation":"earlier_version","status":"public"}]},"doi":"10.31263/voebm.v72i1.2276","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","issue":"1","oa":1,"date_updated":"2023-10-17T11:33:58Z","month":"05","intvolume":" 72","date_published":"2019-05-17T00:00:00Z","year":"2019","page":"59-65"},{"oa":1,"issue":"7","date_updated":"2023-08-29T06:35:05Z","date_published":"2019-07-01T00:00:00Z","month":"07","intvolume":" 29","year":"2019","page":"1115-1122","external_id":{"isi":["000473730600007"]},"status":"public","day":"01","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"ddc":["576"],"date_created":"2019-07-21T21:59:15Z","volume":29,"oa_version":"Published Version","isi":1,"publication":"Genome Research","doi":"10.1101/gr.238824.118","author":[{"full_name":"Raices, Julia","last_name":"Raices","id":"3EE67F22-F248-11E8-B48F-1D18A9856A87","first_name":"Julia"},{"full_name":"Otto, Paulo","first_name":"Paulo","last_name":"Otto"},{"last_name":"Vibranovski","first_name":"Maria","full_name":"Vibranovski, Maria"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Haploid selection drives new gene male germline expression","file":[{"file_name":"2019_GenomeResearch_Raices.pdf","date_created":"2019-07-24T08:05:56Z","date_updated":"2020-07-14T12:47:35Z","content_type":"application/pdf","file_id":"6670","file_size":2319022,"creator":"apreinsp","relation":"main_file","checksum":"4636f03a6750f90b88bf2bc3eb9d71ae","access_level":"open_access"}],"publisher":"CSH Press","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"BeVi"}],"article_processing_charge":"No","quality_controlled":"1","_id":"6658","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. "}],"scopus_import":"1","file_date_updated":"2020-07-14T12:47:35Z","type":"journal_article","citation":{"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.","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.","ista":"Raices J, Otto P, Vibranovski M. 2019. Haploid selection drives new gene male germline expression. Genome Research. 29(7), 1115–1122.","short":"J. Raices, P. Otto, M. Vibranovski, Genome Research 29 (2019) 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","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.","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"},"publication_status":"published"},{"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"RySh"}],"file":[{"date_updated":"2020-10-02T08:49:58Z","date_created":"2020-10-02T08:49:58Z","file_name":"2019_BCSJ_Zenmyo.pdf","success":1,"checksum":"186de511d6e0ca93f5d981e2443eb8cd","access_level":"open_access","relation":"main_file","file_size":2464903,"creator":"dernst","content_type":"application/pdf","file_id":"8594"}],"title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","author":[{"first_name":"Naoki","last_name":"Zenmyo","full_name":"Zenmyo, Naoki"},{"full_name":"Tokumaru, Hiroki","last_name":"Tokumaru","first_name":"Hiroki"},{"first_name":"Shohei","last_name":"Uchinomiya","full_name":"Uchinomiya, Shohei"},{"last_name":"Fuchida","first_name":"Hirokazu","full_name":"Fuchida, Hirokazu"},{"full_name":"Tabata, Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87","first_name":"Shigekazu","last_name":"Tabata"},{"full_name":"Hamachi, Itaru","last_name":"Hamachi","first_name":"Itaru"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"full_name":"Ojida, Akio","first_name":"Akio","last_name":"Ojida"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"Bulletin of the Chemical Society of Japan","project":[{"_id":"25CA28EA-B435-11E9-9278-68D0E5697425","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539","call_identifier":"H2020"}],"publication_status":"published","_id":"6659","quality_controlled":"1","citation":{"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.","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.","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","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","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."},"publication_identifier":{"issn":["00092673"]},"type":"journal_article","file_date_updated":"2020-10-02T08:49:58Z","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"}],"scopus_import":"1","year":"2019","page":"995-1000","date_updated":"2021-01-12T08:08:26Z","issue":"5","oa":1,"intvolume":" 92","month":"05","date_published":"2019-05-15T00:00:00Z","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.","ec_funded":1,"oa_version":"Published Version","doi":"10.1246/bcsj.20190034","publication":"Bulletin of the Chemical Society of Japan","date_created":"2019-07-21T21:59:16Z","ddc":["570"],"status":"public","day":"15","volume":92},{"_id":"6660","quality_controlled":"1","publication_identifier":{"issn":["0730-0301"]},"citation":{"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.","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","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).","ieee":"D. Sumin et al., “Geometry-aware scattering compensation for 3D printing,” ACM Transactions on Graphics, vol. 38, no. 4. ACM, 2019.","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.","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"},"scopus_import":"1","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."}],"type":"journal_article","file_date_updated":"2020-07-14T12:47:36Z","project":[{"call_identifier":"H2020","grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020"}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Sumin, Denis","last_name":"Sumin","first_name":"Denis"},{"full_name":"Weyrich, Tim","first_name":"Tim","last_name":"Weyrich"},{"first_name":"Tobias","last_name":"Rittig","full_name":"Rittig, Tobias"},{"last_name":"Babaei","first_name":"Vahid","full_name":"Babaei, Vahid"},{"first_name":"Thomas","last_name":"Nindel","full_name":"Nindel, Thomas"},{"first_name":"Alexander","last_name":"Wilkie","full_name":"Wilkie, Alexander"},{"last_name":"Didyk","first_name":"Piotr","full_name":"Didyk, Piotr"},{"full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"full_name":"Křivánek, Jaroslav","first_name":"Jaroslav","last_name":"Křivánek"},{"full_name":"Myszkowski, Karol","first_name":"Karol","last_name":"Myszkowski"}],"title":"Geometry-aware scattering compensation for 3D printing","file":[{"file_name":"2019_ACM_Sumin_AuthorVersion.pdf","date_created":"2019-07-24T07:36:08Z","date_updated":"2020-07-14T12:47:36Z","file_size":10109800,"creator":"dernst","file_id":"6669","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"43c2019d6b48ed9c56e31686c4c2d1f5"},{"file_size":11051245,"creator":"dernst","content_type":"application/zip","file_id":"6938","checksum":"f80f365a04e35855fa467ea7ab26b16c","access_level":"open_access","relation":"supplementary_material","file_name":"sumin19geometry-aware-suppl.zip","date_updated":"2020-07-14T12:47:36Z","date_created":"2019-10-11T06:51:07Z"}],"has_accepted_license":"1","publisher":"ACM","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"BeBi"}],"date_created":"2019-07-22T07:22:28Z","ddc":["000"],"status":"public","day":"04","volume":38,"oa_version":"Submitted Version","ec_funded":1,"isi":1,"publication":"ACM Transactions on Graphics","doi":"10.1145/3306346.3322992","date_updated":"2023-08-29T06:40:49Z","oa":1,"issue":"4","date_published":"2019-07-04T00:00:00Z","month":"07","intvolume":" 38","article_number":"111","year":"2019","external_id":{"isi":["000475740600085"]}},{"publication_status":"published","_id":"6662","quality_controlled":"1","publication_identifier":{"eissn":["1615-3383"]},"citation":{"mla":"Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics, vol. 19, no. 3, Springer, 2019, pp. 703–73, doi:10.1007/s10208-018-9395-y.","apa":"Mondelli, M., & Montanari, A. (2019). Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-018-9395-y","chicago":"Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics. Springer, 2019. https://doi.org/10.1007/s10208-018-9395-y.","ieee":"M. Mondelli and A. Montanari, “Fundamental limits of weak recovery with applications to phase retrieval,” Foundations of Computational Mathematics, vol. 19, no. 3. Springer, pp. 703–773, 2019.","short":"M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019) 703–773.","ista":"Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773.","ama":"Mondelli M, Montanari A. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 2019;19(3):703-773. doi:10.1007/s10208-018-9395-y"},"extern":"1","type":"journal_article","arxiv":1,"abstract":[{"text":"In phase retrieval, we want to recover an unknown signal 𝑥∈ℂ𝑑 from n quadratic measurements of the form 𝑦𝑖=|⟨𝑎𝑖,𝑥⟩|2+𝑤𝑖, where 𝑎𝑖∈ℂ𝑑 are known sensing vectors and 𝑤𝑖 is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator 𝑥^(𝑦) that is positively correlated with the signal 𝑥? We consider the case of Gaussian vectors 𝑎𝑎𝑖. We prove that—in the high-dimensional limit—a sharp phase transition takes place, and we locate the threshold in the regime of vanishingly small noise. For 𝑛≤𝑑−𝑜(𝑑), no estimator can do significantly better than random and achieve a strictly positive correlation. For 𝑛≥𝑑+𝑜(𝑑), a simple spectral estimator achieves a positive correlation. Surprisingly, numerical simulations with the same spectral estimator demonstrate promising performance with realistic sensing matrices. Spectral methods are used to initialize non-convex optimization algorithms in phase retrieval, and our approach can boost the performance in this setting as well. Our impossibility result is based on classical information-theoretic arguments. The spectral algorithm computes the leading eigenvector of a weighted empirical covariance matrix. We obtain a sharp characterization of the spectral properties of this random matrix using tools from free probability and generalizing a recent result by Lu and Li. Both the upper bound and lower bound generalize beyond phase retrieval to measurements 𝑦𝑖 produced according to a generalized linear model. As a by-product of our analysis, we compare the threshold of the proposed spectral method with that of a message passing algorithm.","lang":"eng"}],"language":[{"iso":"eng"}],"article_type":"original","title":"Fundamental limits of weak recovery with applications to phase retrieval","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"full_name":"Montanari, Andrea","last_name":"Montanari","first_name":"Andrea"}],"publisher":"Springer","oa_version":"Preprint","doi":"10.1007/s10208-018-9395-y","main_file_link":[{"url":"https://arxiv.org/abs/1708.05932","open_access":"1"}],"publication":"Foundations of Computational Mathematics","date_created":"2019-07-22T13:23:48Z","status":"public","day":"01","volume":19,"year":"2019","external_id":{"arxiv":["1708.05932"]},"page":"703-773","date_updated":"2021-01-12T08:08:28Z","issue":"3","oa":1,"intvolume":" 19","month":"06","date_published":"2019-06-01T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Mondelli, Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"first_name":"Rudiger","last_name":"Urbanke","full_name":"Urbanke, Rudiger"}],"title":"Construction of polar codes with sublinear complexity","publisher":"IEEE","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"6663","type":"journal_article","arxiv":1,"abstract":[{"lang":"eng","text":"Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, we know from two independent works by Schürch and by Bardet et al. that the synthetic channels are partially ordered with respect to degradation. Hence, it is natural to ask whether the partial order can be exploited to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order, we can construct a polar code by computing the reliability of roughly a fraction 1/ log 3/2 N of the synthetic channels. In particular, we prove that N/ log 3/2 N is a lower bound on the number of synthetic channels to be considered and such a bound is tight up to a multiplicative factor log log N. This set of roughly N/ log 3/2 N synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists of reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general, and it can be used to further improve the complexity of the construction problem, in case a refined partial order on the synthetic channels of polar codes is discovered."}],"citation":{"short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE 65 (2019) 2782–2791.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019.","ista":"Mondelli M, Hassani H, Urbanke R. 2019. Construction of polar codes with sublinear complexity. IEEE. 65(5), 2782–2791.","ama":"Mondelli M, Hassani H, Urbanke R. Construction of polar codes with sublinear complexity. IEEE. 2019;65(5):2782-2791. doi:10.1109/tit.2018.2889667","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” IEEE. IEEE, 2019. https://doi.org/10.1109/tit.2018.2889667.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2019). Construction of polar codes with sublinear complexity. IEEE. IEEE. https://doi.org/10.1109/tit.2018.2889667","mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” IEEE, vol. 65, no. 5, IEEE, 2019, pp. 2782–91, doi:10.1109/tit.2018.2889667."},"extern":"1","publication_status":"published","issue":"5","oa":1,"date_updated":"2023-02-23T12:50:20Z","month":"05","intvolume":" 65","date_published":"2019-05-01T00:00:00Z","year":"2019","external_id":{"arxiv":["1612.05295"]},"page":"2782-2791","day":"01","status":"public","date_created":"2019-07-23T07:32:57Z","volume":65,"oa_version":"Preprint","related_material":{"record":[{"id":"6729","status":"public","relation":"earlier_version"}]},"doi":"10.1109/tit.2018.2889667","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.05295"}],"publication":"IEEE"}]