[{"date_created":"2020-08-24T06:24:03Z","doi":"10.3390/ijms21165727","date_published":"2020-08-10T00:00:00Z","year":"2020","isi":1,"has_accepted_license":"1","publication":"International Journal of Molecular Sciences","day":"10","oa":1,"quality_controlled":"1","publisher":"MDPI","acknowledgement":"We would like to thank the reviewers for their helpful comments on the original manuscript. ","external_id":{"isi":["000565090300001"],"pmid":["32785037"]},"article_processing_charge":"No","author":[{"first_name":"Huihuang","last_name":"Chen","full_name":"Chen, Huihuang"},{"first_name":"Linyi","last_name":"Lai","full_name":"Lai, Linyi"},{"first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Lanxin","orcid":"0000-0002-5607-272X","last_name":"Li"},{"full_name":"Liu, Liping","last_name":"Liu","first_name":"Liping"},{"first_name":"Bello Hassan","full_name":"Jakada, Bello Hassan","last_name":"Jakada"},{"first_name":"Youmei","full_name":"Huang, Youmei","last_name":"Huang"},{"first_name":"Qing","last_name":"He","full_name":"He, Qing"},{"full_name":"Chai, Mengnan","last_name":"Chai","first_name":"Mengnan"},{"first_name":"Xiaoping","full_name":"Niu, Xiaoping","last_name":"Niu"},{"first_name":"Yuan","last_name":"Qin","full_name":"Qin, Yuan"}],"title":"AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling","citation":{"ista":"Chen H, Lai L, Li L, Liu L, Jakada BH, Huang Y, He Q, Chai M, Niu X, Qin Y. 2020. AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling. International Journal of Molecular Sciences. 21(16), 5272.","chicago":"Chen, Huihuang, Linyi Lai, Lanxin Li, Liping Liu, Bello Hassan Jakada, Youmei Huang, Qing He, Mengnan Chai, Xiaoping Niu, and Yuan Qin. “AcoMYB4, an Ananas Comosus L. MYB Transcription Factor, Functions in Osmotic Stress through Negative Regulation of ABA Signaling.” International Journal of Molecular Sciences. MDPI, 2020. https://doi.org/10.3390/ijms21165727.","short":"H. Chen, L. Lai, L. Li, L. Liu, B.H. Jakada, Y. Huang, Q. He, M. Chai, X. Niu, Y. Qin, International Journal of Molecular Sciences 21 (2020).","ieee":"H. Chen et al., “AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling,” International Journal of Molecular Sciences, vol. 21, no. 16. MDPI, 2020.","apa":"Chen, H., Lai, L., Li, L., Liu, L., Jakada, B. H., Huang, Y., … Qin, Y. (2020). AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms21165727","ama":"Chen H, Lai L, Li L, et al. AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling. International Journal of Molecular Sciences. 2020;21(16). doi:10.3390/ijms21165727","mla":"Chen, Huihuang, et al. “AcoMYB4, an Ananas Comosus L. MYB Transcription Factor, Functions in Osmotic Stress through Negative Regulation of ABA Signaling.” International Journal of Molecular Sciences, vol. 21, no. 16, 5272, MDPI, 2020, doi:10.3390/ijms21165727."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_number":"5272","issue":"16","volume":21,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10083"}]},"publication_status":"published","publication_identifier":{"eissn":["14220067"],"issn":["16616596"]},"language":[{"iso":"eng"}],"file":[{"creator":"cziletti","file_size":5718755,"date_updated":"2020-08-25T09:53:50Z","file_name":"2020_IntMolecSciences_Chen.pdf","date_created":"2020-08-25T09:53:50Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8292","checksum":"03b039244e6ae80580385fd9f577e2b2"}],"scopus_import":"1","intvolume":" 21","month":"08","abstract":[{"lang":"eng","text":"Drought and salt stress are the main environmental cues affecting the survival, development, distribution, and yield of crops worldwide. MYB transcription factors play a crucial role in plants’ biological processes, but the function of pineapple MYB genes is still obscure. In this study, one of the pineapple MYB transcription factors, AcoMYB4, was isolated and characterized. The results showed that AcoMYB4 is localized in the cell nucleus, and its expression is induced by low temperature, drought, salt stress, and hormonal stimulation, especially by abscisic acid (ABA). Overexpression of AcoMYB4 in rice and Arabidopsis enhanced plant sensitivity to osmotic stress; it led to an increase in the number stomata on leaf surfaces and lower germination rate under salt and drought stress. Furthermore, in AcoMYB4 OE lines, the membrane oxidation index, free proline, and soluble sugar contents were decreased. In contrast, electrolyte leakage and malondialdehyde (MDA) content increased significantly due to membrane injury, indicating higher sensitivity to drought and salinity stresses. Besides the above, both the expression level and activities of several antioxidant enzymes were decreased, indicating lower antioxidant activity in AcoMYB4 transgenic plants. Moreover, under osmotic stress, overexpression of AcoMYB4 inhibited ABA biosynthesis through a decrease in the transcription of genes responsible for ABA synthesis (ABA1 and ABA2) and ABA signal transduction factor ABI5. These results suggest that AcoMYB4 negatively regulates osmotic stress by attenuating cellular ABA biosynthesis and signal transduction pathways. "}],"pmid":1,"oa_version":"Published Version","department":[{"_id":"JiFr"}],"file_date_updated":"2020-08-25T09:53:50Z","date_updated":"2024-03-27T23:30:43Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"8283"},{"project":[{"_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"article_number":"jcs248062","title":"Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis","author":[{"id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander J","last_name":"Johnson","full_name":"Johnson, Alexander J","orcid":"0000-0002-2739-8843"},{"first_name":"Nataliia","id":"390C1120-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2198-0509","full_name":"Gnyliukh, Nataliia","last_name":"Gnyliukh"},{"orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter","last_name":"Kaufmann","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","first_name":"Walter"},{"first_name":"Madhumitha","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","full_name":"Narasimhan, Madhumitha","orcid":"0000-0002-8600-0671","last_name":"Narasimhan"},{"last_name":"Vert","full_name":"Vert, G","first_name":"G"},{"first_name":"SY","full_name":"Bednarek, SY","last_name":"Bednarek"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"external_id":{"isi":["000561047900021"],"pmid":["32616560"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Johnson AJ, Gnyliukh N, Kaufmann W, Narasimhan M, Vert G, Bednarek S, Friml J. 2020. Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis. Journal of Cell Science. 133(15), jcs248062.","chicago":"Johnson, Alexander J, Nataliia Gnyliukh, Walter Kaufmann, Madhumitha Narasimhan, G Vert, SY Bednarek, and Jiří Friml. “Experimental Toolbox for Quantitative Evaluation of Clathrin-Mediated Endocytosis in the Plant Model Arabidopsis.” Journal of Cell Science. The Company of Biologists, 2020. https://doi.org/10.1242/jcs.248062.","short":"A.J. Johnson, N. Gnyliukh, W. Kaufmann, M. Narasimhan, G. Vert, S. Bednarek, J. Friml, Journal of Cell Science 133 (2020).","ieee":"A. J. Johnson et al., “Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis,” Journal of Cell Science, vol. 133, no. 15. The Company of Biologists, 2020.","ama":"Johnson AJ, Gnyliukh N, Kaufmann W, et al. Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis. Journal of Cell Science. 2020;133(15). doi:10.1242/jcs.248062","apa":"Johnson, A. J., Gnyliukh, N., Kaufmann, W., Narasimhan, M., Vert, G., Bednarek, S., & Friml, J. (2020). Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis. Journal of Cell Science. The Company of Biologists. https://doi.org/10.1242/jcs.248062","mla":"Johnson, Alexander J., et al. “Experimental Toolbox for Quantitative Evaluation of Clathrin-Mediated Endocytosis in the Plant Model Arabidopsis.” Journal of Cell Science, vol. 133, no. 15, jcs248062, The Company of Biologists, 2020, doi:10.1242/jcs.248062."},"quality_controlled":"1","publisher":"The Company of Biologists","oa":1,"acknowledgement":"This paper is dedicated to the memory of Christien Merrifield. He pioneered quantitative\r\nimaging approaches in mammalian CME and his mentorship inspired the development of all\r\nthe analysis methods presented here. His joy in research, pure scientific curiosity and\r\nmicroscopy excellence remain a constant inspiration. We thank Daniel Van Damme for gifting\r\nus the CLC2-GFP x TPLATE-TagRFP plants used in this manuscript. We further thank the\r\nScientific Service Units at IST Austria; specifically, the Electron Microscopy Facility for\r\ntechnical assistance (in particular Vanessa Zheden) and the BioImaging Facility BioImaging\r\nFacility for access to equipment. ","date_published":"2020-08-06T00:00:00Z","doi":"10.1242/jcs.248062","date_created":"2020-07-21T08:58:19Z","day":"06","publication":"Journal of Cell Science","has_accepted_license":"1","isi":1,"year":"2020","status":"public","article_type":"original","type":"journal_article","_id":"8139","file_date_updated":"2021-08-08T22:30:03Z","department":[{"_id":"JiFr"},{"_id":"EM-Fac"}],"ddc":["575"],"date_updated":"2023-12-01T13:51:07Z","month":"08","intvolume":" 133","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"text":"Clathrin-mediated endocytosis (CME) is a crucial cellular process implicated in many aspects of plant growth, development, intra- and inter-cellular signaling, nutrient uptake and pathogen defense. Despite these significant roles, little is known about the precise molecular details of how it functions in planta. In order to facilitate the direct quantitative study of plant CME, here we review current routinely used methods and present refined, standardized quantitative imaging protocols which allow the detailed characterization of CME at multiple scales in plant tissues. These include: (i) an efficient electron microscopy protocol for the imaging of Arabidopsis CME vesicles in situ, thus providing a method for the detailed characterization of the ultra-structure of clathrin-coated vesicles; (ii) a detailed protocol and analysis for quantitative live-cell fluorescence microscopy to precisely examine the temporal interplay of endocytosis components during single CME events; (iii) a semi-automated analysis to allow the quantitative characterization of global internalization of cargos in whole plant tissues; and (iv) an overview and validation of useful genetic and pharmacological tools to interrogate the molecular mechanisms and function of CME in intact plant samples.","lang":"eng"}],"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"Bio"}],"issue":"15","related_material":{"record":[{"id":"14510","status":"public","relation":"dissertation_contains"}]},"volume":133,"ec_funded":1,"file":[{"date_created":"2020-11-26T17:12:51Z","file_name":"2020 - Johnson - JSC - plant CME toolbox.pdf","date_updated":"2021-08-08T22:30:03Z","file_size":15150403,"creator":"ajohnson","checksum":"2d11f79a0b4e0a380fb002b933da331a","file_id":"8815","embargo":"2021-08-07","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"publication_status":"published"},{"isi":1,"has_accepted_license":"1","year":"2020","day":"11","publication":"Plant Communications","doi":"10.1016/j.xplc.2020.100048","date_published":"2020-05-11T00:00:00Z","date_created":"2021-02-18T10:18:43Z","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.","quality_controlled":"1","publisher":"Elsevier","oa":1,"citation":{"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.","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.” Plant Communications. Elsevier, 2020. https://doi.org/10.1016/j.xplc.2020.100048.","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. Plant Communications. 2020;1(3). doi:10.1016/j.xplc.2020.100048","apa":"Semerádová, H., Montesinos López, J. C., & Benková, E. (2020). All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. Plant Communications. Elsevier. https://doi.org/10.1016/j.xplc.2020.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,” Plant Communications, vol. 1, no. 3. Elsevier, 2020.","short":"H. Semerádová, J.C. Montesinos López, E. Benková, Plant Communications 1 (2020).","mla":"Semerádová, Hana, et al. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” Plant Communications, vol. 1, no. 3, 100048, Elsevier, 2020, doi:10.1016/j.xplc.2020.100048."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"42FE702E-F248-11E8-B48F-1D18A9856A87","first_name":"Hana","last_name":"Semeradova","full_name":"Semeradova, Hana"},{"first_name":"Juan C","id":"310A8E3E-F248-11E8-B48F-1D18A9856A87","last_name":"Montesinos López","full_name":"Montesinos López, Juan C","orcid":"0000-0001-9179-6099"},{"last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"}],"external_id":{"isi":["000654052800010"],"pmid":["33367243"]},"article_processing_charge":"No","title":"All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways","article_number":"100048","project":[{"grant_number":"24746","name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis.","_id":"261821BC-B435-11E9-9278-68D0E5697425"},{"_id":"253E54C8-B435-11E9-9278-68D0E5697425","grant_number":"ALTF710-2016","name":"Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants"}],"publication_identifier":{"issn":["2590-3462"]},"publication_status":"published","file":[{"file_name":"2020_PlantComm_Semeradova.pdf","date_created":"2021-02-18T10:23:59Z","file_size":840289,"date_updated":"2021-02-18T10:23:59Z","creator":"dernst","success":1,"checksum":"785b266d82a94b007cf40dbbe7c4847e","file_id":"9161","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"issue":"3","related_material":{"record":[{"status":"public","id":"10135","relation":"dissertation_contains"}]},"volume":1,"abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","month":"05","intvolume":" 1","date_updated":"2024-03-27T23:30:46Z","ddc":["580"],"file_date_updated":"2021-02-18T10:23:59Z","department":[{"_id":"EvBe"}],"_id":"9160","article_type":"original","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public"},{"oa":1,"quality_controlled":"1","publisher":"EasyChair","acknowledgement":"The authors gratefully acknowledge \fnancial support by the European Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported by the National Natural Science\r\nFoundation of China (No.61572249).","date_created":"2022-03-18T12:29:23Z","date_published":"2019-05-25T00:00:00Z","doi":"10.29007/rjwn","page":"1-13","publication":"ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems","day":"25","year":"2019","has_accepted_license":"1","editor":[{"first_name":"Goran","full_name":"Frehse, Goran","last_name":"Frehse"},{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"}],"title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","article_processing_charge":"No","author":[{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"first_name":"Dieky","last_name":"Adzkiya","full_name":"Adzkiya, Dieky"},{"first_name":"Anna","full_name":"Becchi, Anna","last_name":"Becchi"},{"first_name":"Lei","last_name":"Bu","full_name":"Bu, Lei"},{"full_name":"Cimatti, Alessandro","last_name":"Cimatti","first_name":"Alessandro"},{"last_name":"Giacobbe","orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco"},{"first_name":"Alberto","last_name":"Griggio","full_name":"Griggio, Alberto"},{"full_name":"Mover, Sergio","last_name":"Mover","first_name":"Sergio"},{"first_name":"Muhammad Syifa'ul","full_name":"Mufid, Muhammad Syifa'ul","last_name":"Mufid"},{"first_name":"Idriss","last_name":"Riouak","full_name":"Riouak, Idriss"},{"first_name":"Stefano","last_name":"Tonetta","full_name":"Tonetta, Stefano"},{"first_name":"Enea","full_name":"Zaffanella, Enea","last_name":"Zaffanella"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series in Computing, vol. 61, 1–13.","chicago":"Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” In ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.","ama":"Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In: Frehse G, Althoff M, eds. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn","apa":"Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella, E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse & M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn","short":"G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe, A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G. Frehse, M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.","ieee":"G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol. 61, pp. 1–13.","mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn."},"intvolume":" 61","month":"05","scopus_import":"1","alternative_title":["EPiC Series in Computing"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with piecewise constant dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been applied to solve five different benchmark problems in the category for piecewise constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL. Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with piecewise constant dynamics up to this date."}],"volume":61,"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"11391","checksum":"4b92e333db7b4e2349501a804dfede69","success":1,"creator":"dernst","date_updated":"2022-05-17T06:55:49Z","file_size":346415,"date_created":"2022-05-17T06:55:49Z","file_name":"2019_EPiCs_Frehse.pdf"}],"publication_status":"published","publication_identifier":{"issn":["2398-7340"]},"status":"public","conference":{"location":"Montreal, Canada","end_date":"2019-04-15","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"type":"conference","_id":"10877","department":[{"_id":"ToHe"}],"file_date_updated":"2022-05-17T06:55:49Z","ddc":["000"],"date_updated":"2022-05-17T07:09:47Z"},{"citation":{"ista":"Kalinin N, Shkolnikov M. 2019. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 5(3), 909–928.","chicago":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40879-018-0218-0.","apa":"Kalinin, N., & Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-018-0218-0","ama":"Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 2019;5(3):909–928. doi:10.1007/s40879-018-0218-0","short":"N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928.","ieee":"N. Kalinin and M. Shkolnikov, “Tropical formulae for summation over a part of SL(2,Z),” European Journal of Mathematics, vol. 5, no. 3. Springer Nature, pp. 909–928, 2019.","mla":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics, vol. 5, no. 3, Springer Nature, 2019, pp. 909–928, doi:10.1007/s40879-018-0218-0."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","external_id":{"arxiv":["1711.02089"]},"article_processing_charge":"No","publist_id":"7382","author":[{"full_name":"Kalinin, Nikita","last_name":"Kalinin","first_name":"Nikita"},{"full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X","last_name":"Shkolnikov","id":"35084A62-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"title":"Tropical formulae for summation over a part of SL(2,Z)","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"year":"2019","publication":"European Journal of Mathematics","day":"15","page":"909–928","date_created":"2018-12-11T11:46:29Z","doi":"10.1007/s40879-018-0218-0","date_published":"2019-09-15T00:00:00Z","oa":1,"publisher":"Springer Nature","quality_controlled":"1","date_updated":"2021-01-12T07:56:46Z","department":[{"_id":"TaHa"}],"_id":"441","article_type":"original","type":"journal_article","status":"public","publication_status":"published","publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"language":[{"iso":"eng"}],"ec_funded":1,"issue":"3","volume":5,"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.02089"}],"scopus_import":1,"intvolume":" 5","month":"09"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:03:30Z","citation":{"mla":"Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14.","ama":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich A, ed. The Hippo Pathway. Vol 1893. Methods in Molecular Biology. Springer; 2019:167-181. doi:10.1007/978-1-4939-8910-2_14","apa":"Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., & Furutani-Seiki, M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In A. Hergovich (Ed.), The hippo pathway (Vol. 1893, pp. 167–181). Springer. https://doi.org/10.1007/978-1-4939-8910-2_14","ieee":"Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki, “Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,” in The hippo pathway, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp. 167–181.","short":"Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki, in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181.","chicago":"Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg, and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” In The Hippo Pathway, edited by Alexander Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. https://doi.org/10.1007/978-1-4939-8910-2_14.","ista":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The hippo pathway. MIMB, vol. 1893, 167–181."},"department":[{"_id":"CaHe"}],"editor":[{"first_name":"Alexander","last_name":"Hergovich","full_name":"Hergovich, Alexander"}],"title":"Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids","author":[{"last_name":"Asaoka","full_name":"Asaoka, Yoichi","first_name":"Yoichi"},{"first_name":"Hitoshi","full_name":"Morita, Hitoshi","last_name":"Morita"},{"first_name":"Hiroko","last_name":"Furumoto","full_name":"Furumoto, Hiroko"},{"last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"},{"last_name":"Furutani-Seiki","full_name":"Furutani-Seiki, Makoto","first_name":"Makoto"}],"series_title":"Methods in Molecular Biology","_id":"5793","status":"public","type":"book_chapter","day":"01","language":[{"iso":"eng"}],"publication":"The hippo pathway","publication_identifier":{"isbn":["978-1-4939-8909-6"]},"year":"2019","publication_status":"published","volume":1893,"date_published":"2019-01-01T00:00:00Z","doi":"10.1007/978-1-4939-8910-2_14","date_created":"2019-01-06T22:59:11Z","page":"167-181","oa_version":"None","abstract":[{"lang":"eng","text":"The transcription coactivator, Yes-associated protein (YAP), which is a nuclear effector of the Hippo signaling pathway, has been shown to be a mechano-transducer. By using mutant fish and human 3D spheroids, we have recently demonstrated that YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis of organ and global body shape by controlling actomyosin-mediated tissue tension. In this chapter, we present a platform that links the findings in fish embryos with human cells. The protocols for analyzing tissue tension-mediated global body shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in vitro using human cell spheroids represent useful tools for unraveling the molecular mechanisms by which YAP functions in regulating global body/organ morphogenesis."}],"month":"01","intvolume":" 1893","publisher":"Springer","quality_controlled":"1","scopus_import":1,"alternative_title":["MIMB"]},{"volume":27,"issue":"1","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0926227X"]},"publication_status":"published","month":"01","intvolume":" 27","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/166"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved."}],"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:05:08Z","status":"public","article_type":"original","type":"journal_article","_id":"5887","date_published":"2019-01-01T00:00:00Z","doi":"10.3233/JCS-181131","date_created":"2019-01-27T22:59:10Z","page":"75-111","day":"1","publication":"Journal of Computer Security","year":"2019","quality_controlled":"1","publisher":"IOS Press","oa":1,"title":"Per-session security: Password-based cryptography revisited","author":[{"full_name":"Demay, Gregory","last_name":"Demay","first_name":"Gregory"},{"first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","full_name":"Gazi, Peter"},{"first_name":"Ueli","last_name":"Maurer","full_name":"Maurer, Ueli"},{"first_name":"Bjorn","last_name":"Tackmann","full_name":"Tackmann, Bjorn"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131","apa":"Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.","chicago":"Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.","ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111."},"project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}]},{"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"6515","file_date_updated":"2020-07-14T12:47:32Z","department":[{"_id":"HeEd"}],"ddc":["510"],"date_updated":"2021-01-12T08:07:50Z","intvolume":" 10","month":"07","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature."}],"ec_funded":1,"issue":"1","volume":10,"language":[{"iso":"eng"}],"file":[{"checksum":"57b4df2f16a74eb499734ec8ee240178","file_id":"6516","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"mainJournalFinal.pdf","date_created":"2019-06-03T09:30:01Z","file_size":2170882,"date_updated":"2020-07-14T12:47:32Z","creator":"mwintrae"}],"publication_status":"published","publication_identifier":{"issn":["1920-180X"]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"title":"Simplices modelled on spaces of constant curvature","author":[{"full_name":"Dyer, Ramsay","last_name":"Dyer","first_name":"Ramsay"},{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9.","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256.","mla":"Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9.","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","ieee":"R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019.","apa":"Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9","ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9"},"oa":1,"quality_controlled":"1","publisher":"Carleton University","date_created":"2019-06-03T09:35:33Z","date_published":"2019-07-01T00:00:00Z","doi":"10.20382/jocg.v10i1a9","page":"223–256","publication":"Journal of Computational Geometry ","day":"01","year":"2019","has_accepted_license":"1"},{"_id":"6528","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2019-01-12","location":"San Diego, CA, United States","start_date":"2019-01-10","name":"ITCS 2019: Innovations in Theoretical Computer Science"},"status":"public","date_updated":"2021-01-12T08:07:53Z","ddc":["000"],"department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:47:33Z","abstract":[{"lang":"eng","text":"We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/627"}],"month":"01","intvolume":" 124","publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"publication_status":"published","file":[{"file_name":"2019_LIPIcs_Pietrzak.pdf","date_created":"2019-06-06T14:22:04Z","creator":"dernst","file_size":558770,"date_updated":"2020-07-14T12:47:33Z","file_id":"6529","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":124,"ec_funded":1,"article_number":"60","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"citation":{"ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60","apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","chicago":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"article_processing_charge":"No","title":"Simple verifiable delay functions","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"has_accepted_license":"1","year":"2019","day":"10","publication":"10th Innovations in Theoretical Computer Science Conference","doi":"10.4230/LIPICS.ITCS.2019.60","date_published":"2019-01-10T00:00:00Z","date_created":"2019-06-06T14:12:36Z"},{"month":"05","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example.","lang":"eng"}],"file":[{"checksum":"d622a91af1e427f6b1e0ba8e18a2b767","file_id":"8687","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-10-21T13:13:49Z","file_name":"2019_ICC_Kundu.pdf","date_updated":"2020-10-21T13:13:49Z","file_size":396031,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-153866246-5"]},"publication_status":"published","status":"public","type":"conference","conference":{"name":"ICC 2019 - Indian Control Conference","location":"Delhi, India","end_date":"2019-01-11","start_date":"2019-01-09"},"_id":"6565","file_date_updated":"2020-10-21T13:13:49Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:08:01Z","quality_controlled":"1","publisher":"IEEE","oa":1,"date_published":"2019-05-16T00:00:00Z","doi":"10.1109/INDIANCC.2019.8715598","date_created":"2019-06-17T06:57:33Z","day":"16","publication":"5th Indian Control Conference Proceedings","has_accepted_license":"1","year":"2019","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"article_number":"8715598","title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","author":[{"full_name":"Kundu, Atreyee","last_name":"Kundu","first_name":"Atreyee"},{"last_name":"Garcia Soto","full_name":"Garcia Soto, Miriam","orcid":"0000−0003−2936−5719","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598.","chicago":"Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598.","ama":"Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598","apa":"Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598","ieee":"A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.","short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","mla":"Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598."}},{"ddc":["004"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:08:16Z","citation":{"ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.","ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79."},"department":[{"_id":"HeEd"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","file_date_updated":"2020-07-14T12:47:34Z","author":[{"full_name":"Vegter, Gert","last_name":"Vegter","first_name":"Gert"},{"last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"_id":"6628","status":"public","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"type":"conference","conference":{"start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10","name":"CCCG: Canadian Conference in Computational Geometry"},"file":[{"checksum":"ceabd152cfa55170d57763f9c6c60a53","file_id":"6629","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IntrinsicExtrinsicCCCG2019.pdf","date_created":"2019-07-12T08:32:46Z","file_size":321176,"date_updated":"2020-07-14T12:47:34Z","creator":"mwintrae"}],"day":"01","language":[{"iso":"eng"}],"publication":"The 31st Canadian Conference in Computational Geometry","has_accepted_license":"1","year":"2019","publication_status":"published","date_published":"2019-08-01T00:00:00Z","date_created":"2019-07-12T08:34:57Z","ec_funded":1,"page":"275-279","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space."}],"month":"08","quality_controlled":"1","scopus_import":1,"oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14.","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31."},"title":"Topological data analysis in information space","external_id":{"arxiv":["1903.08510"]},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Ziga","last_name":"Virk","full_name":"Virk, Ziga"},{"full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"project":[{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication":"35th International Symposium on Computational Geometry","day":"01","year":"2019","has_accepted_license":"1","date_created":"2019-07-17T10:36:09Z","doi":"10.4230/LIPICS.SOCG.2019.31","date_published":"2019-06-01T00:00:00Z","page":"31:1-31:14","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","ddc":["510"],"date_updated":"2021-01-12T08:08:23Z","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:35Z","_id":"6648","status":"public","conference":{"location":"Portland, OR, United States","end_date":"2019-06-21","start_date":"2019-06-18","name":"SoCG 2019: Symposium on Computational Geometry"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:35Z","file_size":1355179,"creator":"dernst","date_created":"2019-07-24T06:40:01Z","file_name":"2019_LIPICS_Edelsbrunner.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"8ec8720730d4c789bf7b06540f1c29f4","file_id":"6666"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771047"]},"volume":129,"oa_version":"Published Version","abstract":[{"text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.","lang":"eng"}],"intvolume":" 129","month":"06","alternative_title":["LIPIcs"],"scopus_import":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034","apa":"Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034","ieee":"N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.","short":"N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.","mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000.","chicago":"Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034."},"title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","article_processing_charge":"No","author":[{"full_name":"Zenmyo, Naoki","last_name":"Zenmyo","first_name":"Naoki"},{"last_name":"Tokumaru","full_name":"Tokumaru, Hiroki","first_name":"Hiroki"},{"first_name":"Shohei","full_name":"Uchinomiya, Shohei","last_name":"Uchinomiya"},{"last_name":"Fuchida","full_name":"Fuchida, Hirokazu","first_name":"Hirokazu"},{"last_name":"Tabata","full_name":"Tabata, Shigekazu","first_name":"Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Itaru","last_name":"Hamachi","full_name":"Hamachi, Itaru"},{"last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Akio","full_name":"Ojida, Akio","last_name":"Ojida"}],"project":[{"_id":"25CA28EA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539"}],"publication":"Bulletin of the Chemical Society of Japan","day":"15","year":"2019","has_accepted_license":"1","date_created":"2019-07-21T21:59:16Z","date_published":"2019-05-15T00:00:00Z","doi":"10.1246/bcsj.20190034","page":"995-1000","acknowledgement":"his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation.","oa":1,"quality_controlled":"1","publisher":"Bulletin of the Chemical Society of Japan","ddc":["570"],"date_updated":"2021-01-12T08:08:26Z","file_date_updated":"2020-10-02T08:49:58Z","department":[{"_id":"RySh"}],"_id":"6659","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-10-02T08:49:58Z","file_size":2464903,"date_created":"2020-10-02T08:49:58Z","file_name":"2019_BCSJ_Zenmyo.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8594","checksum":"186de511d6e0ca93f5d981e2443eb8cd","success":1}],"publication_status":"published","publication_identifier":{"issn":["00092673"]},"ec_funded":1,"issue":"5","volume":92,"oa_version":"Published Version","abstract":[{"text":"Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research.","lang":"eng"}],"intvolume":" 92","month":"05","scopus_import":"1"},{"date_created":"2019-07-29T12:23:29Z","doi":"10.4230/LIPICS.ICALP.2019.77","date_published":"2019-07-01T00:00:00Z","page":"77:1-77:12","publication":"46th International Colloquium on Automata, Languages and Programming","day":"01","year":"2019","has_accepted_license":"1","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","title":"Testing the complexity of a valued CSP language","external_id":{"arxiv":["1803.02289"]},"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.","ista":"Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.","mla":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.","short":"V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.","ieee":"V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.","ama":"Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77","apa":"Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77"},"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"ec_funded":1,"volume":132,"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:38Z","file_size":575475,"creator":"dernst","date_created":"2019-07-31T07:01:45Z","file_name":"2019_LIPICS_Kolmogorov.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6738","checksum":"f5ebee8eec6ae09e30365578ee63a492"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-109-2"],"issn":["1868-8969"]},"intvolume":" 132","month":"07","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds."}],"department":[{"_id":"VlKo"}],"file_date_updated":"2020-07-14T12:47:38Z","ddc":["000"],"date_updated":"2021-01-12T08:08:40Z","status":"public","conference":{"start_date":"2019-07-08","location":"Patras, Greece","end_date":"2019-07-12","name":"ICALP 2019: International Colloquim on Automata, Languages and Programming"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"6725"},{"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-0302-3696-0"],"isbn":["978-3-0302-3695-3"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","volume":11627,"ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so.","lang":"eng"}],"month":"06","place":"Cham","intvolume":" 11627","scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2019/068","open_access":"1"}],"date_updated":"2023-02-23T12:50:15Z","department":[{"_id":"KrPi"}],"_id":"6726","series_title":"LNCS","status":"public","type":"book_chapter","conference":{"name":"AFRICACRYPT: International Conference on Cryptology in Africa","start_date":"2019-07-09","location":"Rabat, Morocco","end_date":"2019-07-11"},"day":"29","publication":"Progress in Cryptology – AFRICACRYPT 2019","year":"2019","doi":"10.1007/978-3-030-23696-0_9","date_published":"2019-06-29T00:00:00Z","date_created":"2019-07-29T12:25:31Z","page":"157-180","quality_controlled":"1","publisher":"Springer Nature","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.","chicago":"Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9.","apa":"Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9","ama":"Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9","short":"M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.","ieee":"M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.","mla":"Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9."},"editor":[{"full_name":"Buchmann, J","last_name":"Buchmann","first_name":"J"},{"first_name":"A","full_name":"Nitaj, A","last_name":"Nitaj"},{"first_name":"T","last_name":"Rachidi","full_name":"Rachidi, T"}],"title":"Sampling the integers with low relative error","author":[{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482"}],"article_processing_charge":"No","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}]},{"article_type":"original","type":"journal_article","status":"public","_id":"6750","department":[{"_id":"MaMo"}],"date_updated":"2021-01-12T08:08:51Z","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1903.09203","open_access":"1"}],"month":"11","intvolume":" 67","abstract":[{"lang":"eng","text":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. "}],"oa_version":"Preprint","issue":"22","volume":67,"publication_identifier":{"issn":["1053587X"]},"publication_status":"published","language":[{"iso":"eng"}],"article_number":"8854897","author":[{"last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali"},{"full_name":"Condo, Carlo","last_name":"Condo","first_name":"Carlo"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"Warren J","full_name":"Gross, Warren J","last_name":"Gross"}],"external_id":{"arxiv":["1903.09203"]},"article_processing_charge":"No","title":"Rate-flexible fast polar decoders","citation":{"apa":"Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738","ama":"Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738","short":"S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019).","ieee":"S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.","mla":"Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738.","ista":"Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.","chicago":"Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","publisher":"IEEE","quality_controlled":"1","oa":1,"doi":"10.1109/TSP.2019.2944738","date_published":"2019-11-15T00:00:00Z","date_created":"2019-07-31T09:51:14Z","year":"2019","day":"15","publication":"IEEE Transactions on Signal Processing"},{"language":[{"iso":"eng"}],"file":[{"file_id":"6764","checksum":"20fc366fc6683ef0b074a019b73a663a","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-08-05T06:46:55Z","file_name":"2019_eJourCombinatorics_Jelinek.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:39Z","file_size":533697}],"publication_status":"published","publication_identifier":{"eissn":["10778926"]},"ec_funded":1,"volume":26,"issue":"3","oa_version":"Published Version","abstract":[{"text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions.","lang":"eng"}],"intvolume":" 26","month":"07","scopus_import":"1","ddc":["510"],"date_updated":"2022-03-18T12:32:02Z","department":[{"_id":"DaAl"}],"file_date_updated":"2020-07-14T12:47:39Z","_id":"6759","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","publication":"Electronic Journal of Combinatorics","day":"19","year":"2019","has_accepted_license":"1","date_created":"2019-08-04T21:59:20Z","date_published":"2019-07-19T00:00:00Z","doi":"10.37236/8096","oa":1,"publisher":"Electronic Journal of Combinatorics","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096."},"title":"On grounded L-graphs and their relatives","article_processing_charge":"No","external_id":{"arxiv":["1808.04148"]},"author":[{"first_name":"Vít","last_name":"Jelínek","full_name":"Jelínek, Vít"},{"full_name":"Töpfer, Martin","last_name":"Töpfer","id":"4B865388-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"}],"article_number":"P3.17","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}]},{"file_date_updated":"2020-07-14T12:47:41Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:09:12Z","status":"public","type":"conference","conference":{"location":"Brussels, Belgium","end_date":"2019-09-13","start_date":"2019-09-11","name":"RP: Reachability Problems"},"_id":"6822","volume":11674,"file":[{"file_id":"6823","checksum":"45ebbc709af2b247d28c7c293c01504b","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"prob.pdf","date_created":"2019-08-19T07:56:40Z","creator":"gavni","file_size":436635,"date_updated":"2020-07-14T12:47:41Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-303030805-6"],"issn":["0302-9743"]},"publication_status":"published","month":"09","intvolume":" 11674","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one.","lang":"eng"}],"title":"Bidding games on Markov decision processes","author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novotny","full_name":"Novotny, Petr","first_name":"Petr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1."},"project":[{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369"},{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"date_published":"2019-09-06T00:00:00Z","doi":"10.1007/978-3-030-30806-3_1","date_created":"2019-08-19T07:58:10Z","page":"1-12","day":"06","publication":" Proceedings of the 13th International Conference of Reachability Problems","has_accepted_license":"1","year":"2019","publisher":"Springer","quality_controlled":"1","oa":1},{"status":"public","type":"conference","conference":{"start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30","name":"CONCUR: International Conference on Concurrency Theory"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"6887","file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"KrCh"}],"ddc":["000"],"date_updated":"2022-08-12T10:54:34Z","month":"08","intvolume":" 140","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. "}],"volume":140,"ec_funded":1,"file":[{"file_id":"6922","checksum":"e1f0e4061212454574f34a1368d018ec","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-10-01T08:20:30Z","file_name":"2019_LIPIcs_Chatterjee.pdf","date_updated":"2020-07-14T12:47:43Z","file_size":730112,"creator":"kschuh"}],"language":[{"iso":"eng"}],"publication_status":"published","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"7","title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Dvorák, Wolfgang","last_name":"Dvorák","first_name":"Wolfgang"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}],"article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.7","date_created":"2019-09-18T08:07:58Z","day":"01","publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","year":"2019"},{"oa":1,"quality_controlled":"1","publisher":"IEEE","date_created":"2019-09-18T08:09:51Z","doi":"10.1109/icra.2019.8793840","date_published":"2019-05-01T00:00:00Z","publication":"Proceedings - IEEE International Conference on Robotics and Automation","day":"01","year":"2019","has_accepted_license":"1","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"8793840","title":"Designing worm-inspired neural networks for interpretable robotic control","article_processing_charge":"No","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Zimmer","full_name":"Zimmer, Manuel","first_name":"Manuel"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.","chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840.","ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.","short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.","mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840."},"month":"05","scopus_import":"1","alternative_title":["ICRA"],"oa_version":"Submitted Version","abstract":[{"text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.","lang":"eng"}],"volume":"2019-May","language":[{"iso":"eng"}],"file":[{"file_name":"2019_ICRA_Lechner.pdf","date_created":"2020-10-08T17:30:38Z","creator":"dernst","file_size":3265107,"date_updated":"2020-10-08T17:30:38Z","success":1,"checksum":"f5545a6b60c3ffd01feb3613f81d03b6","file_id":"8636","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"isbn":["9781538660270"]},"status":"public","conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2019-05-20","end_date":"2019-05-24","location":"Montreal, QC, Canada"},"type":"conference","_id":"6888","department":[{"_id":"ToHe"}],"file_date_updated":"2020-10-08T17:30:38Z","ddc":["000"],"date_updated":"2021-01-12T08:09:28Z"}]