[{"type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"ddc":["004"],"file_date_updated":"2020-07-14T12:48:18Z","acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","author":[{"last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal","first_name":"Michal"}],"date_updated":"2023-09-07T12:05:41Z","abstract":[{"text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language).","lang":"eng"}],"page":"97","date_published":"2017-05-01T00:00:00Z","_id":"992","ec_funded":1,"title":"Complexity of constraint satisfaction","date_created":"2018-12-11T11:49:35Z","citation":{"chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>.","mla":"Rolinek, Michal. <i>Complexity of Constraint Satisfaction</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>.","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>","ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","apa":"Rolinek, M. (2017). <i>Complexity of constraint satisfaction</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>","ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria."},"publication_status":"published","degree_awarded":"PhD","department":[{"_id":"VlKo"}],"publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:48:18Z","checksum":"81761fb939acb7585c36629f765b4373","creator":"system","file_id":"4654","file_size":786145,"date_created":"2018-12-12T10:07:55Z","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","content_type":"application/pdf"},{"file_name":"2017_Thesis_Rolinek_source.zip","date_created":"2019-04-05T08:43:24Z","content_type":"application/zip","date_updated":"2020-07-14T12:48:18Z","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","relation":"source_file","access_level":"closed","creator":"dernst","file_size":5936337,"file_id":"6208"}],"status":"public","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","month":"05","pubrep_id":"815","publist_id":"6407","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","oa_version":"Published Version","has_accepted_license":"1","supervisor":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"}],"oa":1,"project":[{"grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/AT:ISTA:th_815"},{"oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","external_id":{"isi":["000400560700001"]},"month":"05","status":"public","year":"2017","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","day":"04","pubrep_id":"819","publist_id":"6406","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.1038/ncomms15140","publication":"Nature Communications","isi":1,"volume":8,"oa":1,"author":[{"full_name":"Levina (Martius), Anna","first_name":"Anna","id":"35AF8020-F248-11E8-B48F-1D18A9856A87","last_name":"Levina (Martius)"},{"last_name":"Priesemann","first_name":"Viola","full_name":"Priesemann, Viola"}],"file_date_updated":"2020-07-14T12:48:19Z","article_number":"15140","abstract":[{"lang":"eng","text":"In real-world applications, observations are often constrained to a small fraction of a system. Such spatial subsampling can be caused by the inaccessibility or the sheer size of the system, and cannot be overcome by longer sampling. Spatial subsampling can strongly bias inferences about a system’s aggregated properties. To overcome the bias, we derive analytically a subsampling scaling framework that is applicable to different observables, including distributions of neuronal avalanches, of number of people infected during an epidemic outbreak, and of node degrees. We demonstrate how to infer the correct distributions of the underlying full system, how to apply it to distinguish critical from subcritical systems, and how to disentangle subsampling and finite size effects. Lastly, we apply subsampling scaling to neuronal avalanche models and to recordings from developing neural networks. We show that only mature, but not young networks follow power-law scaling, indicating self-organization to criticality during development."}],"date_updated":"2023-09-22T09:54:07Z","type":"journal_article","intvolume":"         8","ddc":["005","571"],"publication_identifier":{"issn":["20411723"]},"department":[{"_id":"GaTk"},{"_id":"JoCs"}],"publisher":"Nature Publishing Group","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"date_updated":"2020-07-14T12:48:19Z","checksum":"9880212f8c4c53404c7c6fbf9023c53a","relation":"main_file","access_level":"open_access","creator":"system","file_size":746224,"file_id":"5122","file_name":"IST-2017-819-v1+1_2017_Levina_SubsamplingScaling.pdf","date_created":"2018-12-12T10:15:05Z","content_type":"application/pdf"}],"title":"Subsampling scaling","ec_funded":1,"_id":"993","date_published":"2017-05-04T00:00:00Z","date_created":"2018-12-11T11:49:35Z","publication_status":"published","citation":{"chicago":"Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncomms15140\">https://doi.org/10.1038/ncomms15140</a>.","mla":"Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” <i>Nature Communications</i>, vol. 8, 15140, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/ncomms15140\">10.1038/ncomms15140</a>.","short":"A. Levina (Martius), V. Priesemann, Nature Communications 8 (2017).","ieee":"A. Levina (Martius) and V. Priesemann, “Subsampling scaling,” <i>Nature Communications</i>, vol. 8. Nature Publishing Group, 2017.","ama":"Levina (Martius) A, Priesemann V. Subsampling scaling. <i>Nature Communications</i>. 2017;8. doi:<a href=\"https://doi.org/10.1038/ncomms15140\">10.1038/ncomms15140</a>","apa":"Levina (Martius), A., &#38; Priesemann, V. (2017). Subsampling scaling. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms15140\">https://doi.org/10.1038/ncomms15140</a>","ista":"Levina (Martius) A, Priesemann V. 2017. Subsampling scaling. Nature Communications. 8, 15140."}},{"author":[{"first_name":"Igor","full_name":"Cherepanov, Igor","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","last_name":"Cherepanov"},{"first_name":"Mikhail","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"https://arxiv.org/abs/1705.09220","open_access":"1"}],"issue":"3","abstract":[{"lang":"eng","text":"The formation of vortices is usually considered to be the main mechanism of angular momentum disposal in superfluids. Recently, it was predicted that a superfluid can acquire angular momentum via an alternative, microscopic route -- namely, through interaction with rotating impurities, forming so-called `angulon quasiparticles' [Phys. Rev. Lett. 114, 203001 (2015)]. The angulon instabilities correspond to transfer of a small number of angular momentum quanta from the impurity to the superfluid, as opposed to vortex instabilities, where angular momentum is quantized in units of ℏ  per atom. Furthermore, since conventional impurities (such as molecules) represent three-dimensional (3D) rotors, the angular momentum transferred is intrinsically 3D as well, as opposed to a merely planar rotation which is inherent to vortices. Herein we show that the angulon theory can explain the anomalous broadening of the spectroscopic lines observed for CH 3   and NH 3   molecules in superfluid helium nanodroplets, thereby providing a fingerprint of the emerging angulon instabilities in experiment."}],"date_updated":"2023-09-22T09:53:42Z","type":"journal_article","intvolume":"         1","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","ec_funded":1,"title":"Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules","_id":"994","date_published":"2017-08-08T00:00:00Z","date_created":"2018-12-11T11:49:35Z","publication_status":"published","citation":{"ista":"Cherepanov I, Lemeshko M. 2017. Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. Physical Review Materials. 1(3).","ieee":"I. Cherepanov and M. Lemeshko, “Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules,” <i>Physical Review Materials</i>, vol. 1, no. 3. American Physical Society, 2017.","ama":"Cherepanov I, Lemeshko M. Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. <i>Physical Review Materials</i>. 2017;1(3). doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.1.035602\">10.1103/PhysRevMaterials.1.035602</a>","apa":"Cherepanov, I., &#38; Lemeshko, M. (2017). Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules. <i>Physical Review Materials</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevMaterials.1.035602\">https://doi.org/10.1103/PhysRevMaterials.1.035602</a>","chicago":"Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities in the Spectra of Matrix-Isolated Molecules.” <i>Physical Review Materials</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevMaterials.1.035602\">https://doi.org/10.1103/PhysRevMaterials.1.035602</a>.","mla":"Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities in the Spectra of Matrix-Isolated Molecules.” <i>Physical Review Materials</i>, vol. 1, no. 3, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.1.035602\">10.1103/PhysRevMaterials.1.035602</a>.","short":"I. Cherepanov, M. Lemeshko, Physical Review Materials 1 (2017)."},"oa_version":"Submitted Version","scopus_import":"1","quality_controlled":"1","external_id":{"isi":["000416564000004"]},"month":"08","status":"public","year":"2017","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"08","publist_id":"6405","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"FWF","grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"doi":"10.1103/PhysRevMaterials.1.035602","publication":"Physical Review Materials","isi":1,"volume":1,"oa":1},{"publisher":"American Physical Society","department":[{"_id":"MiLe"}],"citation":{"ista":"Bighin G, Lemeshko M. 2017. Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment. Physical Review B - Condensed Matter and Materials Physics. 96(8), 085410.","ama":"Bighin G, Lemeshko M. Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2017;96(8). doi:<a href=\"https://doi.org/10.1103/PhysRevB.96.085410\">10.1103/PhysRevB.96.085410</a>","ieee":"G. Bighin and M. Lemeshko, “Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 96, no. 8. American Physical Society, 2017.","apa":"Bighin, G., &#38; Lemeshko, M. (2017). Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.96.085410\">https://doi.org/10.1103/PhysRevB.96.085410</a>","mla":"Bighin, Giacomo, and Mikhail Lemeshko. “Diagrammatic Approach to Orbital Quantum Impurities Interacting with a Many-Particle Environment.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 96, no. 8, 085410, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevB.96.085410\">10.1103/PhysRevB.96.085410</a>.","chicago":"Bighin, Giacomo, and Mikhail Lemeshko. “Diagrammatic Approach to Orbital Quantum Impurities Interacting with a Many-Particle Environment.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevB.96.085410\">https://doi.org/10.1103/PhysRevB.96.085410</a>.","short":"G. Bighin, M. Lemeshko, Physical Review B - Condensed Matter and Materials Physics 96 (2017)."},"publication_status":"published","date_created":"2018-12-11T11:49:36Z","date_published":"2017-08-07T00:00:00Z","_id":"995","title":"Diagrammatic approach to orbital quantum impurities interacting with a many-particle environment","date_updated":"2023-09-22T09:53:17Z","abstract":[{"lang":"eng","text":"Recently it was shown that an impurity exchanging orbital angular momentum with a surrounding bath can be described in terms of the angulon quasiparticle [Phys. Rev. Lett. 118, 095301 (2017)]. The angulon consists of a quantum rotor dressed by a many-particle field of boson excitations, and can be formed out of, for example, a molecule or a nonspherical atom in superfluid helium, or out of an electron coupled to lattice phonons or a Bose condensate. Here we develop an approach to the angulon based on the path-integral formalism, which sets the ground for a systematic, perturbative treatment of the angulon problem. The resulting perturbation series can be interpreted in terms of Feynman diagrams, from which, in turn, one can derive a set of diagrammatic rules. These rules extend the machinery of the graphical theory of angular momentum - well known from theoretical atomic spectroscopy - to the case where an environment with an infinite number of degrees of freedom is present. In particular, we show that each diagram can be interpreted as a 'skeleton', which enforces angular momentum conservation, dressed by an additional many-body contribution. This connection between the angulon theory and the graphical theory of angular momentum is particularly important as it allows to systematically and substantially simplify the analytical representation of each diagram. In order to exemplify the technique, we calculate the 1- and 2-loop contributions to the angulon self-energy, the spectral function, and the quasiparticle weight. The diagrammatic theory we develop paves the way to investigate next-to-leading order quantities in a more compact way compared to the variational approaches."}],"article_number":"085410","issue":"8","author":[{"orcid":"0000-0001-8823-9777","first_name":"Giacomo","full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.02616"}],"publication_identifier":{"issn":["24699950"]},"intvolume":"        96","type":"journal_article","isi":1,"publication":"Physical Review B - Condensed Matter and Materials Physics","doi":"10.1103/PhysRevB.96.085410","project":[{"name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","call_identifier":"FWF"}],"oa":1,"volume":96,"external_id":{"isi":["000407017100009"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6404","day":"07","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2017","status":"public","month":"08"},{"_id":"996","date_published":"2017-06-01T00:00:00Z","title":"Strongly aligned molecules inside helium droplets in the near-adiabatic regime","citation":{"ista":"Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt H. 2017. Strongly aligned molecules inside helium droplets in the near-adiabatic regime. The Journal of Chemical Physics. 147(1), 013946.","mla":"Shepperson, Benjamin, et al. “Strongly Aligned Molecules inside Helium Droplets in the Near-Adiabatic Regime.” <i>The Journal of Chemical Physics</i>, vol. 147, no. 1, 013946, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4983703\">10.1063/1.4983703</a>.","chicago":"Shepperson, Benjamin, Adam Chatterley, Anders Søndergaard, Lars Christiansen, Mikhail Lemeshko, and Henrik Stapelfeldt. “Strongly Aligned Molecules inside Helium Droplets in the Near-Adiabatic Regime.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4983703\">https://doi.org/10.1063/1.4983703</a>.","short":"B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko, H. Stapelfeldt, The Journal of Chemical Physics 147 (2017).","ama":"Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt H. Strongly aligned molecules inside helium droplets in the near-adiabatic regime. <i>The Journal of Chemical Physics</i>. 2017;147(1). doi:<a href=\"https://doi.org/10.1063/1.4983703\">10.1063/1.4983703</a>","ieee":"B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko, and H. Stapelfeldt, “Strongly aligned molecules inside helium droplets in the near-adiabatic regime,” <i>The Journal of Chemical Physics</i>, vol. 147, no. 1. AIP Publishing, 2017.","apa":"Shepperson, B., Chatterley, A., Søndergaard, A., Christiansen, L., Lemeshko, M., &#38; Stapelfeldt, H. (2017). Strongly aligned molecules inside helium droplets in the near-adiabatic regime. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4983703\">https://doi.org/10.1063/1.4983703</a>"},"publication_status":"published","date_created":"2018-12-11T11:49:36Z","publisher":"AIP Publishing","department":[{"_id":"MiLe"}],"intvolume":"       147","type":"journal_article","publication_identifier":{"issn":["00219606"]},"issue":"1","author":[{"full_name":"Shepperson, Benjamin","first_name":"Benjamin","last_name":"Shepperson"},{"full_name":"Chatterley, Adam","first_name":"Adam","last_name":"Chatterley"},{"last_name":"Søndergaard","first_name":"Anders","full_name":"Søndergaard, Anders"},{"full_name":"Christiansen, Lars","first_name":"Lars","last_name":"Christiansen"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"full_name":"Stapelfeldt, Henrik","first_name":"Henrik","last_name":"Stapelfeldt"}],"main_file_link":[{"url":"https://arxiv.org/abs/1704.03684","open_access":"1"}],"date_updated":"2024-02-28T13:02:26Z","article_number":"013946","abstract":[{"lang":"eng","text":"Iodine (I 2  ) molecules embedded in He nanodroplets are aligned by a 160 ps long laser pulse. The highest degree of alignment, occurring at the peak of the pulse and quantified by ⟨cos 2 θ 2D ⟩ , is measured as a function of the laser intensity. The results are well described by ⟨cos 2 θ 2D ⟩  calculated for a gas of isolated molecules each with an effective rotational constant of 0.6 times the gas-phase value, and at a temperature of 0.4 K. Theoretical analysis using the angulon quasiparticle to describe rotating molecules in superfluid helium rationalizes why the alignment mechanism is similar to that of isolated molecules with an effective rotational constant. A major advantage of molecules in He droplets is that their 0.4 K temperature leads to stronger alignment than what can generally be achieved for gas phase molecules -- here demonstrated by a direct comparison of the droplet results to measurements on a ∼  1 K supersonic beam of isolated molecules. This point is further illustrated for more complex system by measurements on 1,4-diiodobenzene and 1,4-dibromobenzene. For all three molecular species studied the highest values of ⟨cos 2 θ 2D ⟩  achieved in He droplets exceed 0.96. "}],"oa":1,"volume":147,"doi":"10.1063/1.4983703","isi":1,"publication":"The Journal of Chemical Physics","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2017","status":"public","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6403","day":"01","scopus_import":"1","oa_version":"Submitted Version","external_id":{"isi":["000405089400047"]},"quality_controlled":"1"},{"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"American Physical Society","title":"Emergence of non-abelian magnetic monopoles in a quantum impurity problem","ec_funded":1,"_id":"997","date_published":"2017-12-06T00:00:00Z","date_created":"2018-12-11T11:49:36Z","citation":{"ama":"Yakaboylu E, Deuchert A, Lemeshko M. Emergence of non-abelian magnetic monopoles in a quantum impurity problem. <i>Physical Review Letters</i>. 2017;119(23). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.119.235301\">10.1103/PhysRevLett.119.235301</a>","ieee":"E. Yakaboylu, A. Deuchert, and M. Lemeshko, “Emergence of non-abelian magnetic monopoles in a quantum impurity problem,” <i>Physical Review Letters</i>, vol. 119, no. 23. American Physical Society, 2017.","apa":"Yakaboylu, E., Deuchert, A., &#38; Lemeshko, M. (2017). Emergence of non-abelian magnetic monopoles in a quantum impurity problem. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.119.235301\">https://doi.org/10.1103/PhysRevLett.119.235301</a>","mla":"Yakaboylu, Enderalp, et al. “Emergence of Non-Abelian Magnetic Monopoles in a Quantum Impurity Problem.” <i>Physical Review Letters</i>, vol. 119, no. 23, 235301, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.119.235301\">10.1103/PhysRevLett.119.235301</a>.","chicago":"Yakaboylu, Enderalp, Andreas Deuchert, and Mikhail Lemeshko. “Emergence of Non-Abelian Magnetic Monopoles in a Quantum Impurity Problem.” <i>Physical Review Letters</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevLett.119.235301\">https://doi.org/10.1103/PhysRevLett.119.235301</a>.","short":"E. Yakaboylu, A. Deuchert, M. Lemeshko, Physical Review Letters 119 (2017).","ista":"Yakaboylu E, Deuchert A, Lemeshko M. 2017. Emergence of non-abelian magnetic monopoles in a quantum impurity problem. Physical Review Letters. 119(23), 235301."},"publication_status":"published","author":[{"last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp","full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874"},{"id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","last_name":"Deuchert","first_name":"Andreas","full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"https://arxiv.org/abs/1705.05162","open_access":"1"}],"issue":"23","abstract":[{"lang":"eng","text":"Recently it was shown that molecules rotating in superfluid helium can be described in terms of the angulon quasiparticles (Phys. Rev. Lett. 118, 095301 (2017)). Here we demonstrate that in the experimentally realized regime the angulon can be seen as a point charge on a 2-sphere interacting with a gauge field of a non-abelian magnetic monopole. Unlike in several other settings, the gauge fields of the angulon problem emerge in the real coordinate space, as opposed to the momentum space or some effective parameter space. Furthermore, we find a topological transition associated with making the monopole abelian, which takes place in the vicinity of the previously reported angulon instabilities. These results pave the way for studying topological phenomena in experiments on molecules trapped in superfluid helium nanodroplets, as well as on other realizations of orbital impurity problems."}],"article_type":"original","article_number":"235301","date_updated":"2023-10-10T13:31:54Z","intvolume":"       119","type":"journal_article","publication_identifier":{"issn":["0031-9007"]},"project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","grant_number":"P29902"}],"doi":"10.1103/PhysRevLett.119.235301","arxiv":1,"publication":"Physical Review Letters","isi":1,"volume":119,"oa":1,"oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["1705.05162"],"isi":["000417132100007"]},"month":"12","status":"public","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","day":"06","publist_id":"6401","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa_version":"Submitted Version","scopus_import":"1","quality_controlled":"1","external_id":{"isi":["000418371405066"]},"month":"04","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2017","day":"14","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"6400","doi":"10.1109/CVPR.2017.587","project":[{"name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","call_identifier":"FP7"}],"isi":1,"oa":1,"volume":2017,"author":[{"full_name":"Rebuffi, Sylvestre Alvise","first_name":"Sylvestre Alvise","last_name":"Rebuffi"},{"first_name":"Alexander","full_name":"Kolesnikov, Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sperl","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","first_name":"Georg"},{"first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.07725"}],"conference":{"name":"CVPR: Computer Vision and Pattern Recognition","location":"Honolulu, HA, United States","end_date":"2017-07-26","start_date":"2017-07-21"},"page":"5533 - 5542","abstract":[{"lang":"eng","text":"A major open problem on the road to artificial intelligence is the development of incrementally learning systems that learn about more and more concepts over time from a stream of data. In this work, we introduce a new training strategy, iCaRL, that allows learning in such a class-incremental way: only the training data for a small number of classes has to be present at the same time and new classes can be added progressively. iCaRL learns strong classifiers and a data representation simultaneously. This distinguishes it from earlier works that were fundamentally limited to fixed data representations and therefore incompatible with deep learning architectures. We show by experiments on CIFAR-100 and ImageNet ILSVRC 2012 data that iCaRL can learn many classes incrementally over a long period of time where other strategies quickly fail. "}],"date_updated":"2023-09-22T09:51:58Z","type":"conference","intvolume":"      2017","publication_identifier":{"isbn":["978-153860457-1"]},"publisher":"IEEE","department":[{"_id":"ChLa"},{"_id":"ChWo"}],"title":"iCaRL: Incremental classifier and representation learning","ec_funded":1,"date_published":"2017-04-14T00:00:00Z","_id":"998","publication_status":"published","citation":{"ista":"Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. 2017. iCaRL: Incremental classifier and representation learning. CVPR: Computer Vision and Pattern Recognition vol. 2017, 5533–5542.","apa":"Rebuffi, S. A., Kolesnikov, A., Sperl, G., &#38; Lampert, C. (2017). iCaRL: Incremental classifier and representation learning (Vol. 2017, pp. 5533–5542). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.587\">https://doi.org/10.1109/CVPR.2017.587</a>","ieee":"S. A. Rebuffi, A. Kolesnikov, G. Sperl, and C. Lampert, “iCaRL: Incremental classifier and representation learning,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 5533–5542.","ama":"Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. iCaRL: Incremental classifier and representation learning. In: Vol 2017. IEEE; 2017:5533-5542. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.587\">10.1109/CVPR.2017.587</a>","short":"S.A. Rebuffi, A. Kolesnikov, G. Sperl, C. Lampert, in:, IEEE, 2017, pp. 5533–5542.","mla":"Rebuffi, Sylvestre Alvise, et al. <i>ICaRL: Incremental Classifier and Representation Learning</i>. Vol. 2017, IEEE, 2017, pp. 5533–42, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.587\">10.1109/CVPR.2017.587</a>.","chicago":"Rebuffi, Sylvestre Alvise, Alexander Kolesnikov, Georg Sperl, and Christoph Lampert. “ICaRL: Incremental Classifier and Representation Learning,” 2017:5533–42. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.587\">https://doi.org/10.1109/CVPR.2017.587</a>."},"date_created":"2018-12-11T11:49:37Z"},{"type":"conference","intvolume":"        70","publication_identifier":{"isbn":["9781510855144"]},"author":[{"last_name":"Pentina","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia","full_name":"Pentina, Anastasia"},{"first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.06518"}],"page":"2807 - 2816","abstract":[{"text":"In multi-task learning, a learner is given a collection of prediction tasks and needs to solve all of them. In contrast to previous work, which required that annotated training data must be available for all tasks, we consider a new setting, in which for some tasks, potentially most of them, only unlabeled training data is provided. Consequently, to solve all tasks, information must be transferred between tasks with labels and tasks without labels. Focusing on an instance-based transfer method we analyze two variants of this setting: when the set of labeled tasks is fixed, and when it can be actively selected by the learner. We state and prove a generalization bound that covers both scenarios and derive from it an algorithm for making the choice of labeled tasks (in the active case) and for transferring information between the tasks in a principled way. We also illustrate the effectiveness of the algorithm on synthetic and real data. ","lang":"eng"}],"conference":{"name":"ICML: International Conference on Machine Learning","location":"Sydney, Australia","start_date":"2017-08-06","end_date":"2017-08-11"},"date_updated":"2023-10-17T11:53:32Z","title":"Multi-task learning with labeled and unlabeled tasks","ec_funded":1,"_id":"999","date_published":"2017-06-08T00:00:00Z","date_created":"2018-12-11T11:49:37Z","citation":{"mla":"Pentina, Anastasia, and Christoph Lampert. <i>Multi-Task Learning with Labeled and Unlabeled Tasks</i>. Vol. 70, ML Research Press, 2017, pp. 2807–16.","chicago":"Pentina, Anastasia, and Christoph Lampert. “Multi-Task Learning with Labeled and Unlabeled Tasks,” 70:2807–16. ML Research Press, 2017.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2017, pp. 2807–2816.","ieee":"A. Pentina and C. Lampert, “Multi-task learning with labeled and unlabeled tasks,” presented at the ICML: International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 2807–2816.","ama":"Pentina A, Lampert C. Multi-task learning with labeled and unlabeled tasks. In: Vol 70. ML Research Press; 2017:2807-2816.","apa":"Pentina, A., &#38; Lampert, C. (2017). Multi-task learning with labeled and unlabeled tasks (Vol. 70, pp. 2807–2816). Presented at the ICML: International Conference on Machine Learning, Sydney, Australia: ML Research Press.","ista":"Pentina A, Lampert C. 2017. Multi-task learning with labeled and unlabeled tasks. ICML: International Conference on Machine Learning, PMLR, vol. 70, 2807–2816."},"publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"ML Research Press","month":"06","year":"2017","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","day":"08","alternative_title":["PMLR"],"publist_id":"6399","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":"1","quality_controlled":"1","external_id":{"isi":["000683309502093"]},"volume":70,"oa":1,"project":[{"grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"isi":1},{"department":[{"_id":"UlWa"}],"publisher":"Springer","date_created":"2018-12-11T11:46:24Z","publication_status":"published","citation":{"ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. , 407–447.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J. Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, Springer, 2017, pp. 407–447.","mla":"Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin Loebl et al., Springer, 2017, pp. 407–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">10.1007/978-3-319-44479-6_17</a>.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers.” In <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin Loebl, Jaroslav Nešetřil, and Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">https://doi.org/10.1007/978-3-319-44479-6_17</a>.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nešetřil, &#38; R. Thomas (Eds.), <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i> (pp. 407–447). Springer. <a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">https://doi.org/10.1007/978-3-319-44479-6_17</a>","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly numbers via betti numbers,” in <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017, pp. 407–447.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i>. A Journey Through Discrete Mathematics. Springer; 2017:407-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-44479-6_17\">10.1007/978-3-319-44479-6_17</a>"},"title":"Bounding helly numbers via betti numbers","_id":"424","date_published":"2017-10-06T00:00:00Z","page":"407 - 447","abstract":[{"lang":"eng","text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b, d) such that the following holds. If F is a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤ i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced Z2-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these [d/2] first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map C*(K)→C*(Rd)."}],"date_updated":"2024-02-28T12:59:37Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.4613v3"}],"author":[{"last_name":"Goaoc","full_name":"Goaoc, Xavier","first_name":"Xavier"},{"last_name":"Paták","first_name":"Pavel","full_name":"Paták, Pavel"},{"first_name":"Zuzana","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","last_name":"Patakova"},{"full_name":"Tancer, Martin","first_name":"Martin","orcid":"0000-0002-1191-6714","last_name":"Tancer"},{"full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"publication_identifier":{"isbn":["978-331944479-6"]},"editor":[{"full_name":"Loebl, Martin","first_name":"Martin","last_name":"Loebl"},{"last_name":"Nešetřil","full_name":"Nešetřil, Jaroslav","first_name":"Jaroslav"},{"last_name":"Thomas","first_name":"Robin","full_name":"Thomas, Robin"}],"type":"book_chapter","publication":"A Journey through Discrete Mathematics: A Tribute to Jiri Matousek","doi":"10.1007/978-3-319-44479-6_17","oa":1,"quality_controlled":"1","series_title":"A Journey Through Discrete Mathematics","oa_version":"Published Version","related_material":{"record":[{"relation":"earlier_version","id":"1512","status":"public"}]},"scopus_import":1,"day":"06","publist_id":"7399","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"10","language":[{"iso":"eng"}],"status":"public","year":"2017"},{"month":"01","year":"2017","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"01","publist_id":"7392","alternative_title":["Advances in Neural Information Processing Systems"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","quality_controlled":"1","external_id":{"arxiv":["1610.02132"]},"volume":2017,"oa":1,"arxiv":1,"intvolume":"      2017","type":"conference","publication_identifier":{"issn":["10495258"]},"author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Demjan","full_name":"Grubic, Demjan","last_name":"Grubic"},{"first_name":"Jerry","full_name":"Li, Jerry","last_name":"Li"},{"first_name":"Ryota","full_name":"Tomioka, Ryota","last_name":"Tomioka"},{"last_name":"Vojnović","first_name":"Milan","full_name":"Vojnović, Milan"}],"main_file_link":[{"url":"https://arxiv.org/abs/1610.02132","open_access":"1"}],"page":"1710-1721","abstract":[{"lang":"eng","text":"Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanks to its excellent scalability properties. A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating gradient updates between nodes; consequently, several lossy compresion heuristics have been proposed, by which nodes only communicate quantized gradients. Although effective in practice, these heuristics do not always converge. In this paper, we propose Quantized SGD (QSGD), a family of compression schemes with convergence guarantees and good practical performance. QSGD allows the user to smoothly trade off communication bandwidth and convergence time: nodes can adjust the number of bits sent per iteration, at the cost of possibly higher variance. We show that this trade-off is inherent, in the sense that improving it past some threshold would violate information-theoretic lower bounds. QSGD guarantees convergence for convex and non-convex objectives, under asynchrony, and can be extended to stochastic variance-reduced techniques. When applied to training deep neural networks for image classification and automated speech recognition, QSGD leads to significant reductions in end-to-end training time. For instance, on 16GPUs, we can train the ResNet-152 network to full accuracy on ImageNet 1.8 × faster than the full-precision variant. "}],"conference":{"location":"Long Beach, CA, United States","name":"NIPS: Neural Information Processing System","start_date":"2017-12-04","end_date":"2017-12-09"},"date_updated":"2023-10-17T11:48:03Z","title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","date_published":"2017-01-01T00:00:00Z","_id":"431","date_created":"2018-12-11T11:46:26Z","citation":{"ista":"Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. 2017. QSGD: Communication-efficient SGD via gradient quantization and encoding. NIPS: Neural Information Processing System, Advances in Neural Information Processing Systems, vol. 2017, 1710–1721.","short":"D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information Processing Systems Foundation, 2017, pp. 1710–1721.","mla":"Alistarh, Dan-Adrian, et al. <i>QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding</i>. Vol. 2017, Neural Information Processing Systems Foundation, 2017, pp. 1710–21.","chicago":"Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,” 2017:1710–21. Neural Information Processing Systems Foundation, 2017.","apa":"Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., &#38; Vojnović, M. (2017). QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol. 2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States: Neural Information Processing Systems Foundation.","ama":"Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing Systems Foundation; 2017:1710-1721.","ieee":"D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721."},"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Neural Information Processing Systems Foundation"},{"ddc":["000"],"publication_identifier":{"isbn":["978-151085514-4"]},"type":"conference","abstract":[{"lang":"eng","text":"Recently there has been significant interest in training machine-learning models at low precision: by reducing precision, one can reduce computation and communication by one order of magnitude. We examine training at reduced precision, both from a theoretical and practical perspective, and ask: is it possible to train models at end-to-end low precision with provable guarantees? Can this lead to consistent order-of-magnitude speedups? We mainly focus on linear models, and the answer is yes for linear models. We develop a simple framework called ZipML based on one simple but novel strategy called double sampling. Our ZipML framework is able to execute training at low precision with no bias, guaranteeing convergence, whereas naive quanti- zation would introduce significant bias. We val- idate our framework across a range of applica- tions, and show that it enables an FPGA proto- type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision. We further de- velop a variance-optimal stochastic quantization strategy and show that it can make a significant difference in a variety of settings. When applied to linear models together with double sampling, we save up to another 1.7 × in data movement compared with uniform quantization. When training deep networks with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. "}],"page":"4035 - 4043","conference":{"location":"Sydney, Australia","name":"ICML: International  Conference  on  Machine Learning","start_date":"2017-08-06","end_date":"2017-08-11"},"date_updated":"2023-10-17T12:31:15Z","author":[{"first_name":"Hantian","full_name":"Zhang, Hantian","last_name":"Zhang"},{"first_name":"Jerry","full_name":"Li, Jerry","last_name":"Li"},{"first_name":"Kaan","full_name":"Kara, Kaan","last_name":"Kara"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Liu","first_name":"Ji","full_name":"Liu, Ji"},{"first_name":"Ce","full_name":"Zhang, Ce","last_name":"Zhang"}],"file_date_updated":"2020-07-14T12:46:26Z","date_created":"2018-12-11T11:46:26Z","citation":{"apa":"Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., &#38; Zhang, C. (2017). ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In <i>Proceedings of Machine Learning Research</i> (Vol. 70, pp. 4035–4043). Sydney, Australia: ML Research Press.","ieee":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning,” in <i>Proceedings of Machine Learning Research</i>, Sydney, Australia, 2017, vol. 70, pp. 4035–4043.","ama":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. In: <i>Proceedings of Machine Learning Research</i>. Vol 70. ML Research Press; 2017:4035-4043.","short":"H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.","chicago":"Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” In <i>Proceedings of Machine Learning Research</i>, 70:4035–43. ML Research Press, 2017.","mla":"Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” <i>Proceedings of Machine Learning Research</i>, vol. 70, ML Research Press, 2017, pp. 4035–43.","ista":"Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning. Proceedings of Machine Learning Research. ICML: International  Conference  on  Machine Learning, PMLR Press, vol. 70, 4035–4043."},"publication_status":"published","title":"ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning","date_published":"2017-01-01T00:00:00Z","_id":"432","file":[{"file_name":"2017_ICML_Zhang.pdf","date_created":"2019-01-22T08:23:58Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:26Z","checksum":"86156ba7f4318e47cef3eb9092593c10","access_level":"open_access","relation":"main_file","file_id":"5869","file_size":849345,"creator":"dernst"}],"department":[{"_id":"DaAl"}],"publisher":"ML Research Press","day":"01","alternative_title":["PMLR Press"],"publist_id":"7391","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","language":[{"iso":"eng"}],"status":"public","year":"2017","article_processing_charge":"No","quality_controlled":"1","has_accepted_license":"1","oa_version":"Submitted Version","scopus_import":"1","volume":" 70","oa":1,"publication":"Proceedings of Machine Learning Research"},{"date_created":"2018-12-11T11:46:30Z","publication_status":"published","citation":{"ista":"Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction in biology . , 25–59.","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), <i>Mechanisms of primary energy transduction in biology </i> (pp. 25–59). Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/9781788010405-00025\">https://doi.org/10.1039/9781788010405-00025</a>","ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. <i>Mechanisms of Primary Energy Transduction in Biology </i>. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:<a href=\"https://doi.org/10.1039/9781788010405-00025\">10.1039/9781788010405-00025</a>","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in <i>Mechanisms of primary energy transduction in biology </i>, M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” <i>Mechanisms of Primary Energy Transduction in Biology </i>, edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:<a href=\"https://doi.org/10.1039/9781788010405-00025\">10.1039/9781788010405-00025</a>.","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In <i>Mechanisms of Primary Energy Transduction in Biology </i>, edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/9781788010405-00025\">https://doi.org/10.1039/9781788010405-00025</a>."},"date_published":"2017-11-29T00:00:00Z","_id":"444","title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions","publication":"Mechanisms of primary energy transduction in biology ","department":[{"_id":"LeSa"}],"publisher":"Royal Society of Chemistry","doi":"10.1039/9781788010405-00025","publist_id":"7379","publication_identifier":{"isbn":["978-1-78262-865-1"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","type":"book_chapter","language":[{"iso":"eng"}],"status":"public","year":"2017","month":"11","editor":[{"last_name":"Wikström","full_name":"Wikström, Mårten","first_name":"Mårten"}],"series_title":"Mechanisms of Primary Energy Transduction in Biology ","date_updated":"2021-01-12T07:56:59Z","abstract":[{"lang":"eng","text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy generation, contributing to the proton motive force used to produce ATP. It couples the transfer of two electrons between NADH and quinone to translocation of four protons across the membrane. It is the largest protein assembly of bacterial and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size, providing the important “minimal” model of complex I. The l-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. Previously, we have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane domain from Escherichia coli, followed by the atomic structure of intact, entire complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are well conserved from the bacterial version, whilst supernumerary subunits form an interlinked, stabilizing shell around the core. Subunits containing additional cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The structure of mammalian enzyme provides many insights into complex I mechanism, assembly, maturation and dysfunction, allowing detailed molecular analysis of disease-causing mutations."}],"quality_controlled":"1","page":"25 - 59","oa_version":"None","author":[{"orcid":"0000-0002-0977-7989","first_name":"Leonid A","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov"}]},{"date_updated":"2023-10-10T13:10:32Z","page":"299 - 325","article_type":"original","abstract":[{"lang":"eng","text":"We consider last passage percolation (LPP) models with exponentially distributed random variables, which are linked to the totally asymmetric simple exclusion process (TASEP). The competition interface for LPP was introduced and studied in Ferrari and Pimentel (2005a) for cases where the corresponding exclusion process had a rarefaction fan. Here we consider situations with a shock and determine the law of the fluctuations of the competition interface around its deter- ministic law of large number position. We also study the multipoint distribution of the LPP around the shock, extending our one-point result of Ferrari and Nejjar (2015)."}],"main_file_link":[{"open_access":"1","url":"http://alea.impa.br/articles/v14/14-17.pdf"}],"author":[{"last_name":"Ferrari","full_name":"Ferrari, Patrik","first_name":"Patrik"},{"full_name":"Nejjar, Peter","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","last_name":"Nejjar"}],"intvolume":"         9","type":"journal_article","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"publisher":"Instituto Nacional de Matematica Pura e Aplicada","date_created":"2018-12-11T11:46:31Z","citation":{"mla":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” <i>Revista Latino-Americana de Probabilidade e Estatística</i>, vol. 9, Instituto Nacional de Matematica Pura e Aplicada, 2017, pp. 299–325, doi:<a href=\"https://doi.org/10.30757/ALEA.v14-17\">10.30757/ALEA.v14-17</a>.","chicago":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” <i>Revista Latino-Americana de Probabilidade e Estatística</i>. Instituto Nacional de Matematica Pura e Aplicada, 2017. <a href=\"https://doi.org/10.30757/ALEA.v14-17\">https://doi.org/10.30757/ALEA.v14-17</a>.","short":"P. Ferrari, P. Nejjar, Revista Latino-Americana de Probabilidade e Estatística 9 (2017) 299–325.","ama":"Ferrari P, Nejjar P. Fluctuations of the competition interface in presence of shocks. <i>Revista Latino-Americana de Probabilidade e Estatística</i>. 2017;9:299-325. doi:<a href=\"https://doi.org/10.30757/ALEA.v14-17\">10.30757/ALEA.v14-17</a>","ieee":"P. Ferrari and P. Nejjar, “Fluctuations of the competition interface in presence of shocks,” <i>Revista Latino-Americana de Probabilidade e Estatística</i>, vol. 9. Instituto Nacional de Matematica Pura e Aplicada, pp. 299–325, 2017.","apa":"Ferrari, P., &#38; Nejjar, P. (2017). Fluctuations of the competition interface in presence of shocks. <i>Revista Latino-Americana de Probabilidade e Estatística</i>. Instituto Nacional de Matematica Pura e Aplicada. <a href=\"https://doi.org/10.30757/ALEA.v14-17\">https://doi.org/10.30757/ALEA.v14-17</a>","ista":"Ferrari P, Nejjar P. 2017. Fluctuations of the competition interface in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística. 9, 299–325."},"publication_status":"published","date_published":"2017-03-23T00:00:00Z","_id":"447","ec_funded":1,"title":"Fluctuations of the competition interface in presence of shocks","quality_controlled":"1","scopus_import":"1","oa_version":"Submitted Version","publist_id":"7376","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"23","status":"public","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","month":"03","publication":"Revista Latino-Americana de Probabilidade e Estatística","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804"}],"doi":"10.30757/ALEA.v14-17","volume":9,"oa":1},{"volume":113,"oa":1,"doi":"10.1016/j.bpj.2017.09.006","publication":"Biophysical Journal","month":"11","status":"public","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","day":"07","publist_id":"7369","pubrep_id":"965","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","quality_controlled":"1","has_accepted_license":"1","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","_id":"453","date_published":"2017-11-07T00:00:00Z","date_created":"2018-12-11T11:46:33Z","publication_status":"published","citation":{"ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” <i>Biophysical Journal</i>, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. 2017;113(9):2055-2067. doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., &#38; Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>. Biophysical Society, 2017. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067."},"department":[{"_id":"MaLo"}],"publisher":"Biophysical Society","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:31Z","checksum":"99a2474088e20ac74b1882c4fbbb45b1","creator":"system","file_size":977192,"file_id":"5052","date_created":"2018-12-12T10:14:03Z","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","content_type":"application/pdf"}],"type":"journal_article","intvolume":"       113","ddc":["570"],"author":[{"full_name":"Fallesen, Todd","first_name":"Todd","last_name":"Fallesen"},{"last_name":"Roostalu","first_name":"Johanna","full_name":"Roostalu, Johanna"},{"id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg","orcid":"0000-0001-6335-9748","first_name":"Christian F","full_name":"Düllberg, Christian F"},{"last_name":"Pruessner","full_name":"Pruessner, Gunnar","first_name":"Gunnar"},{"first_name":"Thomas","full_name":"Surrey, Thomas","last_name":"Surrey"}],"acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","file_date_updated":"2020-07-14T12:46:31Z","issue":"9","page":"2055 - 2067","article_type":"original","abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"date_updated":"2021-01-12T07:59:28Z"},{"oa":1,"volume":46,"publication":"Rundgespräche Forum Ökologie","article_processing_charge":"No","status":"public","year":"2017","language":[{"iso":"eng"}],"month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"962","publist_id":"7362","day":"04","oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","date_published":"2017-04-04T00:00:00Z","_id":"459","title":"Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern","citation":{"ieee":"S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern,” <i>Rundgespräche Forum Ökologie</i>, vol. 46. Verlag Dr. Friedrich Pfeil, pp. 105–116, 2017.","ama":"Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. <i>Rundgespräche Forum Ökologie</i>. 2017;46:105-116.","apa":"Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. <i>Rundgespräche Forum Ökologie</i>. Verlag Dr. Friedrich Pfeil.","mla":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” <i>Rundgespräche Forum Ökologie</i>, vol. 46, Verlag Dr. Friedrich Pfeil, 2017, pp. 105–16.","chicago":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” <i>Rundgespräche Forum Ökologie</i>. Verlag Dr. Friedrich Pfeil, 2017.","short":"S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116.","ista":"Cremer S. 2017. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. 46, 105–116."},"publication_status":"published","date_created":"2018-12-11T11:46:35Z","publisher":"Verlag Dr. Friedrich Pfeil","department":[{"_id":"SyCr"}],"file":[{"access_level":"open_access","relation":"main_file","checksum":"4919baf9050415ca151fe22497379f78","date_updated":"2020-07-14T12:46:32Z","file_size":1711131,"file_id":"5175","creator":"system","date_created":"2018-12-12T10:15:52Z","file_name":"IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf","content_type":"application/pdf"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png"},"type":"journal_article","intvolume":"        46","publication_identifier":{"issn":["2366-2875"]},"ddc":["592"],"file_date_updated":"2020-07-14T12:46:32Z","author":[{"last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","first_name":"Sylvia"}],"date_updated":"2023-10-17T12:28:13Z","page":"105 - 116","abstract":[{"lang":"eng","text":"The social insects bees, wasps, ants, and termites are species-rich, occur in many habitats, and often constitute a large part of the biomass. Many are also invasive, including species of termites, the red imported fire ant, and the Argentine ant. While invasive social insects have been a problem in Southern Europe for some time, Central Europa was free of invasive ant species until recently because most ants are adapted to warmer climates. Only in the 1990s, did Lasius neglectus, a close relative of the common black garden ant, arrive in Germany. First described in 1990 based on individuals collected in Budapest, the species has since been detected for example in France, Germany, Spain, England, and Kyrgyzstan. The species is spread with soil during construction work or plantings, and L. neglectus therefore is often found in parks and botanical gardens. Another invasive ant now spreading in southern Germany is Formica fuscocinerea, which occurs along rivers, including in the sandy floodplains of the river Isar. As is typical of pioneer species, F. fuscocinerea quickly becomes extremely abundant and therefore causes problems for example on playgrounds in Munich. All invasive ant species are characterized by cooperation across nests, leading to strongly interconnected, very large super-colonies. The resulting dominance results in the extinction of native ant species as well as other arthropod species and thus in the reduction of biodiversity."}]},{"author":[{"orcid":"0000-0001-5964-0203","first_name":"Sebastian","full_name":"Altmeyer, Sebastian","last_name":"Altmeyer","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Younghae","full_name":"Do, Younghae","last_name":"Do"},{"last_name":"Ryu","full_name":"Ryu, Soorok","first_name":"Soorok"}],"issue":"11","file_date_updated":"2020-07-14T12:46:32Z","abstract":[{"text":"We investigate transient behaviors induced by magnetic fields on the dynamics of the flow of a ferrofluid in the gap between two concentric, independently rotating cylinders. Without applying any magnetic fields, we uncover emergence of flow states constituted by a combination of a localized spiral state (SPIl) in the top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v) with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl + SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented, we observe the transient behaviors between multi-cell states passing through two critical thresholds in a strength of an axial (transverse) magnetic field. Before the first critical threshold of a magnetic field strength, multi-stable states with different number of cells could be observed. After the first critical threshold, we find the transient behavior between the three- and two-cell flow states. For more strength of magnetic field or after the second critical threshold, we discover that multi-cell states are disappeared and a localized spiral state remains to be stimulated. The studied transient behavior could be understood by the investigation of various quantities including a modal kinetic energy, a mode amplitude of the radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence of new flow states and the transient behavior between their states in ferrofluidic flows indicate that richer and potentially controllable dynamics through magnetic fields could be possible in ferrofluic flow.","lang":"eng"}],"article_type":"original","article_number":"113112","date_updated":"2024-02-28T13:02:12Z","intvolume":"        27","type":"journal_article","ddc":["530"],"publication_identifier":{"issn":["10541500"]},"publisher":"AIP Publishing","department":[{"_id":"BjHo"}],"file":[{"date_created":"2019-10-24T15:14:30Z","file_name":"2017_Chaos_Altmeyer.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"0731f9d416760c1062db258ca51f8bdc","date_updated":"2020-07-14T12:46:32Z","creator":"dernst","file_id":"6970","file_size":7714020}],"title":"Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow","date_published":"2017-11-01T00:00:00Z","_id":"463","citation":{"ista":"Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.","ama":"Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. <i>Chaos</i>. 2017;27(11). doi:<a href=\"https://doi.org/10.1063/1.5002771\">10.1063/1.5002771</a>","ieee":"S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow,” <i>Chaos</i>, vol. 27, no. 11. AIP Publishing, 2017.","apa":"Altmeyer, S., Do, Y., &#38; Ryu, S. (2017). Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. <i>Chaos</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5002771\">https://doi.org/10.1063/1.5002771</a>","mla":"Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” <i>Chaos</i>, vol. 27, no. 11, 113112, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.5002771\">10.1063/1.5002771</a>.","chicago":"Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” <i>Chaos</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.5002771\">https://doi.org/10.1063/1.5002771</a>.","short":"S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017)."},"publication_status":"published","date_created":"2018-12-11T11:46:37Z","oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","month":"11","article_processing_charge":"No","year":"2017","language":[{"iso":"eng"}],"status":"public","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7358","doi":"10.1063/1.5002771","publication":"Chaos","oa":1,"volume":27},{"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"issue":"3","file_date_updated":"2020-07-14T12:46:32Z","article_number":"26","abstract":[{"lang":"eng","text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years."}],"date_updated":"2025-06-02T08:53:41Z","intvolume":"        13","type":"journal_article","ddc":["004"],"publication_identifier":{"issn":["1860-5974"]},"publisher":"International Federation of Computational Logic","department":[{"_id":"KrCh"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png"},"file":[{"file_size":582940,"file_id":"5010","creator":"system","checksum":"12d469ae69b80361333d7dead965cf5d","date_updated":"2020-07-14T12:46:32Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z"}],"title":"Improved algorithms for parity and Streett objectives","ec_funded":1,"_id":"464","date_published":"2017-09-26T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>","apa":"Chatterjee, K., Henzinger, M. H., &#38; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26."},"publication_status":"published","date_created":"2018-12-11T11:46:37Z","oa_version":"Published Version","related_material":{"record":[{"id":"1661","status":"public","relation":"earlier_version"}]},"scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["1410.0833"]},"has_accepted_license":"1","month":"09","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2017","status":"public","day":"26","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"956","publist_id":"7357","doi":"10.23638/LMCS-13(3:26)2017","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"publication":"Logical Methods in Computer Science","arxiv":1,"oa":1,"volume":13},{"date_updated":"2023-02-23T12:26:25Z","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"issue":"3","file_date_updated":"2020-07-14T12:46:33Z","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan"}],"publication_identifier":{"issn":["18605974"]},"ddc":["004"],"type":"journal_article","intvolume":"        13","file":[{"file_name":"IST-2015-321-v1+1_main.pdf","date_created":"2018-12-12T10:14:37Z","content_type":"application/pdf","checksum":"08041379ba408d40664f449eb5907a8f","date_updated":"2020-07-14T12:46:33Z","access_level":"open_access","relation":"main_file","file_size":279071,"file_id":"5090","creator":"system"},{"file_size":279071,"file_id":"5091","creator":"system","access_level":"open_access","relation":"main_file","checksum":"08041379ba408d40664f449eb5907a8f","date_updated":"2020-07-14T12:46:33Z","content_type":"application/pdf","date_created":"2018-12-12T10:14:38Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png"},"publisher":"International Federation of Computational Logic","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3)."},"date_created":"2018-12-11T11:46:37Z","date_published":"2017-09-13T00:00:00Z","_id":"465","title":"Edit distance for pushdown automata","ec_funded":1,"has_accepted_license":"1","quality_controlled":"1","scopus_import":1,"related_material":{"record":[{"status":"public","id":"1610","relation":"earlier_version"},{"id":"5438","status":"public","relation":"earlier_version"}]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7356","pubrep_id":"955","day":"13","status":"public","year":"2017","language":[{"iso":"eng"}],"month":"09","publication":"Logical Methods in Computer Science","doi":"10.23638/LMCS-13(3:23)2017","project":[{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"oa":1,"volume":13},{"publication":"Logical Methods in Computer Science","doi":"10.23638/LMCS-13(2:15)2017","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"H2020","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"oa":1,"volume":13,"quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"1657","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5429"},{"status":"public","id":"5435","relation":"earlier_version"}]},"scopus_import":1,"day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7355","pubrep_id":"957","month":"07","status":"public","language":[{"iso":"eng"}],"year":"2017","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png"},"file":[{"creator":"system","file_size":511832,"file_id":"5354","checksum":"bfa405385ec6229ad5ead89ab5751639","date_updated":"2020-07-14T12:46:33Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","date_created":"2018-12-12T10:18:32Z"}],"publisher":"International Federation of Computational Logic","department":[{"_id":"KrCh"}],"citation":{"ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>.","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. 2017;13(2). doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Křetínská, Z., &#38; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>"},"publication_status":"published","date_created":"2018-12-11T11:46:38Z","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","ec_funded":1,"_id":"466","date_published":"2017-07-03T00:00:00Z","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"article_number":"15","date_updated":"2023-02-23T12:26:16Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Křetínská","first_name":"Zuzana","full_name":"Křetínská, Zuzana"},{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan"}],"issue":"2","file_date_updated":"2020-07-14T12:46:33Z","ddc":["004"],"publication_identifier":{"issn":["18605974"]},"type":"journal_article","intvolume":"        13"},{"type":"journal_article","intvolume":"        18","publication_identifier":{"issn":["15293785"]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"issue":"4","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"article_number":"31","date_updated":"2023-02-23T12:26:19Z","ec_funded":1,"title":"Nested weighted automata","date_published":"2017-12-01T00:00:00Z","_id":"467","date_created":"2018-12-11T11:46:38Z","publication_status":"published","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4, 31, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4. ACM, 2017.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(4). doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31."},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","month":"12","status":"public","language":[{"iso":"eng"}],"year":"2017","day":"01","publist_id":"7354","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","related_material":{"record":[{"status":"public","id":"1656","relation":"earlier_version"},{"status":"public","id":"5415","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5436"}]},"scopus_import":1,"quality_controlled":"1","external_id":{"arxiv":["1606.03598"]},"volume":18,"oa":1,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1145/3152769","arxiv":1,"publication":"ACM Transactions on Computational Logic (TOCL)"}]