[{"status":"public","language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Midya, Bikashkali","first_name":"Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87","last_name":"Midya"},{"full_name":"Tomza, Michał","last_name":"Tomza","first_name":"Michał"},{"full_name":"Schmidt, Richard","last_name":"Schmidt","first_name":"Richard"},{"last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"}],"corr_author":"1","department":[{"_id":"MiLe"}],"main_file_link":[{"url":"https://arxiv.org/abs/1607.06092","open_access":"1"}],"abstract":[{"text":"We use recently developed angulon theory [R. Schmidt and M. Lemeshko, Phys. Rev. Lett. 114, 203001 (2015)PRLTAO0031-900710.1103/PhysRevLett.114.203001] to study the rotational spectrum of a cyanide molecular anion immersed into Bose-Einstein condensates of rubidium and strontium. Based on ab initio potential energy surfaces, we provide a detailed study of the rotational Lamb shift and many-body-induced fine structure which arise due to dressing of molecular rotation by a field of phonon excitations. We demonstrate that the magnitude of these effects is large enough in order to be observed in modern experiments on cold molecular ions. Furthermore, we introduce a novel method to construct pseudopotentials starting from the ab initio potential energy surfaces, which provides a means to obtain effective coupling constants for low-energy polaron models.","lang":"eng"}],"acknowledgement":"The work was supported by the NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and the Smithsonian Astrophysical Observatory. B.M. acknowledges financial support received from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No. 291734. M.T. acknowledges support from the EU Marie Curie COFUND action (ICFOnest), the EU Grants ERC AdG OSYRIS, FP7 SIQS and EQuaM, FETPROACT QUIC, the Spanish Ministry Grants FOQUS (FIS2013-46768-P) and Severo Ochoa (SEV-2015-0522), Generalitat de Catalunya (SGR 874), Fundacio Cellex, the National Science Centre (2015/19/D/ST4/02173), and the PL-Grid Infrastructure.","arxiv":1,"issue":"4","volume":94,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"oa":1,"publist_id":"6030","publisher":"American Physical Society","date_created":"2018-12-11T11:51:09Z","citation":{"chicago":"Midya, Bikashkali, Michał Tomza, Richard Schmidt, and Mikhail Lemeshko. “Rotation of Cold Molecular Ions inside a Bose-Einstein Condensate.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/PhysRevA.94.041601\">https://doi.org/10.1103/PhysRevA.94.041601</a>.","ama":"Midya B, Tomza M, Schmidt R, Lemeshko M. Rotation of cold molecular ions inside a Bose-Einstein condensate. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2016;94(4). doi:<a href=\"https://doi.org/10.1103/PhysRevA.94.041601\">10.1103/PhysRevA.94.041601</a>","mla":"Midya, Bikashkali, et al. “Rotation of Cold Molecular Ions inside a Bose-Einstein Condensate.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 94, no. 4, 041601, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/PhysRevA.94.041601\">10.1103/PhysRevA.94.041601</a>.","ista":"Midya B, Tomza M, Schmidt R, Lemeshko M. 2016. Rotation of cold molecular ions inside a Bose-Einstein condensate. Physical Review A - Atomic, Molecular, and Optical Physics. 94(4), 041601.","short":"B. Midya, M. Tomza, R. Schmidt, M. Lemeshko, Physical Review A - Atomic, Molecular, and Optical Physics 94 (2016).","apa":"Midya, B., Tomza, M., Schmidt, R., &#38; Lemeshko, M. (2016). Rotation of cold molecular ions inside a Bose-Einstein condensate. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.94.041601\">https://doi.org/10.1103/PhysRevA.94.041601</a>","ieee":"B. Midya, M. Tomza, R. Schmidt, and M. Lemeshko, “Rotation of cold molecular ions inside a Bose-Einstein condensate,” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 94, no. 4. American Physical Society, 2016."},"isi":1,"external_id":{"isi":["000385618500001"],"arxiv":["1607.06092"]},"publication":"Physical Review A - Atomic, Molecular, and Optical Physics","day":"13","scopus_import":"1","title":"Rotation of cold molecular ions inside a Bose-Einstein condensate","type":"journal_article","oa_version":"Preprint","ec_funded":1,"date_published":"2016-10-13T00:00:00Z","quality_controlled":"1","intvolume":"        94","month":"10","publication_status":"published","date_updated":"2025-09-22T08:33:08Z","_id":"1286","article_number":"041601","doi":"10.1103/PhysRevA.94.041601","article_processing_charge":"No"},{"article_processing_charge":"No","doi":"10.1364/OL.41.004621","date_updated":"2025-09-22T08:32:34Z","publication_status":"published","_id":"1287","quality_controlled":"1","intvolume":"        41","month":"10","ec_funded":1,"date_published":"2016-10-15T00:00:00Z","oa_version":"Preprint","page":"4621 - 4624","type":"journal_article","title":"Modes and exceptional points in waveguides with impedance boundary conditions","scopus_import":"1","publication":"Optics Letters","day":"15","external_id":{"isi":["000386854500005"],"arxiv":["1609.02863"]},"isi":1,"citation":{"apa":"Midya, B., &#38; Konotop, V. (2016). Modes and exceptional points in waveguides with impedance boundary conditions. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OL.41.004621\">https://doi.org/10.1364/OL.41.004621</a>","short":"B. Midya, V. Konotop, Optics Letters 41 (2016) 4621–4624.","ieee":"B. Midya and V. Konotop, “Modes and exceptional points in waveguides with impedance boundary conditions,” <i>Optics Letters</i>, vol. 41, no. 20. Optica Publishing Group, pp. 4621–4624, 2016.","ista":"Midya B, Konotop V. 2016. Modes and exceptional points in waveguides with impedance boundary conditions. Optics Letters. 41(20), 4621–4624.","chicago":"Midya, Bikashkali, and Vladimir Konotop. “Modes and Exceptional Points in Waveguides with Impedance Boundary Conditions.” <i>Optics Letters</i>. Optica Publishing Group, 2016. <a href=\"https://doi.org/10.1364/OL.41.004621\">https://doi.org/10.1364/OL.41.004621</a>.","ama":"Midya B, Konotop V. Modes and exceptional points in waveguides with impedance boundary conditions. <i>Optics Letters</i>. 2016;41(20):4621-4624. doi:<a href=\"https://doi.org/10.1364/OL.41.004621\">10.1364/OL.41.004621</a>","mla":"Midya, Bikashkali, and Vladimir Konotop. “Modes and Exceptional Points in Waveguides with Impedance Boundary Conditions.” <i>Optics Letters</i>, vol. 41, no. 20, Optica Publishing Group, 2016, pp. 4621–24, doi:<a href=\"https://doi.org/10.1364/OL.41.004621\">10.1364/OL.41.004621</a>."},"publist_id":"6029","publisher":"Optica Publishing Group","oa":1,"date_created":"2018-12-11T11:51:09Z","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":41,"acknowledgement":"The research of B.M. is supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant No. [291734].","arxiv":1,"issue":"20","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.02863"}],"abstract":[{"lang":"eng","text":"A planar waveguide with an impedance boundary, composed of nonperfect metallic plates, and with passive or active dielectric filling, is considered. We show the possibility of selective mode guiding and amplification when a homogeneous pump is added to the dielectric and analyze differences in TE and TM mode propagation. Such a non-conservative system is also shown to feature exceptional points for specific and experimentally tunable parameters, which are described for a particular case of transparent dielectric."}],"department":[{"_id":"MiLe"}],"corr_author":"1","year":"2016","language":[{"iso":"eng"}],"author":[{"full_name":"Midya, Bikashkali","first_name":"Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87","last_name":"Midya"},{"full_name":"Konotop, Vladimir","first_name":"Vladimir","last_name":"Konotop"}],"status":"public"},{"abstract":[{"lang":"eng","text":"Respiratory complex I transfers electrons from NADH to quinone, utilizing the reaction energy to translocate protons across the membrane. It is a key enzyme of the respiratory chain of many prokaryotic and most eukaryotic organisms. The reversible NADH oxidation reaction is facilitated in complex I by non-covalently bound flavin mononucleotide (FMN). Here we report that the catalytic activity of E. coli complex I with artificial electron acceptors potassium ferricyanide (FeCy) and hexaamineruthenium (HAR) is significantly inhibited in the enzyme pre-reduced by NADH. Further, we demonstrate that the inhibition is caused by reversible dissociation of FMN. The binding constant (Kd) for FMN increases from the femto- or picomolar range in oxidized complex I to the nanomolar range in the NADH reduced enzyme, with an FMN dissociation time constant of ~ 5 s. The oxidation state of complex I, rather than that of FMN, proved critical to the dissociation. Such dissociation is not observed with the T. thermophilus enzyme and our analysis suggests that the difference may be due to the unusually high redox potential of Fe-S cluster N1a in E. coli. It is possible that the enzyme attenuates ROS production in vivo by releasing FMN under highly reducing conditions."}],"issue":"11","acknowledgement":"This work was funded by the UK Medical Research Council.","volume":1857,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:09Z","publisher":"Elsevier","publist_id":"6028","status":"public","author":[{"full_name":"Holt, Peter","last_name":"Holt","first_name":"Peter"},{"first_name":"Rouslan","last_name":"Efremov","full_name":"Efremov, Rouslan"},{"full_name":"Nakamaru Ogiso, Eiko","first_name":"Eiko","last_name":"Nakamaru Ogiso"},{"first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989"}],"year":"2016","language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"LeSa"}],"date_published":"2016-11-01T00:00:00Z","month":"11","intvolume":"      1857","quality_controlled":"1","_id":"1288","date_updated":"2025-09-22T08:32:00Z","publication_status":"published","doi":"10.1016/j.bbabio.2016.08.008","article_processing_charge":"No","citation":{"ama":"Holt P, Efremov R, Nakamaru Ogiso E, Sazanov LA. Reversible FMN dissociation from Escherichia coli respiratory complex I. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. 2016;1857(11):1777-1785. doi:<a href=\"https://doi.org/10.1016/j.bbabio.2016.08.008\">10.1016/j.bbabio.2016.08.008</a>","mla":"Holt, Peter, et al. “Reversible FMN Dissociation from Escherichia Coli Respiratory Complex I.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1857, no. 11, Elsevier, 2016, pp. 1777–85, doi:<a href=\"https://doi.org/10.1016/j.bbabio.2016.08.008\">10.1016/j.bbabio.2016.08.008</a>.","chicago":"Holt, Peter, Rouslan Efremov, Eiko Nakamaru Ogiso, and Leonid A Sazanov. “Reversible FMN Dissociation from Escherichia Coli Respiratory Complex I.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.bbabio.2016.08.008\">https://doi.org/10.1016/j.bbabio.2016.08.008</a>.","ista":"Holt P, Efremov R, Nakamaru Ogiso E, Sazanov LA. 2016. Reversible FMN dissociation from Escherichia coli respiratory complex I. Biochimica et Biophysica Acta - Bioenergetics. 1857(11), 1777–1785.","ieee":"P. Holt, R. Efremov, E. Nakamaru Ogiso, and L. A. Sazanov, “Reversible FMN dissociation from Escherichia coli respiratory complex I,” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1857, no. 11. Elsevier, pp. 1777–1785, 2016.","short":"P. Holt, R. Efremov, E. Nakamaru Ogiso, L.A. Sazanov, Biochimica et Biophysica Acta - Bioenergetics 1857 (2016) 1777–1785.","apa":"Holt, P., Efremov, R., Nakamaru Ogiso, E., &#38; Sazanov, L. A. (2016). Reversible FMN dissociation from Escherichia coli respiratory complex I. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbabio.2016.08.008\">https://doi.org/10.1016/j.bbabio.2016.08.008</a>"},"isi":1,"external_id":{"isi":["000384867400007"]},"publication":"Biochimica et Biophysica Acta - Bioenergetics","day":"01","scopus_import":"1","title":"Reversible FMN dissociation from Escherichia coli respiratory complex I","type":"journal_article","page":"1777 - 1785","oa_version":"None"},{"volume":83,"related_material":{"record":[{"id":"1568","relation":"earlier_version","status":"public"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Aiming at the automatic diagnosis of tumors using narrow band imaging (NBI) magnifying endoscopic (ME) images of the stomach, we combine methods from image processing, topology, geometry, and machine learning to classify patterns into three classes: oval, tubular and irregular. Training the algorithm on a small number of images of each type, we achieve a high rate of correct classifications. The analysis of the learning algorithm reveals that a handful of geometric and topological features are responsible for the overwhelming majority of decisions."}],"issue":"1","publisher":"Elsevier","publist_id":"6027","oa":1,"date_created":"2018-12-11T11:51:10Z","file_date_updated":"2020-07-14T12:44:42Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"has_accepted_license":"1","pubrep_id":"975","ddc":["004","514"],"status":"public","department":[{"_id":"HeEd"}],"year":"2016","language":[{"iso":"eng"}],"author":[{"full_name":"Dunaeva, Olga","last_name":"Dunaeva","first_name":"Olga"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Lukyanov, Anton","last_name":"Lukyanov","first_name":"Anton"},{"first_name":"Michael","last_name":"Machin","full_name":"Machin, Michael"},{"full_name":"Malkova, Daria","first_name":"Daria","last_name":"Malkova"},{"last_name":"Kuvaev","first_name":"Roman","full_name":"Kuvaev, Roman"},{"full_name":"Kashin, Sergey","first_name":"Sergey","last_name":"Kashin"}],"quality_controlled":"1","intvolume":"        83","month":"11","date_updated":"2025-09-23T13:44:16Z","publication_status":"published","_id":"1289","date_published":"2016-11-01T00:00:00Z","article_processing_charge":"No","doi":"10.1016/j.patrec.2015.12.012","external_id":{"isi":["000386874700003"]},"publication":"Pattern Recognition Letters","day":"01","citation":{"chicago":"Dunaeva, Olga, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova, Roman Kuvaev, and Sergey Kashin. “The Classification of Endoscopy Images with Persistent Homology.” <i>Pattern Recognition Letters</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.patrec.2015.12.012\">https://doi.org/10.1016/j.patrec.2015.12.012</a>.","ama":"Dunaeva O, Edelsbrunner H, Lukyanov A, et al. The classification of endoscopy images with persistent homology. <i>Pattern Recognition Letters</i>. 2016;83(1):13-22. doi:<a href=\"https://doi.org/10.1016/j.patrec.2015.12.012\">10.1016/j.patrec.2015.12.012</a>","mla":"Dunaeva, Olga, et al. “The Classification of Endoscopy Images with Persistent Homology.” <i>Pattern Recognition Letters</i>, vol. 83, no. 1, Elsevier, 2016, pp. 13–22, doi:<a href=\"https://doi.org/10.1016/j.patrec.2015.12.012\">10.1016/j.patrec.2015.12.012</a>.","ista":"Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D, Kuvaev R, Kashin S. 2016. The classification of endoscopy images with persistent homology. Pattern Recognition Letters. 83(1), 13–22.","short":"O. Dunaeva, H. Edelsbrunner, A. Lukyanov, M. Machin, D. Malkova, R. Kuvaev, S. Kashin, Pattern Recognition Letters 83 (2016) 13–22.","apa":"Dunaeva, O., Edelsbrunner, H., Lukyanov, A., Machin, M., Malkova, D., Kuvaev, R., &#38; Kashin, S. (2016). The classification of endoscopy images with persistent homology. <i>Pattern Recognition Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.patrec.2015.12.012\">https://doi.org/10.1016/j.patrec.2015.12.012</a>","ieee":"O. Dunaeva <i>et al.</i>, “The classification of endoscopy images with persistent homology,” <i>Pattern Recognition Letters</i>, vol. 83, no. 1. Elsevier, pp. 13–22, 2016."},"file":[{"creator":"dernst","checksum":"33458bbb8c32a339e1adeca6d5a1112d","relation":"main_file","file_id":"6334","file_size":1921113,"file_name":"2016-Edelsbrunner_The_classification.pdf","access_level":"open_access","date_created":"2019-04-17T07:55:51Z","content_type":"application/pdf","date_updated":"2020-07-14T12:44:42Z"}],"isi":1,"oa_version":"Submitted Version","scopus_import":"1","page":"13 - 22","type":"journal_article","title":"The classification of endoscopy images with persistent homology"},{"publisher":"Nature Publishing Group","oa":1,"publist_id":"6026","date_created":"2018-12-11T11:51:10Z","volume":12,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5069154/","open_access":"1"}],"abstract":[{"lang":"eng","text":"We developed a competition-based screening strategy to identify compounds that invert the selective advantage of antibiotic resistance. Using our assay, we screened over 19,000 compounds for the ability to select against the TetA tetracycline-resistance efflux pump in Escherichia coli and identified two hits, β-thujaplicin and disulfiram. Treating a tetracycline-resistant population with β-thujaplicin selects for loss of the resistance gene, enabling an effective second-phase treatment with doxycycline."}],"acknowledgement":"This work was supported in part by National Institute of Allergy and Infectious Diseases grant U54 AI057159, US National Institutes of Health grants R01 GM081617 (to R.K.) and GM086258 (to J.C.), European Research Council FP7 ERC grant 281891 (to R.K.) and a National Science Foundation Graduate Fellowship (to L.K.S.).\r\n","issue":"11","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"year":"2016","language":[{"iso":"eng"}],"author":[{"first_name":"Laura","last_name":"Stone","full_name":"Stone, Laura"},{"full_name":"Baym, Michael","first_name":"Michael","last_name":"Baym"},{"full_name":"Lieberman, Tami","last_name":"Lieberman","first_name":"Tami"},{"orcid":"0000-0003-0876-3187","full_name":"Chait, Remy P","id":"3464AE84-F248-11E8-B48F-1D18A9856A87","last_name":"Chait","first_name":"Remy P"},{"full_name":"Clardy, Jon","first_name":"Jon","last_name":"Clardy"},{"first_name":"Roy","last_name":"Kishony","full_name":"Kishony, Roy"}],"status":"public","article_processing_charge":"No","doi":"10.1038/nchembio.2176","quality_controlled":"1","intvolume":"        12","month":"11","publication_status":"published","date_updated":"2025-09-22T08:30:48Z","_id":"1290","date_published":"2016-11-01T00:00:00Z","oa_version":"Preprint","scopus_import":"1","page":"902 - 904","title":"Compounds that select against the tetracycline-resistance efflux pump","type":"journal_article","external_id":{"isi":["000386798800008"]},"publication":"Nature Chemical Biology","day":"01","citation":{"short":"L. Stone, M. Baym, T. Lieberman, R.P. Chait, J. Clardy, R. Kishony, Nature Chemical Biology 12 (2016) 902–904.","apa":"Stone, L., Baym, M., Lieberman, T., Chait, R. P., Clardy, J., &#38; Kishony, R. (2016). Compounds that select against the tetracycline-resistance efflux pump. <i>Nature Chemical Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nchembio.2176\">https://doi.org/10.1038/nchembio.2176</a>","ieee":"L. Stone, M. Baym, T. Lieberman, R. P. Chait, J. Clardy, and R. Kishony, “Compounds that select against the tetracycline-resistance efflux pump,” <i>Nature Chemical Biology</i>, vol. 12, no. 11. Nature Publishing Group, pp. 902–904, 2016.","chicago":"Stone, Laura, Michael Baym, Tami Lieberman, Remy P Chait, Jon Clardy, and Roy Kishony. “Compounds That Select against the Tetracycline-Resistance Efflux Pump.” <i>Nature Chemical Biology</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nchembio.2176\">https://doi.org/10.1038/nchembio.2176</a>.","mla":"Stone, Laura, et al. “Compounds That Select against the Tetracycline-Resistance Efflux Pump.” <i>Nature Chemical Biology</i>, vol. 12, no. 11, Nature Publishing Group, 2016, pp. 902–04, doi:<a href=\"https://doi.org/10.1038/nchembio.2176\">10.1038/nchembio.2176</a>.","ama":"Stone L, Baym M, Lieberman T, Chait RP, Clardy J, Kishony R. Compounds that select against the tetracycline-resistance efflux pump. <i>Nature Chemical Biology</i>. 2016;12(11):902-904. doi:<a href=\"https://doi.org/10.1038/nchembio.2176\">10.1038/nchembio.2176</a>","ista":"Stone L, Baym M, Lieberman T, Chait RP, Clardy J, Kishony R. 2016. Compounds that select against the tetracycline-resistance efflux pump. Nature Chemical Biology. 12(11), 902–904."},"isi":1},{"title":"High performance computing at IST Austria: Modelling the human hippocampus","author":[{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois"},{"id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","last_name":"Stadlbauer","first_name":"Stephan","full_name":"Stadlbauer, Stephan"}],"type":"conference_abstract","year":"2016","language":[{"iso":"eng"}],"page":"37","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"oa_version":"Published Version","corr_author":"1","file":[{"content_type":"application/pdf","date_updated":"2023-05-16T07:03:56Z","success":1,"creator":"dernst","relation":"main_file","checksum":"4a7b00362e81358d568f5e216fa03c3e","file_id":"12968","file_size":1073523,"file_name":"2016_AHPC_Schloegl.pdf","access_level":"open_access","date_created":"2023-05-16T07:03:56Z"}],"conference":{"name":"AHPC: Austrian HPC Meeting","location":"Grundlsee, Austria","start_date":"2016-02-22","end_date":"2016-02-24"},"citation":{"ieee":"A. Schlögl and S. Stadlbauer, “High performance computing at IST Austria: Modelling the human hippocampus,” in <i>AHPC16 - Austrian HPC Meeting 2016</i>, Grundlsee, Austria, 2016, p. 37.","apa":"Schlögl, A., &#38; Stadlbauer, S. (2016). High performance computing at IST Austria: Modelling the human hippocampus. In <i>AHPC16 - Austrian HPC Meeting 2016</i> (p. 37). Grundlsee, Austria: VSC - Vienna Scientific Cluster.","short":"A. Schlögl, S. Stadlbauer, in:, AHPC16 - Austrian HPC Meeting 2016, VSC - Vienna Scientific Cluster, 2016, p. 37.","mla":"Schlögl, Alois, and Stephan Stadlbauer. “High Performance Computing at IST Austria: Modelling the Human Hippocampus.” <i>AHPC16 - Austrian HPC Meeting 2016</i>, VSC - Vienna Scientific Cluster, 2016, p. 37.","ama":"Schlögl A, Stadlbauer S. High performance computing at IST Austria: Modelling the human hippocampus. In: <i>AHPC16 - Austrian HPC Meeting 2016</i>. VSC - Vienna Scientific Cluster; 2016:37.","chicago":"Schlögl, Alois, and Stephan Stadlbauer. “High Performance Computing at IST Austria: Modelling the Human Hippocampus.” In <i>AHPC16 - Austrian HPC Meeting 2016</i>, 37. VSC - Vienna Scientific Cluster, 2016.","ista":"Schlögl A, Stadlbauer S. 2016. High performance computing at IST Austria: Modelling the human hippocampus. AHPC16 - Austrian HPC Meeting 2016. AHPC: Austrian HPC Meeting, 37."},"status":"public","day":"24","ddc":["000"],"publication":"AHPC16 - Austrian HPC Meeting 2016","has_accepted_license":"1","file_date_updated":"2023-05-16T07:03:56Z","article_processing_charge":"No","date_created":"2023-05-05T12:54:47Z","publisher":"VSC - Vienna Scientific Cluster","oa":1,"date_published":"2016-02-24T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc16/BOOKLET_AHPC16.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12903","date_updated":"2024-10-09T21:05:23Z","publication_status":"published","month":"02","quality_controlled":"1"},{"oa_version":"Published Version","scopus_import":"1","title":"Periodic striped ground states in Ising models with competing interactions","type":"journal_article","page":"983 - 1007","external_id":{"isi":["000385162900010"]},"publication":"Communications in Mathematical Physics","day":"01","citation":{"ista":"Giuliani A, Seiringer R. 2016. Periodic striped ground states in Ising models with competing interactions. Communications in Mathematical Physics. 347(3), 983–1007.","chicago":"Giuliani, Alessandro, and Robert Seiringer. “Periodic Striped Ground States in Ising Models with Competing Interactions.” <i>Communications in Mathematical Physics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00220-016-2665-0\">https://doi.org/10.1007/s00220-016-2665-0</a>.","ama":"Giuliani A, Seiringer R. Periodic striped ground states in Ising models with competing interactions. <i>Communications in Mathematical Physics</i>. 2016;347(3):983-1007. doi:<a href=\"https://doi.org/10.1007/s00220-016-2665-0\">10.1007/s00220-016-2665-0</a>","mla":"Giuliani, Alessandro, and Robert Seiringer. “Periodic Striped Ground States in Ising Models with Competing Interactions.” <i>Communications in Mathematical Physics</i>, vol. 347, no. 3, Springer, 2016, pp. 983–1007, doi:<a href=\"https://doi.org/10.1007/s00220-016-2665-0\">10.1007/s00220-016-2665-0</a>.","apa":"Giuliani, A., &#38; Seiringer, R. (2016). Periodic striped ground states in Ising models with competing interactions. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-016-2665-0\">https://doi.org/10.1007/s00220-016-2665-0</a>","short":"A. Giuliani, R. Seiringer, Communications in Mathematical Physics 347 (2016) 983–1007.","ieee":"A. Giuliani and R. Seiringer, “Periodic striped ground states in Ising models with competing interactions,” <i>Communications in Mathematical Physics</i>, vol. 347, no. 3. Springer, pp. 983–1007, 2016."},"isi":1,"file":[{"file_size":794983,"date_created":"2018-12-12T10:09:02Z","file_name":"IST-2016-688-v1+1_s00220-016-2665-0.pdf","access_level":"open_access","creator":"system","relation":"main_file","checksum":"3c6e08c048fc462e312788be72874bb1","file_id":"4725","date_updated":"2020-07-14T12:44:42Z","content_type":"application/pdf"}],"article_processing_charge":"No","doi":"10.1007/s00220-016-2665-0","intvolume":"       347","month":"11","quality_controlled":"1","_id":"1291","date_updated":"2025-09-22T08:30:16Z","publication_status":"published","date_published":"2016-11-01T00:00:00Z","department":[{"_id":"RoSe"}],"author":[{"full_name":"Giuliani, Alessandro","last_name":"Giuliani","first_name":"Alessandro"},{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"language":[{"iso":"eng"}],"year":"2016","pubrep_id":"688","ddc":["510","530"],"status":"public","date_created":"2018-12-11T11:51:11Z","oa":1,"publisher":"Springer","publist_id":"6025","file_date_updated":"2020-07-14T12:44:42Z","project":[{"grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":347,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"We consider Ising models in two and three dimensions, with short range ferromagnetic and long range, power-law decaying, antiferromagnetic interactions. We let J be the ratio between the strength of the ferromagnetic to antiferromagnetic interactions. The competition between these two kinds of interactions induces the system to form domains of minus spins in a background of plus spins, or vice versa. If the decay exponent p of the long range interaction is larger than dÂ +Â 1, with d the space dimension, this happens for all values of J smaller than a critical value Jc(p), beyond which the ground state is homogeneous. In this paper, we give a characterization of the infinite volume ground states of the system, for pÂ &gt;Â 2d and J in a left neighborhood of Jc(p). In particular, we prove that the quasi-one-dimensional states consisting of infinite stripes (dÂ =Â 2) or slabs (dÂ =Â 3), all of the same optimal width and orientation, and alternating magnetization, are infinite volume ground states. Our proof is based on localization bounds combined with reflection positivity."}],"issue":"3","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The\r\nresearch leading to these results has received funding from the European Research Council under the European\r\nUnion’s Seventh Framework Programme ERC Starting Grant CoMBoS (Grant Agreement No. 239694), from\r\nthe Italian PRIN National Grant Geometric and analytic theory of Hamiltonian systems in finite and infinite\r\ndimensions, and the Austrian Science Fund (FWF), project Nr. P 27533-N27. Part of this work was completed\r\nduring a stay at the Erwin Schrödinger Institute for Mathematical Physics in Vienna (ESI program 2015\r\n“Quantum many-body systems, random matrices, and disorder”), whose hospitality and financial support is\r\ngratefully acknowledged."},{"status":"public","author":[{"last_name":"Durst","first_name":"Sebastian","full_name":"Durst, Sebastian"},{"first_name":"Marc","last_name":"Kegel","full_name":"Kegel, Marc"},{"full_name":"Klukas, Mirko D","id":"34927512-F248-11E8-B48F-1D18A9856A87","last_name":"Klukas","first_name":"Mirko D"}],"year":"2016","language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"We give explicit formulas and algorithms for the computation of the Thurston–Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on Heegaard surfaces in convex position. Furthermore, we extend the results to rationally nullhomologous knots in arbitrary 3-manifolds."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.00794"}],"issue":"2","arxiv":1,"acknowledgement":"The authors are veryg rateful to Hansj ̈org Geiges \r\nfor fruitful discussions and advice and Christian Evers for helpful remarks on a draft version.","volume":150,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:11Z","oa":1,"publist_id":"6023","publisher":"Springer","citation":{"short":"S. Durst, M. Kegel, M.D. Klukas, Acta Mathematica Hungarica 150 (2016) 441–455.","apa":"Durst, S., Kegel, M., &#38; Klukas, M. D. (2016). Computing the Thurston–Bennequin invariant in open books. <i>Acta Mathematica Hungarica</i>. Springer. <a href=\"https://doi.org/10.1007/s10474-016-0648-4\">https://doi.org/10.1007/s10474-016-0648-4</a>","ieee":"S. Durst, M. Kegel, and M. D. Klukas, “Computing the Thurston–Bennequin invariant in open books,” <i>Acta Mathematica Hungarica</i>, vol. 150, no. 2. Springer, pp. 441–455, 2016.","ista":"Durst S, Kegel M, Klukas MD. 2016. Computing the Thurston–Bennequin invariant in open books. Acta Mathematica Hungarica. 150(2), 441–455.","chicago":"Durst, Sebastian, Marc Kegel, and Mirko D Klukas. “Computing the Thurston–Bennequin Invariant in Open Books.” <i>Acta Mathematica Hungarica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s10474-016-0648-4\">https://doi.org/10.1007/s10474-016-0648-4</a>.","ama":"Durst S, Kegel M, Klukas MD. Computing the Thurston–Bennequin invariant in open books. <i>Acta Mathematica Hungarica</i>. 2016;150(2):441-455. doi:<a href=\"https://doi.org/10.1007/s10474-016-0648-4\">10.1007/s10474-016-0648-4</a>","mla":"Durst, Sebastian, et al. “Computing the Thurston–Bennequin Invariant in Open Books.” <i>Acta Mathematica Hungarica</i>, vol. 150, no. 2, Springer, 2016, pp. 441–55, doi:<a href=\"https://doi.org/10.1007/s10474-016-0648-4\">10.1007/s10474-016-0648-4</a>."},"isi":1,"external_id":{"arxiv":["1605.00794"],"isi":["000387471100014"]},"day":"01","publication":"Acta Mathematica Hungarica","scopus_import":"1","title":"Computing the Thurston–Bennequin invariant in open books","type":"journal_article","page":"441 - 455","oa_version":"Preprint","date_published":"2016-12-01T00:00:00Z","month":"12","intvolume":"       150","quality_controlled":"1","_id":"1292","publication_status":"published","date_updated":"2025-09-22T08:29:12Z","doi":"10.1007/s10474-016-0648-4","article_processing_charge":"No"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":509,"arxiv":1,"acknowledgement":"We wish to thank Alexander Engström and Bernd Sturmfels for various valuable discussions and insights. We also thank the two anonymous referees for their thoughtful feedback on the paper. CU was partially supported by the Austrian Science Fund (FWF) Y 903-N35.","abstract":[{"text":"For a graph G with p vertices the closed convex cone S⪰0(G) consists of all real positive semidefinite p×p matrices whose sparsity pattern is given by G, that is, those matrices with zeros in the off-diagonal entries corresponding to nonedges of G. The extremal rays of this cone and their associated ranks have applications to matrix completion problems, maximum likelihood estimation in Gaussian graphical models in statistics, and Gauss elimination for sparse matrices. While the maximum rank of an extremal ray in S⪰0(G), known as the sparsity order of G, has been characterized for different classes of graphs, we here study all possible extremal ranks of S⪰0(G). We investigate when the geometry of the (±1)-cut polytope of G yields a polyhedral characterization of the set of extremal ranks of S⪰0(G). For a graph G without K5 minors, we show that appropriately chosen normal vectors to the facets of the (±1)-cut polytope of G specify the off-diagonal entries of extremal matrices in S⪰0(G). We also prove that for appropriately chosen scalars the constant term of the linear equation of each facet-supporting hyperplane is the rank of its corresponding extremal matrix in S⪰0(G). Furthermore, we show that if G is series-parallel then this gives a complete characterization of all possible extremal ranks of S⪰0(G). Consequently, the sparsity order problem for series-parallel graphs can be solved in terms of polyhedral geometry.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.06702"}],"date_created":"2018-12-11T11:51:11Z","publist_id":"6024","publisher":"Elsevier","oa":1,"project":[{"call_identifier":"FWF","name":"Gaussian Graphical Models: Theory and Applications","_id":"2530CA10-B435-11E9-9278-68D0E5697425","grant_number":"Y 903-N35"}],"status":"public","department":[{"_id":"CaUh"}],"author":[{"full_name":"Solus, Liam T","first_name":"Liam T","last_name":"Solus","id":"2AADA620-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","first_name":"Caroline"},{"last_name":"Yoshida","first_name":"Ruriko","full_name":"Yoshida, Ruriko"}],"year":"2016","language":[{"iso":"eng"}],"_id":"1293","publication_status":"published","date_updated":"2025-09-22T08:29:45Z","month":"11","intvolume":"       509","quality_controlled":"1","date_published":"2016-11-15T00:00:00Z","article_processing_charge":"No","doi":"10.1016/j.laa.2016.07.026","day":"15","publication":"Linear Algebra and Its Applications","external_id":{"arxiv":["1506.06702"],"isi":["000385338000012"]},"isi":1,"citation":{"ieee":"L. T. Solus, C. Uhler, and R. Yoshida, “Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors,” <i>Linear Algebra and Its Applications</i>, vol. 509. Elsevier, pp. 247–275, 2016.","apa":"Solus, L. T., Uhler, C., &#38; Yoshida, R. (2016). Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">https://doi.org/10.1016/j.laa.2016.07.026</a>","short":"L.T. Solus, C. Uhler, R. Yoshida, Linear Algebra and Its Applications 509 (2016) 247–275.","ama":"Solus LT, Uhler C, Yoshida R. Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors. <i>Linear Algebra and Its Applications</i>. 2016;509:247-275. doi:<a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">10.1016/j.laa.2016.07.026</a>","mla":"Solus, Liam T., et al. “Extremal Positive Semidefinite Matrices Whose Sparsity Pattern Is given by Graphs without K5 Minors.” <i>Linear Algebra and Its Applications</i>, vol. 509, Elsevier, 2016, pp. 247–75, doi:<a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">10.1016/j.laa.2016.07.026</a>.","chicago":"Solus, Liam T, Caroline Uhler, and Ruriko Yoshida. “Extremal Positive Semidefinite Matrices Whose Sparsity Pattern Is given by Graphs without K5 Minors.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">https://doi.org/10.1016/j.laa.2016.07.026</a>.","ista":"Solus LT, Uhler C, Yoshida R. 2016. Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors. Linear Algebra and Its Applications. 509, 247–275."},"oa_version":"Preprint","title":"Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors","type":"journal_article","page":"247 - 275","scopus_import":"1"},{"doi":"10.1016/j.endm.2016.09.030","quality_controlled":"1","intvolume":"        54","month":"10","date_updated":"2024-10-09T20:57:05Z","publication_status":"published","_id":"1295","ec_funded":1,"date_published":"2016-10-01T00:00:00Z","oa_version":"None","scopus_import":1,"page":"169 - 174","title":"Multiple covers with balls II: Weighted averages","type":"journal_article","day":"01","publication":"Electronic Notes in Discrete Mathematics","citation":{"ista":"Edelsbrunner H, Iglesias Ham M. 2016. Multiple covers with balls II: Weighted averages. Electronic Notes in Discrete Mathematics. 54, 169–174.","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls II: Weighted Averages.” <i>Electronic Notes in Discrete Mathematics</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">https://doi.org/10.1016/j.endm.2016.09.030</a>.","ama":"Edelsbrunner H, Iglesias Ham M. Multiple covers with balls II: Weighted averages. <i>Electronic Notes in Discrete Mathematics</i>. 2016;54:169-174. doi:<a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">10.1016/j.endm.2016.09.030</a>","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls II: Weighted Averages.” <i>Electronic Notes in Discrete Mathematics</i>, vol. 54, Elsevier, 2016, pp. 169–74, doi:<a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">10.1016/j.endm.2016.09.030</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2016). Multiple covers with balls II: Weighted averages. <i>Electronic Notes in Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">https://doi.org/10.1016/j.endm.2016.09.030</a>","short":"H. Edelsbrunner, M. Iglesias Ham, Electronic Notes in Discrete Mathematics 54 (2016) 169–174.","ieee":"H. Edelsbrunner and M. Iglesias Ham, “Multiple covers with balls II: Weighted averages,” <i>Electronic Notes in Discrete Mathematics</i>, vol. 54. Elsevier, pp. 169–174, 2016."},"publist_id":"5976","publisher":"Elsevier","date_created":"2018-12-11T11:51:12Z","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"volume":54,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Voronoi diagrams and Delaunay triangulations have been extensively used to represent and compute geometric features of point configurations. We introduce a generalization to poset diagrams and poset complexes, which contain order-k and degree-k Voronoi diagrams and their duals as special cases. Extending a result of Aurenhammer from 1990, we show how to construct poset diagrams as weighted Voronoi diagrams of average balls."}],"acknowledgement":"This work is partially supported by the Toposys project FP7-ICT-318493-STREP, and by ESF under the ACAT Research Network Programme.","corr_author":"1","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"year":"2016","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Iglesias Ham, Mabel","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","last_name":"Iglesias Ham"}],"status":"public"},{"year":"2016","language":[{"iso":"eng"}],"page":"3806 - 3816","author":[{"first_name":"Moritz","last_name":"Bächer","full_name":"Bächer, Moritz"},{"first_name":"Benjamin","last_name":"Hepp","full_name":"Hepp, Benjamin"},{"full_name":"Pece, Fabrizio","last_name":"Pece","first_name":"Fabrizio"},{"full_name":"Kry, Paul","first_name":"Paul","last_name":"Kry"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"last_name":"Thomaszewski","first_name":"Bernhard","full_name":"Thomaszewski, Bernhard"},{"full_name":"Hilliges, Otmar","first_name":"Otmar","last_name":"Hilliges"}],"title":"DefSense: computational design of customized deformable input devices","type":"conference","scopus_import":"1","department":[{"_id":"BeBi"}],"oa_version":"None","isi":1,"citation":{"short":"M. Bächer, B. Hepp, F. Pece, P. Kry, B. Bickel, B. Thomaszewski, O. Hilliges, in:, ACM, 2016, pp. 3806–3816.","apa":"Bächer, M., Hepp, B., Pece, F., Kry, P., Bickel, B., Thomaszewski, B., &#38; Hilliges, O. (2016). DefSense: computational design of customized deformable input devices (pp. 3806–3816). Presented at the CHI: Conference on Human Factors in Computing Systems, San Jose, California, USA: ACM. <a href=\"https://doi.org/10.1145/2858036.2858354\">https://doi.org/10.1145/2858036.2858354</a>","ieee":"M. Bächer <i>et al.</i>, “DefSense: computational design of customized deformable input devices,” presented at the CHI: Conference on Human Factors in Computing Systems, San Jose, California, USA, 2016, pp. 3806–3816.","chicago":"Bächer, Moritz, Benjamin Hepp, Fabrizio Pece, Paul Kry, Bernd Bickel, Bernhard Thomaszewski, and Otmar Hilliges. “DefSense: Computational Design of Customized Deformable Input Devices,” 3806–16. ACM, 2016. <a href=\"https://doi.org/10.1145/2858036.2858354\">https://doi.org/10.1145/2858036.2858354</a>.","mla":"Bächer, Moritz, et al. <i>DefSense: Computational Design of Customized Deformable Input Devices</i>. ACM, 2016, pp. 3806–16, doi:<a href=\"https://doi.org/10.1145/2858036.2858354\">10.1145/2858036.2858354</a>.","ama":"Bächer M, Hepp B, Pece F, et al. DefSense: computational design of customized deformable input devices. In: ACM; 2016:3806-3816. doi:<a href=\"https://doi.org/10.1145/2858036.2858354\">10.1145/2858036.2858354</a>","ista":"Bächer M, Hepp B, Pece F, Kry P, Bickel B, Thomaszewski B, Hilliges O. 2016. DefSense: computational design of customized deformable input devices. CHI: Conference on Human Factors in Computing Systems, 3806–3816."},"conference":{"name":"CHI: Conference on Human Factors in Computing Systems","location":"San Jose, California, USA","end_date":"2016-05-12","start_date":"2016-05-07"},"status":"public","day":"07","external_id":{"isi":["000380532903074"]},"doi":"10.1145/2858036.2858354","article_processing_charge":"No","publisher":"ACM","publist_id":"5951","date_created":"2018-12-11T11:51:21Z","acknowledgement":"We  thank  Damian  Karrer,   Rocco  Ghielmini  and  Jemin\r\nHwangbo for their help in our initial explorations. We would\r\nlike to thank Christian Schumacher for creating the video and\r\nC\r\n ́\r\necile Edwards-Rietmann for providing the voiceover. Mau-\r\nrizio Nitti helped us in designing our 3D characters. We thank\r\nChiara Daraio for insightful discussions on material proper-\r\nties and 3D printing.   We also thank the CHI reviewers for\r\ntheir feedback and guidance. Fabrizio Pece was supported by\r\nan ETH/Marie Curie fellowship (FEL-3314-1).","abstract":[{"text":"We present a novel optimization-based algorithm for the design and fabrication of customized, deformable input devices, capable of continuously sensing their deformation. We propose to embed piezoresistive sensing elements into flexible 3D printed objects. These sensing elements are then utilized to recover rich and natural user interactions at runtime. Designing such objects is a challenging and hard problem if attempted manually for all but the simplest geometries and deformations. Our method simultaneously optimizes the internal routing of the sensing elements and computes a mapping from low-level sensor readings to user-specified outputs in order to minimize reconstruction error. We demonstrate the power and flexibility of the approach by designing and fabricating a set of flexible input devices. Our results indicate that the optimization-based design greatly outperforms manual routings in terms of reconstruction accuracy and thus interaction fidelity.","lang":"eng"}],"date_published":"2016-05-07T00:00:00Z","publication_status":"published","date_updated":"2025-09-22T08:28:21Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1319","quality_controlled":"1","month":"05"},{"year":"2016","language":[{"iso":"eng"}],"author":[{"last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","first_name":"Moritz","full_name":"Lang, Moritz"},{"first_name":"Eduardo","last_name":"Sontag","full_name":"Sontag, Eduardo"}],"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"conference":{"start_date":"2016-07-06","end_date":"2016-07-08","location":"Boston, MA, USA","name":"ACC: American Control Conference"},"status":"public","pubrep_id":"810","ddc":["003","621"],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","publist_id":"5950","publisher":"IEEE","oa":1,"date_created":"2018-12-11T11:51:21Z","file_date_updated":"2025-06-25T11:46:36Z","abstract":[{"lang":"eng","text":"In recent years, several biomolecular systems have been shown to be scale-invariant (SI), i.e. to show the same output dynamics when exposed to geometrically scaled input signals (u → pu, p &gt; 0) after pre-adaptation to accordingly scaled constant inputs. In this article, we show that SI systems-as well as systems invariant with respect to other input transformations-can realize nonlinear differential operators: when excited by inputs obeying functional forms characteristic for a given class of invariant systems, the systems' outputs converge to constant values directly quantifying the speed of the input."}],"acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n° [291734]. Work supported in part by grants AFOSR FA9550-14-1-0060 and NIH 1R01GM100473.","volume":"2016-July","OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","type":"conference","title":"Scale-invariant systems realize nonlinear differential operators","oa_version":"Submitted Version","citation":{"ista":"Lang M, Sontag E. 2016. Scale-invariant systems realize nonlinear differential operators. ACC: American Control Conference vol. 2016–July, 7526722.","chicago":"Lang, Moritz, and Eduardo Sontag. “Scale-Invariant Systems Realize Nonlinear Differential Operators,” Vol. 2016–July. IEEE, 2016. <a href=\"https://doi.org/10.1109/ACC.2016.7526722\">https://doi.org/10.1109/ACC.2016.7526722</a>.","ama":"Lang M, Sontag E. Scale-invariant systems realize nonlinear differential operators. In: Vol 2016-July. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/ACC.2016.7526722\">10.1109/ACC.2016.7526722</a>","mla":"Lang, Moritz, and Eduardo Sontag. <i>Scale-Invariant Systems Realize Nonlinear Differential Operators</i>. Vol. 2016–July, 7526722, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/ACC.2016.7526722\">10.1109/ACC.2016.7526722</a>.","short":"M. Lang, E. Sontag, in:, IEEE, 2016.","apa":"Lang, M., &#38; Sontag, E. (2016). Scale-invariant systems realize nonlinear differential operators (Vol. 2016–July). Presented at the ACC: American Control Conference, Boston, MA, USA: IEEE. <a href=\"https://doi.org/10.1109/ACC.2016.7526722\">https://doi.org/10.1109/ACC.2016.7526722</a>","ieee":"M. Lang and E. Sontag, “Scale-invariant systems realize nonlinear differential operators,” presented at the ACC: American Control Conference, Boston, MA, USA, 2016, vol. 2016–July."},"file":[{"file_size":539166,"access_level":"open_access","date_created":"2018-12-12T10:16:17Z","file_name":"IST-2017-810-v1+1_root.pdf","creator":"system","relation":"main_file","checksum":"7219432b43defc62a0d45f48d4ce6a19","file_id":"5203","date_updated":"2025-06-25T11:46:36Z","content_type":"application/pdf"}],"day":"28","article_number":"7526722","doi":"10.1109/ACC.2016.7526722","OA_type":"green","article_processing_charge":"No","ec_funded":1,"date_published":"2016-07-28T00:00:00Z","quality_controlled":"1","month":"07","date_updated":"2025-06-25T11:46:37Z","publication_status":"published","_id":"1320"},{"oa_version":"Published Version","type":"journal_article","title":"Asymmetric power boosts extortion in an economic experiment","scopus_import":"1","day":"04","publication":"PLoS One","external_id":{"isi":["000385696900024"]},"isi":1,"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:44Z","checksum":"6b33e394003dfe8b4ca6be1858aaa8e3","relation":"main_file","file_id":"4668","creator":"system","date_created":"2018-12-12T10:08:08Z","access_level":"open_access","file_name":"IST-2016-716-v1+1_journal.pone.0163867.PDF","file_size":2077905}],"citation":{"short":"C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).","apa":"Hilbe, C., Hagel, K., &#38; Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0163867\">https://doi.org/10.1371/journal.pone.0163867</a>","ieee":"C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” <i>PLoS One</i>, vol. 11, no. 10. Public Library of Science, 2016.","ista":"Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867.","chicago":"Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.” <i>PLoS One</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pone.0163867\">https://doi.org/10.1371/journal.pone.0163867</a>.","mla":"Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.” <i>PLoS One</i>, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pone.0163867\">10.1371/journal.pone.0163867</a>.","ama":"Hilbe C, Hagel K, Milinski M. Asymmetric power boosts extortion in an economic experiment. <i>PLoS One</i>. 2016;11(10). doi:<a href=\"https://doi.org/10.1371/journal.pone.0163867\">10.1371/journal.pone.0163867</a>"},"article_processing_charge":"No","doi":"10.1371/journal.pone.0163867","article_number":"e0163867","_id":"1322","date_updated":"2025-09-22T08:27:01Z","publication_status":"published","intvolume":"        11","month":"10","quality_controlled":"1","date_published":"2016-10-04T00:00:00Z","department":[{"_id":"KrCh"}],"corr_author":"1","author":[{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe"},{"last_name":"Hagel","first_name":"Kristin","full_name":"Hagel, Kristin"},{"first_name":"Manfred","last_name":"Milinski","full_name":"Milinski, Manfred"}],"language":[{"iso":"eng"}],"year":"2016","ddc":["004","006"],"pubrep_id":"716","status":"public","file_date_updated":"2020-07-14T12:44:44Z","date_created":"2018-12-11T11:51:22Z","publisher":"Public Library of Science","publist_id":"5948","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"research_data","id":"9867"},{"id":"9868","relation":"research_data","status":"public"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":11,"issue":"10","acknowledgement":"CH was funded by the Schrödinger program of the Austrian Science Fund (FWF) J3475. ","abstract":[{"lang":"eng","text":"Direct reciprocity is a major mechanism for the evolution of cooperation. Several classical studies have suggested that humans should quickly learn to adopt reciprocal strategies to establish mutual cooperation in repeated interactions. On the other hand, the recently discovered theory of ZD strategies has found that subjects who use extortionate strategies are able to exploit and subdue cooperators. Although such extortioners have been predicted to succeed in any population of adaptive opponents, theoretical follow-up studies questioned whether extortion can evolve in reality. However, most of these studies presumed that individuals have similar strategic possibilities and comparable outside options, whereas asymmetries are ubiquitous in real world applications. Here we show with a model and an economic experiment that extortionate strategies readily emerge once subjects differ in their strategic power. Our experiment combines a repeated social dilemma with asymmetric partner choice. In our main treatment there is one randomly chosen group member who is unilaterally allowed to exchange one of the other group members after every ten rounds of the social dilemma. We find that this asymmetric replacement opportunity generally promotes cooperation, but often the resulting payoff distribution reflects the underlying power structure. Almost half of the subjects in a better strategic position turn into extortioners, who quickly proceed to exploit their peers. By adapting their cooperation probabilities consistent with ZD theory, extortioners force their co-players to cooperate without being similarly cooperative themselves. Comparison to non-extortionate players under the same conditions indicates a substantial net gain to extortion. Our results thus highlight how power asymmetries can endanger mutually beneficial interactions, and transform them into exploitative relationships. In particular, our results indicate that the extortionate strategies predicted from ZD theory could play a more prominent role in our daily interactions than previously thought."}]},{"ddc":["571","572"],"pubrep_id":"715","status":"public","department":[{"_id":"PeJo"}],"corr_author":"1","language":[{"iso":"eng"}],"year":"2016","author":[{"full_name":"Vyleta, Nicholas","last_name":"Vyleta","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas"},{"full_name":"Borges Merjane, Carolina","orcid":"0000-0003-0005-401X","first_name":"Carolina","last_name":"Borges Merjane","id":"4305C450-F248-11E8-B48F-1D18A9856A87"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":5,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"abstract":[{"lang":"eng","text":"Mossy fiber synapses on CA3 pyramidal cells are 'conditional detonators' that reliably discharge postsynaptic targets. The 'conditional' nature implies that burst activity in dentate gyrus granule cells is required for detonation. Whether single unitary excitatory postsynaptic potentials (EPSPs) trigger spikes in CA3 neurons remains unknown. Mossy fiber synapses exhibit both pronounced short-term facilitation and uniquely large post-tetanic potentiation (PTP). We tested whether PTP could convert mossy fiber synapses from subdetonator into detonator mode, using a recently developed method to selectively and noninvasively stimulate individual presynaptic terminals in rat brain slices. Unitary EPSPs failed to initiate a spike in CA3 neurons under control conditions, but reliably discharged them after induction of presynaptic short-term plasticity. Remarkably, PTP switched mossy fiber synapses into full detonators for tens of seconds. Plasticity-dependent detonation may be critical for efficient coding, storage, and recall of information in the granule cell–CA3 cell network."}],"file_date_updated":"2020-07-14T12:44:44Z","publist_id":"5947","publisher":"eLife Sciences Publications","oa":1,"date_created":"2018-12-11T11:51:22Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","project":[{"grant_number":"268548","_id":"25C0F108-B435-11E9-9278-68D0E5697425","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","call_identifier":"FP7"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse"}],"day":"25","publication":"eLife","external_id":{"isi":["000387034600001"]},"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:44Z","creator":"system","file_id":"5257","checksum":"a7201280c571bed88ebd459ce5ce6a47","relation":"main_file","file_size":1477891,"date_created":"2018-12-12T10:17:05Z","file_name":"IST-2016-715-v1+1_e17977-download.pdf","access_level":"open_access"}],"isi":1,"citation":{"ama":"Vyleta N, Borges Merjane C, Jonas PM. Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. <i>eLife</i>. 2016;5. doi:<a href=\"https://doi.org/10.7554/eLife.17977\">10.7554/eLife.17977</a>","mla":"Vyleta, Nicholas, et al. “Plasticity-Dependent, Full Detonation at Hippocampal Mossy Fiber–CA3 Pyramidal Neuron Synapses.” <i>ELife</i>, vol. 5, e17977, eLife Sciences Publications, 2016, doi:<a href=\"https://doi.org/10.7554/eLife.17977\">10.7554/eLife.17977</a>.","chicago":"Vyleta, Nicholas, Carolina Borges Merjane, and Peter M Jonas. “Plasticity-Dependent, Full Detonation at Hippocampal Mossy Fiber–CA3 Pyramidal Neuron Synapses.” <i>ELife</i>. eLife Sciences Publications, 2016. <a href=\"https://doi.org/10.7554/eLife.17977\">https://doi.org/10.7554/eLife.17977</a>.","ista":"Vyleta N, Borges Merjane C, Jonas PM. 2016. Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. eLife. 5, e17977.","ieee":"N. Vyleta, C. Borges Merjane, and P. M. Jonas, “Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses,” <i>eLife</i>, vol. 5. eLife Sciences Publications, 2016.","short":"N. Vyleta, C. Borges Merjane, P.M. Jonas, ELife 5 (2016).","apa":"Vyleta, N., Borges Merjane, C., &#38; Jonas, P. M. (2016). Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.17977\">https://doi.org/10.7554/eLife.17977</a>"},"oa_version":"Published Version","type":"journal_article","title":"Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses","scopus_import":"1","publication_status":"published","date_updated":"2025-09-22T08:26:29Z","_id":"1323","quality_controlled":"1","month":"10","intvolume":"         5","ec_funded":1,"date_published":"2016-10-25T00:00:00Z","article_processing_charge":"No","article_number":"e17977","doi":"10.7554/eLife.17977"},{"article_processing_charge":"No","doi":"10.1609/icaps.v26i1.13737","intvolume":"      2016","month":"01","quality_controlled":"1","_id":"1324","publication_status":"published","date_updated":"2025-05-19T11:03:49Z","date_published":"2016-01-01T00:00:00Z","ec_funded":1,"oa_version":"None","scopus_import":"1","type":"conference","title":"Indefinite-horizon reachability in Goal-DEC-POMDPs","page":"88 - 96","day":"01","publication":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling","citation":{"short":"K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.","apa":"Chatterjee, K., &#38; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i> (Vol. 2016, pp. 88–96). London, United Kingdom: AAAI Press. <a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">https://doi.org/10.1609/icaps.v26i1.13737</a>","ieee":"K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>, London, United Kingdom, 2016, vol. 2016, pp. 88–96.","ista":"Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016, 88–96.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>, 2016:88–96. AAAI Press, 2016. <a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">https://doi.org/10.1609/icaps.v26i1.13737</a>.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>, vol. 2016, AAAI Press, 2016, pp. 88–96, doi:<a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">10.1609/icaps.v26i1.13737</a>.","ama":"Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>. Vol 2016. AAAI Press; 2016:88-96. doi:<a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">10.1609/icaps.v26i1.13737</a>"},"date_created":"2018-12-11T11:51:22Z","publist_id":"5946","oa":1,"publisher":"AAAI Press","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"volume":2016,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. Copyright ","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12999"}],"corr_author":"1","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"year":"2016","status":"public","conference":{"location":"London, United Kingdom","start_date":"2016-06-12","end_date":"2016-06-17","name":"ICAPS: International Conference on Automated Planning and Scheduling"}},{"day":"01","citation":{"apa":"Brázdil, T., Forejt, V., Kučera, A., &#38; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.10</a>","short":"T. Brázdil, V. Forejt, A. Kučera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.","chicago":"Brázdil, Tomáš, Vojtěch Forejt, Antonín Kučera, and Petr Novotný. “Stability in Graphs and Games,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.10</a>.","ama":"Brázdil T, Forejt V, Kučera A, Novotný P. Stability in graphs and games. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">10.4230/LIPIcs.CONCUR.2016.10</a>","mla":"Brázdil, Tomáš, et al. <i>Stability in Graphs and Games</i>. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">10.4230/LIPIcs.CONCUR.2016.10</a>.","ista":"Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10."},"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:44Z","creator":"system","relation":"main_file","checksum":"3c2dc6ab0358f8aa8f7aa7d6c1293159","file_id":"5229","file_size":553648,"file_name":"IST-2016-665-v1+1_Forejt_et_al__Stability_in_graphs_and_games.pdf","date_created":"2018-12-12T10:16:40Z","access_level":"open_access"}],"oa_version":"Published Version","scopus_import":1,"type":"conference","title":"Stability in graphs and games","month":"08","intvolume":"        59","quality_controlled":"1","_id":"1325","publication_status":"published","date_updated":"2024-10-09T20:57:03Z","date_published":"2016-08-01T00:00:00Z","ec_funded":1,"doi":"10.4230/LIPIcs.CONCUR.2016.10","article_number":"10","pubrep_id":"665","ddc":["004"],"alternative_title":["LIPIcs"],"conference":{"name":"CONCUR: Concurrency Theory","location":"Quebec City, Canada","start_date":"2016-08-23","end_date":"2016-08-26"},"status":"public","corr_author":"1","department":[{"_id":"KrCh"}],"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"full_name":"Kučera, Antonín","first_name":"Antonín","last_name":"Kučera"},{"last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotny, Petr"}],"year":"2016","language":[{"iso":"eng"}],"volume":59,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system.","lang":"eng"}],"acknowledgement":"The work has been supported by the Czech Science Foundation, grant No. 15-17564S, by EPSRC grant\r\nEP/M023656/1, and by the People Programme (Marie Curie Actions) of the European Union’s Seventh\r\nFramework Programme (FP7/2007-2013) under REA grant agreement no [291734]","date_created":"2018-12-11T11:51:23Z","publist_id":"5944","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"file_date_updated":"2020-07-14T12:44:44Z","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"article_processing_charge":"No","doi":"10.1007/978-3-319-46520-3_3","intvolume":"      9938","month":"09","quality_controlled":"1","_id":"1326","date_updated":"2025-09-22T08:25:26Z","publication_status":"published","date_published":"2016-09-22T00:00:00Z","ec_funded":1,"oa_version":"Preprint","scopus_import":"1","type":"conference","title":"Optimizing the expected mean payoff in Energy Markov Decision Processes","page":"32 - 49","external_id":{"arxiv":["1607.00678"],"isi":["000389808100003"]},"day":"22","citation":{"short":"T. Brázdil, A. Kučera, P. Novotný, in:, Springer, 2016, pp. 32–49.","apa":"Brázdil, T., Kučera, A., &#38; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">https://doi.org/10.1007/978-3-319-46520-3_3</a>","ieee":"T. Brázdil, A. Kučera, and P. Novotný, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.","ista":"Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49.","chicago":"Brázdil, Tomáš, Antonín Kučera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,” 9938:32–49. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">https://doi.org/10.1007/978-3-319-46520-3_3</a>.","mla":"Brázdil, Tomáš, et al. <i>Optimizing the Expected Mean Payoff in Energy Markov Decision Processes</i>. Vol. 9938, Springer, 2016, pp. 32–49, doi:<a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">10.1007/978-3-319-46520-3_3</a>.","ama":"Brázdil T, Kučera A, Novotný P. Optimizing the expected mean payoff in Energy Markov Decision Processes. In: Vol 9938. Springer; 2016:32-49. doi:<a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">10.1007/978-3-319-46520-3_3</a>"},"isi":1,"date_created":"2018-12-11T11:51:23Z","publist_id":"5943","oa":1,"publisher":"Springer","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"volume":9938,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff. "}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00678"}],"arxiv":1,"acknowledgement":"The research was funded by the Czech Science Foundation Grant No. P202/12/G061 and by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].","corr_author":"1","department":[{"_id":"KrCh"}],"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"},{"last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotny, Petr"}],"year":"2016","language":[{"iso":"eng"}],"status":"public","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","location":"Chiba, Japan","end_date":"2016-10-20","start_date":"2016-10-17"},"alternative_title":["LNCS"]},{"citation":{"mla":"Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, ACM, 2016, pp. 1465–66.","ama":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. Stochastic shortest path with energy constraints in POMDPs. In: <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>. ACM; 2016:1465-1466.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, 1465–66. ACM, 2016.","ista":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents &#38; Multiagent Systems, 1465–1466.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotný, “Stochastic shortest path with energy constraints in POMDPs,” in <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, Singapore, 2016, pp. 1465–1466.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &#38; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i> (pp. 1465–1466). Singapore: ACM."},"day":"01","publication":"Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems","external_id":{"arxiv":["1602.07565"]},"title":"Stochastic shortest path with energy constraints in POMDPs","type":"conference","page":"1465 - 1466","scopus_import":"1","oa_version":"Preprint","date_published":"2016-01-01T00:00:00Z","ec_funded":1,"_id":"1327","publication_status":"published","date_updated":"2025-06-04T10:26:23Z","month":"01","quality_controlled":"1","article_processing_charge":"No","conference":{"name":"AAMAS: Autonomous Agents & Multiagent Systems","location":"Singapore","start_date":"2016-05-09","end_date":"2016-05-13"},"status":"public","author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"full_name":"Gupta, Anchit","first_name":"Anchit","last_name":"Gupta"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr"}],"language":[{"iso":"eng"}],"year":"2016","department":[{"_id":"KrCh"}],"arxiv":1,"abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we present a novel algorithm for solving POMDPs with energy levels, developing on existing POMDP solvers and using RTDP as its main method. Our second contribution is related to policy representation. For larger POMDP instances the policies computed by existing solvers are too large to be understandable. We present an automated procedure based on machine learning techniques that automatically extracts important decisions of the policy allowing us to compute succinct human readable policies. Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels. "}],"main_file_link":[{"url":"https://arxiv.org/abs/1602.07565","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"date_created":"2018-12-11T11:51:23Z","publisher":"ACM","publist_id":"5942","oa":1},{"issue":"10","acknowledgement":"This study was financially supported by individual grants from the Volkswagen Stiftung (to M.C.), the Deutsche Forschungsgemeinschaft (grant PA 903/6 to J.P.) and the DAAD (to A.K.H.). The authors would like to thank I. Schrank, L. Theodosiou, M. Kredler, C. Laforsch, J. Wolinska, J. Griebel, R. Jaenichen, and K. Otte for providing the necessary resources and help for maintaining Daphnia cultures in the laboratory. H. Lainer supported us for the molecular laboratory work. D. Gilbert and J. K. Colbourne contributed ideas for the bioinformatics analysis, and L. Hardulak did the orthology mapping including more insect species. This study was financially supported by individual grants from the Volkswagen Stiftung (to M.C.), the Deutsche Forschungsgemeinschaft (grant PA 903/6 to J.P.) and the DAAD (to A.K.H.). This work benefits from and contributes to the Daphnia Genomics Consortium.","abstract":[{"text":"Daphnia species have become models for ecological genomics and exhibit interesting features, such as high phenotypic plasticity and a densely packed genome with many lineage-specific genes. They are also cyclic parthenogenetic, with alternating asexual and sexual cycles and environmental sex determination. Here, we present a de novo transcriptome assembly of over 32,000 D. galeata genes and use it to investigate gene expression in females and spontaneously produced males of two clonal lines derived from lakes in Germany and the Czech Republic. We find that only a low percentage (18%) of genes shows sex-biased expression and that there are many more female-biased gene (FBG) than male-biased gene (MBG). Furthermore, FBGs tend to be more conserved between species than MBGs in both sequence and expression. These patterns may be a consequence of cyclic parthenogenesis leading to a relaxation of purifying selection on MBGs. The two clonal lines show considerable differences in both number and identity of sex-biased genes, suggesting that they may have reproductive strategies differing in their investment in sexual reproduction. Orthologs of key genes in the sex determination and juvenile hormone pathways, which are thought to be important for the transition from asexual to sexual reproduction, are present in D. galeata and highly conserved among Daphnia species.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":8,"has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"file_date_updated":"2020-07-14T12:44:44Z","date_created":"2018-12-11T11:51:24Z","publist_id":"5940","oa":1,"publisher":"Oxford University Press","status":"public","ddc":["576"],"pubrep_id":"663","author":[{"orcid":"0000-0001-8871-4961","full_name":"Huylmans, Ann K","last_name":"Huylmans","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","first_name":"Ann K"},{"first_name":"Alberto","last_name":"López Ezquerra","full_name":"López Ezquerra, Alberto"},{"last_name":"Parsch","first_name":"John","full_name":"Parsch, John"},{"full_name":"Cordellier, Mathilde","first_name":"Mathilde","last_name":"Cordellier"}],"year":"2016","language":[{"iso":"eng"}],"department":[{"_id":"BeVi"}],"date_published":"2016-10-01T00:00:00Z","_id":"1329","publication_status":"published","date_updated":"2025-09-22T08:24:02Z","intvolume":"         8","month":"10","quality_controlled":"1","doi":"10.1093/gbe/evw221","article_processing_charge":"No","isi":1,"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:44Z","creator":"system","relation":"main_file","checksum":"25c7adcb452d39d3b6343ff4b57a652d","file_id":"4924","file_size":1406265,"access_level":"open_access","date_created":"2018-12-12T10:12:06Z","file_name":"IST-2016-663-v1+1_Genome_Biol_Evol-2016-Huylmans-3120-39.pdf"}],"citation":{"ista":"Huylmans AK, López Ezquerra A, Parsch J, Cordellier M. 2016. De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata. Genome Biology and Evolution. 8(10), 3120–3139.","chicago":"Huylmans, Ann K, Alberto López Ezquerra, John Parsch, and Mathilde Cordellier. “De Novo Transcriptome Assembly and Sex-Biased Gene Expression in the Cyclical Parthenogenetic Daphnia Galeata.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/gbe/evw221\">https://doi.org/10.1093/gbe/evw221</a>.","mla":"Huylmans, Ann K., et al. “De Novo Transcriptome Assembly and Sex-Biased Gene Expression in the Cyclical Parthenogenetic Daphnia Galeata.” <i>Genome Biology and Evolution</i>, vol. 8, no. 10, Oxford University Press, 2016, pp. 3120–39, doi:<a href=\"https://doi.org/10.1093/gbe/evw221\">10.1093/gbe/evw221</a>.","ama":"Huylmans AK, López Ezquerra A, Parsch J, Cordellier M. De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata. <i>Genome Biology and Evolution</i>. 2016;8(10):3120-3139. doi:<a href=\"https://doi.org/10.1093/gbe/evw221\">10.1093/gbe/evw221</a>","short":"A.K. Huylmans, A. López Ezquerra, J. Parsch, M. Cordellier, Genome Biology and Evolution 8 (2016) 3120–3139.","apa":"Huylmans, A. K., López Ezquerra, A., Parsch, J., &#38; Cordellier, M. (2016). De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evw221\">https://doi.org/10.1093/gbe/evw221</a>","ieee":"A. K. Huylmans, A. López Ezquerra, J. Parsch, and M. Cordellier, “De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata,” <i>Genome Biology and Evolution</i>, vol. 8, no. 10. Oxford University Press, pp. 3120–3139, 2016."},"publication":"Genome Biology and Evolution","day":"01","external_id":{"isi":["000386121300005"]},"title":"De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata","type":"journal_article","page":"3120 - 3139","scopus_import":"1","oa_version":"Published Version"},{"oa_version":"Preprint","page":"833 - 845","title":"Billiards in convex bodies with acute angles","type":"journal_article","scopus_import":"1","day":"15","publication":"Israel Journal of Mathematics","external_id":{"isi":["000386356400012"],"arxiv":["1506.06014"]},"isi":1,"citation":{"apa":"Akopyan, A., &#38; Balitskiy, A. (2016). Billiards in convex bodies with acute angles. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-016-1429-z\">https://doi.org/10.1007/s11856-016-1429-z</a>","short":"A. Akopyan, A. Balitskiy, Israel Journal of Mathematics 216 (2016) 833–845.","ieee":"A. Akopyan and A. Balitskiy, “Billiards in convex bodies with acute angles,” <i>Israel Journal of Mathematics</i>, vol. 216, no. 2. Springer, pp. 833–845, 2016.","chicago":"Akopyan, Arseniy, and Alexey Balitskiy. “Billiards in Convex Bodies with Acute Angles.” <i>Israel Journal of Mathematics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11856-016-1429-z\">https://doi.org/10.1007/s11856-016-1429-z</a>.","ama":"Akopyan A, Balitskiy A. Billiards in convex bodies with acute angles. <i>Israel Journal of Mathematics</i>. 2016;216(2):833-845. doi:<a href=\"https://doi.org/10.1007/s11856-016-1429-z\">10.1007/s11856-016-1429-z</a>","mla":"Akopyan, Arseniy, and Alexey Balitskiy. “Billiards in Convex Bodies with Acute Angles.” <i>Israel Journal of Mathematics</i>, vol. 216, no. 2, Springer, 2016, pp. 833–45, doi:<a href=\"https://doi.org/10.1007/s11856-016-1429-z\">10.1007/s11856-016-1429-z</a>.","ista":"Akopyan A, Balitskiy A. 2016. Billiards in convex bodies with acute angles. Israel Journal of Mathematics. 216(2), 833–845."},"article_processing_charge":"No","doi":"10.1007/s11856-016-1429-z","publication_status":"published","date_updated":"2025-09-22T08:23:27Z","_id":"1330","quality_controlled":"1","month":"10","intvolume":"       216","ec_funded":1,"date_published":"2016-10-15T00:00:00Z","department":[{"_id":"HeEd"}],"corr_author":"1","year":"2016","language":[{"iso":"eng"}],"author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Balitskiy, Alexey","first_name":"Alexey","last_name":"Balitskiy"}],"status":"public","publist_id":"5938","publisher":"Springer","oa":1,"date_created":"2018-12-11T11:51:24Z","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":216,"acknowledgement":"Supported by People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n°[291734]. Supported by the Russian Foundation for Basic Research grant 15-31-20403 (mol a ved), by the Russian Foundation for Basic Research grant 15-01-99563 A, in part by the Moebius Contest Foundation for Young Scientists, and in part by the Simons Foundation.","issue":"2","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.06014"}],"abstract":[{"text":"In this paper we investigate the existence of closed billiard trajectories in not necessarily smooth convex bodies. In particular, we show that if a body K ⊂ Rd has the property that the tangent cone of every non-smooth point q ∉ ∂K is acute (in a certain sense), then there is a closed billiard trajectory in K.","lang":"eng"}]}]
