[{"day":"15","date_published":"2025-09-15T00:00:00Z","OA_place":"publisher","alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"GradSch"},{"_id":"GaTk"}],"citation":{"ama":"Ruzickova N. Effect propagation in biological networks. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20357\">10.15479/AT-ISTA-20357</a>","short":"N. Ruzickova, Effect Propagation in Biological Networks, Institute of Science and Technology Austria, 2025.","mla":"Ruzickova, Natalia. <i>Effect Propagation in Biological Networks</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20357\">10.15479/AT-ISTA-20357</a>.","ista":"Ruzickova N. 2025. Effect propagation in biological networks. Institute of Science and Technology Austria.","apa":"Ruzickova, N. (2025). <i>Effect propagation in biological networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20357\">https://doi.org/10.15479/AT-ISTA-20357</a>","chicago":"Ruzickova, Natalia. “Effect Propagation in Biological Networks.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20357\">https://doi.org/10.15479/AT-ISTA-20357</a>.","ieee":"N. Ruzickova, “Effect propagation in biological networks,” Institute of Science and Technology Austria, 2025."},"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","publication_identifier":{"isbn":["978-3-99078-066-4"],"issn":["2663-337X"]},"article_processing_charge":"No","supervisor":[{"full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","first_name":"Gašper","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","acknowledgement":"I would also like to acknowledge the Austrian Academy of Sciences for funding through the\r\nDOC Fellowship program (fellowship number 26917), the Grants Office at ISTA for their\r\nassistance with the application, and the Scientific Computing Unit for their support regarding\r\nhigh-performance computation.\r\n","keyword":["gene regulation","networks","omnigenic model","pancreas","collective behaviour"],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"E-Lib"}],"corr_author":"1","file_date_updated":"2025-11-27T10:00:25Z","type":"dissertation","doi":"10.15479/AT-ISTA-20357","ddc":["570","530"],"date_updated":"2026-04-07T12:02:39Z","publication_status":"published","month":"09","author":[{"first_name":"Natalia","full_name":"Ruzickova, Natalia","last_name":"Ruzickova","id":"D2761128-D73D-11E9-A1BF-BA0DE6697425"}],"_id":"20357","language":[{"iso":"eng"}],"title":"Effect propagation in biological networks","file":[{"checksum":"991e81bc16a76b4e0c352567728fd2c5","file_size":43518367,"date_updated":"2025-11-27T10:00:25Z","embargo_to":"open_access","date_created":"2025-09-16T12:56:06Z","file_id":"20360","creator":"nruzicko","title":"Effect propagation in biological networks","file_name":"2025_Ruzickova_Natalia_Thesis.pdf","relation":"main_file","embargo":"2026-09-14","access_level":"closed","content_type":"application/pdf"},{"date_updated":"2025-09-16T12:59:23Z","date_created":"2025-09-16T12:59:23Z","file_size":53464789,"checksum":"c4ab257adad116083d8a97fac69b2dde","file_name":"2025_Ruzickova_Natalia_Thesis_source.zip","access_level":"closed","content_type":"application/zip","relation":"source_file","creator":"nruzicko","file_id":"20361"}],"status":"public","related_material":{"record":[{"status":"public","id":"18525","relation":"part_of_dissertation"}]},"date_created":"2025-09-15T17:04:48Z","oa_version":"Published Version","page":"160","project":[{"name":"Collective behaviour of cells in pancreatic Islets of Langerhans","_id":"7bec9174-9f16-11ee-852c-ded9fe5f810e"}],"year":"2025"},{"keyword":["Computational Theory and Mathematics","Computer Networks and Communications","Hardware and Architecture","Theoretical Computer Science"],"acknowledgement":"A preliminary version of this work appeared in DISC’19. Mirza Ahad Baig, Alessia Milani and Corentin Travers are supported by ANR projects Descartes and FREDDA. Mirza Ahad Baig is supported by UMI Relax. Danny Hendler is supported by the Israel Science Foundation (Grants 380/18 and 1425/22).","doi":"10.1007/s00446-022-00439-5","oa":1,"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://drops.dagstuhl.de/opus/volltexte/2019/11310/"}],"intvolume":"        36","date_published":"2023-03-01T00:00:00Z","quality_controlled":"1","day":"01","article_processing_charge":"No","publication_identifier":{"eissn":["1432-0452"],"issn":["0178-2770"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"citation":{"chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” <i>Distributed Computing</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00446-022-00439-5\">https://doi.org/10.1007/s00446-022-00439-5</a>.","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived counters with polylogarithmic amortized step complexity,” <i>Distributed Computing</i>, vol. 36. Springer Nature, pp. 29–43, 2023.","apa":"Baig, M. A., Hendler, D., Milani, A., &#38; Travers, C. (2023). Long-lived counters with polylogarithmic amortized step complexity. <i>Distributed Computing</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00446-022-00439-5\">https://doi.org/10.1007/s00446-022-00439-5</a>","ista":"Baig MA, Hendler D, Milani A, Travers C. 2023. Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. 36, 29–43.","mla":"Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” <i>Distributed Computing</i>, vol. 36, Springer Nature, 2023, pp. 29–43, doi:<a href=\"https://doi.org/10.1007/s00446-022-00439-5\">10.1007/s00446-022-00439-5</a>.","short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023) 29–43.","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic amortized step complexity. <i>Distributed Computing</i>. 2023;36:29-43. doi:<a href=\"https://doi.org/10.1007/s00446-022-00439-5\">10.1007/s00446-022-00439-5</a>"},"publisher":"Springer Nature","oa_version":"Preprint","external_id":{"isi":["000890138700001"]},"date_created":"2023-01-12T12:10:08Z","volume":36,"isi":1,"year":"2023","page":"29-43","abstract":[{"lang":"eng","text":"A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read-write registers, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this work, we address this gap. We show that n-process, wait-free and linearizable counters can be implemented from read-write registers with O(log2n) amortized step complexity. This is the first counter algorithm from read-write registers that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is within a logarithmic factor of the optimal. The worst-case step complexity of the construction remains linear, which is optimal. This is obtained thanks to a new max register construction with O(logn) amortized step complexity in executions of arbitrary length in which the value stored in the register does not grow too quickly. We then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel [1] in which we “plug” our max register implementation to show that it remains linearizable while achieving O(log2n) amortized step complexity."}],"author":[{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","last_name":"Baig","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad"},{"first_name":"Danny","full_name":"Hendler, Danny","last_name":"Hendler"},{"full_name":"Milani, Alessia","first_name":"Alessia","last_name":"Milani"},{"last_name":"Travers","full_name":"Travers, Corentin","first_name":"Corentin"}],"month":"03","date_updated":"2023-08-16T08:39:36Z","publication_status":"published","title":"Long-lived counters with polylogarithmic amortized step complexity","status":"public","scopus_import":"1","article_type":"original","publication":"Distributed Computing","language":[{"iso":"eng"}],"_id":"12164"},{"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"SSU"},{"_id":"NanoFab"}],"corr_author":"1","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"keyword":["quantum optics","electrooptics","quantum networks","quantum communication","transduction"],"has_accepted_license":"1","doi":"10.15479/at:ista:13175","oa":1,"type":"dissertation","file_date_updated":"2023-07-06T11:35:15Z","OA_place":"publisher","date_published":"2023-05-05T00:00:00Z","day":"05","supervisor":[{"first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink"}],"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-030-5"]},"degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"mla":"Sahu, Rishabh. <i>Cavity Quantum Electrooptics</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:13175\">10.15479/at:ista:13175</a>.","chicago":"Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:13175\">https://doi.org/10.15479/at:ista:13175</a>.","apa":"Sahu, R. (2023). <i>Cavity quantum electrooptics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:13175\">https://doi.org/10.15479/at:ista:13175</a>","ieee":"R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology Austria, 2023.","ista":"Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology Austria.","ama":"Sahu R. Cavity quantum electrooptics. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:13175\">10.15479/at:ista:13175</a>","short":"R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology Austria, 2023."},"alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"JoFi"}],"oa_version":"Published Version","date_created":"2023-06-30T08:07:43Z","related_material":{"record":[{"status":"public","relation":"old_edition","id":"12900"},{"status":"public","relation":"part_of_dissertation","id":"10924"},{"status":"public","id":"9114","relation":"part_of_dissertation"}]},"year":"2023","project":[{"grant_number":"758053","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"grant_number":"899354","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","call_identifier":"H2020","name":"Quantum Local Area Networks with Superconducting Qubits"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","grant_number":"F07105"}],"page":"202","ec_funded":1,"abstract":[{"text":"About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. \r\n\r\nQuantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. \r\n\r\nAfter decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. \r\nWith this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. ","lang":"eng"}],"author":[{"last_name":"Sahu","id":"47D26E34-F248-11E8-B48F-1D18A9856A87","full_name":"Sahu, Rishabh","orcid":"0000-0001-6264-2162","first_name":"Rishabh"}],"month":"05","publication_status":"published","date_updated":"2026-04-15T06:43:26Z","ddc":["537","535","539"],"status":"public","file":[{"file_id":"13176","creator":"cchlebak","file_name":"thesis_pdfa.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","checksum":"7d03f1a5a5258ee43dfc3323dea4e08f","file_size":18688376,"date_updated":"2023-06-30T08:17:25Z","success":1,"date_created":"2023-06-30T08:17:25Z"},{"checksum":"c3b45317ae58e0527533f98c202d81b7","file_size":37847025,"date_created":"2023-07-06T11:35:15Z","date_updated":"2023-07-06T11:35:15Z","file_id":"13196","creator":"cchlebak","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","file_name":"thesis.zip"}],"title":"Cavity quantum electrooptics","language":[{"iso":"eng"}],"_id":"13175"},{"doi":"10.15479/at:ista:12900","file_date_updated":"2023-07-06T11:37:40Z","type":"dissertation","corr_author":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"SSU"},{"_id":"NanoFab"}],"keyword":["quantum optics","electrooptics","quantum networks","quantum communication","transduction"],"tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"has_accepted_license":"1","supervisor":[{"first_name":"Johannes M","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink"}],"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-030-5"]},"degree_awarded":"PhD","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"mla":"Sahu, Rishabh. <i>Cavity Quantum Electrooptics</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:12900\">10.15479/at:ista:12900</a>.","ista":"Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology Austria.","chicago":"Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:12900\">https://doi.org/10.15479/at:ista:12900</a>.","apa":"Sahu, R. (2023). <i>Cavity quantum electrooptics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12900\">https://doi.org/10.15479/at:ista:12900</a>","ieee":"R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology Austria, 2023.","ama":"Sahu R. Cavity quantum electrooptics. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:12900\">10.15479/at:ista:12900</a>","short":"R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology Austria, 2023."},"alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"JoFi"}],"publisher":"Institute of Science and Technology Austria","OA_place":"publisher","date_published":"2023-05-05T00:00:00Z","day":"05","project":[{"grant_number":"758053","call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"grant_number":"899354","_id":"9B868D20-BA93-11EA-9121-9846C619BF3A","name":"Quantum Local Area Networks with Superconducting Qubits","call_identifier":"H2020"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","grant_number":"F07105"}],"year":"2023","page":"190","ec_funded":1,"abstract":[{"text":"About a 100 years ago, we discovered that our universe is inherently noisy, that is, measuring any physical quantity with a precision beyond a certain point is not possible because of an omnipresent inherent noise. We call this - the quantum noise. Certain physical processes allow this quantum noise to get correlated in conjugate physical variables. These quantum correlations can be used to go beyond the potential of our inherently noisy universe and obtain a quantum advantage over the classical applications. \r\n\r\nQuantum noise being inherent also means that, at the fundamental level, the physical quantities are not well defined and therefore, objects can stay in multiple states at the same time. For example, the position of a particle not being well defined means that the particle is in multiple positions at the same time. About 4 decades ago, we started exploring the possibility of using objects which can be in multiple states at the same time to increase the dimensionality in computation. Thus, the field of quantum computing was born. We discovered that using quantum entanglement, a property closely related to quantum correlations, can be used to speed up computation of certain problems, such as factorisation of large numbers, faster than any known classical algorithm. Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date, we have explored quantum control over many physical systems including photons, spins, atoms, ions and even simple circuits made up of superconducting material. However, there persists one ubiquitous theme. The more readily a system interacts with an external field or matter, the more easily we can control it. But this also means that such a system can easily interact with a noisy environment and quickly lose its coherence. Consequently, such systems like electron spins need to be protected from the environment to ensure the longevity of their coherence. Other systems like nuclear spins are naturally protected as they do not interact easily with the environment. But, due to the same reason, it is harder to interact with such systems. \r\n\r\nAfter decades of experimentation with various systems, we are convinced that no one type of quantum system would be the best for all the quantum applications. We would need hybrid systems which are all interconnected - much like the current internet where all sorts of devices can all talk to each other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons are the best contenders to carry information for the quantum internet. They can carry quantum information cheaply and without much loss - the same reasons which has made them the backbone of our current internet. Following this direction, many systems, like trapped ions, have already demonstrated successful quantum links over a large distances using optical photons. However, some of the most promising contenders for quantum computing which are based on microwave frequencies have been left behind. This is because high energy optical photons can adversely affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present substantial progress on this missing quantum link between microwave and optics using electrooptical nonlinearities in lithium niobate. The nonlinearities are enhanced by using resonant cavities for all the involved modes leading to observation of strong direct coupling between optical and microwave frequencies. With this strong coupling we are not only able to achieve almost 100\\% internal conversion efficiency with low added noise, thus presenting a quantum-enabled transducer, but also we are able to observe novel effects such as cooling of a microwave mode using optics. The strong coupling regime also leads to direct observation of dynamical backaction effect between microwave and optical frequencies which are studied in detail here. Finally, we also report first observation of microwave-optics entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level. \r\nWith this new bridge between microwave and optics, the microwave-based quantum technologies can finally be a part of a quantum network which is based on optical photons - putting us one step closer to a future with quantum internet. ","lang":"eng"}],"oa_version":"Published Version","date_created":"2023-05-05T11:08:50Z","related_material":{"record":[{"relation":"new_edition","id":"13175","status":"public"},{"relation":"part_of_dissertation","id":"10924","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9114"}]},"title":"Cavity quantum electrooptics","file":[{"file_id":"12928","creator":"rsahu","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","file_name":"thesis.zip","file_size":36767177,"checksum":"8cbdab9c37ee55e591092a6f66b272c4","date_created":"2023-05-09T08:45:14Z","embargo_to":"open_access","date_updated":"2023-06-06T22:30:03Z"},{"checksum":"439659ead46618147309be39d9dd5a8c","file_size":17501990,"date_updated":"2023-07-06T11:37:40Z","date_created":"2023-05-09T08:51:17Z","file_id":"12929","creator":"rsahu","file_name":"thesis_pdfa_final.pdf","relation":"main_file","content_type":"application/pdf","access_level":"closed"}],"status":"public","language":[{"iso":"eng"}],"_id":"12900","month":"05","author":[{"orcid":"0000-0001-6264-2162","first_name":"Rishabh","full_name":"Sahu, Rishabh","last_name":"Sahu","id":"47D26E34-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-15T06:43:26Z","publication_status":"published","ddc":["537","535","539"]},{"publication_status":"published","date_updated":"2023-02-13T09:15:13Z","ddc":["530"],"month":"10","author":[{"last_name":"Börner","full_name":"Börner, Georg","first_name":"Georg"},{"last_name":"Schröder","first_name":"Malte","full_name":"Schröder, Malte"},{"full_name":"Scarselli, Davide","first_name":"Davide","orcid":"0000-0001-5227-4271","id":"40315C30-F248-11E8-B48F-1D18A9856A87","last_name":"Scarselli"},{"orcid":"0000-0003-0423-5010","first_name":"Nazmi B","full_name":"Budanur, Nazmi B","last_name":"Budanur","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","full_name":"Hof, Björn"},{"full_name":"Timme, Marc","first_name":"Marc","last_name":"Timme"}],"language":[{"iso":"eng"}],"publication":"Journal of Physics: Complexity","_id":"12134","status":"public","scopus_import":"1","file":[{"date_updated":"2023-01-24T07:24:37Z","success":1,"date_created":"2023-01-24T07:24:37Z","file_size":1006106,"checksum":"35c5c5cb0eb17ea1b5184755daab9fc9","file_name":"2022_JourPhysics_Boerner.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"12350","creator":"dernst"}],"title":"Explosive transitions in epidemic dynamics","article_type":"original","date_created":"2023-01-12T12:03:43Z","oa_version":"Published Version","abstract":[{"text":"Standard epidemic models exhibit one continuous, second order phase transition to macroscopic outbreaks. However, interventions to control outbreaks may fundamentally alter epidemic dynamics. Here we reveal how such interventions modify the type of phase transition. In particular, we uncover three distinct types of explosive phase transitions for epidemic dynamics with capacity-limited interventions. Depending on the capacity limit, interventions may (i) leave the standard second order phase transition unchanged but exponentially suppress the probability of large outbreaks, (ii) induce a first-order discontinuous transition to macroscopic outbreaks, or (iii) cause a secondary explosive yet continuous third-order transition. These insights highlight inherent limitations in predicting and containing epidemic outbreaks. More generally our study offers a cornerstone example of a third-order explosive phase transition in complex systems.","lang":"eng"}],"year":"2022","volume":3,"quality_controlled":"1","day":"25","intvolume":"         3","date_published":"2022-10-25T00:00:00Z","publisher":"IOP Publishing","issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Börner, Georg, Malte Schröder, Davide Scarselli, Nazmi B Budanur, Björn Hof, and Marc Timme. “Explosive Transitions in Epidemic Dynamics.” <i>Journal of Physics: Complexity</i>. IOP Publishing, 2022. <a href=\"https://doi.org/10.1088/2632-072x/ac99cd\">https://doi.org/10.1088/2632-072x/ac99cd</a>.","ieee":"G. Börner, M. Schröder, D. Scarselli, N. B. Budanur, B. Hof, and M. Timme, “Explosive transitions in epidemic dynamics,” <i>Journal of Physics: Complexity</i>, vol. 3, no. 4. IOP Publishing, 2022.","apa":"Börner, G., Schröder, M., Scarselli, D., Budanur, N. B., Hof, B., &#38; Timme, M. (2022). Explosive transitions in epidemic dynamics. <i>Journal of Physics: Complexity</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/2632-072x/ac99cd\">https://doi.org/10.1088/2632-072x/ac99cd</a>","ista":"Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. 2022. Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. 3(4), 04LT02.","mla":"Börner, Georg, et al. “Explosive Transitions in Epidemic Dynamics.” <i>Journal of Physics: Complexity</i>, vol. 3, no. 4, 04LT02, IOP Publishing, 2022, doi:<a href=\"https://doi.org/10.1088/2632-072x/ac99cd\">10.1088/2632-072x/ac99cd</a>.","short":"G. Börner, M. Schröder, D. Scarselli, N.B. Budanur, B. Hof, M. Timme, Journal of Physics: Complexity 3 (2022).","ama":"Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. Explosive transitions in epidemic dynamics. <i>Journal of Physics: Complexity</i>. 2022;3(4). doi:<a href=\"https://doi.org/10.1088/2632-072x/ac99cd\">10.1088/2632-072x/ac99cd</a>"},"department":[{"_id":"BjHo"}],"article_processing_charge":"No","publication_identifier":{"issn":["2632-072X"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"license":"https://creativecommons.org/licenses/by/4.0/","article_number":"04LT02","keyword":["Artificial Intelligence","Computer Networks and Communications","Computer Science Applications","Information Systems"],"acknowledgement":"We acknowledge support from the Volkswagen Foundation under Grant No. 99720 and the German Federal Ministry for Education and Research (BMBF) under Grant No. 16ICR01. This research was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2068—390729961—Cluster of Excellence Physics of Life of TU Dresden.","has_accepted_license":"1","type":"journal_article","file_date_updated":"2023-01-24T07:24:37Z","doi":"10.1088/2632-072x/ac99cd","oa":1},{"acknowledgement":"This research was supported in part by the AI2050 program at Schmidt Futures (grant G-22-63172), the Boeing Company, and the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under cooperative agreement number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes, notwithstanding any copyright notation herein. This work was further supported by The Boeing Company and Office of Naval Research grant N00014-18-1-2830. M.T. is supported by the Poul Due Jensen Foundation, grant 883901. M.L. was supported in part by the Austrian Science Fund under grant Z211-N23 (Wittgenstein Award). A.A. was supported by the National Science Foundation Graduate Research Fellowship Program. We thank T.-H. Wang, P. Kao, M. Chahine, W. Xiao, X. Li, L. Yin and Y. Ben for useful suggestions and for testing of CfC models to confirm the results across other domains.","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Artificial Intelligence","Computer Networks and Communications","Computer Vision and Pattern Recognition","Human-Computer Interaction","Software"],"type":"journal_article","file_date_updated":"2023-01-24T09:49:44Z","oa":1,"doi":"10.1038/s42256-022-00556-7","day":"15","arxiv":1,"quality_controlled":"1","date_published":"2022-11-15T00:00:00Z","intvolume":"         4","publisher":"Springer Nature","issue":"11","citation":{"ama":"Hasani R, Lechner M, Amini A, et al. Closed-form continuous-time neural networks. <i>Nature Machine Intelligence</i>. 2022;4(11):992-1003. doi:<a href=\"https://doi.org/10.1038/s42256-022-00556-7\">10.1038/s42256-022-00556-7</a>","short":"R. Hasani, M. Lechner, A. Amini, L. Liebenwein, A. Ray, M. Tschaikowski, G. Teschl, D. Rus, Nature Machine Intelligence 4 (2022) 992–1003.","mla":"Hasani, Ramin, et al. “Closed-Form Continuous-Time Neural Networks.” <i>Nature Machine Intelligence</i>, vol. 4, no. 11, Springer Nature, 2022, pp. 992–1003, doi:<a href=\"https://doi.org/10.1038/s42256-022-00556-7\">10.1038/s42256-022-00556-7</a>.","apa":"Hasani, R., Lechner, M., Amini, A., Liebenwein, L., Ray, A., Tschaikowski, M., … Rus, D. (2022). Closed-form continuous-time neural networks. <i>Nature Machine Intelligence</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42256-022-00556-7\">https://doi.org/10.1038/s42256-022-00556-7</a>","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Lucas Liebenwein, Aaron Ray, Max Tschaikowski, Gerald Teschl, and Daniela Rus. “Closed-Form Continuous-Time Neural Networks.” <i>Nature Machine Intelligence</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s42256-022-00556-7\">https://doi.org/10.1038/s42256-022-00556-7</a>.","ieee":"R. Hasani <i>et al.</i>, “Closed-form continuous-time neural networks,” <i>Nature Machine Intelligence</i>, vol. 4, no. 11. Springer Nature, pp. 992–1003, 2022.","ista":"Hasani R, Lechner M, Amini A, Liebenwein L, Ray A, Tschaikowski M, Teschl G, Rus D. 2022. Closed-form continuous-time neural networks. Nature Machine Intelligence. 4(11), 992–1003."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"ToHe"}],"publication_identifier":{"issn":["2522-5839"]},"article_processing_charge":"No","external_id":{"arxiv":["2106.13898"],"isi":["000884215600003"]},"date_created":"2023-01-12T12:07:21Z","related_material":{"link":[{"url":"https://doi.org/10.1038/s42256-022-00597-y","relation":"erratum"}]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Continuous-time neural networks are a class of machine learning systems that can tackle representation learning on spatiotemporal decision-making tasks. These models are typically represented by continuous differential equations. However, their expressive power when they are deployed on computers is bottlenecked by numerical differential equation solvers. This limitation has notably slowed down the scaling and understanding of numerous natural physical phenomena such as the dynamics of nervous systems. Ideally, we would circumvent this bottleneck by solving the given dynamical system in closed form. This is known to be intractable in general. Here, we show that it is possible to closely approximate the interaction between neurons and synapses—the building blocks of natural and artificial neural networks—constructed by liquid time-constant networks efficiently in closed form. To this end, we compute a tightly bounded approximation of the solution of an integral appearing in liquid time-constant dynamics that has had no known closed-form solution so far. This closed-form solution impacts the design of continuous-time and continuous-depth neural models. For instance, since time appears explicitly in closed form, the formulation relaxes the need for complex numerical solvers. Consequently, we obtain models that are between one and five orders of magnitude faster in training and inference compared with differential equation-based counterparts. More importantly, in contrast to ordinary differential equation-based continuous networks, closed-form networks can scale remarkably well compared with other deep learning instances. Lastly, as these models are derived from liquid networks, they show good performance in time-series modelling compared with advanced recurrent neural network models."}],"page":"992-1003","year":"2022","volume":4,"isi":1,"project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"ddc":["000"],"publication_status":"published","date_updated":"2025-04-15T06:26:02Z","month":"11","author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"last_name":"Liebenwein","first_name":"Lucas","full_name":"Liebenwein, Lucas"},{"last_name":"Ray","full_name":"Ray, Aaron","first_name":"Aaron"},{"first_name":"Max","full_name":"Tschaikowski, Max","last_name":"Tschaikowski"},{"last_name":"Teschl","first_name":"Gerald","full_name":"Teschl, Gerald"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"}],"_id":"12147","publication":"Nature Machine Intelligence","language":[{"iso":"eng"}],"article_type":"original","file":[{"date_updated":"2023-01-24T09:49:44Z","date_created":"2023-01-24T09:49:44Z","success":1,"file_size":3259553,"checksum":"b4789122ce04bfb4ac042390f59aaa8b","file_name":"2022_NatureMachineIntelligence_Hasani.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"12355","creator":"dernst"}],"status":"public","scopus_import":"1","title":"Closed-form continuous-time neural networks"},{"month":"10","author":[{"first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky"},{"first_name":"Tobias","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer"},{"last_name":"Waldmann","full_name":"Waldmann, Clara","first_name":"Clara"},{"full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"}],"ddc":["000"],"publication_status":"published","date_updated":"2025-04-15T06:53:08Z","article_type":"original","status":"public","scopus_import":"1","file":[{"date_created":"2022-01-07T07:50:31Z","success":1,"date_updated":"2022-01-07T07:50:31Z","checksum":"bf1c195b6aaf59e8530cf9e3a9d731f7","file_size":1066082,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2021_ActaInfor_Křetínský.pdf","file_id":"10603","creator":"cchlebak"}],"title":"Index appearance record with preorders","_id":"10602","publication":"Acta Informatica","language":[{"iso":"eng"}],"oa_version":"Published Version","external_id":{"isi":["000735765500001"]},"date_created":"2022-01-06T12:37:27Z","year":"2022","volume":59,"isi":1,"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"abstract":[{"lang":"eng","text":"Transforming ω-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches."}],"page":"585-618","date_published":"2022-10-01T00:00:00Z","intvolume":"        59","day":"01","quality_controlled":"1","publication_identifier":{"eissn":["1432-0525"],"issn":["0001-5903"]},"article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Kretinsky, Jan, et al. “Index Appearance Record with Preorders.” <i>Acta Informatica</i>, vol. 59, Springer Nature, 2022, pp. 585–618, doi:<a href=\"https://doi.org/10.1007/s00236-021-00412-y\">10.1007/s00236-021-00412-y</a>.","ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance record with preorders. Acta Informatica. 59, 585–618.","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record with Preorders.” <i>Acta Informatica</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00236-021-00412-y\">https://doi.org/10.1007/s00236-021-00412-y</a>.","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” <i>Acta Informatica</i>, vol. 59. Springer Nature, pp. 585–618, 2022.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., &#38; Weininger, M. (2022). Index appearance record with preorders. <i>Acta Informatica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00236-021-00412-y\">https://doi.org/10.1007/s00236-021-00412-y</a>","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. <i>Acta Informatica</i>. 2022;59:585-618. doi:<a href=\"https://doi.org/10.1007/s00236-021-00412-y\">10.1007/s00236-021-00412-y</a>","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618."},"department":[{"_id":"KrCh"}],"corr_author":"1","acknowledgement":"This work is partially funded by the German Research Foundation (DFG) projects Verified Model Checkers (No. 317422601) and Statistical Unbounded Verification (No. 383882557), and the Alexander von Humboldt Foundation with funds from the German Federal Ministry of Education and Research. It is an extended version of [21], including all proofs together with further explanations and examples. Moreover, we provide a new, more efficient construction based on (total) preorders, unifying previous optimizations. Experiments are performed with a new, performant implementation, comparing our approach to the current state of the art.","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["computer networks and communications","information systems","software"],"oa":1,"doi":"10.1007/s00236-021-00412-y","type":"journal_article","file_date_updated":"2022-01-07T07:50:31Z"},{"oa_version":"None","external_id":{"isi":["000766422000002"]},"date_created":"2022-03-10T12:16:19Z","year":"2022","isi":1,"volume":14,"abstract":[{"lang":"eng","text":"We determine the unique factorization of some polynomials over a finite local commutative ring with identity explicitly. This solves and generalizes the main conjecture of Qian, Shi and Solé in [13]. We also give some applications to enumeration of certain generalized double circulant self-dual and linear complementary dual (LCD) codes over some finite rings together with an application in asymptotic coding theory."}],"page":"933-948","month":"07","author":[{"id":"8ba3170d-dc85-11ea-9058-c4251c96a6eb","last_name":"Köse","full_name":"Köse, Seyda","first_name":"Seyda"},{"full_name":"Özbudak, Ferruh","first_name":"Ferruh","last_name":"Özbudak"}],"publication_status":"published","date_updated":"2023-09-05T15:35:55Z","article_type":"original","scopus_import":"1","status":"public","title":"Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes","_id":"10842","language":[{"iso":"eng"}],"publication":"Cryptography and Communications","acknowledgement":"The authors would like to thank Prof. Dr. Minjia Shi for bringing [13, Conjecture 3.5] to our attention. We would also like to thank the associate editor and anonymous reviewers for their valuable comments and suggestions which improved and clarified the manuscript.","keyword":["Applied Mathematics","Computational Theory and Mathematics","Computer Networks and Communications"],"doi":"10.1007/s12095-022-00557-8","type":"journal_article","date_published":"2022-07-01T00:00:00Z","intvolume":"        14","day":"01","quality_controlled":"1","publication_identifier":{"issn":["1936-2447"],"eissn":["1936-2455"]},"article_processing_charge":"No","publisher":"Springer Nature","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"S. Köse, F. Özbudak, Cryptography and Communications 14 (2022) 933–948.","ama":"Köse S, Özbudak F. Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes. <i>Cryptography and Communications</i>. 2022;14(4):933-948. doi:<a href=\"https://doi.org/10.1007/s12095-022-00557-8\">10.1007/s12095-022-00557-8</a>","ista":"Köse S, Özbudak F. 2022. Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes. Cryptography and Communications. 14(4), 933–948.","chicago":"Köse, Seyda, and Ferruh Özbudak. “Factorization of Some Polynomials over Finite Local Commutative Rings and Applications to Certain Self-Dual and LCD Codes.” <i>Cryptography and Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s12095-022-00557-8\">https://doi.org/10.1007/s12095-022-00557-8</a>.","ieee":"S. Köse and F. Özbudak, “Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes,” <i>Cryptography and Communications</i>, vol. 14, no. 4. Springer Nature, pp. 933–948, 2022.","apa":"Köse, S., &#38; Özbudak, F. (2022). Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes. <i>Cryptography and Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s12095-022-00557-8\">https://doi.org/10.1007/s12095-022-00557-8</a>","mla":"Köse, Seyda, and Ferruh Özbudak. “Factorization of Some Polynomials over Finite Local Commutative Rings and Applications to Certain Self-Dual and LCD Codes.” <i>Cryptography and Communications</i>, vol. 14, no. 4, Springer Nature, 2022, pp. 933–48, doi:<a href=\"https://doi.org/10.1007/s12095-022-00557-8\">10.1007/s12095-022-00557-8</a>."},"department":[{"_id":"GradSch"}]},{"publication_identifier":{"isbn":["978-3-99078-017-6"]},"supervisor":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","citation":{"ista":"Lechner M. 2022. Learning verifiable representations. Institute of Science and Technology Austria.","chicago":"Lechner, Mathias. “Learning Verifiable Representations.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11362\">https://doi.org/10.15479/at:ista:11362</a>.","apa":"Lechner, M. (2022). <i>Learning verifiable representations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11362\">https://doi.org/10.15479/at:ista:11362</a>","ieee":"M. Lechner, “Learning verifiable representations,” Institute of Science and Technology Austria, 2022.","mla":"Lechner, Mathias. <i>Learning Verifiable Representations</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">10.15479/at:ista:11362</a>.","short":"M. Lechner, Learning Verifiable Representations, Institute of Science and Technology Austria, 2022.","ama":"Lechner M. Learning verifiable representations. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">10.15479/at:ista:11362</a>"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","date_published":"2022-05-12T00:00:00Z","OA_place":"publisher","day":"12","oa":1,"doi":"10.15479/at:ista:11362","type":"dissertation","file_date_updated":"2022-05-17T15:19:39Z","corr_author":"1","has_accepted_license":"1","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"license":"https://creativecommons.org/licenses/by-nd/4.0/","keyword":["neural networks","verification","machine learning"],"file":[{"date_updated":"2022-05-13T12:49:00Z","date_created":"2022-05-13T12:33:26Z","checksum":"8eefa9c7c10ca7e1a2ccdd731962a645","file_size":13210143,"file_name":"src.zip","relation":"source_file","content_type":"application/zip","access_level":"closed","file_id":"11378","creator":"mlechner"},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"thesis_main-a2.pdf","creator":"mlechner","file_id":"11382","date_created":"2022-05-16T08:02:28Z","date_updated":"2022-05-17T15:19:39Z","file_size":2732536,"checksum":"1b9e1e5a9a83ed9d89dad2f5133dc026"}],"status":"public","title":"Learning verifiable representations","_id":"11362","language":[{"iso":"eng"}],"month":"05","author":[{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"}],"ddc":["004"],"publication_status":"published","date_updated":"2026-04-16T09:46:06Z","year":"2022","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"abstract":[{"lang":"eng","text":"Deep learning has enabled breakthroughs in challenging computing problems and has emerged as the standard problem-solving tool for computer vision and natural language processing tasks.\r\nOne exception to this trend is safety-critical tasks where robustness and resilience requirements contradict the black-box nature of neural networks. \r\nTo deploy deep learning methods for these tasks, it is vital to provide guarantees on neural network agents' safety and robustness criteria. \r\nThis can be achieved by developing formal verification methods to verify the safety and robustness properties of neural networks.\r\n\r\nOur goal is to design, develop and assess safety verification methods for neural networks to improve their reliability and trustworthiness in real-world applications.\r\nThis thesis establishes techniques for the verification of compressed and adversarially trained models as well as the design of novel neural networks for verifiably safe decision-making.\r\n\r\nFirst, we establish the problem of verifying quantized neural networks. Quantization is a technique that trades numerical precision for the computational efficiency of running a neural network and is widely adopted in industry.\r\nWe show that neglecting the reduced precision when verifying a neural network can lead to wrong conclusions about the robustness and safety of the network, highlighting that novel techniques for quantized network verification are necessary. We introduce several bit-exact verification methods explicitly designed for quantized neural networks and experimentally confirm on realistic networks that the network's robustness and other formal properties are affected by the quantization.\r\n\r\nFurthermore, we perform a case study providing evidence that adversarial training, a standard technique for making neural networks more robust, has detrimental effects on the network's performance. This robustness-accuracy tradeoff has been studied before regarding the accuracy obtained on classification datasets where each data point is independent of all other data points. On the other hand, we investigate the tradeoff empirically in robot learning settings where a both, a high accuracy and a high robustness, are desirable.\r\nOur results suggest that the negative side-effects of adversarial training outweigh its robustness benefits in practice.\r\n\r\nFinally, we consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with systems over the infinite time horizon. Bayesian neural networks are probabilistic models for learning uncertainties in the data and are therefore often used on robotic and healthcare applications where data is inherently stochastic.\r\nWe introduce a method for recalibrating Bayesian neural networks so that they yield probability distributions over safe decisions only.\r\nOur method learns a safety certificate that guarantees safety over the infinite time horizon to determine which decisions are safe in every possible state of the system.\r\nWe demonstrate the effectiveness of our approach on a series of reinforcement learning benchmarks."}],"ec_funded":1,"page":"124","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"11366","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10665","status":"public"},{"status":"public","id":"10667","relation":"part_of_dissertation"},{"status":"public","id":"10666","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"7808"}]},"date_created":"2022-05-12T07:14:01Z"},{"quality_controlled":"1","day":"01","arxiv":1,"intvolume":"         5","date_published":"2021-03-01T00:00:00Z","issue":"1","publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>"},"department":[{"_id":"DaAl"}],"article_processing_charge":"No","publication_identifier":{"issn":["2476-1249"]},"keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"doi":"10.1145/3447384","oa":1,"publication_status":"published","date_updated":"2025-04-14T13:52:09Z","month":"03","author":[{"last_name":"Foerster","first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","first_name":"Janne","full_name":"Korhonen, Janne"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","language":[{"iso":"eng"}],"_id":"10855","status":"public","scopus_import":"1","title":"Input-dynamic distributed algorithms for communication networks","article_type":"original","external_id":{"arxiv":["2005.07637"]},"date_created":"2022-03-18T09:10:27Z","related_material":{"record":[{"relation":"shorter_version","id":"10854","status":"public"}]},"oa_version":"Preprint","page":"1-33","ec_funded":1,"abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.","lang":"eng"}],"year":"2021","project":[{"name":"Coordination in constrained and natural distributed systems","call_identifier":"H2020","_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605"},{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"volume":5},{"status":"public","scopus_import":"1","title":"Into the unknown: active monitoring of neural networks","language":[{"iso":"eng"}],"publication":"21st International Conference on Runtime Verification","_id":"10206","month":"10","author":[{"full_name":"Lukina, Anna","first_name":"Anna","last_name":"Lukina","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"},{"full_name":"Schilling, Christian","first_name":"Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"publication_status":"published","date_updated":"2025-04-15T06:26:14Z","year":"2021","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"}],"isi":1,"volume":"12974 ","page":"42-61","abstract":[{"text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios.","lang":"eng"}],"ec_funded":1,"oa_version":"Preprint","date_created":"2021-10-31T23:01:31Z","external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"related_material":{"record":[{"relation":"extended_version","id":"13234","status":"public"}]},"article_processing_charge":"No","publication_identifier":{"isbn":["9-783-0308-8493-2"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-88494-9"]},"publisher":"Springer Nature","citation":{"ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: <i>21st International Conference on Runtime Verification</i>. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” <i>21st International Conference on Runtime Verification</i>, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:<a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">10.1007/978-3-030-88494-9_3</a>.","ista":"Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring of neural networks. 21st International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 42–61.","apa":"Lukina, A., Schilling, C., &#38; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In <i>21st International Conference on Runtime Verification</i> (Vol. 12974, pp. 42–61). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In <i>21st International Conference on Runtime Verification</i>, 12974:42–61. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-88494-9_3\">https://doi.org/10.1007/978-3-030-88494-9_3</a>.","ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in <i>21st International Conference on Runtime Verification</i>, Virtual, 2021, vol. 12974, pp. 42–61."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"date_published":"2021-10-06T00:00:00Z","quality_controlled":"1","arxiv":1,"day":"06","place":"Cham","doi":"10.1007/978-3-030-88494-9_3","oa":1,"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/2009.06429","open_access":"1"}],"conference":{"location":"Virtual","end_date":"2021-10-14","name":"RV: Runtime Verification","start_date":"2021-10-11"},"corr_author":"1","keyword":["monitoring","neural networks","novelty detection"],"acknowledgement":"We thank Christoph Lampert and Alex Greengold for fruitful discussions. This research was supported in part by the Simons Institute for the Theory of Computing, the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411."},{"year":"2021","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"volume":21,"isi":1,"page":"291-323","ec_funded":1,"abstract":[{"text":"In this paper, we present two new inertial projection-type methods for solving multivalued variational inequality problems in finite-dimensional spaces. We establish the convergence of the sequence generated by these methods when the multivalued mapping associated with the problem is only required to be locally bounded without any monotonicity assumption. Furthermore, the inertial techniques that we employ in this paper are quite different from the ones used in most papers. Moreover, based on the weaker assumptions on the inertial factor in our methods, we derive several special cases of our methods. Finally, we present some experimental results to illustrate the profits that we gain by introducing the inertial extrapolation steps.","lang":"eng"}],"oa_version":"Published Version","external_id":{"isi":["000625002100001"]},"date_created":"2021-03-10T12:18:47Z","scopus_import":"1","status":"public","file":[{"checksum":"22b4253a2e5da843622a2df713784b4c","file_size":834964,"success":1,"date_created":"2021-08-11T12:44:16Z","date_updated":"2021-08-11T12:44:16Z","file_id":"9884","creator":"kschuh","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2021_NetworksSpatialEconomics_Shehu.pdf"}],"title":"New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity","article_type":"original","language":[{"iso":"eng"}],"publication":"Networks and Spatial Economics","_id":"9234","author":[{"last_name":"Izuchukwu","full_name":"Izuchukwu, Chinedu","first_name":"Chinedu"},{"id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","last_name":"Shehu","first_name":"Yekini","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini"}],"month":"06","publication_status":"published","date_updated":"2024-11-04T13:52:33Z","ddc":["510"],"doi":"10.1007/s11067-021-09517-w","oa":1,"type":"journal_article","file_date_updated":"2021-08-11T12:44:16Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Computer Networks and Communications","Software","Artificial Intelligence"],"acknowledgement":"The authors sincerely thank the Editor-in-Chief and anonymous referees for their careful reading, constructive comments and fruitful suggestions that help improve the manuscript. The research of the first author is supported by the National Research Foundation (NRF) South Africa (S& F-DSI/NRF Free Standing Postdoctoral Fellowship; Grant Number: 120784). The first author also acknowledges the financial support from DSI/NRF, South Africa Center of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) Postdoctoral Fellowship. The second author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7 - 2007-2013) (Grant agreement No. 616160). Open Access funding provided by Institute of Science and Technology (IST Austria).","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1572-9427"],"issn":["1566-113X"]},"issue":"2","publisher":"Springer Nature","citation":{"short":"C. Izuchukwu, Y. Shehu, Networks and Spatial Economics 21 (2021) 291–323.","ama":"Izuchukwu C, Shehu Y. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. <i>Networks and Spatial Economics</i>. 2021;21(2):291-323. doi:<a href=\"https://doi.org/10.1007/s11067-021-09517-w\">10.1007/s11067-021-09517-w</a>","ista":"Izuchukwu C, Shehu Y. 2021. New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. Networks and Spatial Economics. 21(2), 291–323.","apa":"Izuchukwu, C., &#38; Shehu, Y. (2021). New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity. <i>Networks and Spatial Economics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11067-021-09517-w\">https://doi.org/10.1007/s11067-021-09517-w</a>","chicago":"Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.” <i>Networks and Spatial Economics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11067-021-09517-w\">https://doi.org/10.1007/s11067-021-09517-w</a>.","ieee":"C. Izuchukwu and Y. Shehu, “New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity,” <i>Networks and Spatial Economics</i>, vol. 21, no. 2. Springer Nature, pp. 291–323, 2021.","mla":"Izuchukwu, Chinedu, and Yekini Shehu. “New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems beyond Monotonicity.” <i>Networks and Spatial Economics</i>, vol. 21, no. 2, Springer Nature, 2021, pp. 291–323, doi:<a href=\"https://doi.org/10.1007/s11067-021-09517-w\">10.1007/s11067-021-09517-w</a>."},"department":[{"_id":"VlKo"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"        21","date_published":"2021-06-01T00:00:00Z","quality_controlled":"1","day":"01"},{"isi":1,"volume":39,"project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"}],"year":"2020","page":"89-99","ec_funded":1,"abstract":[{"text":"This paper introduces a simple method for simulating highly anisotropic elastoplastic material behaviors like the dissolution of fibrous phenomena (splintering wood, shredding bales of hay) and materials composed of large numbers of irregularly‐shaped bodies (piles of twigs, pencils, or cards). We introduce a simple transformation of the anisotropic problem into an equivalent isotropic one, and we solve this new “fictitious” isotropic problem using an existing simulator based on the material point method. Our approach results in minimal changes to existing simulators, and it allows us to re‐use popular isotropic plasticity models like the Drucker‐Prager yield criterion instead of inventing new anisotropic plasticity models for every phenomenon we wish to simulate.","lang":"eng"}],"oa_version":"Submitted Version","date_created":"2020-11-17T09:35:10Z","external_id":{"isi":["000548709600008"]},"title":"A practical method for animating anisotropic elastoplastic materials","scopus_import":"1","status":"public","file":[{"checksum":"7605f605acd84d0942b48bc7a1c2d72e","file_size":38969122,"date_updated":"2020-11-23T09:05:13Z","success":1,"date_created":"2020-11-23T09:05:13Z","creator":"dernst","file_id":"8796","file_name":"2020_poff_revisited.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"article_type":"original","language":[{"iso":"eng"}],"publication":"Computer Graphics Forum","_id":"8765","month":"05","author":[{"full_name":"Schreck, Camille","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","last_name":"Schreck"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2024-10-22T09:58:14Z","publication_status":"published","ddc":["000"],"doi":"10.1111/cgf.13914","oa":1,"file_date_updated":"2020-11-23T09:05:13Z","type":"journal_article","acknowledged_ssus":[{"_id":"ScienComp"}],"keyword":["Computer Networks and Communications"],"has_accepted_license":"1","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would also like to thank Joseph Teran and Chenfanfu Jiang for the helpful discussions.\r\nThis project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under grant agreement No. 638176.","article_processing_charge":"No","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Schreck, Camille, and Chris Wojtan. “A Practical Method for Animating Anisotropic Elastoplastic Materials.” <i>Computer Graphics Forum</i>, vol. 39, no. 2, Wiley, 2020, pp. 89–99, doi:<a href=\"https://doi.org/10.1111/cgf.13914\">10.1111/cgf.13914</a>.","ista":"Schreck C, Wojtan C. 2020. A practical method for animating anisotropic elastoplastic materials. Computer Graphics Forum. 39(2), 89–99.","chicago":"Schreck, Camille, and Chris Wojtan. “A Practical Method for Animating Anisotropic Elastoplastic Materials.” <i>Computer Graphics Forum</i>. Wiley, 2020. <a href=\"https://doi.org/10.1111/cgf.13914\">https://doi.org/10.1111/cgf.13914</a>.","ieee":"C. Schreck and C. Wojtan, “A practical method for animating anisotropic elastoplastic materials,” <i>Computer Graphics Forum</i>, vol. 39, no. 2. Wiley, pp. 89–99, 2020.","apa":"Schreck, C., &#38; Wojtan, C. (2020). A practical method for animating anisotropic elastoplastic materials. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13914\">https://doi.org/10.1111/cgf.13914</a>","ama":"Schreck C, Wojtan C. A practical method for animating anisotropic elastoplastic materials. <i>Computer Graphics Forum</i>. 2020;39(2):89-99. doi:<a href=\"https://doi.org/10.1111/cgf.13914\">10.1111/cgf.13914</a>","short":"C. Schreck, C. Wojtan, Computer Graphics Forum 39 (2020) 89–99."},"department":[{"_id":"ChWo"}],"publisher":"Wiley","issue":"2","intvolume":"        39","date_published":"2020-05-01T00:00:00Z","quality_controlled":"1","day":"01"},{"title":"Sequences of gene regulatory network permutations for the article \"Local genetic context shapes the function of a gene regulatory network\"","file":[{"relation":"main_file","content_type":"text/plain","access_level":"open_access","file_name":"readme.txt","file_id":"8952","creator":"bkavcic","date_created":"2020-12-20T09:52:52Z","success":1,"date_updated":"2020-12-20T09:52:52Z","file_size":523,"checksum":"f57862aeee1690c7effd2b1117d40ed1"},{"file_name":"GRNs Research depository.gb","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","creator":"bkavcic","file_id":"8954","date_updated":"2020-12-20T22:01:44Z","success":1,"date_created":"2020-12-20T22:01:44Z","file_size":379228,"checksum":"f2c6d5232ec6d551b6993991e8689e9f"}],"status":"public","article_processing_charge":"No","_id":"8951","department":[{"_id":"CaGu"}],"citation":{"chicago":"Nagy-Staron, Anna A. “Sequences of Gene Regulatory Network Permutations for the Article ‘Local Genetic Context Shapes the Function of a Gene Regulatory Network.’” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8951\">https://doi.org/10.15479/AT:ISTA:8951</a>.","apa":"Nagy-Staron, A. A. (2020). Sequences of gene regulatory network permutations for the article “Local genetic context shapes the function of a gene regulatory network.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8951\">https://doi.org/10.15479/AT:ISTA:8951</a>","ieee":"A. A. Nagy-Staron, “Sequences of gene regulatory network permutations for the article ‘Local genetic context shapes the function of a gene regulatory network.’” Institute of Science and Technology Austria, 2020.","ista":"Nagy-Staron AA. 2020. Sequences of gene regulatory network permutations for the article ‘Local genetic context shapes the function of a gene regulatory network’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8951\">10.15479/AT:ISTA:8951</a>.","mla":"Nagy-Staron, Anna A. <i>Sequences of Gene Regulatory Network Permutations for the Article “Local Genetic Context Shapes the Function of a Gene Regulatory Network.”</i> Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8951\">10.15479/AT:ISTA:8951</a>.","short":"A.A. Nagy-Staron, (2020).","ama":"Nagy-Staron AA. Sequences of gene regulatory network permutations for the article “Local genetic context shapes the function of a gene regulatory network.” 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8951\">10.15479/AT:ISTA:8951</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Science and Technology Austria","month":"12","author":[{"orcid":"0000-0002-1391-8377","first_name":"Anna A","full_name":"Nagy-Staron, Anna A","last_name":"Nagy-Staron","id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2020-12-21T00:00:00Z","date_updated":"2025-06-12T06:36:16Z","ddc":["570"],"day":"21","doi":"10.15479/AT:ISTA:8951","oa":1,"year":"2020","file_date_updated":"2020-12-20T22:01:44Z","type":"research_data","abstract":[{"lang":"eng","text":"Gene expression levels are influenced by multiple coexisting molecular mechanisms. Some of these interactions, such as those of transcription factors and promoters have been studied extensively. However, predicting phenotypes of gene regulatory networks remains a major challenge. Here, we use a well-defined synthetic gene regulatory network to study how network phenotypes depend on local genetic context, i.e. the genetic neighborhood of a transcription factor and its relative position. We show that one gene regulatory network with fixed topology can display not only quantitatively but also qualitatively different phenotypes, depending solely on the local genetic context of its components. Our results demonstrate that changes in local genetic context can place a single transcriptional unit within two separate regulons without the need for complex regulatory sequences. We propose that relative order of individual transcriptional units, with its potential for combinatorial complexity, plays an important role in shaping phenotypes of gene regulatory networks."}],"corr_author":"1","oa_version":"Published Version","contributor":[{"last_name":"Nagy-Staron","id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","first_name":"Anna A"},{"contributor_type":"project_member","first_name":"Kathrin","last_name":"Tomasek","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Caroline","contributor_type":"project_member","last_name":"Caruso Carter"},{"contributor_type":"project_member","first_name":"Elisabeth","last_name":"Sonnleitner"},{"id":"350F91D2-F248-11E8-B48F-1D18A9856A87","last_name":"Kavcic","contributor_type":"project_member","first_name":"Bor","orcid":"0000-0001-6041-254X"},{"first_name":"Tiago","contributor_type":"project_member","last_name":"Paixão"},{"contributor_type":"project_manager","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet"}],"keyword":["Gene regulatory networks","Gene expression","Escherichia coli","Synthetic Biology"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2020-12-20T10:00:26Z","has_accepted_license":"1","related_material":{"record":[{"id":"9283","relation":"used_in_publication","status":"public"}]}},{"datarep_id":"98","publisher":"Institute of Science and Technology Austria","_id":"5584","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Deny S, Marre O, Botella-Soler V, Martius GS, Tkačik G. Nonlinear decoding of a complex movie from the mammalian retina. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:98\">10.15479/AT:ISTA:98</a>","short":"S. Deny, O. Marre, V. Botella-Soler, G.S. Martius, G. Tkačik, (2018).","mla":"Deny, Stephane, et al. <i>Nonlinear Decoding of a Complex Movie from the Mammalian Retina</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:98\">10.15479/AT:ISTA:98</a>.","chicago":"Deny, Stephane, Olivier Marre, Vicente Botella-Soler, Georg S Martius, and Gašper Tkačik. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:98\">https://doi.org/10.15479/AT:ISTA:98</a>.","apa":"Deny, S., Marre, O., Botella-Soler, V., Martius, G. S., &#38; Tkačik, G. (2018). Nonlinear decoding of a complex movie from the mammalian retina. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:98\">https://doi.org/10.15479/AT:ISTA:98</a>","ieee":"S. Deny, O. Marre, V. Botella-Soler, G. S. Martius, and G. Tkačik, “Nonlinear decoding of a complex movie from the mammalian retina.” Institute of Science and Technology Austria, 2018.","ista":"Deny S, Marre O, Botella-Soler V, Martius GS, Tkačik G. 2018. Nonlinear decoding of a complex movie from the mammalian retina, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:98\">10.15479/AT:ISTA:98</a>."},"article_processing_charge":"No","file":[{"checksum":"6808748837b9afbbbabc2a356ca2b88a","file_size":1142543971,"date_updated":"2020-07-14T12:47:07Z","date_created":"2018-12-12T13:02:24Z","file_id":"5590","creator":"system","file_name":"IST-2018-98-v1+1_BBalls_area2_tile2_20x20.mat","relation":"main_file","content_type":"application/octet-stream","access_level":"open_access"},{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-98-v1+2_ExperimentStructure.pdf","file_id":"5591","creator":"system","date_created":"2018-12-12T13:02:25Z","date_updated":"2020-07-14T12:47:07Z","file_size":702336,"checksum":"d6d6cd07743038fe3a12352983fcf9dd"},{"access_level":"open_access","content_type":"application/octet-stream","relation":"main_file","file_name":"IST-2018-98-v1+3_GoodLocations_area2_20x20.mat","creator":"system","file_id":"5592","date_created":"2018-12-12T13:02:26Z","date_updated":"2020-07-14T12:47:07Z","checksum":"0c9cfb4dab35bb3dc25a04395600b1c8","file_size":432},{"file_name":"IST-2018-98-v1+4_README.txt","relation":"main_file","access_level":"open_access","content_type":"text/plain","file_id":"5593","creator":"system","date_updated":"2020-07-14T12:47:07Z","date_created":"2018-12-12T13:02:26Z","checksum":"2a83b011012e21e934b4596285b1a183","file_size":986}],"status":"public","title":"Nonlinear decoding of a complex movie from the mammalian retina","date_updated":"2025-04-15T08:18:24Z","ddc":["570"],"day":"29","month":"03","author":[{"first_name":"Stephane","full_name":"Deny, Stephane","last_name":"Deny"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"last_name":"Botella-Soler","full_name":"Botella-Soler, Vicente","first_name":"Vicente"},{"id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","full_name":"Martius, Georg S","first_name":"Georg S"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"}],"date_published":"2018-03-29T00:00:00Z","type":"research_data","file_date_updated":"2020-07-14T12:47:07Z","abstract":[{"lang":"eng","text":"This package contains data for the publication \"Nonlinear decoding of a complex movie from the mammalian retina\" by Deny S. et al, PLOS Comput Biol (2018). \r\n\r\nThe data consists of\r\n(i) 91 spike sorted, isolated rat retinal ganglion cells that pass stability and quality criteria, recorded on the multi-electrode array, in response to the presentation of the complex movie with many randomly moving dark discs. The responses are represented as 648000 x 91 binary matrix, where the first index indicates the timebin of duration 12.5 ms, and the second index the neural identity. The matrix entry is 0/1 if the neuron didn't/did spike in the particular time bin.\r\n(ii) README file and a graphical illustration of the structure of the experiment, specifying how the 648000 timebins are split into epochs where 1, 2, 4, or 10 discs  were displayed, and which stimulus segments are exact repeats or unique ball trajectories.\r\n(iii) a 648000 x 400 matrix of luminance traces for each of the 20 x 20 positions (\"sites\") in the movie frame, with time that is locked to the recorded raster. The luminance traces are produced as described in the manuscript by filtering the raw disc movie with a small gaussian spatial kernel. "}],"doi":"10.15479/AT:ISTA:98","oa":1,"year":"2018","project":[{"grant_number":"P 25651-N26","call_identifier":"FWF","name":"Sensitivity to higher-order statistics in natural scenes","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"license":"https://creativecommons.org/publicdomain/zero/1.0/","keyword":["retina","decoding","regression","neural networks","complex stimulus"],"related_material":{"record":[{"status":"public","id":"292","relation":"used_in_publication"}]},"date_created":"2018-12-12T12:31:39Z","has_accepted_license":"1","oa_version":"Published Version"},{"abstract":[{"text":"Supporting material to the article \r\nSTATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH\r\n\r\nboundscoli.dat\r\nFlux Bounds of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium. \r\n\r\npolcoli.dat\r\nMatrix enconding the polytope of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium, \r\nobtained from the soichiometric matrix by standard linear algebra  (reduced row echelon form).\r\n\r\nellis.dat\r\nApproximate Lowner-John ellipsoid rounding the polytope of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium\r\nobtained with the Lovasz method.\r\n\r\npoint0.dat\r\nCenter of the approximate Lowner-John ellipsoid rounding the polytope of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium\r\nobtained with the Lovasz method.\r\n\r\nlovasz.cpp  \r\nThis c++ code file receives in input the polytope of the feasible steady states of a metabolic network, \r\n(matrix and bounds), and it gives in output an approximate Lowner-John ellipsoid rounding the polytope\r\nwith the Lovasz method \r\nNB inputs are referred by defaults to the catabolic core of the E.Coli network iAF1260. \r\nFor further details we refer to  PLoS ONE 10.4 e0122670 (2015).\r\n\r\nsampleHRnew.cpp  \r\nThis c++ code file receives in input the polytope of the feasible steady states of a metabolic network, \r\n(matrix and bounds), the ellipsoid rounding the polytope, a point inside and  \r\nit gives in output a max entropy sampling at fixed average growth rate \r\nof the steady states by performing an Hit-and-Run Monte Carlo Markov chain.\r\nNB inputs are referred by defaults to the catabolic core of the E.Coli network iAF1260. \r\nFor further details we refer to  PLoS ONE 10.4 e0122670 (2015).","lang":"eng"}],"ec_funded":1,"type":"research_data","file_date_updated":"2020-07-14T12:47:08Z","year":"2018","oa":1,"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Biophysics of information processing in gene regulation","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"doi":"10.15479/AT:ISTA:62","related_material":{"record":[{"relation":"research_paper","id":"161","status":"public"}]},"has_accepted_license":"1","date_created":"2018-12-12T12:31:41Z","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"keyword":["metabolic networks","e.coli core","maximum entropy","monte carlo markov chain sampling","ellipsoidal rounding"],"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","datarep_id":"111","department":[{"_id":"GaTk"}],"_id":"5587","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"De Martino D, Tkačik G. Supporting materials “STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.” 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:62\">10.15479/AT:ISTA:62</a>","short":"D. De Martino, G. Tkačik, (2018).","mla":"De Martino, Daniele, and Gašper Tkačik. <i>Supporting Materials “STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.”</i> Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:62\">10.15479/AT:ISTA:62</a>.","ista":"De Martino D, Tkačik G. 2018. Supporting materials ‘STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:62\">10.15479/AT:ISTA:62</a>.","chicago":"De Martino, Daniele, and Gašper Tkačik. “Supporting Materials ‘STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.’” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:62\">https://doi.org/10.15479/AT:ISTA:62</a>.","ieee":"D. De Martino and G. Tkačik, “Supporting materials ‘STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.’” Institute of Science and Technology Austria, 2018.","apa":"De Martino, D., &#38; Tkačik, G. (2018). Supporting materials “STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:62\">https://doi.org/10.15479/AT:ISTA:62</a>"},"article_processing_charge":"No","file":[{"file_size":14376,"checksum":"97992e3e8cf8544ec985a48971708726","date_updated":"2020-07-14T12:47:08Z","date_created":"2018-12-12T13:05:13Z","creator":"system","file_id":"5641","file_name":"IST-2018-111-v1+1_CODES.zip","content_type":"application/zip","access_level":"open_access","relation":"main_file"}],"status":"public","title":"Supporting materials \"STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH\"","day":"21","ddc":["530"],"date_updated":"2025-04-15T06:50:08Z","date_published":"2018-09-21T00:00:00Z","month":"09","author":[{"last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706","first_name":"Daniele"},{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","first_name":"Gasper"}]},{"quality_controlled":"1","day":"01","intvolume":"         7","date_published":"2013-03-01T00:00:00Z","publisher":"Association for Computing Machinery","issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Baykan, E., Weber, I., &#38; Henzinger, M. (2013). A comprehensive study of techniques for URL-based web page language classification. <i>ACM Transactions on the Web</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2435215.2435218\">https://doi.org/10.1145/2435215.2435218</a>","chicago":"Baykan, Eda, Ingmar Weber, and Monika Henzinger. “A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.” <i>ACM Transactions on the Web</i>. Association for Computing Machinery, 2013. <a href=\"https://doi.org/10.1145/2435215.2435218\">https://doi.org/10.1145/2435215.2435218</a>.","ieee":"E. Baykan, I. Weber, and M. Henzinger, “A comprehensive study of techniques for URL-based web page language classification,” <i>ACM Transactions on the Web</i>, vol. 7, no. 1. Association for Computing Machinery, 2013.","ista":"Baykan E, Weber I, Henzinger M. 2013. A comprehensive study of techniques for URL-based web page language classification. ACM Transactions on the Web. 7(1), 3.","mla":"Baykan, Eda, et al. “A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.” <i>ACM Transactions on the Web</i>, vol. 7, no. 1, 3, Association for Computing Machinery, 2013, doi:<a href=\"https://doi.org/10.1145/2435215.2435218\">10.1145/2435215.2435218</a>.","short":"E. Baykan, I. Weber, M. Henzinger, ACM Transactions on the Web 7 (2013).","ama":"Baykan E, Weber I, Henzinger M. A comprehensive study of techniques for URL-based web page language classification. <i>ACM Transactions on the Web</i>. 2013;7(1). doi:<a href=\"https://doi.org/10.1145/2435215.2435218\">10.1145/2435215.2435218</a>"},"article_processing_charge":"No","publication_identifier":{"issn":["1559-1131"],"eissn":["1559-114X"]},"keyword":["Computer Networks and Communications"],"article_number":"3","type":"journal_article","doi":"10.1145/2435215.2435218","publication_status":"published","date_updated":"2024-11-06T12:07:18Z","month":"03","author":[{"last_name":"Baykan","first_name":"Eda","full_name":"Baykan, Eda"},{"first_name":"Ingmar","full_name":"Weber, Ingmar","last_name":"Weber"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"}],"language":[{"iso":"eng"}],"publication":"ACM Transactions on the Web","_id":"11671","scopus_import":"1","status":"public","title":"A comprehensive study of techniques for URL-based web page language classification","extern":"1","article_type":"original","date_created":"2022-07-27T12:50:18Z","oa_version":"None","abstract":[{"text":"Given only the URL of a Web page, can we identify its language? In this article we examine this question. URL-based language classification is useful when the content of the Web page is not available or downloading the content is a waste of bandwidth and time.\r\nWe built URL-based language classifiers for English, German, French, Spanish, and Italian by applying a variety of algorithms and features. As algorithms we used machine learning algorithms which are widely applied for text classification and state-of-art algorithms for language identification of text. As features we used words, various sized n-grams, and custom-made features (our novel feature set). We compared our approaches with two baseline methods, namely classification by country code top-level domains and classification by IP addresses of the hosting Web servers.\r\n\r\nWe trained and tested our classifiers in a 10-fold cross-validation setup on a dataset obtained from the Open Directory Project and from querying a commercial search engine. We obtained the lowest F1-measure for English (94) and the highest F1-measure for German (98) with the best performing classifiers.\r\n\r\nWe also evaluated the performance of our methods: (i) on a set of Web pages written in Adobe Flash and (ii) as part of a language-focused crawler. In the first case, the content of the Web page is hard to extract and in the second page downloading pages of the “wrong” language constitutes a waste of bandwidth. In both settings the best classifiers have a high accuracy with an F1-measure between 95 (for English) and 98 (for Italian) for the Adobe Flash pages and a precision between 90 (for Italian) and 97 (for French) for the language-focused crawler.","lang":"eng"}],"year":"2013","volume":7}]