[{"oa_version":"Published Version","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","doi":"10.34727/2020/isbn.978-3-85448-042-6_21","status":"public","day":"21","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"],"date_created":"2021-01-24T23:01:10Z","year":"2020","conference":{"location":"Online Conference","name":" FMCAD: Formal Methods in Computer-Aided Design","start_date":"2020-09-21","end_date":"2020-09-24"},"page":"138-147","oa":1,"date_updated":"2021-02-09T09:39:59Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","date_published":"2020-09-21T00:00:00Z","month":"09","publication_status":"published","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}],"quality_controlled":"1","_id":"9040","scopus_import":"1","abstract":[{"text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training.","lang":"eng"}],"file_date_updated":"2021-02-09T09:39:02Z","type":"conference","publication_identifier":{"isbn":["9783854480426"],"eissn":["2708-7824"]},"citation":{"apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., &#38; Lukina, A. (2020). Formal methods with a touch of magic. In <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i> (pp. 138–147). Online Conference: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21</a>","mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>, TU Wien Academic Press, 2020, pp. 138–47, doi:<a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">10.34727/2020/isbn.978-3-85448-042-6_21</a>.","ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design.  FMCAD: Formal Methods in Computer-Aided Design, 138–147.","ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>, Online Conference, 2020, pp. 138–147.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>. TU Wien Academic Press; 2020:138-147. doi:<a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">10.34727/2020/isbn.978-3-85448-042-6_21</a>","chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In <i>Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design</i>, 138–47. TU Wien Academic Press, 2020. <a href=\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21\">https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21</a>."},"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"last_name":"Alamdari","first_name":"Par Alizadeh","full_name":"Alamdari, Par Alizadeh"},{"last_name":"Avni","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","last_name":"Lukina","full_name":"Lukina, Anna"}],"title":"Formal methods with a touch of magic","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2021-02-09T09:39:02Z","date_created":"2021-02-09T09:39:02Z","file_name":"2020_FMCAD_Alamdari.pdf","success":1,"relation":"main_file","access_level":"open_access","checksum":"d616d549a0ade78606b16f8a9540820f","creator":"dernst","file_size":990999,"content_type":"application/pdf","file_id":"9109"}],"publisher":"TU Wien Academic Press","has_accepted_license":"1"},{"department":[{"_id":"SyCr"}],"article_processing_charge":"No","year":"2020","language":[{"iso":"eng"}],"publisher":"Springer Nature","date_published":"2020-02-22T00:00:00Z","month":"02","author":[{"full_name":"Schmid-Hempel, Paul","last_name":"Schmid-Hempel","first_name":"Paul"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia M","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M"}],"title":"Parasites and Pathogens","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-02-05T12:19:21Z","publication":"Encyclopedia of Social Insects","publication_status":"published","doi":"10.1007/978-3-319-90306-4_94-1","place":"Cham","oa_version":"None","type":"book_chapter","publication_identifier":{"isbn":["9783319903064"]},"citation":{"mla":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” <i>Encyclopedia of Social Insects</i>, edited by C Starr, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">10.1007/978-3-319-90306-4_94-1</a>.","apa":"Schmid-Hempel, P., &#38; Cremer, S. (2020). Parasites and Pathogens. In C. Starr (Ed.), <i>Encyclopedia of Social Insects</i>. Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">https://doi.org/10.1007/978-3-319-90306-4_94-1</a>","chicago":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” In <i>Encyclopedia of Social Insects</i>, edited by C Starr. Cham: Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">https://doi.org/10.1007/978-3-319-90306-4_94-1</a>.","short":"P. Schmid-Hempel, S. Cremer, in:, C. Starr (Ed.), Encyclopedia of Social Insects, Springer Nature, Cham, 2020.","ieee":"P. Schmid-Hempel and S. Cremer, “Parasites and Pathogens,” in <i>Encyclopedia of Social Insects</i>, C. Starr, Ed. Cham: Springer Nature, 2020.","ista":"Schmid-Hempel P, Cremer S. 2020.Parasites and Pathogens. In: Encyclopedia of Social Insects. .","ama":"Schmid-Hempel P, Cremer S. Parasites and Pathogens. In: Starr C, ed. <i>Encyclopedia of Social Insects</i>. Cham: Springer Nature; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-319-90306-4_94-1\">10.1007/978-3-319-90306-4_94-1</a>"},"day":"22","quality_controlled":"1","status":"public","_id":"9096","date_created":"2021-02-05T12:15:18Z","editor":[{"full_name":"Starr, C","last_name":"Starr","first_name":"C"}]},{"date_created":"2021-02-07T23:01:14Z","status":"public","day":"14","volume":2020,"oa_version":"Preprint","doi":"10.1109/CDC42340.2020.9304042","main_file_link":[{"url":"https://arxiv.org/abs/2012.07458","open_access":"1"}],"publication":"Proceedings of the 59th IEEE Conference on Decision and Control","date_updated":"2021-02-09T09:20:58Z","oa":1,"intvolume":"      2020","month":"12","date_published":"2020-12-14T00:00:00Z","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","year":"2020","external_id":{"arxiv":["2012.07458"]},"page":"1556-1563","conference":{"location":"Jeju Islang, Korea (South)","name":"CDC: Conference on Decision and Control","end_date":"2020-12-18","start_date":"2020-12-14"},"_id":"9103","quality_controlled":"1","publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"citation":{"chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, 2020:1556–63. IEEE, 2020. <a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">https://doi.org/10.1109/CDC42340.2020.9304042</a>.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>. Vol 2020. IEEE; 2020:1556-1563. doi:<a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">10.1109/CDC42340.2020.9304042</a>","mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” <i>Proceedings of the 59th IEEE Conference on Decision and Control</i>, vol. 2020, IEEE, 2020, pp. 1556–63, doi:<a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">10.1109/CDC42340.2020.9304042</a>.","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &#38; Grosu, R. (2020). Lagrangian reachtubes: The next generation. In <i>Proceedings of the 59th IEEE Conference on Decision and Control</i> (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. <a href=\"https://doi.org/10.1109/CDC42340.2020.9304042\">https://doi.org/10.1109/CDC42340.2020.9304042</a>"},"type":"conference","abstract":[{"text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.","lang":"eng"}],"arxiv":1,"scopus_import":"1","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"publication_status":"published","title":"Lagrangian reachtubes: The next generation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Gruenbacher","first_name":"Sophie","full_name":"Gruenbacher, Sophie"},{"full_name":"Cyranka, Jacek","first_name":"Jacek","last_name":"Cyranka"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Islam, Md Ariful","first_name":"Md Ariful","last_name":"Islam"},{"last_name":"Smolka","first_name":"Scott A.","full_name":"Smolka, Scott A."},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"publisher":"IEEE","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"ToHe"}]},{"article_processing_charge":"No","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"article_type":"original","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"On the support of the free additive convolution","author":[{"orcid":"0000-0003-3036-1475","last_name":"Bao","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","first_name":"Zhigang","full_name":"Bao, Zhigang"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin","orcid":"0000-0003-0954-3231","last_name":"Schnelli","full_name":"Schnelli, Kevin"}],"project":[{"grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","publication_identifier":{"issn":["00217670"],"eissn":["15658538"]},"citation":{"apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2020). On the support of the free additive convolution. <i>Journal d’Analyse Mathematique</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11854-020-0135-2\">https://doi.org/10.1007/s11854-020-0135-2</a>","mla":"Bao, Zhigang, et al. “On the Support of the Free Additive Convolution.” <i>Journal d’Analyse Mathematique</i>, vol. 142, Springer Nature, 2020, pp. 323–48, doi:<a href=\"https://doi.org/10.1007/s11854-020-0135-2\">10.1007/s11854-020-0135-2</a>.","short":"Z. Bao, L. Erdös, K. Schnelli, Journal d’Analyse Mathematique 142 (2020) 323–348.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “On the support of the free additive convolution,” <i>Journal d’Analyse Mathematique</i>, vol. 142. Springer Nature, pp. 323–348, 2020.","ista":"Bao Z, Erdös L, Schnelli K. 2020. On the support of the free additive convolution. Journal d’Analyse Mathematique. 142, 323–348.","ama":"Bao Z, Erdös L, Schnelli K. On the support of the free additive convolution. <i>Journal d’Analyse Mathematique</i>. 2020;142:323-348. doi:<a href=\"https://doi.org/10.1007/s11854-020-0135-2\">10.1007/s11854-020-0135-2</a>","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “On the Support of the Free Additive Convolution.” <i>Journal d’Analyse Mathematique</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11854-020-0135-2\">https://doi.org/10.1007/s11854-020-0135-2</a>."},"arxiv":1,"abstract":[{"text":"We consider the free additive convolution of two probability measures μ and ν on the real line and show that μ ⊞ v is supported on a single interval if μ and ν each has single interval support. Moreover, the density of μ ⊞ ν is proven to vanish as a square root near the edges of its support if both μ and ν have power law behavior with exponents between −1 and 1 near their edges. In particular, these results show the ubiquity of the conditions in our recent work on optimal local law at the spectral edges for addition of random matrices [5].","lang":"eng"}],"scopus_import":"1","type":"journal_article","_id":"9104","quality_controlled":"1","page":"323-348","external_id":{"isi":["000611879400008"],"arxiv":["1804.11199"]},"year":"2020","date_published":"2020-11-01T00:00:00Z","month":"11","intvolume":"       142","acknowledgement":"Supported in part by Hong Kong RGC Grant ECS 26301517.\r\nSupported in part by ERC Advanced Grant RANMAT No. 338804.\r\nSupported in part by the Knut and Alice Wallenberg Foundation and the Swedish Research Council Grant VR-2017-05195.","date_updated":"2023-08-24T11:16:03Z","oa":1,"publication":"Journal d'Analyse Mathematique","doi":"10.1007/s11854-020-0135-2","main_file_link":[{"url":"https://arxiv.org/abs/1804.11199","open_access":"1"}],"oa_version":"Preprint","ec_funded":1,"isi":1,"volume":142,"date_created":"2021-02-07T23:01:15Z","status":"public","day":"01"},{"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"JoFi"}],"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Bidirectional electro-optic wavelength conversion in the quantum ground state","author":[{"last_name":"Hease","orcid":"0000-0001-9868-2166","first_name":"William J","id":"29705398-F248-11E8-B48F-1D18A9856A87","full_name":"Hease, William J"},{"full_name":"Rueda Sanchez, Alfredo R","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","last_name":"Rueda Sanchez"},{"full_name":"Sahu, Rishabh","last_name":"Sahu","orcid":"0000-0001-6264-2162","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","first_name":"Rishabh"},{"full_name":"Wulf, Matthias","first_name":"Matthias","id":"45598606-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6613-1378","last_name":"Wulf"},{"last_name":"Arnold","orcid":"0000-0003-1397-7876","id":"3770C838-F248-11E8-B48F-1D18A9856A87","first_name":"Georg M","full_name":"Arnold, Georg M"},{"full_name":"Schwefel, Harald G.L.","first_name":"Harald G.L.","last_name":"Schwefel"},{"full_name":"Fink, Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"file":[{"date_updated":"2021-02-12T11:16:16Z","date_created":"2021-02-12T11:16:16Z","file_name":"2020_PRXQuantum_Hease.pdf","success":1,"relation":"main_file","checksum":"b70b12ded6d7660d4c9037eb09bfed0c","access_level":"open_access","creator":"dernst","file_size":2146924,"content_type":"application/pdf","file_id":"9115"}],"publisher":"American Physical Society","has_accepted_license":"1","publication_status":"published","project":[{"grant_number":"758053","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"899354","call_identifier":"H2020","name":"Quantum Local Area Networks with Superconducting Qubits","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A"},{"_id":"26927A52-B435-11E9-9278-68D0E5697425","name":"Integrating superconducting quantum circuits","call_identifier":"FWF","grant_number":"F07105"},{"_id":"2671EB66-B435-11E9-9278-68D0E5697425","name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies"}],"quality_controlled":"1","_id":"9114","abstract":[{"text":"Microwave photonics lends the advantages of fiber optics to electronic sensing and communication systems. In contrast to nonlinear optics, electro-optic devices so far require classical modulation fields whose variance is dominated by electronic or thermal noise rather than quantum fluctuations. Here we demonstrate bidirectional single-sideband conversion of X band microwave to C band telecom light with a microwave mode occupancy as low as 0.025 ± 0.005 and an added output noise of less than or equal to 0.074 photons. This is facilitated by radiative cooling and a triply resonant ultra-low-loss transducer operating at millikelvin temperatures. The high bandwidth of 10.7 MHz and total (internal) photon conversion\r\nefficiency of 0.03% (0.67%) combined with the extremely slow heating rate of 1.1 added output noise photons per second for the highest available pump power of 1.48 mW puts near-unity efficiency pulsed quantum transduction within reach. Together with the non-Gaussian resources of superconducting qubits this might provide the practical foundation to extend the range and scope of current quantum networks in analogy to electrical repeaters in classical fiber optic communication.","lang":"eng"}],"file_date_updated":"2021-02-12T11:16:16Z","type":"journal_article","publication_identifier":{"issn":["2691-3399"]},"citation":{"mla":"Hease, William J., et al. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” <i>PRX Quantum</i>, vol. 1, no. 2, 020315, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/prxquantum.1.020315\">10.1103/prxquantum.1.020315</a>.","apa":"Hease, W. J., Rueda Sanchez, A. R., Sahu, R., Wulf, M., Arnold, G. M., Schwefel, H. G. L., &#38; Fink, J. M. (2020). Bidirectional electro-optic wavelength conversion in the quantum ground state. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/prxquantum.1.020315\">https://doi.org/10.1103/prxquantum.1.020315</a>","chicago":"Hease, William J, Alfredo R Rueda Sanchez, Rishabh Sahu, Matthias Wulf, Georg M Arnold, Harald G.L. Schwefel, and Johannes M Fink. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” <i>PRX Quantum</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/prxquantum.1.020315\">https://doi.org/10.1103/prxquantum.1.020315</a>.","ama":"Hease WJ, Rueda Sanchez AR, Sahu R, et al. Bidirectional electro-optic wavelength conversion in the quantum ground state. <i>PRX Quantum</i>. 2020;1(2). doi:<a href=\"https://doi.org/10.1103/prxquantum.1.020315\">10.1103/prxquantum.1.020315</a>","short":"W.J. Hease, A.R. Rueda Sanchez, R. Sahu, M. Wulf, G.M. Arnold, H.G.L. Schwefel, J.M. Fink, PRX Quantum 1 (2020).","ista":"Hease WJ, Rueda Sanchez AR, Sahu R, Wulf M, Arnold GM, Schwefel HGL, Fink JM. 2020. Bidirectional electro-optic wavelength conversion in the quantum ground state. PRX Quantum. 1(2), 020315.","ieee":"W. J. Hease <i>et al.</i>, “Bidirectional electro-optic wavelength conversion in the quantum ground state,” <i>PRX Quantum</i>, vol. 1, no. 2. American Physical Society, 2020."},"year":"2020","external_id":{"isi":["000674680100001"]},"oa":1,"acknowledged_ssus":[{"_id":"M-Shop"}],"issue":"2","date_updated":"2024-10-29T09:11:05Z","article_number":"020315","acknowledgement":"The authors acknowledge the support of T. Menner, A. Arslani, and T. Asenov from the Miba machine shop for machining the microwave cavity, and thank S. Barzanjeh, F. Sedlmeir, and C. Marquardt for fruitful discussions. This work is supported by IST Austria and the European Research Council under Grant No. 758053 (ERC StG QUNNECT). W.H. is the recipient of an ISTplus postdoctoral fellowship with funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant No. 754411.\r\nG.A. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria. J.M.F. acknowledges support from the Austrian Science Fund (FWF) through BeyondC (F71) and the European Union’s Horizon 2020 research and innovation program under Grant No. 899354 (FET Open SuperQuLAN). H.G.L.S. acknowledges support from the Aotearoa/New Zealand’s MBIE Endeavour Smart Ideas Grant No UOOX1805.","date_published":"2020-11-23T00:00:00Z","intvolume":"         1","month":"11","oa_version":"Published Version","ec_funded":1,"isi":1,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/how-to-transport-microwave-quantum-information-via-optical-fiber/","description":"News on IST Homepage","relation":"press_release"}],"record":[{"id":"13071","status":"public","relation":"research_data"},{"status":"public","relation":"dissertation_contains","id":"12900"},{"id":"13175","status":"public","relation":"dissertation_contains"}]},"publication":"PRX Quantum","doi":"10.1103/prxquantum.1.020315","day":"23","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":["530"],"date_created":"2021-02-12T10:41:28Z","volume":1},{"date_created":"2021-02-15T12:39:04Z","_id":"9123","day":"16","quality_controlled":"1","status":"public","publication_identifier":{"isbn":["9780470016176","9780470015902"]},"citation":{"chicago":"Westram, Anja M, Rui Faria, Roger Butlin, and Kerstin Johannesson. “Inversions and Evolution.” In <i>ELS</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/9780470015902.a0029007\">https://doi.org/10.1002/9780470015902.a0029007</a>.","short":"A.M. Westram, R. Faria, R. Butlin, K. Johannesson, in:, ELS, Wiley, 2020.","ista":"Westram AM, Faria R, Butlin R, Johannesson K. 2020.Inversions and Evolution. In: eLS. .","ieee":"A. M. Westram, R. Faria, R. Butlin, and K. Johannesson, “Inversions and Evolution,” in <i>eLS</i>, Wiley, 2020.","ama":"Westram AM, Faria R, Butlin R, Johannesson K. Inversions and Evolution. In: <i>ELS</i>. Wiley; 2020. doi:<a href=\"https://doi.org/10.1002/9780470015902.a0029007\">10.1002/9780470015902.a0029007</a>","mla":"Westram, Anja M., et al. “Inversions and Evolution.” <i>ELS</i>, Wiley, 2020, doi:<a href=\"https://doi.org/10.1002/9780470015902.a0029007\">10.1002/9780470015902.a0029007</a>.","apa":"Westram, A. M., Faria, R., Butlin, R., &#38; Johannesson, K. (2020). Inversions and Evolution. In <i>eLS</i>. Wiley. <a href=\"https://doi.org/10.1002/9780470015902.a0029007\">https://doi.org/10.1002/9780470015902.a0029007</a>"},"type":"book_chapter","abstract":[{"lang":"eng","text":"Inversions are chromosomal rearrangements where the order of genes is reversed. Inversions originate by mutation and can be under positive, negative or balancing selection. Selective effects result from potential disruptive effects on meiosis, gene disruption at inversion breakpoints and, importantly, the effects of inversions as modifiers of recombination rate: Recombination is strongly reduced in individuals heterozygous for an inversion, allowing for alleles at different loci to be inherited as a ‘block’. This may lead to a selective advantage whenever it is favourable to keep certain combinations of alleles associated, for example under local adaptation with gene flow. Inversions can cover a considerable part of a chromosome and contain numerous loci under different selection pressures, so that the resulting overall effects may be complex. Empirical data from various systems show that inversions may have a prominent role in local adaptation, speciation, parallel evolution, the maintenance of polymorphism and sex chromosome evolution."}],"oa_version":"None","doi":"10.1002/9780470015902.a0029007","publication_status":"published","publication":"eLS","date_updated":"2021-02-15T13:18:16Z","author":[{"first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Inversions and Evolution","month":"05","date_published":"2020-05-16T00:00:00Z","publisher":"Wiley","language":[{"iso":"eng"}],"year":"2020","article_processing_charge":"No","department":[{"_id":"NiBa"}]},{"year":"2020","page":"74-88","external_id":{"arxiv":["1908.06777"]},"oa":1,"issue":"1","date_updated":"2023-10-17T12:35:10Z","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of theweighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","date_published":"2020-07-21T00:00:00Z","month":"07","intvolume":"         8","ec_funded":1,"oa_version":"Published Version","publication":"Computational and Mathematical Biophysics","doi":"10.1515/cmb-2020-0101","day":"21","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)"},"date_created":"2021-02-17T15:12:44Z","ddc":["510"],"volume":8,"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"article_processing_charge":"No","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"title":"The weighted Gaussian curvature derivative of a space-filling diagram","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","checksum":"ca43a7440834eab6bbea29c59b56ef3a","relation":"main_file","content_type":"application/pdf","file_id":"9170","creator":"dernst","file_size":707452,"date_updated":"2021-02-19T13:33:19Z","date_created":"2021-02-19T13:33:19Z","success":1,"file_name":"2020_CompMathBiophysics_Akopyan.pdf"}],"publisher":"De Gruyter","has_accepted_license":"1","publication_status":"published","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"},{"grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"quality_controlled":"1","_id":"9156","arxiv":1,"abstract":[{"text":"The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy.","lang":"eng"}],"type":"journal_article","file_date_updated":"2021-02-19T13:33:19Z","publication_identifier":{"issn":["2544-7297"]},"citation":{"apa":"Akopyan, A., &#38; Edelsbrunner, H. (2020). The weighted Gaussian curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. De Gruyter. <a href=\"https://doi.org/10.1515/cmb-2020-0101\">https://doi.org/10.1515/cmb-2020-0101</a>","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1, De Gruyter, 2020, pp. 74–88, doi:<a href=\"https://doi.org/10.1515/cmb-2020-0101\">10.1515/cmb-2020-0101</a>.","ama":"Akopyan A, Edelsbrunner H. The weighted Gaussian curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. 2020;8(1):74-88. doi:<a href=\"https://doi.org/10.1515/cmb-2020-0101\">10.1515/cmb-2020-0101</a>","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted Gaussian curvature derivative of a space-filling diagram,” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1. De Gruyter, pp. 74–88, 2020.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 74–88.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/cmb-2020-0101\">https://doi.org/10.1515/cmb-2020-0101</a>."}},{"page":"51-67","year":"2020","date_published":"2020-06-20T00:00:00Z","month":"06","intvolume":"         8","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of the weighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations and for his continued encouragement. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","date_updated":"2023-10-17T12:34:51Z","oa":1,"issue":"1","publication":"Computational and Mathematical Biophysics","doi":"10.1515/cmb-2020-0100","ec_funded":1,"oa_version":"Published Version","volume":8,"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":"2021-02-17T15:13:01Z","ddc":["510"],"day":"20","status":"public","article_processing_charge":"No","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"De Gruyter","title":"The weighted mean curvature derivative of a space-filling diagram","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"file":[{"file_name":"2020_CompMathBiophysics_Akopyan2.pdf","success":1,"date_updated":"2021-02-19T13:56:24Z","date_created":"2021-02-19T13:56:24Z","creator":"dernst","file_size":562359,"content_type":"application/pdf","file_id":"9171","checksum":"cea41de9937d07a3b927d71ee8b4e432","access_level":"open_access","relation":"main_file"}],"project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"publication_status":"published","publication_identifier":{"issn":["2544-7297"]},"citation":{"mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1, De Gruyter, 2020, pp. 51–67, doi:<a href=\"https://doi.org/10.1515/cmb-2020-0100\">10.1515/cmb-2020-0100</a>.","apa":"Akopyan, A., &#38; Edelsbrunner, H. (2020). The weighted mean curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. De Gruyter. <a href=\"https://doi.org/10.1515/cmb-2020-0100\">https://doi.org/10.1515/cmb-2020-0100</a>","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/cmb-2020-0100\">https://doi.org/10.1515/cmb-2020-0100</a>.","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted mean curvature derivative of a space-filling diagram,” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1. De Gruyter, pp. 51–67, 2020.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67.","ama":"Akopyan A, Edelsbrunner H. The weighted mean curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. 2020;8(1):51-67. doi:<a href=\"https://doi.org/10.1515/cmb-2020-0100\">10.1515/cmb-2020-0100</a>"},"abstract":[{"text":"Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy.","lang":"eng"}],"type":"journal_article","file_date_updated":"2021-02-19T13:56:24Z","_id":"9157","quality_controlled":"1"},{"publisher":"Elsevier","has_accepted_license":"1","author":[{"full_name":"Semeradova, Hana","last_name":"Semeradova","id":"42FE702E-F248-11E8-B48F-1D18A9856A87","first_name":"Hana"},{"last_name":"Montesinos López","orcid":"0000-0001-9179-6099","id":"310A8E3E-F248-11E8-B48F-1D18A9856A87","first_name":"Juan C","full_name":"Montesinos López, Juan C"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","full_name":"Benková, Eva"}],"title":"All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"creator":"dernst","file_size":840289,"content_type":"application/pdf","file_id":"9161","checksum":"785b266d82a94b007cf40dbbe7c4847e","relation":"main_file","access_level":"open_access","file_name":"2020_PlantComm_Semeradova.pdf","success":1,"date_updated":"2021-02-18T10:23:59Z","date_created":"2021-02-18T10:23:59Z"}],"department":[{"_id":"EvBe"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"abstract":[{"text":"Auxin is a key hormonal regulator, that governs plant growth and development in concert with other hormonal pathways. The unique feature of auxin is its polar, cell-to-cell transport that leads to the formation of local auxin maxima and gradients, which coordinate initiation and patterning of plant organs. The molecular machinery mediating polar auxin transport is one of the important points of interaction with other hormones. Multiple hormonal pathways converge at the regulation of auxin transport and form a regulatory network that integrates various developmental and environmental inputs to steer plant development. In this review, we discuss recent advances in understanding the mechanisms that underlie regulation of polar auxin transport by multiple hormonal pathways. Specifically, we focus on the post-translational mechanisms that contribute to fine-tuning of the abundance and polarity of auxin transporters at the plasma membrane and thereby enable rapid modification of the auxin flow to coordinate plant growth and development.","lang":"eng"}],"scopus_import":"1","file_date_updated":"2021-02-18T10:23:59Z","type":"journal_article","citation":{"mla":"Semerádová, Hana, et al. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” <i>Plant Communications</i>, vol. 1, no. 3, 100048, Elsevier, 2020, doi:<a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">10.1016/j.xplc.2020.100048</a>.","apa":"Semerádová, H., Montesinos López, J. C., &#38; Benková, E. (2020). All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. <i>Plant Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">https://doi.org/10.1016/j.xplc.2020.100048</a>","chicago":"Semerádová, Hana, Juan C Montesinos López, and Eva Benková. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” <i>Plant Communications</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">https://doi.org/10.1016/j.xplc.2020.100048</a>.","ama":"Semerádová H, Montesinos López JC, Benková E. All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. <i>Plant Communications</i>. 2020;1(3). doi:<a href=\"https://doi.org/10.1016/j.xplc.2020.100048\">10.1016/j.xplc.2020.100048</a>","short":"H. Semerádová, J.C. Montesinos López, E. Benková, Plant Communications 1 (2020).","ista":"Semerádová H, Montesinos López JC, Benková E. 2020. All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. Plant Communications. 1(3), 100048.","ieee":"H. Semerádová, J. C. Montesinos López, and E. Benková, “All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways,” <i>Plant Communications</i>, vol. 1, no. 3. Elsevier, 2020."},"publication_identifier":{"issn":["2590-3462"]},"quality_controlled":"1","_id":"9160","publication_status":"published","project":[{"name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis.","_id":"261821BC-B435-11E9-9278-68D0E5697425","grant_number":"24746"},{"_id":"253E54C8-B435-11E9-9278-68D0E5697425","name":"Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants","grant_number":"ALTF710-2016"}],"acknowledgement":"H.S. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology, Austria. J.C.M. is the recipient of an EMBO Long-Term Fellowship (ALTF number 710-2016). We would like to thank Jiri Friml and Carina Baskett for critical reading of the manuscript and Shutang Tan and Maciek Adamowski for helpful discussions. No conflict of interest declared.","article_number":"100048","date_published":"2020-05-11T00:00:00Z","month":"05","intvolume":"         1","oa":1,"issue":"3","date_updated":"2024-03-25T23:30:26Z","external_id":{"pmid":["33367243"],"isi":["000654052800010"]},"year":"2020","volume":1,"pmid":1,"status":"public","day":"11","ddc":["580"],"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":"2021-02-18T10:18:43Z","publication":"Plant Communications","doi":"10.1016/j.xplc.2020.100048","oa_version":"Published Version","isi":1,"related_material":{"record":[{"id":"10135","status":"public","relation":"dissertation_contains"}]}},{"year":"2020","external_id":{"isi":["000521449500001"]},"date_updated":"2023-08-24T11:17:48Z","oa":1,"issue":"2","date_published":"2020-03-01T00:00:00Z","month":"03","intvolume":"         5","article_number":"020501","acknowledgement":"During the writing of this article we became aware of another review of quantum transduction with somewhat different emphasis [99].\r\nWe would like to thank the participants of the transduction workshop at Caltech in September 2018 for helpful and stimulating discussions. We particularly thank John Bartholomew, Andrei Faraon, Johannes Fink, Jeff Holzgrafe, Linbo Shao, Marko Lončar, Daniel Oblak, and Oskar Painter.\r\nN L and N S acknowledge support from the Alliance for Quantum Technologies' (AQT) Intelligent Quantum Networks and Technologies (INQNET) research program and by DOE/HEP QuantISED program grant, QCCFP (Quantum Communication Channels for Fundamental Physics), award number DE-SC0019219. NS further acknowledges support by the Natural Sciences and Engineering Research Council of Canada (NSERC). SB acknowledges support from the Marie Skłodowska Curie fellowship number 707 438 (MSC-IF SUPEREOM). JPC acknowledges support from the Caltech PMA prize postdoctoral fellowship. MS acknowledges support from the ARL-CDQI and the National Science Foundation. CS acknowledges NSERC, Quantum Alberta, and the Alberta Major Innovation Fund.","ec_funded":1,"oa_version":"Published Version","isi":1,"publication":"Quantum Science and Technology","doi":"10.1088/2058-9565/ab788a","ddc":["530"],"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":"2021-02-25T08:32:29Z","status":"public","day":"01","volume":5,"language":[{"iso":"eng"}],"article_type":"review","article_processing_charge":"No","department":[{"_id":"JoFi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Perspectives on quantum transduction","author":[{"full_name":"Lauk, Nikolai","first_name":"Nikolai","last_name":"Lauk"},{"last_name":"Sinclair","first_name":"Neil","full_name":"Sinclair, Neil"},{"id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","first_name":"Shabir","orcid":"0000-0003-0415-1423","last_name":"Barzanjeh","full_name":"Barzanjeh, Shabir"},{"last_name":"Covey","first_name":"Jacob P","full_name":"Covey, Jacob P"},{"last_name":"Saffman","first_name":"Mark","full_name":"Saffman, Mark"},{"last_name":"Spiropulu","first_name":"Maria","full_name":"Spiropulu, Maria"},{"full_name":"Simon, Christoph","first_name":"Christoph","last_name":"Simon"}],"file":[{"date_updated":"2021-03-02T09:47:13Z","date_created":"2021-03-02T09:47:13Z","file_name":"2020_QuantumScience_Lauk.pdf","success":1,"relation":"main_file","access_level":"open_access","checksum":"a8562c42124a66b86836fe2489eb5f4f","file_size":974399,"creator":"dernst","file_id":"9215","content_type":"application/pdf"}],"has_accepted_license":"1","publisher":"IOP Publishing","project":[{"call_identifier":"H2020","grant_number":"707438","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics SUPEREOM","_id":"258047B6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","_id":"9194","quality_controlled":"1","citation":{"ama":"Lauk N, Sinclair N, Barzanjeh S, et al. Perspectives on quantum transduction. <i>Quantum Science and Technology</i>. 2020;5(2). doi:<a href=\"https://doi.org/10.1088/2058-9565/ab788a\">10.1088/2058-9565/ab788a</a>","ista":"Lauk N, Sinclair N, Barzanjeh S, Covey JP, Saffman M, Spiropulu M, Simon C. 2020. Perspectives on quantum transduction. Quantum Science and Technology. 5(2), 020501.","short":"N. Lauk, N. Sinclair, S. Barzanjeh, J.P. Covey, M. Saffman, M. Spiropulu, C. Simon, Quantum Science and Technology 5 (2020).","ieee":"N. Lauk <i>et al.</i>, “Perspectives on quantum transduction,” <i>Quantum Science and Technology</i>, vol. 5, no. 2. IOP Publishing, 2020.","chicago":"Lauk, Nikolai, Neil Sinclair, Shabir Barzanjeh, Jacob P Covey, Mark Saffman, Maria Spiropulu, and Christoph Simon. “Perspectives on Quantum Transduction.” <i>Quantum Science and Technology</i>. IOP Publishing, 2020. <a href=\"https://doi.org/10.1088/2058-9565/ab788a\">https://doi.org/10.1088/2058-9565/ab788a</a>.","apa":"Lauk, N., Sinclair, N., Barzanjeh, S., Covey, J. P., Saffman, M., Spiropulu, M., &#38; Simon, C. (2020). Perspectives on quantum transduction. <i>Quantum Science and Technology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/2058-9565/ab788a\">https://doi.org/10.1088/2058-9565/ab788a</a>","mla":"Lauk, Nikolai, et al. “Perspectives on Quantum Transduction.” <i>Quantum Science and Technology</i>, vol. 5, no. 2, 020501, IOP Publishing, 2020, doi:<a href=\"https://doi.org/10.1088/2058-9565/ab788a\">10.1088/2058-9565/ab788a</a>."},"publication_identifier":{"issn":["2058-9565"]},"abstract":[{"lang":"eng","text":"Quantum transduction, the process of converting quantum signals from one form of energy to another, is an important area of quantum science and technology. The present perspective article reviews quantum transduction between microwave and optical photons, an area that has recently seen a lot of activity and progress because of its relevance for connecting superconducting quantum processors over long distances, among other applications. Our review covers the leading approaches to achieving such transduction, with an emphasis on those based on atomic ensembles, opto-electro-mechanics, and electro-optics. We briefly discuss relevant metrics from the point of view of different applications, as well as challenges for the future."}],"scopus_import":"1","type":"journal_article","file_date_updated":"2021-03-02T09:47:13Z"},{"department":[{"_id":"JoFi"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Wiley","has_accepted_license":"1","file":[{"date_updated":"2021-03-02T12:30:03Z","date_created":"2021-03-02T12:30:03Z","file_name":"2020_AdvQuantumTech_Lambert.pdf","success":1,"relation":"main_file","checksum":"157e95abd6883c3b35b0fa78ae10775e","access_level":"open_access","creator":"dernst","file_size":2410114,"file_id":"9216","content_type":"application/pdf"}],"title":"Coherent conversion between microwave and optical photons - An overview of physical implementations","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Nicholas J.","last_name":"Lambert","full_name":"Lambert, Nicholas J."},{"id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R","last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R"},{"last_name":"Sedlmeir","first_name":"Florian","full_name":"Sedlmeir, Florian"},{"last_name":"Schwefel","first_name":"Harald G. L.","full_name":"Schwefel, Harald G. L."}],"publication_status":"published","file_date_updated":"2021-03-02T12:30:03Z","type":"journal_article","abstract":[{"lang":"eng","text":"Quantum information technology based on solid state qubits has created much interest in converting quantum states from the microwave to the optical domain. Optical photons, unlike microwave photons, can be transmitted by fiber, making them suitable for long distance quantum communication. Moreover, the optical domain offers access to a large set of very well‐developed quantum optical tools, such as highly efficient single‐photon detectors and long‐lived quantum memories. For a high fidelity microwave to optical transducer, efficient conversion at single photon level and low added noise is needed. Currently, the most promising approaches to build such systems are based on second‐order nonlinear phenomena such as optomechanical and electro‐optic interactions. Alternative approaches, although not yet as efficient, include magneto‐optical coupling and schemes based on isolated quantum systems like atoms, ions, or quantum dots. Herein, the necessary theoretical foundations for the most important microwave‐to‐optical conversion experiments are provided, their implementations are described, and the current limitations and future prospects are discussed."}],"publication_identifier":{"issn":["2511-9044"]},"citation":{"chicago":"Lambert, Nicholas J., Alfredo R Rueda Sanchez, Florian Sedlmeir, and Harald G. L. Schwefel. “Coherent Conversion between Microwave and Optical Photons - An Overview of Physical Implementations.” <i>Advanced Quantum Technologies</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/qute.201900077\">https://doi.org/10.1002/qute.201900077</a>.","ista":"Lambert NJ, Rueda Sanchez AR, Sedlmeir F, Schwefel HGL. 2020. Coherent conversion between microwave and optical photons - An overview of physical implementations. Advanced Quantum Technologies. 3(1), 1900077.","ieee":"N. J. Lambert, A. R. Rueda Sanchez, F. Sedlmeir, and H. G. L. Schwefel, “Coherent conversion between microwave and optical photons - An overview of physical implementations,” <i>Advanced Quantum Technologies</i>, vol. 3, no. 1. Wiley, 2020.","short":"N.J. Lambert, A.R. Rueda Sanchez, F. Sedlmeir, H.G.L. Schwefel, Advanced Quantum Technologies 3 (2020).","ama":"Lambert NJ, Rueda Sanchez AR, Sedlmeir F, Schwefel HGL. Coherent conversion between microwave and optical photons - An overview of physical implementations. <i>Advanced Quantum Technologies</i>. 2020;3(1). doi:<a href=\"https://doi.org/10.1002/qute.201900077\">10.1002/qute.201900077</a>","mla":"Lambert, Nicholas J., et al. “Coherent Conversion between Microwave and Optical Photons - An Overview of Physical Implementations.” <i>Advanced Quantum Technologies</i>, vol. 3, no. 1, 1900077, Wiley, 2020, doi:<a href=\"https://doi.org/10.1002/qute.201900077\">10.1002/qute.201900077</a>.","apa":"Lambert, N. J., Rueda Sanchez, A. R., Sedlmeir, F., &#38; Schwefel, H. G. L. (2020). Coherent conversion between microwave and optical photons - An overview of physical implementations. <i>Advanced Quantum Technologies</i>. Wiley. <a href=\"https://doi.org/10.1002/qute.201900077\">https://doi.org/10.1002/qute.201900077</a>"},"quality_controlled":"1","_id":"9195","license":"https://creativecommons.org/licenses/by-nc/4.0/","external_id":{"isi":["000548088300001"]},"year":"2020","article_number":"1900077","acknowledgement":"The authors thank Amita Deb for useful comments on this manuscript. The authors acknowledge support from the MBIE of New Zealand Endeavour Smart Ideas fund. The reference numbers in Figure 8 were corrected in April 2020, after online publication.","intvolume":"         3","month":"01","date_published":"2020-01-01T00:00:00Z","issue":"1","oa":1,"date_updated":"2023-08-24T13:53:02Z","doi":"10.1002/qute.201900077","publication":"Advanced Quantum Technologies","isi":1,"oa_version":"Published Version","related_material":{"link":[{"relation":"poster","description":"Cover Page","url":"https://doi.org/10.1002/qute.202070011"}]},"volume":3,"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"},"date_created":"2021-02-25T08:52:36Z","ddc":["530"]},{"publication_status":"published","_id":"9196","quality_controlled":"1","citation":{"ama":"Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. <i>Studia Mathematica</i>. 2020;252(3):251-297. doi:<a href=\"https://doi.org/10.4064/sm180411-11-2\">10.4064/sm180411-11-2</a>","short":"S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297.","ieee":"S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” <i>Studia Mathematica</i>, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297, 2020.","ista":"Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 252(3), 251–297.","chicago":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” <i>Studia Mathematica</i>. Instytut Matematyczny, 2020. <a href=\"https://doi.org/10.4064/sm180411-11-2\">https://doi.org/10.4064/sm180411-11-2</a>.","apa":"Hensel, S., &#38; Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. <i>Studia Mathematica</i>. Instytut Matematyczny. <a href=\"https://doi.org/10.4064/sm180411-11-2\">https://doi.org/10.4064/sm180411-11-2</a>","mla":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” <i>Studia Mathematica</i>, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:<a href=\"https://doi.org/10.4064/sm180411-11-2\">10.4064/sm180411-11-2</a>."},"publication_identifier":{"eissn":["1730-6337"],"issn":["0039-3223"]},"type":"journal_article","arxiv":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \\textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces."}],"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"JuFi"},{"_id":"GradSch"}],"title":"Modelled distributions of Triebel–Lizorkin type","author":[{"full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","orcid":"0000-0001-7252-8072","last_name":"Hensel"},{"last_name":"Rosati","first_name":"Tommaso","full_name":"Rosati, Tommaso"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Instytut Matematyczny","isi":1,"oa_version":"Preprint","doi":"10.4064/sm180411-11-2","publication":"Studia Mathematica","date_created":"2021-02-25T08:55:03Z","day":"01","status":"public","volume":252,"year":"2020","page":"251-297","external_id":{"isi":["000558100500002"],"arxiv":["1709.05202"]},"date_updated":"2023-10-17T09:15:53Z","keyword":["General Mathematics"],"issue":"3","intvolume":"       252","month":"03","date_published":"2020-03-01T00:00:00Z"},{"publisher":"Association for the Advancement of Artificial Intelligence","author":[{"full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus"},{"orcid":"0000-0002-1097-9684","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","full_name":"Tkadlec, Josef"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"All-pay bidding games on graphs","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve."}],"scopus_import":"1","arxiv":1,"type":"journal_article","publication_identifier":{"isbn":["9781577358350"],"eissn":["2374-3468"],"issn":["2159-5399"]},"citation":{"apa":"Avni, G., Ibsen-Jensen, R., &#38; Tkadlec, J. (2020). All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2020;34(02):1798-1805. doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>."},"quality_controlled":"1","_id":"9197","publication_status":"published","project":[{"grant_number":"S11402-N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"M02369","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","date_published":"2020-04-03T00:00:00Z","month":"04","intvolume":"        34","issue":"02","date_updated":"2023-09-05T12:40:00Z","conference":{"location":"New York, NY, United States","name":"AAAI: Conference on Artificial Intelligence","start_date":"2020-02-07","end_date":"2020-02-12"},"external_id":{"arxiv":["1911.08360"]},"page":"1798-1805","year":"2020","volume":34,"day":"03","status":"public","date_created":"2021-02-25T09:05:18Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","doi":"10.1609/aaai.v34i02.5546","oa_version":"Preprint"},{"title":"Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks","author":[{"first_name":"Alexander","last_name":"Shevchenko","full_name":"Shevchenko, Alexander"},{"full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2021-03-02T15:38:14Z","date_created":"2021-03-02T15:38:14Z","file_name":"2020_PMLR_Shevchenko.pdf","success":1,"checksum":"f042c8d4316bd87c6361aa76f1fbdbbe","relation":"main_file","access_level":"open_access","file_size":5336380,"creator":"dernst","file_id":"9217","content_type":"application/pdf"}],"has_accepted_license":"1","publisher":"ML Research Press","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"MaMo"}],"_id":"9198","quality_controlled":"1","citation":{"mla":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” <i>Proceedings of the 37th International Conference on Machine Learning</i>, vol. 119, ML Research Press, 2020, pp. 8773–84.","apa":"Shevchenko, A., &#38; Mondelli, M. (2020). Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In <i>Proceedings of the 37th International Conference on Machine Learning</i> (Vol. 119, pp. 8773–8784). ML Research Press.","chicago":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” In <i>Proceedings of the 37th International Conference on Machine Learning</i>, 119:8773–84. ML Research Press, 2020.","short":"A. Shevchenko, M. Mondelli, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 8773–8784.","ista":"Shevchenko A, Mondelli M. 2020. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. Proceedings of the 37th International Conference on Machine Learning. vol. 119, 8773–8784.","ieee":"A. Shevchenko and M. Mondelli, “Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks,” in <i>Proceedings of the 37th International Conference on Machine Learning</i>, 2020, vol. 119, pp. 8773–8784.","ama":"Shevchenko A, Mondelli M. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In: <i>Proceedings of the 37th International Conference on Machine Learning</i>. Vol 119. ML Research Press; 2020:8773-8784."},"abstract":[{"lang":"eng","text":"The optimization of multilayer neural networks typically leads to a solution\r\nwith zero training error, yet the landscape can exhibit spurious local minima\r\nand the minima can be disconnected. In this paper, we shed light on this\r\nphenomenon: we show that the combination of stochastic gradient descent (SGD)\r\nand over-parameterization makes the landscape of multilayer neural networks\r\napproximately connected and thus more favorable to optimization. More\r\nspecifically, we prove that SGD solutions are connected via a piecewise linear\r\npath, and the increase in loss along this path vanishes as the number of\r\nneurons grows large. This result is a consequence of the fact that the\r\nparameters found by SGD are increasingly dropout stable as the network becomes\r\nwider. We show that, if we remove part of the neurons (and suitably rescale the\r\nremaining ones), the change in loss is independent of the total number of\r\nneurons, and it depends only on how many neurons are left. Our results exhibit\r\na mild dependence on the input dimension: they are dimension-free for two-layer\r\nnetworks and depend linearly on the dimension for multilayer networks. We\r\nvalidate our theoretical findings with numerical experiments for different\r\narchitectures and classification tasks."}],"arxiv":1,"type":"conference","file_date_updated":"2021-03-02T15:38:14Z","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"publication_status":"published","date_updated":"2024-09-10T13:03:19Z","oa":1,"date_published":"2020-07-13T00:00:00Z","month":"07","intvolume":"       119","acknowledgement":"M. Mondelli was partially supported by the 2019 LopezLoreta Prize. The authors thank Phan-Minh Nguyen for helpful discussions and the IST Distributed Algorithms and Systems Lab for providing computational resources.","year":"2020","page":"8773-8784","external_id":{"arxiv":["1912.10095"]},"date_created":"2021-02-25T09:36:22Z","ddc":["000"],"status":"public","day":"13","volume":119,"oa_version":"Published Version","publication":"Proceedings of the 37th International Conference on Machine Learning"},{"publication_status":"published","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function."}],"file_date_updated":"2021-02-26T16:38:14Z","type":"conference","citation":{"mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” <i>2020 IEEE Real-Time Systems Symposium</i>, IEEE, 2020, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">10.1109/RTSS49844.2020.00031</a>.","apa":"Garcia Soto, M., &#38; Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In <i>2020 IEEE Real-Time Systems Symposium</i> (pp. 244–256). Houston, TX, USA : IEEE. <a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">https://doi.org/10.1109/RTSS49844.2020.00031</a>","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In <i>2020 IEEE Real-Time Systems Symposium</i>, 244–56. IEEE, 2020. <a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">https://doi.org/10.1109/RTSS49844.2020.00031</a>.","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: <i>2020 IEEE Real-Time Systems Symposium</i>. IEEE; 2020:244-256. doi:<a href=\"https://doi.org/10.1109/RTSS49844.2020.00031\">10.1109/RTSS49844.2020.00031</a>","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in <i>2020 IEEE Real-Time Systems Symposium</i>, Houston, TX, USA , 2020, pp. 244–256.","short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256."},"publication_identifier":{"eissn":["2576-3172"],"eisbn":["9781728183244"]},"quality_controlled":"1","_id":"9202","department":[{"_id":"ToHe"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"IEEE","has_accepted_license":"1","author":[{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","orcid":"0000-0003-2936-5719","last_name":"Garcia Soto","full_name":"Garcia Soto, Miriam"},{"full_name":"Prabhakar, Pavithra","first_name":"Pavithra","last_name":"Prabhakar"}],"title":"Hybridization for stability verification of nonlinear switched systems","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","access_level":"open_access","checksum":"8f97f229316c3b3a6f0cf99297aa0941","content_type":"application/pdf","file_id":"9203","file_size":1125794,"creator":"mgarcias","date_created":"2021-02-26T16:38:14Z","date_updated":"2021-02-26T16:38:14Z","file_name":"main.pdf"}],"publication":"2020 IEEE Real-Time Systems Symposium","doi":"10.1109/RTSS49844.2020.00031","oa_version":"Submitted Version","isi":1,"status":"public","day":"01","ddc":["000"],"date_created":"2021-02-26T16:38:24Z","conference":{"name":"RTTS: Real-Time Systems Symposium","start_date":"2020-12-01","end_date":"2020-12-04","location":"Houston, TX, USA "},"page":"244-256","external_id":{"isi":["000680435100021"]},"year":"2020","acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","date_published":"2020-12-01T00:00:00Z","month":"12","oa":1,"date_updated":"2024-02-22T13:25:19Z"},{"author":[{"full_name":"Laccone, Francesco","first_name":"Francesco","last_name":"Laccone"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"full_name":"Perez Rodriguez, Jesus","last_name":"Perez Rodriguez","first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietroni, Nico","last_name":"Pietroni","first_name":"Nico"},{"full_name":"Ponchio, Federico","first_name":"Federico","last_name":"Ponchio"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"}],"title":"A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"BeBi"}],"_id":"9208","quality_controlled":"1","citation":{"apa":"Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., &#38; Cignoni, P. (2020). A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. <i>SN Applied Sciences</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s42452-020-03305-w\">https://doi.org/10.1007/s42452-020-03305-w</a>","mla":"Laccone, Francesco, et al. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” <i>SN Applied Sciences</i>, vol. 2, no. 9, 1505, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1007/s42452-020-03305-w\">10.1007/s42452-020-03305-w</a>.","ama":"Laccone F, Malomo L, Perez Rodriguez J, et al. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. <i>SN Applied Sciences</i>. 2020;2(9). doi:<a href=\"https://doi.org/10.1007/s42452-020-03305-w\">10.1007/s42452-020-03305-w</a>","ieee":"F. Laccone <i>et al.</i>, “A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion,” <i>SN Applied Sciences</i>, vol. 2, no. 9. Springer Nature, 2020.","ista":"Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2020. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2(9), 1505.","short":"F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, SN Applied Sciences 2 (2020).","chicago":"Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” <i>SN Applied Sciences</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s42452-020-03305-w\">https://doi.org/10.1007/s42452-020-03305-w</a>."},"publication_identifier":{"eissn":["25233971"]},"scopus_import":"1","abstract":[{"lang":"eng","text":"Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype."}],"type":"journal_article","publication_status":"published","date_updated":"2021-03-03T09:43:14Z","issue":"9","date_published":"2020-09-01T00:00:00Z","month":"09","intvolume":"         2","acknowledgement":"The FlexMaps Pavilion has been awarded First Prize at the “Competition and Exhibition of innovative lightweight structures” organized by the IASS Working Group 21 within the FORM and FORCE, joint international conference of IASS Symposium 2019 and Structural Membranes 2019 (Barcelona, 7-11 October 2019) with the following motivation: “for its structural innovation of bending-twisting system, connection constructability and exquisite craftmanship”[20]. The authors would like to acknowledge the Visual Computing Lab Staff of ISTI - CNR, in particular Thomas Alderighi, Marco Callieri, Paolo Pingi; Antonio Rizzo of IPCF - CNR; and the Administrative Staff of ISTI - CNR. This research was partially funded by the EU H2020 Programme EVOCATION: Advanced Visual and Geometric Computing for 3D Capture, Display, and Fabrication (grant no. 813170).","article_number":"1505","year":"2020","date_created":"2021-02-28T23:01:25Z","status":"public","day":"01","volume":2,"oa_version":"None","publication":"SN Applied Sciences","doi":"10.1007/s42452-020-03305-w"},{"volume":33,"date_created":"2021-03-03T12:06:02Z","status":"public","day":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.07867"}],"publication":"34th Conference on Neural Information Processing Systems","oa_version":"Preprint","month":"07","intvolume":"        33","date_published":"2020-07-07T00:00:00Z","acknowledgement":"The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1.","date_updated":"2024-09-10T13:03:17Z","oa":1,"page":"11961–11972","external_id":{"arxiv":["2002.07867"]},"conference":{"location":"Vancouver, Canada","start_date":"2020-12-06","end_date":"2020-12-12","name":"NeurIPS: Neural Information Processing Systems"},"year":"2020","citation":{"ieee":"Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in <i>34th Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.","ista":"Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972.","short":"Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 11961–11972.","ama":"Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: <i>34th Conference on Neural Information Processing Systems</i>. Vol 33. Curran Associates; 2020:11961–11972.","chicago":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In <i>34th Conference on Neural Information Processing Systems</i>, 33:11961–11972. Curran Associates, 2020.","apa":"Nguyen, Q., &#38; Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In <i>34th Conference on Neural Information Processing Systems</i> (Vol. 33, pp. 11961–11972). Vancouver, Canada: Curran Associates.","mla":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” <i>34th Conference on Neural Information Processing Systems</i>, vol. 33, Curran Associates, 2020, pp. 11961–11972."},"type":"conference","abstract":[{"lang":"eng","text":"Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n"}],"arxiv":1,"_id":"9221","quality_controlled":"1","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"publication_status":"published","publisher":"Curran Associates","title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","author":[{"last_name":"Nguyen","first_name":"Quynh","full_name":"Nguyen, Quynh"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","department":[{"_id":"MaMo"}],"language":[{"iso":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Katsaros, Georgios","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","orcid":"0000-0001-8342-202X"}],"oa":1,"title":"Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling","file":[{"access_level":"open_access","checksum":"41b66e195ed3dbd73077feee77b05652","relation":"main_file","content_type":"application/x-zip-compressed","file_id":"9223","creator":"gkatsaro","file_size":13317557,"date_created":"2021-03-05T17:50:45Z","date_updated":"2021-03-05T17:50:45Z","file_name":"DOI_SiteControlledHWs.zip"},{"relation":"main_file","access_level":"open_access","checksum":"a1dc5f710ba4b3bb7f248195ba754ab2","file_size":3515,"creator":"dernst","file_id":"9233","content_type":"text/plain","date_updated":"2021-03-10T07:31:50Z","date_created":"2021-03-10T07:31:50Z","file_name":"Readme.txt","success":1}],"date_updated":"2024-02-21T12:42:13Z","publisher":"Institute of Science and Technology Austria","date_published":"2020-03-16T00:00:00Z","has_accepted_license":"1","month":"03","year":"2020","license":"https://creativecommons.org/publicdomain/zero/1.0/","department":[{"_id":"GeKa"}],"article_processing_charge":"No","day":"16","status":"public","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"ddc":["530"],"_id":"9222","date_created":"2021-03-05T18:00:47Z","file_date_updated":"2021-03-10T07:31:50Z","type":"research_data","citation":{"mla":"Katsaros, Georgios. <i>Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9222\">10.15479/AT:ISTA:9222</a>.","apa":"Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9222\">https://doi.org/10.15479/AT:ISTA:9222</a>","chicago":"Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:9222\">https://doi.org/10.15479/AT:ISTA:9222</a>.","ista":"Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9222\">10.15479/AT:ISTA:9222</a>.","short":"G. Katsaros, (2020).","ieee":"G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.","ama":"Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9222\">10.15479/AT:ISTA:9222</a>"},"oa_version":"Published Version","contributor":[{"last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","contributor_type":"research_group"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"7541"}]},"doi":"10.15479/AT:ISTA:9222"},{"date_updated":"2021-03-22T09:01:50Z","issue":"1","oa":1,"month":"11","intvolume":"         4","date_published":"2020-11-17T00:00:00Z","acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","year":"2020","page":"143-158","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"],"date_created":"2021-03-16T08:55:19Z","day":"17","status":"public","volume":4,"ec_funded":1,"oa_version":"Published Version","doi":"10.1515/mathm-2020-0106","publication":"Mathematical Morphology - Theory and Applications","file":[{"date_updated":"2021-03-22T08:56:37Z","date_created":"2021-03-22T08:56:37Z","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","success":1,"checksum":"4a1043fa0548a725d464017fe2483ce0","relation":"main_file","access_level":"open_access","creator":"dernst","file_size":3668725,"file_id":"9272","content_type":"application/pdf"}],"title":"Digital objects in rhombic dodecahedron grid","author":[{"orcid":"0000-0002-5372-7890","last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita"},{"full_name":"Largeteau-Skapin, Gaëlle","first_name":"Gaëlle","last_name":"Largeteau-Skapin"},{"full_name":"Zrour, Rita","first_name":"Rita","last_name":"Zrour"},{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"De Gruyter","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"HeEd"}],"_id":"9249","quality_controlled":"1","publication_identifier":{"issn":["2353-3390"]},"citation":{"ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. <i>Mathematical Morphology - Theory and Applications</i>. 2020;4(1):143-158. doi:<a href=\"https://doi.org/10.1515/mathm-2020-0106\">10.1515/mathm-2020-0106</a>","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” <i>Mathematical Morphology - Theory and Applications</i>, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158.","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” <i>Mathematical Morphology - Theory and Applications</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/mathm-2020-0106\">https://doi.org/10.1515/mathm-2020-0106</a>.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., &#38; Andres, E. (2020). Digital objects in rhombic dodecahedron grid. <i>Mathematical Morphology - Theory and Applications</i>. De Gruyter. <a href=\"https://doi.org/10.1515/mathm-2020-0106\">https://doi.org/10.1515/mathm-2020-0106</a>","mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” <i>Mathematical Morphology - Theory and Applications</i>, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:<a href=\"https://doi.org/10.1515/mathm-2020-0106\">10.1515/mathm-2020-0106</a>."},"file_date_updated":"2021-03-22T08:56:37Z","type":"journal_article","abstract":[{"text":"Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.","lang":"eng"}],"project":[{"grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"publication_status":"published"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Crossings between non-homotopic edges","author":[{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach","full_name":"Pach, János"},{"full_name":"Tardos, Gábor","last_name":"Tardos","first_name":"Gábor"},{"last_name":"Tóth","first_name":"Géza","full_name":"Tóth, Géza"}],"publisher":"Springer Nature","project":[{"name":"The Wittgenstein Prize","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"}],"publication_status":"published","_id":"9299","quality_controlled":"1","citation":{"mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” <i>28th International Symposium on Graph Drawing and Network Visualization</i>, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:<a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">10.1007/978-3-030-68766-3_28</a>.","apa":"Pach, J., Tardos, G., &#38; Tóth, G. (2020). Crossings between non-homotopic edges. In <i>28th International Symposium on Graph Drawing and Network Visualization</i> (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">https://doi.org/10.1007/978-3-030-68766-3_28</a>","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In <i>28th International Symposium on Graph Drawing and Network Visualization</i>, 12590:359–71. LNCS. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">https://doi.org/10.1007/978-3-030-68766-3_28</a>.","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: <i>28th International Symposium on Graph Drawing and Network Visualization</i>. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:<a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">10.1007/978-3-030-68766-3_28</a>","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in <i>28th International Symposium on Graph Drawing and Network Visualization</i>, Virtual, Online, 2020, vol. 12590, pp. 359–371.","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371."},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030687656"],"eissn":["1611-3349"]},"scopus_import":"1","arxiv":1,"abstract":[{"text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on   n>1  vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and   m>4n  edges is larger than   cm2n  for some constant   c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and   m⟶∞ .","lang":"eng"}],"type":"conference","year":"2020","external_id":{"arxiv":["2006.14908"]},"page":"359-371","series_title":"LNCS","conference":{"name":"GD: Graph Drawing and Network Visualization","end_date":"2020-09-18","start_date":"2020-09-16","location":"Virtual, Online"},"date_updated":"2021-04-06T11:32:32Z","oa":1,"date_published":"2020-09-20T00:00:00Z","month":"09","intvolume":"     12590","acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","oa_version":"Preprint","publication":"28th International Symposium on Graph Drawing and Network Visualization","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"doi":"10.1007/978-3-030-68766-3_28","date_created":"2021-03-28T22:01:44Z","status":"public","day":"20","volume":12590}]